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-158987938400044.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-007008, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938400044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.1K Apr 12 10:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 10:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 11 11:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 11 11:59 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.2K 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 3.3K Apr 10 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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 18K 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 1591223804315

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 22:36:45] [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:36:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 22:36:46] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2020-06-03 22:36:46] [INFO ] Transformed 39 places.
[2020-06-03 22:36:46] [INFO ] Transformed 31 transitions.
[2020-06-03 22:36:46] [INFO ] Parsed PT model containing 39 places and 31 transitions in 67 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 109 ms. (steps per millisecond=917 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0]
// Phase 1: matrix 31 rows 39 cols
[2020-06-03 22:36:46] [INFO ] Computed 16 place invariants in 2 ms
[2020-06-03 22:36:46] [INFO ] [Real]Absence check using 16 positive place invariants in 87 ms returned sat
[2020-06-03 22:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:36:46] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2020-06-03 22:36:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:36:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 13 ms returned sat
[2020-06-03 22:36:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:36:46] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-06-03 22:36:46] [INFO ] Computed and/alt/rep : 23/30/23 causal constraints in 3 ms.
[2020-06-03 22:36:46] [INFO ] Added : 16 causal constraints over 4 iterations in 66 ms. Result :sat
[2020-06-03 22:36:46] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2020-06-03 22:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:36:46] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2020-06-03 22:36:46] [INFO ] Computed and/alt/rep : 23/30/23 causal constraints in 3 ms.
[2020-06-03 22:36:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:36:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 17 ms returned sat
[2020-06-03 22:36:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:36:46] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2020-06-03 22:36:46] [INFO ] Computed and/alt/rep : 23/30/23 causal constraints in 2 ms.
[2020-06-03 22:36:46] [INFO ] Added : 16 causal constraints over 4 iterations in 37 ms. Result :sat
[2020-06-03 22:36:46] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2020-06-03 22:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:36:46] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-03 22:36:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:36:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2020-06-03 22:36:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:36:46] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-03 22:36:46] [INFO ] Computed and/alt/rep : 23/30/23 causal constraints in 4 ms.
[2020-06-03 22:36:46] [INFO ] Added : 23 causal constraints over 5 iterations in 53 ms. Result :sat
[2020-06-03 22:36:47] [INFO ] Flatten gal took : 43 ms
[2020-06-03 22:36:47] [INFO ] Flatten gal took : 9 ms
[2020-06-03 22:36:47] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 16 ms.
[2020-06-03 22:36:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ RefineWMG-PT-007008 @ 3570 seconds

FORMULA n0-CTLFireability-01 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-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

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

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

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

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

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

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

FORMULA n0-CTLFireability-09 CANNOT_COMPUTE 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
vrfy: finished
info: timeLeft: 1363
rslt: Output for CTLFireability @ RefineWMG-PT-007008

{
"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:36:47 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 247
},
"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": "(p13 <= 0)",
"processed_size": 10,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 231
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p8) AND (1 <= p16) AND (1 <= p17) AND (1 <= p19))))",
"processed_size": 64,
"rewrites": 42
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 247
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "AX(EF(((1 <= p6) AND (1 <= p7) AND (1 <= p9))))",
"processed_size": 47,
"rewrites": 43
},
"net":
{
"conflict_clusters": 24,
"singleton_clusters": 0
},
"result":
{
"edges": 13885716,
"markings": 8886867,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 267
},
"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": 41
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 291
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "EF(AX(((1 <= p16) AND (1 <= p17) AND (1 <= p19) AND (1 <= p28))))",
"processed_size": 65,
"rewrites": 43
},
"net":
{
"conflict_clusters": 24,
"singleton_clusters": 0
},
"result":
{
"edges": 7537425,
"markings": 4823972,
"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": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 291
},
"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": "(p23 <= 0)",
"processed_size": 10,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 320
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p17 <= 0)",
"processed_size": 10,
"rewrites": 44
},
"result":
{
"edges": 82008,
"markings": 52489,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX(((p27 <= 0) OR (p23 <= 0)))",
"processed_size": 31,
"rewrites": 42
},
"net":
{
"conflict_clusters": 24,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 337
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"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 (X (E (((1 <= p38) U ((1 <= p6) AND (1 <= p7) AND (1 <= p9))))))",
"processed_size": 66,
"rewrites": 44
},
"result":
{
"edges": 10570675,
"markings": 6731582,
"produced_by": "state space / EXEU",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "existential_until_from_successors"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 378
},
"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 (((2 <= p1) AND (2 <= p2) AND (1 <= p5))))",
"processed_size": 47,
"rewrites": 42
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"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": 432
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p11 <= 0) OR (p12 <= 0) OR (p14 <= 0) OR (p4 <= 4))))",
"processed_size": 64,
"rewrites": 43
},
"result":
{
"edges": 44,
"markings": 45,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 870
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 1,
"F": 1,
"G": 2,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(AG(((p7 <= 0) OR AF((1 <= p32)))) AND E(((5 <= p4) OR (1 <= p22) OR (p25 <= 0)) U AG(((1 <= p21) AND (1 <= p22) AND (1 <= p24)))))",
"processed_size": 133,
"rewrites": 45
},
"net":
{
"conflict_clusters": 24,
"singleton_clusters": 0
},
"result":
{
"edges": 190,
"markings": 81,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1305
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((p10 <= 0) AND (p12 <= 0)) R ((p27 <= 0) R (p4 <= 4)))",
"processed_size": 56,
"rewrites": 51
},
"result":
{
"edges": 671,
"markings": 427,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
},

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

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AX(((1 <= p22) AND (1 <= p33)))",
"processed_size": 31,
"rewrites": 42
},
"net":
{
"conflict_clusters": 24,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX(((1 <= p25) OR (1 <= p37)))",
"processed_size": 31,
"rewrites": 42
},
"net":
{
"conflict_clusters": 24,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
},

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 19,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 19,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "((p32 <= 0) OR ((2 <= p1) AND (2 <= p2) AND (1 <= p22) AND (1 <= p27) AND (1 <= p32) AND (1 <= p17) AND (1 <= p11) AND (1 <= p12) AND (1 <= p14) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9) AND (p25 <= 0) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p0 <= 0) OR (p36 <= 0) OR (p37 <= 0))))",
"processed_size": 281,
"rewrites": 42
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 22,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 21,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 4012,
"runtime": 2207.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(F(A(X(*)))) AND (A(X(**)) OR (E(X(**)) OR (** OR A(X(**)))))) : (E(F(*)) OR E(X((A(X(**)) AND **)))) : E(F((E(G(*)) AND (** AND A(X(**)))))) : A(X(E(F(**)))) : E(F(**)) : (E(F(A(X(**)))) OR (** AND (E(X(*)) OR (E(G(**)) AND (** AND (** AND **)))))) : (A(G((** OR A(F(**))))) AND E((** U A(G(**))))) : E(F(A(G(**)))) : (E(G(E(F(*)))) AND (E(X(*)) AND **)) : E(F((A(G(*)) AND **))) : E(F((A(X(**)) AND E((** U **))))) : E(X(E((** U **)))) : E((** U E((** U **)))) : E(F(*)) : A(G(**)) : (A(G(*)) OR (** OR **))"
},
"net":
{
"arcs": 92,
"conflict_clusters": 24,
"places": 39,
"places_significant": 23,
"singleton_clusters": 0,
"transitions": 31
},
"result":
{
"preliminary_value": "unknown yes unknown yes yes yes no unknown yes unknown unknown yes yes yes no no ",
"value": "unknown yes unknown yes yes yes no unknown yes unknown unknown yes yes yes no 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: 70/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1248
lola: finding significant places
lola: 39 places, 31 transitions, 23 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: (E (F (NOT(E (X ((1 <= p33)))))) AND (((A (X (((1 <= p22) AND (1 <= p33)))) OR E (X (((1 <= p25) OR (1 <= p37))))) OR (p13 <= 0)) OR A (X ((p28 <= 0))))) : (NOT(A (G (((p8 <= 0) OR (p16 <= 0) OR (p17 <= 0) OR (p19 <= 0))))) OR E (X ((A (X (((2 <= p1) AND (2 <= p2)))) AND ((p37 <= 0) OR (3 <= p3)))))) : E (F (((NOT(A (F (((1 <= p0) AND (1 <= p36) AND (1 <= p37))))) AND (1 <= p27)) AND A (X ((1 <= p15)))))) : A (X (E (F (E (F (((1 <= p6) AND (1 <= p7) AND (1 <= p9)))))))) : E ((((1 <= p13) OR (5 <= p4) OR (1 <= p15) OR (p32 <= 0)) U E (F (((2 <= p1) AND (2 <= p2) AND (1 <= p5)))))) : (E (F (A (X (((1 <= p16) AND (1 <= p17) AND (1 <= p19) AND (1 <= p28)))))) OR (((1 <= p11) AND (1 <= p12) AND (1 <= p14)) AND (NOT(A (X ((1 <= p22)))) OR (((E (G (((1 <= p11) AND (1 <= p12) AND (1 <= p14)))) AND (1 <= p8)) AND (1 <= p38)) AND (1 <= p28))))) : (A (G (((p7 <= 0) OR A (F ((1 <= p32)))))) AND E ((((5 <= p4) OR (1 <= p22) OR (p25 <= 0)) U A (G (((1 <= p21) AND (1 <= p22) AND (1 <= p24))))))) : E (F (A (G (((1 <= p8) OR (1 <= p17) OR (3 <= p3) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p29))))))) : ((NOT(A (F (A (G ((1 <= p17)))))) AND NOT(A (X (((1 <= p27) AND (1 <= p23)))))) AND (p23 <= 0)) : E (F ((NOT(E (F ((1 <= p27)))) AND ((p13 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p9 <= 0))))) : E (F ((A (X (((5 <= p4) AND (1 <= p23)))) AND E (((1 <= p28) U (1 <= p7)))))) : E (X (E (((1 <= p38) U ((1 <= p6) AND (1 <= p7) AND (1 <= p9)))))) : E ((((1 <= p10) OR (1 <= p12)) U E (((1 <= p27) U (5 <= p4))))) : NOT(A (G (((p17 <= 0) OR (p16 <= 0) OR (p19 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p9 <= 0) OR (1 <= p28) OR (1 <= p35))))) : A (G (A (G (((p11 <= 0) OR (p12 <= 0) OR (p14 <= 0) OR (p4 <= 4)))))) : ((NOT(E (F ((5 <= p4)))) OR (p32 <= 0)) OR ((2 <= p1) AND (2 <= p2) AND (1 <= p22) AND (1 <= p27) AND (1 <= p32) AND (1 <= p17) AND (1 <= p11) AND (1 <= p12) AND (1 <= p14) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9) AND (p25 <= 0) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p0 <= 0) OR (p36 <= 0) OR (p37 <= 0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: 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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:389
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:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (X ((p33 <= 0))))) AND (A (X (((1 <= p22) AND (1 <= p33)))) OR (E (X (((1 <= p25) OR (1 <= p37)))) OR ((p13 <= 0) OR A (X ((p28 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((p33 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((p33 <= 0)))
lola: processed formula length: 18
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 5049344 markings, 7889574 edges, 1009869 markings/sec, 0 secs
lola: 9870716 markings, 15422972 edges, 964274 markings/sec, 5 secs
lola: 14635221 markings, 22867508 edges, 952901 markings/sec, 10 secs
lola: 19091238 markings, 29830036 edges, 891203 markings/sec, 15 secs
lola: 23717185 markings, 37058074 edges, 925189 markings/sec, 20 secs
lola: 28429314 markings, 44420768 edges, 942426 markings/sec, 25 secs
lola: 33066712 markings, 51666706 edges, 927480 markings/sec, 30 secs
lola: 37734579 markings, 58960251 edges, 933573 markings/sec, 35 secs
lola: 42407294 markings, 66261364 edges, 934543 markings/sec, 40 secs
lola: 46975591 markings, 73399323 edges, 913659 markings/sec, 45 secs
lola: 51448613 markings, 80388423 edges, 894604 markings/sec, 50 secs
lola: 55987265 markings, 87480063 edges, 907730 markings/sec, 55 secs
lola: 60474145 markings, 94490816 edges, 897376 markings/sec, 60 secs
lola: 65191787 markings, 101862125 edges, 943528 markings/sec, 65 secs
lola: 69235019 markings, 108180202 edges, 808646 markings/sec, 70 secs
lola: 72899824 markings, 113906282 edges, 732961 markings/sec, 75 secs
lola: 75920007 markings, 118626095 edges, 604037 markings/sec, 80 secs
lola: 78312071 markings, 122362598 edges, 478413 markings/sec, 85 secs
lola: 81863859 markings, 127912459 edges, 710358 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 231 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= p22) AND (1 <= p33))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((1 <= p22) AND (1 <= p33)))
lola: processed formula length: 31
lola: 42 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p13 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p13 <= 0)
lola: processed formula length: 10
lola: 41 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 1 will run for 231 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p8) AND (1 <= p16) AND (1 <= p17) AND (1 <= p19)))) OR E (X ((A (X (((2 <= p1) AND (2 <= p2)))) AND ((p37 <= 0) OR (3 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 231 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p8) AND (1 <= p16) AND (1 <= p17) AND (1 <= p19))))
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 <= p8) AND (1 <= p16) AND (1 <= p17) AND (1 <= p19))))
lola: processed formula length: 64
lola: 42 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 <= p8) AND (1 <= p16) AND (1 <= p17) AND (1 <= p19))
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: 7 markings, 6 edges
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G (((p0 <= 0) OR (p36 <= 0) OR (p37 <= 0)))) AND ((1 <= p27) AND A (X ((1 <= p15)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((EG(((p0 <= 0) OR (p36 <= 0) OR (p37 <= 0))) AND ((1 <= p27) AND AX((1 <= p15)))))
lola: processed formula length: 87
lola: 44 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: 2339739 markings, 8335298 edges, 467948 markings/sec, 0 secs
lola: 4655880 markings, 16586551 edges, 463228 markings/sec, 5 secs
lola: 6886618 markings, 24533521 edges, 446148 markings/sec, 10 secs
lola: 9105869 markings, 32439591 edges, 443850 markings/sec, 15 secs
lola: 11259355 markings, 40111393 edges, 430697 markings/sec, 20 secs
lola: 13496638 markings, 48081712 edges, 447457 markings/sec, 25 secs
lola: 15706936 markings, 55955886 edges, 442060 markings/sec, 30 secs
lola: 17915044 markings, 63822283 edges, 441622 markings/sec, 35 secs
lola: 20045151 markings, 71410777 edges, 426021 markings/sec, 40 secs
lola: 22267729 markings, 79328728 edges, 444516 markings/sec, 45 secs
lola: 24495764 markings, 87266101 edges, 445607 markings/sec, 50 secs
lola: 26723624 markings, 95202856 edges, 445572 markings/sec, 55 secs
lola: 28898778 markings, 102951838 edges, 435031 markings/sec, 60 secs
lola: 31070404 markings, 110688157 edges, 434325 markings/sec, 65 secs
lola: 33280104 markings, 118560207 edges, 441940 markings/sec, 70 secs
lola: 35444616 markings, 126271283 edges, 432902 markings/sec, 75 secs
lola: 37758565 markings, 134514706 edges, 462790 markings/sec, 80 secs
lola: 40004463 markings, 142515725 edges, 449180 markings/sec, 85 secs
lola: 42114424 markings, 150032473 edges, 421992 markings/sec, 90 secs
lola: 44368960 markings, 158064256 edges, 450907 markings/sec, 95 secs
lola: 46557348 markings, 165860387 edges, 437678 markings/sec, 100 secs
lola: 48629413 markings, 173242101 edges, 414413 markings/sec, 105 secs
lola: 50802652 markings, 180984287 edges, 434648 markings/sec, 110 secs
lola: 53057289 markings, 189016426 edges, 450927 markings/sec, 115 secs
lola: 55215579 markings, 196705325 edges, 431658 markings/sec, 120 secs
lola: 57337417 markings, 204264377 edges, 424368 markings/sec, 125 secs
lola: 59407264 markings, 211638219 edges, 413969 markings/sec, 130 secs
lola: 61651114 markings, 219631823 edges, 448770 markings/sec, 135 secs
lola: 63816221 markings, 227345013 edges, 433021 markings/sec, 140 secs
lola: 66046371 markings, 235289926 edges, 446030 markings/sec, 145 secs
lola: 68320301 markings, 243390792 edges, 454786 markings/sec, 150 secs
lola: 69670550 markings, 248202490 edges, 270050 markings/sec, 155 secs
lola: 71405948 markings, 254389506 edges, 347080 markings/sec, 160 secs
lola: 72745031 markings, 259153896 edges, 267817 markings/sec, 165 secs
lola: 74074844 markings, 263891355 edges, 265963 markings/sec, 170 secs
lola: 74205061 markings, 264355243 edges, 26043 markings/sec, 175 secs
lola: 74205061 markings, 264355243 edges, 0 markings/sec, 180 secs
lola: 74205061 markings, 264355243 edges, 0 markings/sec, 185 secs
lola: 75254956 markings, 268095509 edges, 209979 markings/sec, 190 secs
lola: 76223825 markings, 271547105 edges, 193774 markings/sec, 195 secs
lola: 76223825 markings, 271547105 edges, 0 markings/sec, 200 secs
lola: 76242503 markings, 271613643 edges, 3736 markings/sec, 205 secs
lola: 76749293 markings, 273419074 edges, 101358 markings/sec, 210 secs
lola: 76749293 markings, 273419074 edges, 0 markings/sec, 215 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes 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 3 will run for 247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((1 <= p6) AND (1 <= p7) AND (1 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(((1 <= p6) AND (1 <= p7) AND (1 <= p9))))
lola: processed formula length: 47
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 6071314 markings, 9486403 edges, 1214263 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 8886867 markings, 13885716 edges
lola: ========================================
lola: subprocess 4 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (X (((1 <= p16) AND (1 <= p17) AND (1 <= p19) AND (1 <= p28)))))) OR (((1 <= p11) AND (1 <= p12) AND (1 <= p14)) AND (E (X ((p22 <= 0))) OR (E (G (((1 <= p11) AND (1 <= p12) AND (1 <= p14)))) AND ((1 <= p8) AND ((1 <= p38) AND (1 <= p28)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 267 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: 41 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 5 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((1 <= p16) AND (1 <= p17) AND (1 <= p19) AND (1 <= p28))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(((1 <= p16) AND (1 <= p17) AND (1 <= p19) AND (1 <= p28))))
lola: processed formula length: 65
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 4823972 markings, 7537425 edges, 964794 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4823972 markings, 7537425 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((p17 <= 0))))) AND (E (X (((p27 <= 0) OR (p23 <= 0)))) AND (p23 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p23 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p23 <= 0)
lola: processed formula length: 10
lola: 41 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 6 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((p17 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: (p17 <= 0)
lola: processed formula length: 10
lola: 44 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p17 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p17)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-1.sara
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-0.sara.
sara: try reading problem file CTLFireability-6-1.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 52489 markings, 82008 edges
lola: ========================================

lola: subprocess 7 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((p27 <= 0) OR (p23 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((p27 <= 0) OR (p23 <= 0)))
lola: processed formula length: 31
lola: 42 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 6 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X (((5 <= p4) AND (1 <= p23)))) AND E (((1 <= p28) U (1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AX(((5 <= p4) AND (1 <= p23))) AND E((1 <= p28) U (1 <= p7))))
lola: processed formula length: 66
lola: 44 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: 5096252 markings, 7962870 edges, 1019250 markings/sec, 0 secs
lola: 10142978 markings, 15848376 edges, 1009345 markings/sec, 5 secs
lola: 15070376 markings, 23547438 edges, 985480 markings/sec, 10 secs
lola: 19795650 markings, 30930672 edges, 945055 markings/sec, 15 secs
lola: 24549109 markings, 38357950 edges, 950692 markings/sec, 20 secs
lola: 29397918 markings, 45934221 edges, 969762 markings/sec, 25 secs
lola: 33985421 markings, 53102185 edges, 917501 markings/sec, 30 secs
lola: 38755602 markings, 60555599 edges, 954036 markings/sec, 35 secs
lola: 43279729 markings, 67624542 edges, 904825 markings/sec, 40 secs
lola: 47839267 markings, 74748818 edges, 911908 markings/sec, 45 secs
lola: 52278316 markings, 81684835 edges, 887810 markings/sec, 50 secs
lola: 56818884 markings, 88779473 edges, 908114 markings/sec, 55 secs
lola: 61391221 markings, 95923744 edges, 914467 markings/sec, 60 secs
lola: 66119117 markings, 103312461 edges, 945579 markings/sec, 65 secs
lola: 69677533 markings, 108872535 edges, 711683 markings/sec, 70 secs
lola: 72705321 markings, 113602626 edges, 605558 markings/sec, 75 secs
lola: 75066217 markings, 117290917 edges, 472179 markings/sec, 80 secs
lola: 75151784 markings, 117424617 edges, 17113 markings/sec, 85 secs
lola: 75657718 markings, 118215140 edges, 101187 markings/sec, 90 secs
lola: 77581776 markings, 121221479 edges, 384812 markings/sec, 95 secs
lola: 77581776 markings, 121221479 edges, 0 markings/sec, 100 secs
lola: 77581776 markings, 121221479 edges, 0 markings/sec, 105 secs
lola: 78669650 markings, 122921283 edges, 217575 markings/sec, 110 secs
lola: 80069810 markings, 125109036 edges, 280032 markings/sec, 115 secs
lola: 80069810 markings, 125109036 edges, 0 markings/sec, 120 secs
lola: 80069810 markings, 125109036 edges, 0 markings/sec, 125 secs
lola: 80962393 markings, 126503696 edges, 178517 markings/sec, 130 secs
lola: 81765720 markings, 127758892 edges, 160665 markings/sec, 135 secs
lola: 81765720 markings, 127758892 edges, 0 markings/sec, 140 secs
lola: 81765720 markings, 127758892 edges, 0 markings/sec, 145 secs
lola: 81765720 markings, 127758892 edges, 0 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (((1 <= p38) U ((1 <= p6) AND (1 <= p7) AND (1 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking existential until from successors
lola: rewrite Frontend/Parser/formula_rewrite.k:688
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:716
lola: rewrite Frontend/Parser/formula_rewrite.k:688
lola: processed formula: E (X (E (((1 <= p38) U ((1 <= p6) AND (1 <= p7) AND (1 <= p9))))))
lola: processed formula length: 66
lola: 44 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 / EXEU)
lola: state space: using reachability graph (EXEU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p6) AND (1 <= p7) AND (1 <= p9))
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-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-0.sara.

lola: state equation 0: solution produced
lola: sara is running 0 secs || 5891632 markings, 9251688 edges, 1178326 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EXEU
lola: There is a path where Predicate Phi holds until Predicate Psi from some successor.
lola: 6731582 markings, 10570675 edges
lola: sara is running 5 secs || 6731582 markings, 10570675 edges, 167990 markings/sec, 5 secs
lola: ========================================
lola: subprocess 8 will run for 378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p1) AND (2 <= p2) AND (1 <= p5))))
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 (((2 <= p1) AND (2 <= p2) AND (1 <= p5))))
lola: processed formula length: 47
lola: 42 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: ((2 <= p1) AND (2 <= p2) AND (1 <= p5))
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: 9 markings, 8 edges
lola: state equation: write sara problem file to CTLFireability-8-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file CTLFireability-8-0.sara.

lola: subprocess 9 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p11 <= 0) OR (p12 <= 0) OR (p14 <= 0) OR (p4 <= 4))))
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 (((p11 <= 0) OR (p12 <= 0) OR (p14 <= 0) OR (p4 <= 4))))
lola: processed formula length: 64
lola: 43 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 45 markings, 44 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p11) AND (1 <= p12) AND (1 <= p14) AND (5 <= p4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-0.sara.

lola: ========================================
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p17) AND (1 <= p16) AND (1 <= p19) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9) AND (p28 <= 0) AND (p35 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p17) AND (1 <= p16) AND (1 <= p19) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9) AND (p28 <= 0) AND (p35 <= 0))))
lola: processed formula length: 122
lola: 42 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 <= p17) AND (1 <= p16) AND (1 <= p19) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9) AND (p28 <= 0) AND (p35 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: state equation: write sara problem file to CTLFireability-10-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file CTLFireability-10-0.sara.

lola: subprocess 11 will run for 606 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p8) OR (1 <= p17) OR (3 <= p3) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p29)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p8 <= 0) AND (p17 <= 0) AND (p3 <= 2) AND ((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0)))
lola: processed formula length: 87
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p8) OR (1 <= p17) OR (3 <= p3) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p29)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 4 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p8 <= 0) AND (p17 <= 0) AND (p3 <= 2) AND ((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 12 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
sara: try reading problem file CTLFireability-11-0.sara.

lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 6233229 markings, 9745259 edges, 1246646 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 12365051 markings, 19332784 edges, 1226364 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 18399720 markings, 28771080 edges, 1206934 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 24361059 markings, 38094635 edges, 1192268 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 30286075 markings, 47359624 edges, 1185003 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 36165368 markings, 56554616 edges, 1175859 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 42118627 markings, 65865253 edges, 1190652 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 48136807 markings, 75289144 edges, 1203636 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 54086038 markings, 84605196 edges, 1189846 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 59819355 markings, 93583217 edges, 1146663 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 65683191 markings, 102762777 edges, 1172767 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 71593439 markings, 112014982 edges, 1182050 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 77481268 markings, 121227826 edges, 1177566 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 83384811 markings, 130466493 edges, 1180709 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 89232366 markings, 139623832 edges, 1169511 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 94909703 markings, 148509968 edges, 1135467 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 100544930 markings, 157333758 edges, 1127045 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 106254166 markings, 166265084 edges, 1141847 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 111798518 markings, 174945622 edges, 1108870 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 115148654 markings, 180186711 edges, 670027 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 116980748 markings, 183057053 edges, 366419 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 121518827 markings, 190160815 edges, 907616 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 124843389 markings, 195369510 edges, 664912 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 128896228 markings, 201713103 edges, 810568 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 133494768 markings, 208912050 edges, 919708 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 137962790 markings, 215911463 edges, 893604 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 141864817 markings, 222018439 edges, 780405 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 722 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((p27 <= 0))) AND ((p13 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p9 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AG((p27 <= 0)) AND ((p13 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p9 <= 0))))
lola: processed formula length: 79
lola: 43 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: 3989738 markings, 10913159 edges, 797948 markings/sec, 0 secs
lola: 7939699 markings, 21718057 edges, 789992 markings/sec, 5 secs
lola: 11699937 markings, 32003722 edges, 752048 markings/sec, 10 secs
lola: 15445501 markings, 42249039 edges, 749113 markings/sec, 15 secs
lola: 19164998 markings, 52423349 edges, 743899 markings/sec, 20 secs
lola: 22923754 markings, 62704819 edges, 751751 markings/sec, 25 secs
lola: 26779168 markings, 73250603 edges, 771083 markings/sec, 30 secs
lola: 30506901 markings, 83447137 edges, 745547 markings/sec, 35 secs
lola: 34205043 markings, 93562841 edges, 739628 markings/sec, 40 secs
lola: 37915829 markings, 103713068 edges, 742157 markings/sec, 45 secs
lola: 41555295 markings, 113668189 edges, 727893 markings/sec, 50 secs
lola: 45119613 markings, 123417897 edges, 712864 markings/sec, 55 secs
lola: 48653430 markings, 133084142 edges, 706763 markings/sec, 60 secs
lola: 52121751 markings, 142571221 edges, 693664 markings/sec, 65 secs
lola: 55701234 markings, 152362308 edges, 715897 markings/sec, 70 secs
lola: 59193862 markings, 161915720 edges, 698526 markings/sec, 75 secs
lola: 62965481 markings, 172232405 edges, 754324 markings/sec, 80 secs
lola: 66815251 markings, 182762709 edges, 769954 markings/sec, 85 secs
lola: 70581426 markings, 193064457 edges, 753235 markings/sec, 90 secs
lola: 74285110 markings, 203195477 edges, 740737 markings/sec, 95 secs
lola: 77940032 markings, 213192729 edges, 730984 markings/sec, 100 secs
lola: 81506583 markings, 222948661 edges, 713310 markings/sec, 105 secs
lola: 85181997 markings, 233001972 edges, 735083 markings/sec, 110 secs
lola: 88761999 markings, 242794620 edges, 716000 markings/sec, 115 secs
lola: 92572060 markings, 253216369 edges, 762012 markings/sec, 120 secs
lola: 94546911 markings, 258622440 edges, 394970 markings/sec, 125 secs
lola: 94701459 markings, 259041509 edges, 30910 markings/sec, 130 secs
lola: 94740561 markings, 259148398 edges, 7820 markings/sec, 135 secs
lola: 96739671 markings, 264617237 edges, 399822 markings/sec, 140 secs
lola: 99664491 markings, 272617088 edges, 584964 markings/sec, 145 secs
lola: 101715816 markings, 278228066 edges, 410265 markings/sec, 150 secs
lola: 101715816 markings, 278228066 edges, 0 markings/sec, 155 secs
lola: 101715816 markings, 278228066 edges, 0 markings/sec, 160 secs
lola: 104235902 markings, 285121494 edges, 504017 markings/sec, 165 secs
lola: 104380752 markings, 285517614 edges, 28970 markings/sec, 170 secs
lola: 104404368 markings, 285582162 edges, 4723 markings/sec, 175 secs
lola: 107311701 markings, 293534801 edges, 581467 markings/sec, 180 secs
lola: 110048286 markings, 301020200 edges, 547317 markings/sec, 185 secs
lola: 110048286 markings, 301020200 edges, 0 markings/sec, 190 secs
lola: 110048286 markings, 301020200 edges, 0 markings/sec, 195 secs
lola: 112546454 markings, 307853676 edges, 499634 markings/sec, 200 secs
lola: 113381040 markings, 310136449 edges, 166917 markings/sec, 205 secs
lola: 113381040 markings, 310136449 edges, 0 markings/sec, 210 secs
lola: 113381040 markings, 310136449 edges, 0 markings/sec, 215 secs
lola: 115599336 markings, 316204375 edges, 443659 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 870 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p7 <= 0) OR A (F ((1 <= p32)))))) AND E ((((5 <= p4) OR (1 <= p22) OR (p25 <= 0)) U A (G (((1 <= p21) AND (1 <= p22) AND (1 <= p24)))))))
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:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: (AG(((p7 <= 0) OR AF((1 <= p32)))) AND E(((5 <= p4) OR (1 <= p22) OR (p25 <= 0)) U AG(((1 <= p21) AND (1 <= p22) AND (1 <= p24)))))
lola: processed formula length: 133
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 4 significant temporal operators and needs 17 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 81 markings, 190 edges
lola: ========================================
lola: subprocess 14 will run for 1305 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p10) OR (1 <= p12)) U E (((1 <= p27) U (5 <= p4)))))
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:659
lola: rewrite Frontend/Parser/formula_rewrite.k:663
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: (((p10 <= 0) AND (p12 <= 0)) R ((p27 <= 0) R (p4 <= 4)))
lola: processed formula length: 56
lola: 51 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: yes
lola: produced by: LTL model checker
lola: The existential single path CTL formula holds.
lola: 427 markings, 671 edges
lola: ========================================
lola: subprocess 15 will run for 2610 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p4 <= 4))) OR ((p32 <= 0) OR ((2 <= p1) AND (2 <= p2) AND (1 <= p22) AND (1 <= p27) AND (1 <= p32) AND (1 <= p17) AND (1 <= p11) AND (1 <= p12) AND (1 <= p14) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9) AND (p25 <= 0) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p0 <= 0) OR (p36 <= 0) OR (p37 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2610 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p4 <= 4)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p4 <= 4)))
lola: processed formula length: 17
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (5 <= p4)
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: 40 markings, 39 edges
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: state equation: calling and running sara
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F (A (X ((p33 <= 0))))) AND (A (X (((1 <= p22) AND (1 <= p33)))) OR (E (X (((1 <= p25) OR (1 <= p37)))) OR ((p13 <= 0) OR A (X ((p28 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((p33 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((p33 <= 0)))
lola: processed formula length: 18
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: try reading problem file CTLFireability-15-0.sara.

lola: 5275121 markings, 8242349 edges, 1055024 markings/sec, 0 secs
lola: 10192725 markings, 15926105 edges, 983521 markings/sec, 5 secs
lola: 15006225 markings, 23447202 edges, 962700 markings/sec, 10 secs
lola: 19771850 markings, 30893487 edges, 953125 markings/sec, 15 secs
lola: 24520754 markings, 38313650 edges, 949781 markings/sec, 20 secs
lola: 29333854 markings, 45834122 edges, 962620 markings/sec, 25 secs
lola: 34014001 markings, 53146847 edges, 936029 markings/sec, 30 secs
lola: 38749185 markings, 60545565 edges, 947037 markings/sec, 35 secs
lola: 43400209 markings, 67812792 edges, 930205 markings/sec, 40 secs
lola: 47917353 markings, 74870826 edges, 903429 markings/sec, 45 secs
lola: 52478100 markings, 81997003 edges, 912149 markings/sec, 50 secs
lola: 57080066 markings, 89187567 edges, 920393 markings/sec, 55 secs
lola: 61715851 markings, 96430977 edges, 927157 markings/sec, 60 secs
lola: 66160413 markings, 103375769 edges, 888912 markings/sec, 65 secs
lola: 68748310 markings, 107419496 edges, 517579 markings/sec, 70 secs
lola: 70895507 markings, 110791157 edges, 429439 markings/sec, 75 secs
lola: 74733209 markings, 116770644 edges, 767540 markings/sec, 80 secs
lola: 74875983 markings, 116993682 edges, 28555 markings/sec, 85 secs
lola: 74875983 markings, 116993682 edges, 0 markings/sec, 90 secs
lola: 77250057 markings, 120703171 edges, 474815 markings/sec, 95 secs
lola: 78385580 markings, 122477424 edges, 227105 markings/sec, 100 secs
lola: 81383832 markings, 127162414 edges, 599650 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= p22) AND (1 <= p33))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((1 <= p22) AND (1 <= p33)))
lola: processed formula length: 31
lola: 42 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: ========================================
lola: ...considering subproblem: E (X (((1 <= p25) OR (1 <= p37))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((1 <= p25) OR (1 <= p37)))
lola: processed formula length: 31
lola: 42 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: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((E (G (((p0 <= 0) OR (p36 <= 0) OR (p37 <= 0)))) AND ((1 <= p27) AND A (X ((1 <= p15)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((EG(((p0 <= 0) OR (p36 <= 0) OR (p37 <= 0))) AND ((1 <= p27) AND AX((1 <= p15)))))
lola: processed formula length: 87
lola: 44 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: 2392830 markings, 8524440 edges, 478566 markings/sec, 0 secs
lola: 4750616 markings, 16924048 edges, 471557 markings/sec, 5 secs
lola: 6994002 markings, 24916075 edges, 448677 markings/sec, 10 secs
lola: 9307043 markings, 33156282 edges, 462608 markings/sec, 15 secs
lola: 11572996 markings, 41228742 edges, 453191 markings/sec, 20 secs
lola: 13805903 markings, 49183476 edges, 446581 markings/sec, 25 secs
lola: 16018491 markings, 57065813 edges, 442518 markings/sec, 30 secs
lola: 18304491 markings, 65209693 edges, 457200 markings/sec, 35 secs
lola: 20528255 markings, 73131851 edges, 444753 markings/sec, 40 secs
lola: 22710080 markings, 80904606 edges, 436365 markings/sec, 45 secs
lola: 24941085 markings, 88852558 edges, 446201 markings/sec, 50 secs
lola: 27228003 markings, 96999702 edges, 457384 markings/sec, 55 secs
lola: 29380385 markings, 104667563 edges, 430476 markings/sec, 60 secs
lola: 31363183 markings, 111731176 edges, 396560 markings/sec, 65 secs
lola: 33573054 markings, 119603841 edges, 441974 markings/sec, 70 secs
lola: 35809407 markings, 127570849 edges, 447271 markings/sec, 75 secs
lola: 37955563 markings, 135216528 edges, 429231 markings/sec, 80 secs
lola: 40132959 markings, 142973494 edges, 435479 markings/sec, 85 secs
lola: 42290679 markings, 150660375 edges, 431544 markings/sec, 90 secs
lola: 44399649 markings, 158173579 edges, 421794 markings/sec, 95 secs
lola: 46539183 markings, 165795664 edges, 427907 markings/sec, 100 secs
lola: 48736857 markings, 173624881 edges, 439535 markings/sec, 105 secs
lola: 50816239 markings, 181032694 edges, 415876 markings/sec, 110 secs
lola: 52966255 markings, 188692115 edges, 430003 markings/sec, 115 secs
lola: 55045460 markings, 196099280 edges, 415841 markings/sec, 120 secs
lola: 57136918 markings, 203550103 edges, 418292 markings/sec, 125 secs
lola: 59184379 markings, 210844175 edges, 409492 markings/sec, 130 secs
lola: 61331031 markings, 218491526 edges, 429330 markings/sec, 135 secs
lola: 63513156 markings, 226265346 edges, 436425 markings/sec, 140 secs
lola: 65758250 markings, 234263488 edges, 449019 markings/sec, 145 secs
lola: 68026857 markings, 242345405 edges, 453721 markings/sec, 150 secs
lola: 69353543 markings, 247072251 edges, 265337 markings/sec, 155 secs
lola: 70934647 markings, 252715875 edges, 316221 markings/sec, 160 secs
lola: 72407693 markings, 257952129 edges, 294609 markings/sec, 165 secs
lola: 72407693 markings, 257952129 edges, 0 markings/sec, 170 secs
lola: 72573134 markings, 258541519 edges, 33088 markings/sec, 175 secs
lola: 73815093 markings, 262966001 edges, 248392 markings/sec, 180 secs
lola: 74717811 markings, 266181917 edges, 180544 markings/sec, 185 secs
lola: 74851670 markings, 266658802 edges, 26772 markings/sec, 190 secs
lola: 75651509 markings, 269508230 edges, 159968 markings/sec, 195 secs
lola: 77007350 markings, 274338411 edges, 271168 markings/sec, 200 secs
lola: 77753623 markings, 276997014 edges, 149255 markings/sec, 205 secs
lola: 79375383 markings, 282774530 edges, 324352 markings/sec, 210 secs
lola: 79375383 markings, 282774530 edges, 0 markings/sec, 215 secs
lola: 79375383 markings, 282774530 edges, 0 markings/sec, 220 secs
lola: 80474250 markings, 286689244 edges, 219773 markings/sec, 225 secs
lola: 81286931 markings, 289584424 edges, 162536 markings/sec, 230 secs
lola: 81286931 markings, 289584424 edges, 0 markings/sec, 235 secs
lola: 81310588 markings, 289668704 edges, 4731 markings/sec, 240 secs
lola: 83269333 markings, 296646725 edges, 391749 markings/sec, 245 secs
lola: 83378423 markings, 297035354 edges, 21818 markings/sec, 250 secs
lola: 83378423 markings, 297035354 edges, 0 markings/sec, 255 secs
lola: 84058417 markings, 299457833 edges, 135999 markings/sec, 260 secs
lola: 84312641 markings, 300363507 edges, 50845 markings/sec, 265 secs
lola: 85146029 markings, 303332961 edges, 166678 markings/sec, 270 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (F ((A (X (((5 <= p4) AND (1 <= p23)))) AND E (((1 <= p28) U (1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AX(((5 <= p4) AND (1 <= p23))) AND E((1 <= p28) U (1 <= p7))))
lola: processed formula length: 66
lola: 44 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: 5130757 markings, 8016783 edges, 1026151 markings/sec, 0 secs
lola: 10181960 markings, 15909283 edges, 1010241 markings/sec, 5 secs
lola: 14955058 markings, 23367253 edges, 954620 markings/sec, 10 secs
lola: 19584059 markings, 30600068 edges, 925800 markings/sec, 15 secs
lola: 24334090 markings, 38021991 edges, 950006 markings/sec, 20 secs
lola: 29148261 markings, 45544131 edges, 962834 markings/sec, 25 secs
lola: 33665870 markings, 52602887 edges, 903522 markings/sec, 30 secs
lola: 38552030 markings, 60237512 edges, 977232 markings/sec, 35 secs
lola: 43222204 markings, 67534656 edges, 934035 markings/sec, 40 secs
lola: 47766775 markings, 74635551 edges, 908914 markings/sec, 45 secs
lola: 52264795 markings, 81663710 edges, 899604 markings/sec, 50 secs
lola: 56842525 markings, 88816407 edges, 915546 markings/sec, 55 secs
lola: 61360135 markings, 95875171 edges, 903522 markings/sec, 60 secs
lola: 66045088 markings, 103195409 edges, 936991 markings/sec, 65 secs
lola: 66833843 markings, 104427974 edges, 157751 markings/sec, 70 secs
lola: 68379561 markings, 106843054 edges, 309144 markings/sec, 75 secs
lola: 71943533 markings, 112411726 edges, 712794 markings/sec, 80 secs
lola: 71997610 markings, 112496218 edges, 10815 markings/sec, 85 secs
lola: 71997610 markings, 112496218 edges, 0 markings/sec, 90 secs
lola: 71997610 markings, 112496218 edges, 0 markings/sec, 95 secs
lola: 72800484 markings, 113750713 edges, 160575 markings/sec, 100 secs
lola: 74712018 markings, 116737486 edges, 382307 markings/sec, 105 secs
lola: 77251457 markings, 120705356 edges, 507888 markings/sec, 110 secs
lola: 78287538 markings, 122324235 edges, 207216 markings/sec, 115 secs
lola: 78287538 markings, 122324235 edges, 0 markings/sec, 120 secs
lola: 78296171 markings, 122337715 edges, 1727 markings/sec, 125 secs
lola: 79216722 markings, 123776085 edges, 184110 markings/sec, 130 secs
lola: 79330730 markings, 123954221 edges, 22802 markings/sec, 135 secs
lola: 80492973 markings, 125770232 edges, 232449 markings/sec, 140 secs
lola: 82166861 markings, 128385676 edges, 334778 markings/sec, 145 secs
lola: 82166861 markings, 128385676 edges, 0 markings/sec, 150 secs
lola: 82166861 markings, 128385676 edges, 0 markings/sec, 155 secs
lola: 82166861 markings, 128385676 edges, 0 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p8) OR (1 <= p17) OR (3 <= p3) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p29)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p8 <= 0) AND (p17 <= 0) AND (p3 <= 2) AND ((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0)))
lola: processed formula length: 87
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p8) OR (1 <= p17) OR (3 <= p3) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p29)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 4 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p8 <= 0) AND (p17 <= 0) AND (p3 <= 2) AND ((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-19-0.sara
lola: state equation: write sara problem file to CTLFireability-19-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-19-1.sara.sara:
try reading problem file CTLFireability-19-0.sara.


lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 6284575 markings, 9825525 edges, 1256915 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 12497209 markings, 19539538 edges, 1242527 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 18430905 markings, 28819799 edges, 1186739 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 24657633 markings, 38558297 edges, 1245346 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 30869848 markings, 48272417 edges, 1242443 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 36794668 markings, 57538612 edges, 1184964 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 42671058 markings, 66729779 edges, 1175278 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 48520828 markings, 75890809 edges, 1169954 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 54441139 markings, 85161079 edges, 1184062 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 60208855 markings, 94192202 edges, 1153543 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 65948774 markings, 103181247 edges, 1147984 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 71790394 markings, 112323004 edges, 1168324 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 77488503 markings, 121239134 edges, 1139622 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 83162271 markings, 130118527 edges, 1134754 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 88883334 markings, 139077218 edges, 1144213 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 94511622 markings, 147887098 edges, 1125658 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 100236940 markings, 156851887 edges, 1145064 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 105967584 markings, 165816898 edges, 1146129 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 111679003 markings, 174757924 edges, 1142284 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 115979142 markings, 181486799 edges, 860028 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 120739577 markings, 188942236 edges, 952087 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 124519544 markings, 194861004 edges, 755993 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 127382637 markings, 199343454 edges, 572619 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 129879307 markings, 203251898 edges, 499334 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 132928809 markings, 208024351 edges, 609900 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 133067013 markings, 208242158 edges, 27641 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 133067013 markings, 208242158 edges, 0 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 133067013 markings, 208242158 edges, 0 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 136427276 markings, 213507648 edges, 672053 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 136463926 markings, 213565403 edges, 7330 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 136463927 markings, 213565404 edges, 0 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 139523572 markings, 218354974 edges, 611929 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 139662833 markings, 218572745 edges, 27852 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 139662833 markings, 218572745 edges, 0 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 139662833 markings, 218572745 edges, 0 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 139662833 markings, 218572745 edges, 0 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 141599269 markings, 221603054 edges, 387287 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 141755989 markings, 221848070 edges, 31344 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((p27 <= 0))) AND ((p13 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p9 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AG((p27 <= 0)) AND ((p13 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p9 <= 0))))
lola: processed formula length: 79
lola: 43 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: 4091322 markings, 11191107 edges, 818264 markings/sec, 0 secs
lola: 8028646 markings, 21961345 edges, 787465 markings/sec, 5 secs
lola: 11828532 markings, 32355597 edges, 759977 markings/sec, 10 secs
lola: 15636868 markings, 42772673 edges, 761667 markings/sec, 15 secs
lola: 19377729 markings, 53005130 edges, 748172 markings/sec, 20 secs
lola: 23305536 markings, 63748871 edges, 785561 markings/sec, 25 secs
lola: 27023210 markings, 73918043 edges, 743535 markings/sec, 30 secs
lola: 30802052 markings, 84254510 edges, 755768 markings/sec, 35 secs
lola: 34392471 markings, 94075580 edges, 718084 markings/sec, 40 secs
lola: 38047266 markings, 104072552 edges, 730959 markings/sec, 45 secs
lola: 41670881 markings, 113984536 edges, 724723 markings/sec, 50 secs
lola: 45178405 markings, 123578626 edges, 701505 markings/sec, 55 secs
lola: 48626925 markings, 133011654 edges, 689704 markings/sec, 60 secs
lola: 52142483 markings, 142627883 edges, 703112 markings/sec, 65 secs
lola: 55716287 markings, 152403401 edges, 714761 markings/sec, 70 secs
lola: 59140087 markings, 161768589 edges, 684760 markings/sec, 75 secs
lola: 62862053 markings, 171949482 edges, 744393 markings/sec, 80 secs
lola: 66671407 markings, 182369415 edges, 761871 markings/sec, 85 secs
lola: 70485513 markings, 192802299 edges, 762821 markings/sec, 90 secs
lola: 74139720 markings, 202797714 edges, 730841 markings/sec, 95 secs
lola: 77802074 markings, 212815519 edges, 732471 markings/sec, 100 secs
lola: 81254234 markings, 222258421 edges, 690432 markings/sec, 105 secs
lola: 84879381 markings, 232174324 edges, 725029 markings/sec, 110 secs
lola: 88433879 markings, 241897106 edges, 710900 markings/sec, 115 secs
lola: 92251681 markings, 252339958 edges, 763560 markings/sec, 120 secs
lola: 94770453 markings, 259231754 edges, 503754 markings/sec, 125 secs
lola: 95186972 markings, 260369555 edges, 83304 markings/sec, 130 secs
lola: 95670673 markings, 261692585 edges, 96740 markings/sec, 135 secs
lola: 97723812 markings, 267308573 edges, 410628 markings/sec, 140 secs
lola: 99066219 markings, 270980583 edges, 268481 markings/sec, 145 secs
lola: 99274754 markings, 271550994 edges, 41707 markings/sec, 150 secs
lola: 99274754 markings, 271550994 edges, 0 markings/sec, 155 secs
lola: 99493985 markings, 272150697 edges, 43846 markings/sec, 160 secs
lola: 101672076 markings, 278108418 edges, 435618 markings/sec, 165 secs
lola: 101672076 markings, 278108418 edges, 0 markings/sec, 170 secs
lola: 101672076 markings, 278108418 edges, 0 markings/sec, 175 secs
lola: 101672076 markings, 278108418 edges, 0 markings/sec, 180 secs
lola: 103784731 markings, 283887230 edges, 422531 markings/sec, 185 secs
lola: 104617317 markings, 286164750 edges, 166517 markings/sec, 190 secs
lola: 104617317 markings, 286164750 edges, 0 markings/sec, 195 secs
lola: 104617317 markings, 286164750 edges, 0 markings/sec, 200 secs
lola: 104617317 markings, 286164750 edges, 0 markings/sec, 205 secs
lola: 104617317 markings, 286164750 edges, 0 markings/sec, 210 secs
lola: 104630439 markings, 286200642 edges, 2624 markings/sec, 215 secs
lola: 106179538 markings, 290437970 edges, 309820 markings/sec, 220 secs
lola: 106375665 markings, 290974426 edges, 39225 markings/sec, 225 secs
lola: 106375665 markings, 290974426 edges, 0 markings/sec, 230 secs
lola: 106375665 markings, 290974426 edges, 0 markings/sec, 235 secs
lola: 107461002 markings, 293943231 edges, 217067 markings/sec, 240 secs
lola: 109635712 markings, 299891613 edges, 434942 markings/sec, 245 secs
lola: 109635712 markings, 299891613 edges, 0 markings/sec, 250 secs
lola: 109635712 markings, 299891613 edges, 0 markings/sec, 255 secs
lola: 110081256 markings, 301110477 edges, 89109 markings/sec, 260 secs
lola: 112875348 markings, 308753166 edges, 558818 markings/sec, 265 secs
lola: 112875348 markings, 308753166 edges, 0 markings/sec, 270 secs
lola: 112875348 markings, 308753166 edges, 0 markings/sec, 275 secs
lola: 112875348 markings, 308753166 edges, 0 markings/sec, 280 secs
lola: 114067027 markings, 312012981 edges, 238336 markings/sec, 285 secs
lola: 115610614 markings, 316234974 edges, 308717 markings/sec, 290 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (G ((p4 <= 4))) OR ((p32 <= 0) OR ((2 <= p1) AND (2 <= p2) AND (1 <= p22) AND (1 <= p27) AND (1 <= p32) AND (1 <= p17) AND (1 <= p11) AND (1 <= p12) AND (1 <= p14) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9) AND (p25 <= 0) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p0 <= 0) OR (p36 <= 0) OR (p37 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G ((p4 <= 4)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p4 <= 4)))
lola: processed formula length: 17
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (5 <= p4)
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: 40 markings, 39 edges
lola: state equation: write sara problem file to CTLFireability-21-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: ...considering subproblem: ((p32 <= 0) OR ((2 <= p1) AND (2 <= p2) AND (1 <= p22) AND (1 <= p27) AND (1 <= p32) AND (1 <= p17) AND (1 <= p11) AND (1 <= p12) AND (1 <= p14) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9) AND (p25 <= 0) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p0 <= 0) OR (p36 <= 0) OR (p37 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: ========================================
lola: processed formula: ((p32 <= 0) OR ((2 <= p1) AND (2 <= p2) AND (1 <= p22) AND (1 <= p27) AND (1 <= p32) AND (1 <= p17) AND (1 <= p11) AND (1 <= p12) AND (1 <= p14) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9) AND (p25 <= 0) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p0 <= 0) OR (p36 <= 0) OR (p37 <= 0))))
lola: processed formula length: 281
lola: 42 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 19 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown yes unknown yes yes yes no unknown yes unknown unknown yes yes yes no no
lola:
preliminary result: unknown yes unknown yes yes yes no unknown yes unknown unknown yes yes yes no no
sara: try reading problem file CTLFireability-21-0.sara.

lola: memory consumption: 4012 KB
lola: time consumption: 2207 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-007008"
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-007008, 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-158987938400044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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