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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.2K Apr 12 10:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 10:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 11 12:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 11 12:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 24K Mar 24 05:38 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1591224484084

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 22:48:06] [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:48:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 22:48:06] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2020-06-03 22:48:06] [INFO ] Transformed 54 places.
[2020-06-03 22:48:06] [INFO ] Transformed 43 transitions.
[2020-06-03 22:48:06] [INFO ] Parsed PT model containing 54 places and 43 transitions in 59 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Incomplete random walk after 100008 steps, including 0 resets, run finished after 122 ms. (steps per millisecond=819 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 43 rows 54 cols
[2020-06-03 22:48:06] [INFO ] Computed 22 place invariants in 18 ms
[2020-06-03 22:48:06] [INFO ] [Real]Absence check using 22 positive place invariants in 15 ms returned sat
[2020-06-03 22:48:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:48:06] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-06-03 22:48:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:48:06] [INFO ] [Nat]Absence check using 22 positive place invariants in 13 ms returned sat
[2020-06-03 22:48:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:48:06] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-06-03 22:48:07] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 15 ms.
[2020-06-03 22:48:07] [INFO ] Added : 32 causal constraints over 7 iterations in 123 ms. Result :sat
[2020-06-03 22:48:07] [INFO ] [Real]Absence check using 22 positive place invariants in 100 ms returned sat
[2020-06-03 22:48:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:48:07] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2020-06-03 22:48:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:48:07] [INFO ] [Nat]Absence check using 22 positive place invariants in 7 ms returned sat
[2020-06-03 22:48:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:48:07] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-03 22:48:07] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 16 ms.
[2020-06-03 22:48:07] [INFO ] Added : 14 causal constraints over 3 iterations in 60 ms. Result :sat
[2020-06-03 22:48:07] [INFO ] [Real]Absence check using 22 positive place invariants in 110 ms returned sat
[2020-06-03 22:48:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:48:07] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-06-03 22:48:07] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 2 ms.
[2020-06-03 22:48:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:48:08] [INFO ] [Nat]Absence check using 22 positive place invariants in 8 ms returned sat
[2020-06-03 22:48:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:48:08] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2020-06-03 22:48:08] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 2 ms.
[2020-06-03 22:48:08] [INFO ] Added : 14 causal constraints over 3 iterations in 16 ms. Result :sat
[2020-06-03 22:48:08] [INFO ] [Real]Absence check using 22 positive place invariants in 7 ms returned sat
[2020-06-03 22:48:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:48:08] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-03 22:48:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:48:08] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2020-06-03 22:48:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:48:08] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2020-06-03 22:48:08] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 5 ms.
[2020-06-03 22:48:08] [INFO ] Added : 16 causal constraints over 4 iterations in 20 ms. Result :sat
[2020-06-03 22:48:08] [INFO ] Flatten gal took : 23 ms
[2020-06-03 22:48:08] [INFO ] Flatten gal took : 6 ms
[2020-06-03 22:48:08] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2020-06-03 22:48:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ RefineWMG-PT-010011 @ 3570 seconds

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

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

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

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

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

FORMULA n0-CTLFireability-11 FALSE 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-13 FALSE 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-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA n0-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: -1
rslt: Output for CTLFireability @ RefineWMG-PT-010011

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 283
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (F (((3 <= p3) AND (1 <= p31) AND (1 <= p32) AND (1 <= p34) AND (p28 <= 0) AND (p8 <= 0) AND ((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0)))))",
"processed_size": 140,
"rewrites": 16
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 21,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 401
},
"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 <= p0) AND (1 <= p51) AND (1 <= p52))",
"processed_size": 41,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 803
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (((5 <= p4) U ((1 <= p16) AND (1 <= p17) AND (1 <= p19) AND (1 <= p35) AND (1 <= p22))))",
"processed_size": 90,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1606
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0) OR (p43 <= 0) OR (p40 <= 0) OR (p32 <= 0) OR ((2 <= p1) AND (2 <= p2) AND (p22 <= 0) AND (p52 <= 0)))",
"processed_size": 147,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "((p18 <= 0) AND (1 <= p0) AND (1 <= p51) AND (1 <= p52) AND ((p36 <= 0) OR (p37 <= 0) OR (p39 <= 0)))",
"processed_size": 103,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G ((((1 <= p41) AND (1 <= p42) AND (1 <= p44)) OR (1 <= p27))))",
"processed_size": 67,
"rewrites": 17
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 896,
"runtime": 3571.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E((E(F(**)) U **)) AND E(X(*))) : E(G(E((** U **)))) : (A(G(**)) OR **) : A(G(**)) : E((A(F(**)) U **)) : (E(F((E(X(**)) AND (** AND **)))) OR A((** U E(X(**))))) : E(F(**)) : E(((A(G(**)) OR A(F(**))) U **)) : (E(F(**)) OR (E(F(A(G(**)))) OR A(G(**)))) : (E(F(**)) OR (A(X(**)) AND A(F(**)))) : A(G(**)) : (A((** U **)) OR A(G(**))) : E(((A(F(**)) AND **) U A(G(**)))) : (** AND ((A(G(**)) OR **) AND (E(G(*)) OR **))) : A(F((E(F(**)) OR A((** U **))))) : A(G((** OR (E(F(**)) OR **))))"
},
"net":
{
"arcs": 128,
"conflict_clusters": 33,
"places": 54,
"places_significant": 32,
"singleton_clusters": 0,
"transitions": 43
},
"result":
{
"interim_value": "unknown unknown no no unknown unknown yes unknown yes yes no no unknown no unknown unknown ",
"preliminary_value": "unknown unknown no no unknown unknown yes unknown yes yes no no unknown no unknown unknown "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 97/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1728
lola: finding significant places
lola: 54 places, 43 transitions, 32 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 ((E (F (((1 <= p36) AND (1 <= p37) AND (1 <= p39)))) U ((1 <= p11) AND (1 <= p12) AND (1 <= p14)))) AND NOT(A (X ((p27 <= 0))))) : E (G (E (((p23 <= 0) U ((1 <= p48) AND (1 <= p21) AND (1 <= p22) AND (1 <= p24)))))) : (A (G (A (G (((p31 <= 0) OR (p32 <= 0) OR (p34 <= 0)))))) OR ((1 <= p0) AND (1 <= p51) AND (1 <= p52))) : A (G (A (G ((1 <= p32))))) : E ((A (F ((p25 <= 0))) U ((1 <= p10) AND (1 <= p52) AND (p12 <= 0) AND (p40 <= 0)))) : (E (F (((E (X ((1 <= p10))) AND (p18 <= 0)) AND (1 <= p38)))) OR A ((((1 <= p46) AND (1 <= p47) AND (1 <= p49) AND (1 <= p48) AND (p42 <= 0)) U E (X ((1 <= p30)))))) : E (F (((3 <= p3) AND (1 <= p31) AND (1 <= p32) AND (1 <= p34) AND (p28 <= 0) AND (p8 <= 0) AND ((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0))))) : E (((A (G ((1 <= p7))) OR A (F ((1 <= p42)))) U ((5 <= p4) AND (1 <= p26) AND (1 <= p27) AND (1 <= p29) AND (1 <= p37) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9)))) : (E (F ((((3 <= p3) AND (1 <= p10)) OR A (G (((1 <= p41) AND (1 <= p42) AND (1 <= p44))))))) OR A (G ((1 <= p30)))) : (E (F (E (((1 <= p12) U (5 <= p4))))) OR (A (X (((1 <= p21) AND (1 <= p22) AND (1 <= p24)))) AND A (F ((((1 <= p53) AND (1 <= p45)) OR ((5 <= p4) AND (1 <= p46) AND (1 <= p47) AND (1 <= p49))))))) : A (G ((1 <= p32))) : (A (((5 <= p4) U ((1 <= p16) AND (1 <= p17) AND (1 <= p19) AND (1 <= p35) AND (1 <= p22)))) OR E (G (A (G ((p35 <= 0)))))) : E (((A (F ((1 <= p32))) AND ((1 <= p48) OR (1 <= p38) OR (1 <= p42))) U A (G (((1 <= p41) AND (1 <= p42) AND (1 <= p44)))))) : ((((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0) OR (p43 <= 0) OR (p40 <= 0) OR (p32 <= 0) OR ((2 <= p1) AND (2 <= p2) AND (p22 <= 0) AND (p52 <= 0))) AND (A (G ((((1 <= p41) AND (1 <= p42) AND (1 <= p44)) OR (1 <= p27)))) OR ((p18 <= 0) AND (1 <= p0) AND (1 <= p51) AND (1 <= p52) AND ((p36 <= 0) OR (p37 <= 0) OR (p39 <= 0))))) AND (NOT(A (F ((p52 <= 0)))) OR ((1 <= p41) AND (1 <= p42) AND (1 <= p44)))) : A (F ((E (F (((1 <= p35) AND (1 <= p0) AND (1 <= p51) AND (1 <= p52)))) OR A (((1 <= p50) U (3 <= p3)))))) : A (G ((((1 <= p8) OR E (F ((1 <= p43)))) OR ((2 <= p1) AND (2 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p14) AND ((1 <= p7) OR (1 <= p23))))))
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:389
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: rewrite Frontend/Parser/formula_rewrite.k:476
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: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 ((E (F (((1 <= p36) AND (1 <= p37) AND (1 <= p39)))) U ((1 <= p11) AND (1 <= p12) AND (1 <= p14)))) AND E (X ((1 <= p27))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: (E(EF(((1 <= p36) AND (1 <= p37) AND (1 <= p39))) U ((1 <= p11) AND (1 <= p12) AND (1 <= p14))) AND EX((1 <= p27)))
lola: processed formula length: 115
lola: 18 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: 5413200 markings, 8365839 edges, 1082640 markings/sec, 0 secs
lola: 10849299 markings, 16767080 edges, 1087220 markings/sec, 5 secs
lola: 16153482 markings, 24964446 edges, 1060837 markings/sec, 10 secs
lola: 21272449 markings, 32875582 edges, 1023793 markings/sec, 15 secs
lola: 26482848 markings, 40928013 edges, 1042080 markings/sec, 20 secs
lola: 31785500 markings, 49123021 edges, 1060530 markings/sec, 25 secs
lola: 37173383 markings, 57449751 edges, 1077577 markings/sec, 30 secs
lola: 42406506 markings, 65537302 edges, 1046625 markings/sec, 35 secs
lola: 47597744 markings, 73560124 edges, 1038248 markings/sec, 40 secs
lola: 52734277 markings, 81498405 edges, 1027307 markings/sec, 45 secs
lola: 57820670 markings, 89359193 edges, 1017279 markings/sec, 50 secs
lola: 62794961 markings, 97046740 edges, 994858 markings/sec, 55 secs
lola: 67741766 markings, 104691794 edges, 989361 markings/sec, 60 secs
lola: 72783486 markings, 112483555 edges, 1008344 markings/sec, 65 secs
lola: 78159084 markings, 120791288 edges, 1075120 markings/sec, 70 secs
lola: 83589947 markings, 129184444 edges, 1086173 markings/sec, 75 secs
lola: 87206080 markings, 134773374 edges, 723227 markings/sec, 80 secs
lola: 88285172 markings, 136441716 edges, 215818 markings/sec, 85 secs
lola: 89133058 markings, 137767726 edges, 169577 markings/sec, 90 secs
lola: 91730753 markings, 141766161 edges, 519539 markings/sec, 95 secs
lola: 94129153 markings, 145472303 edges, 479680 markings/sec, 100 secs
lola: 94168065 markings, 145532434 edges, 7782 markings/sec, 105 secs
lola: 94187735 markings, 145562842 edges, 3934 markings/sec, 110 secs
lola: 94999933 markings, 146818054 edges, 162440 markings/sec, 115 secs
lola: 95642444 markings, 147811032 edges, 128502 markings/sec, 120 secs
lola: 95658497 markings, 147835834 edges, 3211 markings/sec, 125 secs
lola: 95658497 markings, 147835834 edges, 0 markings/sec, 130 secs
lola: 96263994 markings, 148771607 edges, 121099 markings/sec, 135 secs
lola: 97048467 markings, 149983979 edges, 156895 markings/sec, 140 secs
lola: 97048467 markings, 149983979 edges, 0 markings/sec, 145 secs
lola: 97082295 markings, 150036252 edges, 6766 markings/sec, 150 secs
lola: 98036481 markings, 151510902 edges, 190837 markings/sec, 155 secs
lola: 98036481 markings, 151510902 edges, 0 markings/sec, 160 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((E (X ((1 <= p10))) AND ((p18 <= 0) AND (1 <= p38))))) OR A ((((1 <= p46) AND (1 <= p47) AND (1 <= p49) AND (1 <= p48) AND (p42 <= 0)) U E (X ((1 <= p30))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: (EF((EX((1 <= p10)) AND ((p18 <= 0) AND (1 <= p38)))) OR A(((1 <= p46) AND (1 <= p47) AND (1 <= p49) AND (1 <= p48) AND (p42 <= 0)) U EX((1 <= p30))))
lola: processed formula length: 150
lola: 19 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: 2970162 markings, 4590227 edges, 594032 markings/sec, 0 secs
lola: 5768670 markings, 8915203 edges, 559702 markings/sec, 5 secs
lola: 9964697 markings, 15399963 edges, 839205 markings/sec, 10 secs
lola: 12763908 markings, 19726018 edges, 559842 markings/sec, 15 secs
lola: 15593895 markings, 24099630 edges, 565997 markings/sec, 20 secs
lola: 18258981 markings, 28218404 edges, 533017 markings/sec, 25 secs
lola: 21099735 markings, 32608654 edges, 568151 markings/sec, 30 secs
lola: 23868946 markings, 36888346 edges, 553842 markings/sec, 35 secs
lola: 26681523 markings, 41235052 edges, 562515 markings/sec, 40 secs
lola: 29487338 markings, 45571321 edges, 561163 markings/sec, 45 secs
lola: 32255470 markings, 49849339 edges, 553626 markings/sec, 50 secs
lola: 35007500 markings, 54102474 edges, 550406 markings/sec, 55 secs
lola: 37826393 markings, 58458950 edges, 563779 markings/sec, 60 secs
lola: 40552331 markings, 62671753 edges, 545188 markings/sec, 65 secs
lola: 43128517 markings, 66653136 edges, 515237 markings/sec, 70 secs
lola: 45696861 markings, 70622392 edges, 513669 markings/sec, 75 secs
lola: 48231932 markings, 74540244 edges, 507014 markings/sec, 80 secs
lola: 50776744 markings, 78473125 edges, 508962 markings/sec, 85 secs
lola: 53444414 markings, 82595886 edges, 533534 markings/sec, 90 secs
lola: 56181519 markings, 86825956 edges, 547421 markings/sec, 95 secs
lola: 58806551 markings, 90882834 edges, 525006 markings/sec, 100 secs
lola: 61243943 markings, 94649801 edges, 487478 markings/sec, 105 secs
lola: 63147740 markings, 97592183 edges, 380759 markings/sec, 110 secs
lola: 63234658 markings, 97726269 edges, 17384 markings/sec, 115 secs
lola: 64458884 markings, 99619364 edges, 244845 markings/sec, 120 secs
lola: 65893372 markings, 101835190 edges, 286898 markings/sec, 125 secs
lola: 65893372 markings, 101835190 edges, 0 markings/sec, 130 secs
lola: 67668758 markings, 104578971 edges, 355077 markings/sec, 135 secs
lola: 69222580 markings, 106980332 edges, 310764 markings/sec, 140 secs
lola: 69362886 markings, 107197159 edges, 28061 markings/sec, 145 secs
lola: 70074209 markings, 108296483 edges, 142265 markings/sec, 150 secs
lola: 70506702 markings, 108964886 edges, 86499 markings/sec, 155 secs
lola: 70506702 markings, 108964886 edges, 0 markings/sec, 160 secs
lola: 71224663 markings, 110074463 edges, 143592 markings/sec, 165 secs
lola: 71961172 markings, 111212705 edges, 147302 markings/sec, 170 secs
lola: 71961172 markings, 111212705 edges, 0 markings/sec, 175 secs
lola: 72524519 markings, 112083332 edges, 112669 markings/sec, 180 secs
lola: 74711135 markings, 115462641 edges, 437323 markings/sec, 185 secs
lola: 74816196 markings, 115625004 edges, 21012 markings/sec, 190 secs
lola: 74816196 markings, 115625004 edges, 0 markings/sec, 195 secs
lola: 74829273 markings, 115645216 edges, 2615 markings/sec, 200 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((5 <= p4))) OR (A (X (((1 <= p21) AND (1 <= p22) AND (1 <= p24)))) AND A (F ((((1 <= p53) AND (1 <= p45)) OR ((5 <= p4) AND (1 <= p46) AND (1 <= p47) AND (1 <= p49)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((5 <= p4)))
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 ((5 <= p4)))
lola: processed formula length: 17
lola: 16 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: (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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 55 markings, 54 edges
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p32)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((1 <= p32)))
lola: processed formula length: 18
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p32 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 4 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p32)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((1 <= p32)))
lola: processed formula length: 18
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p32 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
sara: try reading problem file CTLFireability-2-0.sara.
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 5 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLFireability-4-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: ...considering subproblem: E (F (((3 <= p3) AND (1 <= p31) AND (1 <= p32) AND (1 <= p34) AND (p28 <= 0) AND (p8 <= 0) AND ((p46 <= 0) OR (p47 <= 0) OR (p49 <= 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 (((3 <= p3) AND (1 <= p31) AND (1 <= p32) AND (1 <= p34) AND (p28 <= 0) AND (p8 <= 0) AND ((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0)))))
lola: processed formula length: 140
lola: 16 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: ((3 <= p3) AND (1 <= p31) AND (1 <= p32) AND (1 <= p34) AND (p28 <= 0) AND (p8 <= 0) AND ((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0)))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 21 literals and 3 conjunctive subformulas
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 6 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (((p23 <= 0) U ((1 <= p48) AND (1 <= p21) AND (1 <= p22) AND (1 <= p24))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(E((p23 <= 0) U ((1 <= p48) AND (1 <= p21) AND (1 <= p22) AND (1 <= p24))))
lola: processed formula length: 77
lola: 17 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: 5351361 markings, 8270269 edges, 1070272 markings/sec, 0 secs
lola: 10563332 markings, 16325124 edges, 1042394 markings/sec, 5 secs
lola: 15773267 markings, 24376843 edges, 1041987 markings/sec, 10 secs
lola: 21321450 markings, 32951301 edges, 1109637 markings/sec, 15 secs
lola: 26757281 markings, 41352132 edges, 1087166 markings/sec, 20 secs
lola: 32128972 markings, 49653831 edges, 1074338 markings/sec, 25 secs
lola: 37592291 markings, 58097142 edges, 1092664 markings/sec, 30 secs
lola: 43121570 markings, 66642389 edges, 1105856 markings/sec, 35 secs
lola: 48314483 markings, 74667810 edges, 1038583 markings/sec, 40 secs
lola: 53349194 markings, 82448722 edges, 1006942 markings/sec, 45 secs
lola: 58394440 markings, 90245919 edges, 1009049 markings/sec, 50 secs
lola: 63416931 markings, 98007947 edges, 1004498 markings/sec, 55 secs
lola: 68348336 markings, 105629209 edges, 986281 markings/sec, 60 secs
lola: 73311909 markings, 113300193 edges, 992715 markings/sec, 65 secs
lola: 78518339 markings, 121346490 edges, 1041286 markings/sec, 70 secs
lola: 83604579 markings, 129207050 edges, 1017248 markings/sec, 75 secs
lola: 88418142 markings, 136646226 edges, 962713 markings/sec, 80 secs
lola: 89345125 markings, 138078947 edges, 185397 markings/sec, 85 secs
lola: 93374899 markings, 144308476 edges, 805955 markings/sec, 90 secs
lola: 96792088 markings, 149587730 edges, 683438 markings/sec, 95 secs
lola: 96935926 markings, 149810021 edges, 28768 markings/sec, 100 secs
lola: 96935926 markings, 149810021 edges, 0 markings/sec, 105 secs
lola: 98161963 markings, 151704810 edges, 245207 markings/sec, 110 secs
lola: 100689531 markings, 155611049 edges, 505514 markings/sec, 115 secs
lola: 100689531 markings, 155611049 edges, 0 markings/sec, 120 secs
lola: 103511863 markings, 159972843 edges, 564466 markings/sec, 125 secs
lola: 105359621 markings, 162828457 edges, 369552 markings/sec, 130 secs
lola: 105359621 markings, 162828457 edges, 0 markings/sec, 135 secs
lola: 106494106 markings, 164581764 edges, 226897 markings/sec, 140 secs
lola: 107827154 markings, 166641924 edges, 266610 markings/sec, 145 secs
lola: 107836284 markings, 166656032 edges, 1826 markings/sec, 150 secs
lola: 108041509 markings, 166973210 edges, 41045 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((p25 <= 0))) U ((1 <= p10) AND (1 <= p52) AND (p12 <= 0) AND (p40 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AF((p25 <= 0)) U ((1 <= p10) AND (1 <= p52) AND (p12 <= 0) AND (p40 <= 0)))
lola: processed formula length: 77
lola: 17 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: 3819953 markings, 9723495 edges, 763991 markings/sec, 0 secs
lola: 7658802 markings, 19495113 edges, 767770 markings/sec, 5 secs
lola: 11440871 markings, 29122199 edges, 756414 markings/sec, 10 secs
lola: 15045041 markings, 38296443 edges, 720834 markings/sec, 15 secs
lola: 18738562 markings, 47698135 edges, 738704 markings/sec, 20 secs
lola: 22580603 markings, 57477869 edges, 768408 markings/sec, 25 secs
lola: 26248506 markings, 66814354 edges, 733581 markings/sec, 30 secs
lola: 29881733 markings, 76062574 edges, 726645 markings/sec, 35 secs
lola: 33499277 markings, 85270863 edges, 723509 markings/sec, 40 secs
lola: 37201246 markings, 94694063 edges, 740394 markings/sec, 45 secs
lola: 40984109 markings, 104323163 edges, 756573 markings/sec, 50 secs
lola: 44549883 markings, 113399675 edges, 713155 markings/sec, 55 secs
lola: 47973979 markings, 122115557 edges, 684819 markings/sec, 60 secs
lola: 51456533 markings, 130980239 edges, 696511 markings/sec, 65 secs
lola: 54879673 markings, 139693689 edges, 684628 markings/sec, 70 secs
lola: 58295791 markings, 148389266 edges, 683224 markings/sec, 75 secs
lola: 61603158 markings, 156808017 edges, 661473 markings/sec, 80 secs
lola: 64972324 markings, 165384073 edges, 673833 markings/sec, 85 secs
lola: 68368791 markings, 174029616 edges, 679293 markings/sec, 90 secs
lola: 71678942 markings, 182455469 edges, 662030 markings/sec, 95 secs
lola: 75369219 markings, 191848896 edges, 738055 markings/sec, 100 secs
lola: 78854792 markings, 200721261 edges, 697115 markings/sec, 105 secs
lola: 82329613 markings, 209566262 edges, 694964 markings/sec, 110 secs
lola: 85727361 markings, 218215073 edges, 679550 markings/sec, 115 secs
lola: 88690224 markings, 225757049 edges, 592573 markings/sec, 120 secs
lola: 89802651 markings, 228592501 edges, 222485 markings/sec, 125 secs
lola: 92146710 markings, 234564626 edges, 468812 markings/sec, 130 secs
lola: 95153612 markings, 242209171 edges, 601380 markings/sec, 135 secs
lola: 95341953 markings, 242688579 edges, 37668 markings/sec, 140 secs
lola: 95341953 markings, 242688579 edges, 0 markings/sec, 145 secs
lola: 95341953 markings, 242688579 edges, 0 markings/sec, 150 secs
lola: 96280452 markings, 245077488 edges, 187700 markings/sec, 155 secs
lola: 96925992 markings, 246720682 edges, 129108 markings/sec, 160 secs
lola: 97123745 markings, 247224058 edges, 39551 markings/sec, 165 secs
lola: 99724864 markings, 253845075 edges, 520224 markings/sec, 170 secs
lola: 99724864 markings, 253845075 edges, 0 markings/sec, 175 secs
lola: 99753684 markings, 253918438 edges, 5764 markings/sec, 180 secs
lola: 102463675 markings, 260816605 edges, 541998 markings/sec, 185 secs
lola: 102463675 markings, 260816605 edges, 0 markings/sec, 190 secs
lola: 102463675 markings, 260816605 edges, 0 markings/sec, 195 secs
lola: 102463675 markings, 260816605 edges, 0 markings/sec, 200 secs
lola: 102488671 markings, 260880227 edges, 4999 markings/sec, 205 secs
lola: 105055745 markings, 267414600 edges, 513415 markings/sec, 210 secs
lola: 105088161 markings, 267497105 edges, 6483 markings/sec, 215 secs
lola: 108201405 markings, 275421734 edges, 622649 markings/sec, 220 secs
lola: 108343219 markings, 275782709 edges, 28363 markings/sec, 225 secs
lola: 108343219 markings, 275782709 edges, 0 markings/sec, 230 secs
lola: 108343219 markings, 275782709 edges, 0 markings/sec, 235 secs
lola: 108343219 markings, 275782709 edges, 0 markings/sec, 240 secs
lola: 108343219 markings, 275782709 edges, 0 markings/sec, 245 secs
lola: 108375054 markings, 275863748 edges, 6367 markings/sec, 250 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p8) OR (E (F ((1 <= p43))) OR ((2 <= p1) AND (2 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p14) AND ((1 <= p7) OR (1 <= p23)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(((1 <= p8) OR (EF((1 <= p43)) OR ((2 <= p1) AND (2 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p14) AND ((1 <= p7) OR (1 <= p23))))))
lola: processed formula length: 140
lola: 17 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: 3712452 markings, 9926921 edges, 742490 markings/sec, 0 secs
lola: 7255463 markings, 19400601 edges, 708602 markings/sec, 5 secs
lola: 10757057 markings, 28763518 edges, 700319 markings/sec, 10 secs
lola: 14176818 markings, 37907929 edges, 683952 markings/sec, 15 secs
lola: 17582220 markings, 47013560 edges, 681080 markings/sec, 20 secs
lola: 21157741 markings, 56574101 edges, 715104 markings/sec, 25 secs
lola: 24590815 markings, 65754055 edges, 686615 markings/sec, 30 secs
lola: 28120910 markings, 75193076 edges, 706019 markings/sec, 35 secs
lola: 31538223 markings, 84330798 edges, 683463 markings/sec, 40 secs
lola: 35038260 markings, 93689755 edges, 700007 markings/sec, 45 secs
lola: 38535637 markings, 103041495 edges, 699475 markings/sec, 50 secs
lola: 41967745 markings, 112218673 edges, 686422 markings/sec, 55 secs
lola: 45443153 markings, 121511827 edges, 695082 markings/sec, 60 secs
lola: 48757896 markings, 130375158 edges, 662949 markings/sec, 65 secs
lola: 52078374 markings, 139253464 edges, 664096 markings/sec, 70 secs
lola: 55335949 markings, 147964214 edges, 651515 markings/sec, 75 secs
lola: 58637472 markings, 156792121 edges, 660305 markings/sec, 80 secs
lola: 61815994 markings, 165291374 edges, 635704 markings/sec, 85 secs
lola: 64991249 markings, 173781887 edges, 635051 markings/sec, 90 secs
lola: 68197858 markings, 182356195 edges, 641322 markings/sec, 95 secs
lola: 71362944 markings, 190819232 edges, 633017 markings/sec, 100 secs
lola: 74877406 markings, 200216485 edges, 702892 markings/sec, 105 secs
lola: 78260272 markings, 209262101 edges, 676573 markings/sec, 110 secs
lola: 81662729 markings, 218360239 edges, 680491 markings/sec, 115 secs
lola: 84954482 markings, 227161929 edges, 658351 markings/sec, 120 secs
lola: 88219733 markings, 235893264 edges, 653050 markings/sec, 125 secs
lola: 90300303 markings, 241457772 edges, 416114 markings/sec, 130 secs
lola: 90431417 markings, 241806957 edges, 26223 markings/sec, 135 secs
lola: 90740004 markings, 242631966 edges, 61717 markings/sec, 140 secs
lola: 93830258 markings, 250895625 edges, 618051 markings/sec, 145 secs
lola: 96417218 markings, 257812555 edges, 517392 markings/sec, 150 secs
lola: 97707453 markings, 261262400 edges, 258047 markings/sec, 155 secs
lola: 97831177 markings, 261593311 edges, 24745 markings/sec, 160 secs
lola: 97842818 markings, 261624508 edges, 2328 markings/sec, 165 secs
lola: 99334138 markings, 265612167 edges, 298264 markings/sec, 170 secs
lola: 99421759 markings, 265846303 edges, 17524 markings/sec, 175 secs
lola: 99421759 markings, 265846303 edges, 0 markings/sec, 180 secs
lola: 99711521 markings, 266621173 edges, 57952 markings/sec, 185 secs
lola: 102730404 markings, 274693661 edges, 603777 markings/sec, 190 secs
lola: 102730404 markings, 274693661 edges, 0 markings/sec, 195 secs
lola: 102730404 markings, 274693661 edges, 0 markings/sec, 200 secs
lola: 102730404 markings, 274693661 edges, 0 markings/sec, 205 secs
lola: 102746740 markings, 274737017 edges, 3267 markings/sec, 210 secs
lola: 104778573 markings, 280170026 edges, 406367 markings/sec, 215 secs
lola: 104778573 markings, 280170026 edges, 0 markings/sec, 220 secs
lola: 104778573 markings, 280170026 edges, 0 markings/sec, 225 secs
lola: 104778573 markings, 280170026 edges, 0 markings/sec, 230 secs
lola: 105943191 markings, 283284139 edges, 232924 markings/sec, 235 secs
lola: 106816717 markings, 285619988 edges, 174705 markings/sec, 240 secs
lola: 107937304 markings, 288616256 edges, 224117 markings/sec, 245 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (F (((1 <= p35) AND (1 <= p0) AND (1 <= p51) AND (1 <= p52)))) OR A (((1 <= p50) U (3 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EF(((1 <= p35) AND (1 <= p0) AND (1 <= p51) AND (1 <= p52))) OR A((1 <= p50) U (3 <= p3))))
lola: processed formula length: 95
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 23251 markings, 35916 edges, 4650 markings/sec, 0 secs
lola: 23251 markings, 35916 edges, 0 markings/sec, 5 secs
lola: 23251 markings, 35916 edges, 0 markings/sec, 10 secs
lola: 1553754 markings, 2401235 edges, 306101 markings/sec, 15 secs
lola: 6870436 markings, 10617929 edges, 1063336 markings/sec, 20 secs
lola: 12125244 markings, 18738986 edges, 1050962 markings/sec, 25 secs
lola: 17350249 markings, 26814005 edges, 1045001 markings/sec, 30 secs
lola: 22648752 markings, 35002594 edges, 1059701 markings/sec, 35 secs
lola: 27781284 markings, 42934683 edges, 1026506 markings/sec, 40 secs
lola: 33003193 markings, 51004907 edges, 1044382 markings/sec, 45 secs
lola: 38317533 markings, 59217987 edges, 1062868 markings/sec, 50 secs
lola: 43534749 markings, 67280948 edges, 1043443 markings/sec, 55 secs
lola: 48617469 markings, 75136063 edges, 1016544 markings/sec, 60 secs
lola: 53664806 markings, 82936504 edges, 1009467 markings/sec, 65 secs
lola: 58675426 markings, 90680185 edges, 1002124 markings/sec, 70 secs
lola: 63560719 markings, 98230177 edges, 977059 markings/sec, 75 secs
lola: 68412173 markings, 105727878 edges, 970291 markings/sec, 80 secs
lola: 73383577 markings, 113410962 edges, 994281 markings/sec, 85 secs
lola: 78506497 markings, 121328215 edges, 1024584 markings/sec, 90 secs
lola: 83509531 markings, 129060162 edges, 1000607 markings/sec, 95 secs
lola: 88409832 markings, 136633437 edges, 980060 markings/sec, 100 secs
lola: 89350029 markings, 138086387 edges, 188039 markings/sec, 105 secs
lola: 90154881 markings, 139330247 edges, 160970 markings/sec, 110 secs
lola: 90701226 markings, 140174599 edges, 109269 markings/sec, 115 secs
lola: 90847873 markings, 140401240 edges, 29329 markings/sec, 120 secs
lola: 91176475 markings, 140909081 edges, 65720 markings/sec, 125 secs
lola: 95218541 markings, 147155908 edges, 808413 markings/sec, 130 secs
lola: 98466049 markings, 152174781 edges, 649502 markings/sec, 135 secs
lola: 101233916 markings, 156452394 edges, 553573 markings/sec, 140 secs
lola: 101412103 markings, 156727771 edges, 35637 markings/sec, 145 secs
lola: 101412103 markings, 156727771 edges, 0 markings/sec, 150 secs
lola: 101412103 markings, 156727771 edges, 0 markings/sec, 155 secs
lola: 101495445 markings, 156856576 edges, 16668 markings/sec, 160 secs
lola: 101495445 markings, 156856576 edges, 0 markings/sec, 165 secs
lola: 103678411 markings, 160230243 edges, 436593 markings/sec, 170 secs
lola: 103813889 markings, 160439617 edges, 27096 markings/sec, 175 secs
lola: 103813889 markings, 160439617 edges, 0 markings/sec, 180 secs
lola: 103813889 markings, 160439617 edges, 0 markings/sec, 185 secs
lola: 103813889 markings, 160439617 edges, 0 markings/sec, 190 secs
lola: 103841281 markings, 160481957 edges, 5478 markings/sec, 195 secs
lola: 105487343 markings, 163025867 edges, 329212 markings/sec, 200 secs
lola: 105725953 markings, 163394633 edges, 47722 markings/sec, 205 secs
lola: 105728513 markings, 163398579 edges, 512 markings/sec, 210 secs
lola: 106506387 markings, 164600763 edges, 155575 markings/sec, 215 secs
lola: 106506387 markings, 164600763 edges, 0 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((A (F ((1 <= p32))) AND ((1 <= p48) OR (1 <= p38) OR (1 <= p42))) U A (G (((1 <= p41) AND (1 <= p42) AND (1 <= p44))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((AF((1 <= p32)) AND ((1 <= p48) OR (1 <= p38) OR (1 <= p42))) U AG(((1 <= p41) AND (1 <= p42) AND (1 <= p44))))
lola: processed formula length: 115
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3081015 markings, 10923219 edges, 616203 markings/sec, 0 secs
lola: 6048144 markings, 21442730 edges, 593426 markings/sec, 5 secs
lola: 8964389 markings, 31781787 edges, 583249 markings/sec, 10 secs
lola: 11822998 markings, 41916545 edges, 571722 markings/sec, 15 secs
lola: 14613259 markings, 51808971 edges, 558052 markings/sec, 20 secs
lola: 17403044 markings, 61699722 edges, 557957 markings/sec, 25 secs
lola: 20360151 markings, 72183654 edges, 591421 markings/sec, 30 secs
lola: 23076963 markings, 81815679 edges, 543362 markings/sec, 35 secs
lola: 25819133 markings, 91537606 edges, 548434 markings/sec, 40 secs
lola: 28525771 markings, 101133561 edges, 541328 markings/sec, 45 secs
lola: 31332382 markings, 111083959 edges, 561322 markings/sec, 50 secs
lola: 34148471 markings, 121067962 edges, 563218 markings/sec, 55 secs
lola: 37012455 markings, 131221782 edges, 572797 markings/sec, 60 secs
lola: 39779910 markings, 141033349 edges, 553491 markings/sec, 65 secs
lola: 42551279 markings, 150858797 edges, 554274 markings/sec, 70 secs
lola: 45210853 markings, 160287894 edges, 531915 markings/sec, 75 secs
lola: 47854941 markings, 169662084 edges, 528818 markings/sec, 80 secs
lola: 50432485 markings, 178800344 edges, 515509 markings/sec, 85 secs
lola: 53106567 markings, 188280910 edges, 534816 markings/sec, 90 secs
lola: 55676539 markings, 197392333 edges, 513994 markings/sec, 95 secs
lola: 58277913 markings, 206615080 edges, 520275 markings/sec, 100 secs
lola: 60799356 markings, 215554471 edges, 504289 markings/sec, 105 secs
lola: 63417130 markings, 224835367 edges, 523555 markings/sec, 110 secs
lola: 66027574 markings, 234090280 edges, 522089 markings/sec, 115 secs
lola: 68938625 markings, 244410955 edges, 582210 markings/sec, 120 secs
lola: 71721562 markings, 254277420 edges, 556587 markings/sec, 125 secs
lola: 74501397 markings, 264132881 edges, 555967 markings/sec, 130 secs
lola: 77204028 markings, 273714628 edges, 540526 markings/sec, 135 secs
lola: 79951719 markings, 283456136 edges, 549538 markings/sec, 140 secs
lola: 82583872 markings, 292788014 edges, 526431 markings/sec, 145 secs
lola: 85398628 markings, 302767279 edges, 562951 markings/sec, 150 secs
lola: 88083243 markings, 312286165 edges, 536923 markings/sec, 155 secs
lola: 89902009 markings, 318763714 edges, 363753 markings/sec, 160 secs
lola: 92324001 markings, 327320098 edges, 484398 markings/sec, 165 secs
lola: 94902968 markings, 336463414 edges, 515793 markings/sec, 170 secs
lola: 95082062 markings, 337098372 edges, 35819 markings/sec, 175 secs
lola: 95125691 markings, 337253017 edges, 8726 markings/sec, 180 secs
lola: 97630758 markings, 346134358 edges, 501013 markings/sec, 185 secs
lola: 99067207 markings, 351227062 edges, 287290 markings/sec, 190 secs
lola: 100038328 markings, 354670018 edges, 194224 markings/sec, 195 secs
lola: 102311131 markings, 362727877 edges, 454561 markings/sec, 200 secs
lola: 102734325 markings, 364228250 edges, 84639 markings/sec, 205 secs
lola: 102743199 markings, 364259705 edges, 1775 markings/sec, 210 secs
lola: 104726997 markings, 371292935 edges, 396760 markings/sec, 215 secs
lola: 104726997 markings, 371292935 edges, 0 markings/sec, 220 secs
lola: 106144634 markings, 376318942 edges, 283527 markings/sec, 225 secs
lola: 107310426 markings, 380452095 edges, 233158 markings/sec, 230 secs
lola: 107954364 markings, 382735052 edges, 128788 markings/sec, 235 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 362 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((A (G ((1 <= p7))) OR A (F ((1 <= p42)))) U ((5 <= p4) AND (1 <= p26) AND (1 <= p27) AND (1 <= p29) AND (1 <= p37) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((AG((1 <= p7)) OR AF((1 <= p42))) U ((5 <= p4) AND (1 <= p26) AND (1 <= p27) AND (1 <= p29) AND (1 <= p37) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9)))
lola: processed formula length: 152
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 5458926 markings, 8436501 edges, 1091785 markings/sec, 0 secs
lola: 10904848 markings, 16852930 edges, 1089184 markings/sec, 5 secs
lola: 16290035 markings, 25175480 edges, 1077037 markings/sec, 10 secs
lola: 21583460 markings, 33356227 edges, 1058685 markings/sec, 15 secs
lola: 26765313 markings, 41364546 edges, 1036371 markings/sec, 20 secs
lola: 32089433 markings, 49592732 edges, 1064824 markings/sec, 25 secs
lola: 37377681 markings, 57765481 edges, 1057650 markings/sec, 30 secs
lola: 42622622 markings, 65871300 edges, 1048988 markings/sec, 35 secs
lola: 47699224 markings, 73716963 edges, 1015320 markings/sec, 40 secs
lola: 52817487 markings, 81627004 edges, 1023653 markings/sec, 45 secs
lola: 57941596 markings, 89546081 edges, 1024822 markings/sec, 50 secs
lola: 62941234 markings, 97272791 edges, 999928 markings/sec, 55 secs
lola: 67832040 markings, 104831315 edges, 978161 markings/sec, 60 secs
lola: 72914604 markings, 112686187 edges, 1016513 markings/sec, 65 secs
lola: 78240314 markings, 120916832 edges, 1065142 markings/sec, 70 secs
lola: 83316806 markings, 128762314 edges, 1015298 markings/sec, 75 secs
lola: 88268829 markings, 136416331 edges, 990405 markings/sec, 80 secs
lola: 89245953 markings, 137925539 edges, 195425 markings/sec, 85 secs
lola: 93744712 markings, 144878946 edges, 899752 markings/sec, 90 secs
lola: 93917167 markings, 145144687 edges, 34491 markings/sec, 95 secs
lola: 93917167 markings, 145144687 edges, 0 markings/sec, 100 secs
lola: 93917167 markings, 145144687 edges, 0 markings/sec, 105 secs
lola: 93917167 markings, 145144687 edges, 0 markings/sec, 110 secs
lola: 96851904 markings, 149681211 edges, 586947 markings/sec, 115 secs
lola: 98547713 markings, 152300986 edges, 339162 markings/sec, 120 secs
lola: 102579665 markings, 158532749 edges, 806390 markings/sec, 125 secs
lola: 104235530 markings, 161091247 edges, 331173 markings/sec, 130 secs
lola: 104439993 markings, 161407234 edges, 40893 markings/sec, 135 secs
lola: 104439993 markings, 161407234 edges, 0 markings/sec, 140 secs
lola: 107386308 markings, 165960631 edges, 589263 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 401 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p31 <= 0) OR (p32 <= 0) OR (p34 <= 0)))) OR ((1 <= p0) AND (1 <= p51) AND (1 <= p52)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 401 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p0) AND (1 <= p51) AND (1 <= p52))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p0) AND (1 <= p51) AND (1 <= p52))
lola: processed formula length: 41
lola: 15 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 13 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p31 <= 0) OR (p32 <= 0) OR (p34 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p31 <= 0) OR (p32 <= 0) OR (p34 <= 0))))
lola: processed formula length: 50
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p31) AND (1 <= p32) AND (1 <= p34))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((5 <= p4) U ((1 <= p16) AND (1 <= p17) AND (1 <= p19) AND (1 <= p35) AND (1 <= p22)))) OR A (G ((p35 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p35 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p35 <= 0)))
lola: processed formula length: 18
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p35)
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-13-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 14 will run for 803 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((5 <= p4) U ((1 <= p16) AND (1 <= p17) AND (1 <= p19) AND (1 <= p35) AND (1 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((5 <= p4) U ((1 <= p16) AND (1 <= p17) AND (1 <= p19) AND (1 <= p35) AND (1 <= p22))))
lola: processed formula length: 90
lola: 20 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 1
lola: SUBRESULT
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: result: no
lola: produced by: state space /ER
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: Predicate Phi does not hild until Predicate Psi on all paths.
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 803 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((3 <= p3) AND (1 <= p10)))) OR (E (F (A (G (((1 <= p41) AND (1 <= p42) AND (1 <= p44)))))) OR A (G ((1 <= p30)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 803 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p3) AND (1 <= p10))))
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 (((3 <= p3) AND (1 <= p10))))
lola: processed formula length: 34
lola: 16 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: ((3 <= p3) AND (1 <= p10))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 1606 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0) OR (p43 <= 0) OR (p40 <= 0) OR (p32 <= 0) OR ((2 <= p1) AND (2 <= p2) AND (p22 <= 0) AND (p52 <= 0))) AND ((A (G ((((1 <= p41) AND (1 <= p42) AND (1 <= p44)) OR (1 <= p27)))) OR ((p18 <= 0) AND (1 <= p0) AND (1 <= p51) AND (1 <= p52) AND ((p36 <= 0) OR (p37 <= 0) OR (p39 <= 0)))) AND (E (G ((1 <= p52))) OR ((1 <= p41) AND (1 <= p42) AND (1 <= p44))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 1606 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0) OR (p43 <= 0) OR (p40 <= 0) OR (p32 <= 0) OR ((2 <= p1) AND (2 <= p2) AND (p22 <= 0) AND (p52 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0) OR (p43 <= 0) OR (p40 <= 0) OR (p32 <= 0) OR ((2 <= p1) AND (2 <= p2) AND (p22 <= 0) AND (p52 <= 0)))
lola: processed formula length: 147
lola: 15 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 10 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p52)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((1 <= p52)))
lola: processed formula length: 18
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p52 <= 0)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is possibly preserved.
lola: 16 markings, 16 edges
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p18 <= 0) AND (1 <= p0) AND (1 <= p51) AND (1 <= p52) AND ((p36 <= 0) OR (p37 <= 0) OR (p39 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p18 <= 0) AND (1 <= p0) AND (1 <= p51) AND (1 <= p52) AND ((p36 <= 0) OR (p37 <= 0) OR (p39 <= 0)))
lola: processed formula length: 103
lola: 15 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 7 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 19 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p41) AND (1 <= p42) AND (1 <= p44)) OR (1 <= p27))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((1 <= p41) AND (1 <= p42) AND (1 <= p44)) OR (1 <= p27))))
lola: processed formula length: 67
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: formula 0: (((p41 <= 0) OR (p42 <= 0) OR (p44 <= 0)) AND (p27 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E ((E (F (((1 <= p36) AND (1 <= p37) AND (1 <= p39)))) U ((1 <= p11) AND (1 <= p12) AND (1 <= p14)))) AND E (X ((1 <= p27))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: (E(EF(((1 <= p36) AND (1 <= p37) AND (1 <= p39))) U ((1 <= p11) AND (1 <= p12) AND (1 <= p14))) AND EX((1 <= p27)))
lola: processed formula length: 115
lola: 18 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: 5418168 markings, 8373520 edges, 1083634 markings/sec, 0 secs
lola: 10891863 markings, 16832857 edges, 1094739 markings/sec, 5 secs
lola: 16195871 markings, 25029957 edges, 1060802 markings/sec, 10 secs
lola: 21581773 markings, 33353618 edges, 1077180 markings/sec, 15 secs
lola: 26978880 markings, 41694606 edges, 1079421 markings/sec, 20 secs
lola: 32217544 markings, 49790721 edges, 1047733 markings/sec, 25 secs
lola: 37734169 markings, 58316418 edges, 1103325 markings/sec, 30 secs
lola: 43297989 markings, 66915056 edges, 1112764 markings/sec, 35 secs
lola: 48676090 markings, 75226660 edges, 1075620 markings/sec, 40 secs
lola: 53778670 markings, 83112472 edges, 1020516 markings/sec, 45 secs
lola: 58980481 markings, 91151635 edges, 1040362 markings/sec, 50 secs
lola: 64271565 markings, 99328767 edges, 1058217 markings/sec, 55 secs
lola: 69578899 markings, 107531002 edges, 1061467 markings/sec, 60 secs
lola: 74903939 markings, 115760608 edges, 1065008 markings/sec, 65 secs
lola: 80390808 markings, 124240316 edges, 1097374 markings/sec, 70 secs
lola: 85774971 markings, 132561297 edges, 1076833 markings/sec, 75 secs
lola: 87714417 markings, 135560075 edges, 387889 markings/sec, 80 secs
lola: 91717505 markings, 141745202 edges, 800618 markings/sec, 85 secs
lola: 94084089 markings, 145409850 edges, 473317 markings/sec, 90 secs
lola: 98365374 markings, 152020058 edges, 856257 markings/sec, 95 secs
lola: 102821290 markings, 158905597 edges, 891183 markings/sec, 100 secs
lola: 107311223 markings, 165844590 edges, 897987 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (F ((E (X ((1 <= p10))) AND ((p18 <= 0) AND (1 <= p38))))) OR A ((((1 <= p46) AND (1 <= p47) AND (1 <= p49) AND (1 <= p48) AND (p42 <= 0)) U E (X ((1 <= p30))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: (EF((EX((1 <= p10)) AND ((p18 <= 0) AND (1 <= p38)))) OR A(((1 <= p46) AND (1 <= p47) AND (1 <= p49) AND (1 <= p48) AND (p42 <= 0)) U EX((1 <= p30))))
lola: processed formula length: 150
lola: 19 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: 2752105 markings, 4253231 edges, 550421 markings/sec, 0 secs
lola: 5414227 markings, 8367417 edges, 532424 markings/sec, 5 secs
lola: 8121729 markings, 12551740 edges, 541500 markings/sec, 10 secs
lola: 10794193 markings, 16681915 edges, 534493 markings/sec, 15 secs
lola: 13448610 markings, 20784191 edges, 530883 markings/sec, 20 secs
lola: 16183775 markings, 25011264 edges, 547033 markings/sec, 25 secs
lola: 18892958 markings, 29198182 edges, 541837 markings/sec, 30 secs
lola: 21725897 markings, 33576358 edges, 566588 markings/sec, 35 secs
lola: 24466020 markings, 37811098 edges, 548025 markings/sec, 40 secs
lola: 27123225 markings, 41917686 edges, 531441 markings/sec, 45 secs
lola: 29794613 markings, 46046196 edges, 534278 markings/sec, 50 secs
lola: 32613490 markings, 50402632 edges, 563775 markings/sec, 55 secs
lola: 35439077 markings, 54769455 edges, 565117 markings/sec, 60 secs
lola: 38224352 markings, 59073967 edges, 557055 markings/sec, 65 secs
lola: 40863455 markings, 63152594 edges, 527821 markings/sec, 70 secs
lola: 43454656 markings, 67157167 edges, 518240 markings/sec, 75 secs
lola: 46142567 markings, 71311211 edges, 537582 markings/sec, 80 secs
lola: 48850198 markings, 75495741 edges, 541526 markings/sec, 85 secs
lola: 51478381 markings, 79557464 edges, 525637 markings/sec, 90 secs
lola: 54026620 markings, 83495660 edges, 509648 markings/sec, 95 secs
lola: 56504937 markings, 87325779 edges, 495663 markings/sec, 100 secs
lola: 58998890 markings, 91180076 edges, 498791 markings/sec, 105 secs
lola: 61573800 markings, 95159702 edges, 514982 markings/sec, 110 secs
lola: 62390404 markings, 96422585 edges, 163321 markings/sec, 115 secs
lola: 63287060 markings, 97807618 edges, 179331 markings/sec, 120 secs
lola: 65552574 markings, 101308503 edges, 453103 markings/sec, 125 secs
lola: 65640392 markings, 101444227 edges, 17564 markings/sec, 130 secs
lola: 65640392 markings, 101444227 edges, 0 markings/sec, 135 secs
lola: 65654537 markings, 101466086 edges, 2829 markings/sec, 140 secs
lola: 67727227 markings, 104669336 edges, 414538 markings/sec, 145 secs
lola: 67839984 markings, 104843585 edges, 22551 markings/sec, 150 secs
lola: 67839984 markings, 104843585 edges, 0 markings/sec, 155 secs
lola: 69537216 markings, 107466582 edges, 339446 markings/sec, 160 secs
lola: 69654149 markings, 107647295 edges, 23387 markings/sec, 165 secs
lola: 69654149 markings, 107647295 edges, 0 markings/sec, 170 secs
lola: 69674248 markings, 107678361 edges, 4020 markings/sec, 175 secs
lola: 70334292 markings, 108698426 edges, 132009 markings/sec, 180 secs
lola: 70345473 markings, 108715707 edges, 2236 markings/sec, 185 secs
lola: 72497053 markings, 112040883 edges, 430316 markings/sec, 190 secs
lola: 72572034 markings, 112156762 edges, 14996 markings/sec, 195 secs
lola: 72572034 markings, 112156762 edges, 0 markings/sec, 200 secs
lola: 74843677 markings, 115667476 edges, 454329 markings/sec, 205 secs
lola: 75072704 markings, 116021428 edges, 45805 markings/sec, 210 secs
lola: 75539452 markings, 116742762 edges, 93350 markings/sec, 215 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (G (E (((p23 <= 0) U ((1 <= p48) AND (1 <= p21) AND (1 <= p22) AND (1 <= p24))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(E((p23 <= 0) U ((1 <= p48) AND (1 <= p21) AND (1 <= p22) AND (1 <= p24))))
lola: processed formula length: 77
lola: 17 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: 5325136 markings, 8229735 edges, 1065027 markings/sec, 0 secs
lola: 10677790 markings, 16502010 edges, 1070531 markings/sec, 5 secs
lola: 15924870 markings, 24611144 edges, 1049416 markings/sec, 10 secs
lola: 21161188 markings, 32703626 edges, 1047264 markings/sec, 15 secs
lola: 26341277 markings, 40709222 edges, 1036018 markings/sec, 20 secs
lola: 31556229 markings, 48768687 edges, 1042990 markings/sec, 25 secs
lola: 36859105 markings, 56964045 edges, 1060575 markings/sec, 30 secs
lola: 42143629 markings, 65131038 edges, 1056905 markings/sec, 35 secs
lola: 47313456 markings, 73120768 edges, 1033965 markings/sec, 40 secs
lola: 52355020 markings, 80912272 edges, 1008313 markings/sec, 45 secs
lola: 57437318 markings, 88766732 edges, 1016460 markings/sec, 50 secs
lola: 62403230 markings, 96441316 edges, 993182 markings/sec, 55 secs
lola: 67369685 markings, 104116745 edges, 993291 markings/sec, 60 secs
lola: 72383515 markings, 111865396 edges, 1002766 markings/sec, 65 secs
lola: 77676576 markings, 120045593 edges, 1058612 markings/sec, 70 secs
lola: 82898266 markings, 128115468 edges, 1044338 markings/sec, 75 secs
lola: 87295920 markings, 134913835 edges, 879531 markings/sec, 80 secs
lola: 88185266 markings, 136288456 edges, 177869 markings/sec, 85 secs
lola: 92417892 markings, 142827959 edges, 846525 markings/sec, 90 secs
lola: 92565535 markings, 143055800 edges, 29529 markings/sec, 95 secs
lola: 92565535 markings, 143055800 edges, 0 markings/sec, 100 secs
lola: 92565535 markings, 143055800 edges, 0 markings/sec, 105 secs
lola: 92565535 markings, 143055800 edges, 0 markings/sec, 110 secs
lola: 92565535 markings, 143055800 edges, 0 markings/sec, 115 secs
lola: 92565535 markings, 143055800 edges, 0 markings/sec, 120 secs
lola: 92565535 markings, 143055800 edges, 0 markings/sec, 125 secs
lola: 93623652 markings, 144691062 edges, 211623 markings/sec, 130 secs
lola: 97059318 markings, 150005366 edges, 687133 markings/sec, 135 secs
lola: 97195483 markings, 150211154 edges, 27233 markings/sec, 140 secs
lola: 97195483 markings, 150211154 edges, 0 markings/sec, 145 secs
lola: 97195483 markings, 150211154 edges, 0 markings/sec, 150 secs
lola: 97195483 markings, 150211154 edges, 0 markings/sec, 155 secs
lola: 97455369 markings, 150612804 edges, 51977 markings/sec, 160 secs
lola: 101123904 markings, 156282349 edges, 733707 markings/sec, 165 secs
lola: 101468636 markings, 156815121 edges, 68946 markings/sec, 170 secs
lola: 101483887 markings, 156838694 edges, 3050 markings/sec, 175 secs
lola: 102121583 markings, 157824260 edges, 127539 markings/sec, 180 secs
lola: 104933541 markings, 162169966 edges, 562392 markings/sec, 185 secs
lola: 108377206 markings, 167492000 edges, 688733 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E ((A (F ((p25 <= 0))) U ((1 <= p10) AND (1 <= p52) AND (p12 <= 0) AND (p40 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AF((p25 <= 0)) U ((1 <= p10) AND (1 <= p52) AND (p12 <= 0) AND (p40 <= 0)))
lola: processed formula length: 77
lola: 17 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: 3872500 markings, 9857248 edges, 774500 markings/sec, 0 secs
lola: 7622092 markings, 19401664 edges, 749918 markings/sec, 5 secs
lola: 11340816 markings, 28867511 edges, 743745 markings/sec, 10 secs
lola: 14891855 markings, 37906525 edges, 710208 markings/sec, 15 secs
lola: 18356954 markings, 46726770 edges, 693020 markings/sec, 20 secs
lola: 22082492 markings, 56209949 edges, 745108 markings/sec, 25 secs
lola: 25701959 markings, 65423145 edges, 723893 markings/sec, 30 secs
lola: 29260902 markings, 74482268 edges, 711789 markings/sec, 35 secs
lola: 32884637 markings, 83706326 edges, 724747 markings/sec, 40 secs
lola: 36499362 markings, 92907448 edges, 722945 markings/sec, 45 secs
lola: 40149125 markings, 102197747 edges, 729953 markings/sec, 50 secs
lola: 43652845 markings, 111116303 edges, 700744 markings/sec, 55 secs
lola: 47101152 markings, 119893817 edges, 689661 markings/sec, 60 secs
lola: 50522080 markings, 128601629 edges, 684186 markings/sec, 65 secs
lola: 53874182 markings, 137134261 edges, 670420 markings/sec, 70 secs
lola: 57332464 markings, 145937155 edges, 691656 markings/sec, 75 secs
lola: 60685361 markings, 154471808 edges, 670579 markings/sec, 80 secs
lola: 64048896 markings, 163033534 edges, 672707 markings/sec, 85 secs
lola: 67354081 markings, 171446735 edges, 661037 markings/sec, 90 secs
lola: 70696932 markings, 179955802 edges, 668570 markings/sec, 95 secs
lola: 74225728 markings, 188938194 edges, 705759 markings/sec, 100 secs
lola: 77759836 markings, 197934113 edges, 706822 markings/sec, 105 secs
lola: 81305301 markings, 206958923 edges, 709093 markings/sec, 110 secs
lola: 84678865 markings, 215546187 edges, 674713 markings/sec, 115 secs
lola: 88009849 markings, 224025672 edges, 666197 markings/sec, 120 secs
lola: 90165642 markings, 229513176 edges, 431159 markings/sec, 125 secs
lola: 93347842 markings, 237613914 edges, 636440 markings/sec, 130 secs
lola: 93460209 markings, 237898682 edges, 22473 markings/sec, 135 secs
lola: 93460209 markings, 237898682 edges, 0 markings/sec, 140 secs
lola: 94933219 markings, 241648177 edges, 294602 markings/sec, 145 secs
lola: 96366364 markings, 245296170 edges, 286629 markings/sec, 150 secs
lola: 99483780 markings, 253231412 edges, 623483 markings/sec, 155 secs
lola: 99659756 markings, 253679354 edges, 35195 markings/sec, 160 secs
lola: 99659756 markings, 253679354 edges, 0 markings/sec, 165 secs
lola: 99676094 markings, 253720928 edges, 3268 markings/sec, 170 secs
lola: 102506330 markings, 260925181 edges, 566047 markings/sec, 175 secs
lola: 102688519 markings, 261388932 edges, 36438 markings/sec, 180 secs
lola: 102776929 markings, 261613974 edges, 17682 markings/sec, 185 secs
lola: 105881212 markings, 269515793 edges, 620857 markings/sec, 190 secs
lola: 105881212 markings, 269515793 edges, 0 markings/sec, 195 secs
lola: 105881212 markings, 269515793 edges, 0 markings/sec, 200 secs
lola: 105881212 markings, 269515793 edges, 0 markings/sec, 205 secs
lola: 105908659 markings, 269585648 edges, 5489 markings/sec, 210 secs
lola: 106875375 markings, 272046385 edges, 193343 markings/sec, 215 secs
lola: 108045440 markings, 275024735 edges, 234013 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p8) OR (E (F ((1 <= p43))) OR ((2 <= p1) AND (2 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p14) AND ((1 <= p7) OR (1 <= p23)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(((1 <= p8) OR (EF((1 <= p43)) OR ((2 <= p1) AND (2 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p14) AND ((1 <= p7) OR (1 <= p23))))))
lola: processed formula length: 140
lola: 17 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: 3606323 markings, 9643016 edges, 721265 markings/sec, 0 secs
lola: 7000920 markings, 18719825 edges, 678919 markings/sec, 5 secs
lola: 10362132 markings, 27707639 edges, 672242 markings/sec, 10 secs
lola: 13753988 markings, 36777019 edges, 678371 markings/sec, 15 secs
lola: 16948944 markings, 45320342 edges, 638991 markings/sec, 20 secs
lola: 20283285 markings, 54235980 edges, 666868 markings/sec, 25 secs
lola: 23684546 markings, 63330869 edges, 680252 markings/sec, 30 secs
lola: 27135647 markings, 72558590 edges, 690220 markings/sec, 35 secs
lola: 30467419 markings, 81467481 edges, 666354 markings/sec, 40 secs
lola: 33903244 markings, 90654527 edges, 687165 markings/sec, 45 secs
lola: 37261265 markings, 99633805 edges, 671604 markings/sec, 50 secs
lola: 40577917 markings, 108502430 edges, 663330 markings/sec, 55 secs
lola: 43932817 markings, 117473116 edges, 670980 markings/sec, 60 secs
lola: 47236608 markings, 126307186 edges, 660758 markings/sec, 65 secs
lola: 50572530 markings, 135227318 edges, 667184 markings/sec, 70 secs
lola: 53770927 markings, 143779395 edges, 639679 markings/sec, 75 secs
lola: 57103488 markings, 152690237 edges, 666512 markings/sec, 80 secs
lola: 60288795 markings, 161207724 edges, 637061 markings/sec, 85 secs
lola: 63519885 markings, 169847446 edges, 646218 markings/sec, 90 secs
lola: 66646545 markings, 178208045 edges, 625332 markings/sec, 95 secs
lola: 69865543 markings, 186815214 edges, 643800 markings/sec, 100 secs
lola: 73117366 markings, 195510397 edges, 650365 markings/sec, 105 secs
lola: 76554001 markings, 204699916 edges, 687327 markings/sec, 110 secs
lola: 79852611 markings, 213520004 edges, 659722 markings/sec, 115 secs
lola: 83168297 markings, 222385734 edges, 663137 markings/sec, 120 secs
lola: 86516404 markings, 231338420 edges, 669621 markings/sec, 125 secs
lola: 89433145 markings, 239137586 edges, 583348 markings/sec, 130 secs
lola: 92485428 markings, 247299626 edges, 610457 markings/sec, 135 secs
lola: 93913090 markings, 251116503 edges, 285532 markings/sec, 140 secs
lola: 93913090 markings, 251116503 edges, 0 markings/sec, 145 secs
lola: 93913090 markings, 251116503 edges, 0 markings/sec, 150 secs
lola: 93913090 markings, 251116503 edges, 0 markings/sec, 155 secs
lola: 95643120 markings, 255742667 edges, 346006 markings/sec, 160 secs
lola: 97904979 markings, 261790402 edges, 452372 markings/sec, 165 secs
lola: 98015618 markings, 262086564 edges, 22128 markings/sec, 170 secs
lola: 98015618 markings, 262086564 edges, 0 markings/sec, 175 secs
lola: 99721390 markings, 266647628 edges, 341154 markings/sec, 180 secs
lola: 100458147 markings, 268617591 edges, 147351 markings/sec, 185 secs
lola: 101250290 markings, 270735625 edges, 158429 markings/sec, 190 secs
lola: 103330017 markings, 276296758 edges, 415945 markings/sec, 195 secs
lola: 104416130 markings, 279201063 edges, 217223 markings/sec, 200 secs
lola: 104416130 markings, 279201063 edges, 0 markings/sec, 205 secs
lola: 104416130 markings, 279201063 edges, 0 markings/sec, 210 secs
lola: 106691107 markings, 285284276 edges, 454995 markings/sec, 215 secs
lola: 107462933 markings, 287347941 edges, 154365 markings/sec, 220 secs
lola: 107462933 markings, 287347941 edges, 0 markings/sec, 225 secs
lola: 107481455 markings, 287397309 edges, 3704 markings/sec, 230 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (F ((E (F (((1 <= p35) AND (1 <= p0) AND (1 <= p51) AND (1 <= p52)))) OR A (((1 <= p50) U (3 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EF(((1 <= p35) AND (1 <= p0) AND (1 <= p51) AND (1 <= p52))) OR A((1 <= p50) U (3 <= p3))))
lola: processed formula length: 95
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 5345350 markings, 8260978 edges, 1069070 markings/sec, 0 secs
lola: 10777882 markings, 16656703 edges, 1086506 markings/sec, 5 secs
lola: 15809736 markings, 24433209 edges, 1006371 markings/sec, 10 secs
lola: 20884182 markings, 32275528 edges, 1014889 markings/sec, 15 secs
lola: 26065025 markings, 40282281 edges, 1036169 markings/sec, 20 secs
lola: 31260029 markings, 48310933 edges, 1039001 markings/sec, 25 secs
lola: 36698438 markings, 56715746 edges, 1087682 markings/sec, 30 secs
lola: 42206502 markings, 65228205 edges, 1101613 markings/sec, 35 secs
lola: 47243240 markings, 73012265 edges, 1007348 markings/sec, 40 secs
lola: 52410613 markings, 80998196 edges, 1033475 markings/sec, 45 secs
lola: 57503520 markings, 88869054 edges, 1018581 markings/sec, 50 secs
lola: 62385065 markings, 96413256 edges, 976309 markings/sec, 55 secs
lola: 67300712 markings, 104010172 edges, 983129 markings/sec, 60 secs
lola: 72142374 markings, 111492740 edges, 968332 markings/sec, 65 secs
lola: 77405678 markings, 119626930 edges, 1052661 markings/sec, 70 secs
lola: 82540916 markings, 127563210 edges, 1027048 markings/sec, 75 secs
lola: 87373829 markings, 135042098 edges, 966583 markings/sec, 80 secs
lola: 89149799 markings, 137777227 edges, 355194 markings/sec, 85 secs
lola: 93208050 markings, 144049608 edges, 811650 markings/sec, 90 secs
lola: 96374139 markings, 148941830 edges, 633218 markings/sec, 95 secs
lola: 100632937 markings, 155523609 edges, 851760 markings/sec, 100 secs
lola: 100749057 markings, 155703063 edges, 23224 markings/sec, 105 secs
lola: 101625307 markings, 157057266 edges, 175250 markings/sec, 110 secs
lola: 104437390 markings, 161403214 edges, 562417 markings/sec, 115 secs
lola: 107041728 markings, 165428107 edges, 520868 markings/sec, 120 secs
lola: 107199873 markings, 165672501 edges, 31629 markings/sec, 125 secs
lola: 107199873 markings, 165672501 edges, 0 markings/sec, 130 secs
lola: 107199873 markings, 165672501 edges, 0 markings/sec, 135 secs
lola: 107199873 markings, 165672501 edges, 0 markings/sec, 140 secs
lola: 108297738 markings, 167369523 edges, 219573 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (((A (F ((1 <= p32))) AND ((1 <= p48) OR (1 <= p38) OR (1 <= p42))) U A (G (((1 <= p41) AND (1 <= p42) AND (1 <= p44))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((AF((1 <= p32)) AND ((1 <= p48) OR (1 <= p38) OR (1 <= p42))) U AG(((1 <= p41) AND (1 <= p42) AND (1 <= p44))))
lola: processed formula length: 115
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3004038 markings, 10650305 edges, 600808 markings/sec, 0 secs
lola: 5876286 markings, 20833426 edges, 574450 markings/sec, 5 secs
lola: 8783077 markings, 31138997 edges, 581358 markings/sec, 10 secs
lola: 11645788 markings, 41288295 edges, 572542 markings/sec, 15 secs
lola: 14604193 markings, 51776831 edges, 591681 markings/sec, 20 secs
lola: 17474351 markings, 61952528 edges, 574032 markings/sec, 25 secs
lola: 20498043 markings, 72672537 edges, 604738 markings/sec, 30 secs
lola: 23449519 markings, 83136535 edges, 590295 markings/sec, 35 secs
lola: 26263093 markings, 93111598 edges, 562715 markings/sec, 40 secs
lola: 29173416 markings, 103429700 edges, 582065 markings/sec, 45 secs
lola: 32127973 markings, 113904627 edges, 590911 markings/sec, 50 secs
lola: 35133632 markings, 124560699 edges, 601132 markings/sec, 55 secs
lola: 38026963 markings, 134818557 edges, 578666 markings/sec, 60 secs
lola: 40947158 markings, 145171627 edges, 584039 markings/sec, 65 secs
lola: 43762722 markings, 155153779 edges, 563113 markings/sec, 70 secs
lola: 46606236 markings, 165235005 edges, 568703 markings/sec, 75 secs
lola: 49321634 markings, 174862027 edges, 543080 markings/sec, 80 secs
lola: 52053935 markings, 184548958 edges, 546460 markings/sec, 85 secs
lola: 54780930 markings, 194217086 edges, 545399 markings/sec, 90 secs
lola: 57618266 markings, 204276415 edges, 567467 markings/sec, 95 secs
lola: 60351523 markings, 213966747 edges, 546651 markings/sec, 100 secs
lola: 63170846 markings, 223962184 edges, 563865 markings/sec, 105 secs
lola: 65728803 markings, 233031047 edges, 511591 markings/sec, 110 secs
lola: 68691924 markings, 243536299 edges, 592624 markings/sec, 115 secs
lola: 71550417 markings, 253670643 edges, 571699 markings/sec, 120 secs
lola: 74354428 markings, 263611820 edges, 560802 markings/sec, 125 secs
lola: 77092218 markings, 273318228 edges, 547558 markings/sec, 130 secs
lola: 79926641 markings, 283367220 edges, 566885 markings/sec, 135 secs
lola: 82573587 markings, 292751548 edges, 529389 markings/sec, 140 secs
lola: 85379992 markings, 302701214 edges, 561281 markings/sec, 145 secs
lola: time limit reached - aborting
lola: 88134612 markings, 312468105 edges, 550924 markings/sec, 150 secs
lola:
preliminary result: unknown unknown no no unknown unknown yes unknown yes yes no no unknown no unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown no no unknown unknown yes unknown yes yes no no unknown no unknown unknown
lola:
preliminary result: unknown unknown no no unknown unknown yes unknown yes yes no no unknown no unknown unknown
lola: memory consumption: 896 KB
lola: time consumption: 3571 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-010011"
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-010011, 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-158987938400060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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