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.r184-oct2-158987928700516.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 Kanban-PT-00100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928700516
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 2.9K Apr 8 12:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 8 12:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 7 16:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 7 16:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 6 19:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 6 19:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 6 02:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 6 02:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 14K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Kanban-PT-00100-CTLFireability-00
FORMULA_NAME Kanban-PT-00100-CTLFireability-01
FORMULA_NAME Kanban-PT-00100-CTLFireability-02
FORMULA_NAME Kanban-PT-00100-CTLFireability-03
FORMULA_NAME Kanban-PT-00100-CTLFireability-04
FORMULA_NAME Kanban-PT-00100-CTLFireability-05
FORMULA_NAME Kanban-PT-00100-CTLFireability-06
FORMULA_NAME Kanban-PT-00100-CTLFireability-07
FORMULA_NAME Kanban-PT-00100-CTLFireability-08
FORMULA_NAME Kanban-PT-00100-CTLFireability-09
FORMULA_NAME Kanban-PT-00100-CTLFireability-10
FORMULA_NAME Kanban-PT-00100-CTLFireability-11
FORMULA_NAME Kanban-PT-00100-CTLFireability-12
FORMULA_NAME Kanban-PT-00100-CTLFireability-13
FORMULA_NAME Kanban-PT-00100-CTLFireability-14
FORMULA_NAME Kanban-PT-00100-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591212236530

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 19:23:59] [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 19:23:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 19:23:59] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2020-06-03 19:23:59] [INFO ] Transformed 16 places.
[2020-06-03 19:23:59] [INFO ] Transformed 16 transitions.
[2020-06-03 19:23:59] [INFO ] Parsed PT model containing 16 places and 16 transitions in 52 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Finished random walk after 11509 steps, including 0 resets, run visited all 33 properties in 27 ms. (steps per millisecond=426 )
[2020-06-03 19:23:59] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 19:23:59] [INFO ] Flatten gal took : 28 ms
[2020-06-03 19:23:59] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 19:23:59] [INFO ] Flatten gal took : 12 ms
FORMULA Kanban-PT-00100-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00100-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00100-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00100-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00100-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 19:23:59] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 15 ms.
[2020-06-03 19:23:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Kanban-PT-00100 @ 3570 seconds

FORMULA Kanban-PT-00100-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00100-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00100-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00100-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00100-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00100-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00100-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00100-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00100-CTLFireability-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00100-CTLFireability-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00100-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1266
rslt: Output for CTLFireability @ Kanban-PT-00100

{
"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 19:24:00 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((1 <= p1) OR (1 <= p15) OR (1 <= p5) OR ((p1 <= 0) AND (1 <= p10)))",
"processed_size": 71,
"rewrites": 8
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 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": "((1 <= p12) OR (1 <= p5) OR ((p2 <= 0) AND (p8 <= 0)))",
"processed_size": 56,
"rewrites": 8
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"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 (G (((1 <= p4) OR (1 <= p8) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p13)) OR (1 <= p6))))",
"processed_size": 92,
"rewrites": 10
},
"result":
{
"edges": 100,
"markings": 101,
"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": 12,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (((p12 <= 0) U ((1 <= p4) AND (1 <= p15))))",
"processed_size": 45,
"rewrites": 11
},
"result":
{
"edges": 686800,
"markings": 176851,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2512
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (((p5 <= 0) U ((1 <= p11) AND (1 <= p6) AND ((1 <= p8) OR (1 <= p2)))))",
"processed_size": 74,
"rewrites": 11
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"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": "E (F (((1 <= p0) AND (1 <= p7) AND (1 <= p13) AND (1 <= p3) AND (1 <= p9) AND (1 <= p14))))",
"processed_size": 91,
"rewrites": 9
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 6
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((1 <= p12)))",
"processed_size": 18,
"rewrites": 9
},
"result":
{
"edges": 3,
"markings": 4,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"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": "E (F (((1 <= p0) AND (1 <= p7) AND (1 <= p13) AND (1 <= p3) AND (1 <= p9) AND (1 <= p14))))",
"processed_size": 91,
"rewrites": 9
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 6
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3996,
"runtime": 2304.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G(E(F(A(G(**)))))) : (E(F(**)) AND (A(G(A(F(**)))) OR (E(X(**)) AND **))) : (E(F(**)) OR **) : ((** AND (A(F(**)) AND (A(X(**)) OR E(F(**))))) OR (A(G(**)) AND **)) : A(G(E(F(**)))) : (** OR (E(F(**)) AND E(F(**)))) : (** AND A((** U A(X(**))))) : E(X(A(G(**)))) : (E((** U **)) AND (** OR (E(F(**)) OR (E(X(*)) AND **)))) : E(G(*)) : (** AND E((** U **)))"
},
"net":
{
"arcs": 40,
"conflict_clusters": 12,
"places": 16,
"places_significant": 11,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "unknown no yes no unknown yes no no no yes no ",
"value": "unknown no yes no unknown yes no no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 32/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 16 transitions, 11 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 (G (E (F (A (G ((1 <= p10))))))) : (E (F ((((p8 <= 0) OR (p2 <= 0))))) AND (A (G (A (F ((1 <= p4))))) OR (E (X ((p12 <= 0))) AND ((1 <= p1) OR (1 <= p15) OR (1 <= p5) OR ((p1 <= 0) AND (1 <= p10)))))) : (E (F (((p4 <= 0) AND ((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)) AND (p5 <= 0)))) OR (1 <= p1)) : (((((1 <= p3) AND (1 <= p9) AND (1 <= p14) AND (1 <= p15)) AND A (F ((((1 <= p5) AND (1 <= p15)) OR (p12 <= 0))))) AND (A (X ((1 <= p5))) OR E (F ((1 <= p5))))) OR (A (G (((1 <= p4) OR (1 <= p8) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p13)) OR (1 <= p6)))) AND ((1 <= p12) OR (1 <= p5) OR ((p2 <= 0) AND (p8 <= 0))))) : A (G (E (F ((1 <= p8))))) : ((1 <= p8) OR (E (F ((1 <= p12))) AND E (F (((1 <= p0) AND (1 <= p7) AND (1 <= p13) AND (1 <= p3) AND (1 <= p9) AND (1 <= p14)))))) : ((1 <= p4) AND A ((((1 <= p6) OR (1 <= p1) OR (1 <= p11)) U A (X ((1 <= p12)))))) : E (X (A (G ((p4 <= 0))))) : (E (((p12 <= 0) U ((1 <= p4) AND (1 <= p15)))) AND (((1 <= p4) OR E (F ((1 <= p1)))) OR (NOT(A (X ((1 <= p5)))) AND (((p12 <= 0) AND ((p0 <= 0) OR (p7 <= 0) OR (p13 <= 0))) OR ((p12 <= 0) AND (p15 <= 0)))))) : NOT(A (F (((1 <= p5) AND (1 <= p11))))) : ((1 <= p4) AND E (((p5 <= 0) U ((1 <= p11) AND (1 <= p6) AND ((1 <= p8) OR (1 <= p2))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:254
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((p8 <= 0) OR (p2 <= 0))))) AND (A (G (A (F ((1 <= p4))))) OR (E (X ((p12 <= 0))) AND ((1 <= p1) OR (1 <= p15) OR (1 <= p5) OR ((p1 <= 0) AND (1 <= p10))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1) OR (1 <= p15) OR (1 <= p5) OR ((p1 <= 0) AND (1 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1) OR (1 <= p15) OR (1 <= p5) OR ((p1 <= 0) AND (1 <= p10)))
lola: processed formula length: 71
lola: 8 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 5 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 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p8 <= 0) OR (p2 <= 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 ((((p8 <= 0) OR (p2 <= 0)))))
lola: processed formula length: 35
lola: 9 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: (((p8 <= 0) OR (p2 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p4 <= 0)
lola: processed formula length: 9
lola: 12 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result started, id 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: The predicate does not eventually occur from all states.
lola: 102 markings, 102 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p4 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p4)
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-2-1.sara
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p3) AND (1 <= p9) AND (1 <= p14) AND (1 <= p15)) AND (A (F ((((1 <= p5) AND (1 <= p15)) OR (p12 <= 0)))) AND (A (X ((1 <= p5))) OR E (F ((1 <= p5)))))) OR (A (G (((1 <= p4) OR (1 <= p8) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p13)) OR (1 <= p6)))) AND ((1 <= p12) OR (1 <= p5) OR ((p2 <= 0) AND (p8 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
sara: try reading problem file CTLFireability-2-1.sara.
sara: place or transition ordering is non-deterministic

lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((1 <= p5)))
lola: processed formula length: 17
lola: 9 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p5)
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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p12) OR (1 <= p5) OR ((p2 <= 0) AND (p8 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p12) OR (1 <= p5) OR ((p2 <= 0) AND (p8 <= 0)))
lola: processed formula length: 56
lola: 8 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p3) AND (1 <= p9) AND (1 <= p14) AND (1 <= p15))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p3) AND (1 <= p9) AND (1 <= p14) AND (1 <= p15))
lola: processed formula length: 55
lola: 8 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p4) OR (1 <= p8) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p13)) OR (1 <= p6))))
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 <= p4) OR (1 <= p8) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p13)) OR (1 <= p6))))
lola: processed formula length: 92
lola: 10 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: ((p4 <= 0) AND (p8 <= 0) AND ((p0 <= 0) OR (p7 <= 0) OR (p13 <= 0)) AND (p6 <= 0))
lola: SUBRESULT
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 101 markings, 100 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p4) AND A ((((1 <= p6) OR (1 <= p1) OR (1 <= p11)) U A (X ((1 <= p12))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: ((1 <= p4) AND A(((1 <= p6) OR (1 <= p1) OR (1 <= p11)) U AX((1 <= p12))))
lola: processed formula length: 76
lola: 10 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((p4 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG((p4 <= 0)))
lola: processed formula length: 17
lola: 10 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((p12 <= 0) U ((1 <= p4) AND (1 <= p15)))) AND ((1 <= p4) OR (E (F ((1 <= p1))) OR (E (X ((p5 <= 0))) AND (((p12 <= 0) AND ((p0 <= 0) OR (p7 <= 0) OR (p13 <= 0))) OR ((p12 <= 0) AND (p15 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((1 <= p1)))
lola: processed formula length: 17
lola: 9 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p1)
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-4-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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p12 <= 0) U ((1 <= p4) AND (1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((p12 <= 0) U ((1 <= p4) AND (1 <= p15))))
lola: processed formula length: 45
lola: 11 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p4) AND (1 <= p15))
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-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 176851 markings, 686800 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (1 <= p8)
lola: processed formula length: 9
lola: 11 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p8 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (1 <= p8)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: state equation: write sara problem file to CTLFireability-5-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2860530 markings, 6398341 edges, 572106 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 5489293 markings, 12700469 edges, 525753 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 8145569 markings, 19140196 edges, 531255 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 10756935 markings, 25509259 edges, 522273 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 13306579 markings, 31788880 edges, 509929 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 15804975 markings, 37959035 edges, 499679 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 18263085 markings, 44045224 edges, 491622 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 20718626 markings, 50134796 edges, 491108 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 23115875 markings, 56123351 edges, 479450 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 25466435 markings, 62012310 edges, 470112 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 27811356 markings, 67910093 edges, 468984 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 30185592 markings, 73849432 edges, 474847 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 32560826 markings, 79731439 edges, 475047 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 34849212 markings, 85528434 edges, 457677 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 37153514 markings, 91346055 edges, 460860 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 39443898 markings, 97165348 edges, 458077 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 41719420 markings, 102933140 edges, 455104 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 43998668 markings, 108701856 edges, 455850 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 46116859 markings, 114064878 edges, 423638 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 48367736 markings, 119790281 edges, 450175 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 50615756 markings, 125519623 edges, 449604 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 52843708 markings, 131183745 edges, 445590 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 55081366 markings, 136891103 edges, 447532 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 57330247 markings, 142628120 edges, 449776 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 59523271 markings, 148150155 edges, 438605 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 61764064 markings, 153869908 edges, 448159 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 63984329 markings, 159538727 edges, 444053 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 66227800 markings, 165255544 edges, 448694 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 68373453 markings, 170761460 edges, 429131 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 70529925 markings, 176328437 edges, 431294 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 72476751 markings, 181333193 edges, 389365 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 74506675 markings, 186537448 edges, 405985 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 76664626 markings, 192043236 edges, 431590 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 78860202 markings, 197632521 edges, 439115 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 80986492 markings, 203160957 edges, 425258 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 83176888 markings, 208740825 edges, 438079 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 85286462 markings, 214122179 edges, 421915 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 87217902 markings, 219070251 edges, 386288 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 89196712 markings, 224170857 edges, 395762 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 91335649 markings, 229658326 edges, 427787 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 93390786 markings, 234924538 edges, 411027 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 95219631 markings, 239692472 edges, 365769 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 97278256 markings, 245016774 edges, 411725 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 99374367 markings, 250422246 edges, 419222 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 101487682 markings, 255860351 edges, 422663 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 103605302 markings, 261310022 edges, 423524 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 105700715 markings, 266721086 edges, 419083 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 107816184 markings, 272150585 edges, 423094 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 109906863 markings, 277569319 edges, 418136 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 111973295 markings, 282850456 edges, 413286 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 114059164 markings, 288230050 edges, 417174 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 116154812 markings, 293636261 edges, 419130 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 118234290 markings, 299023617 edges, 415896 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 120321513 markings, 304428047 edges, 417445 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 122417159 markings, 309828760 edges, 419129 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 124463818 markings, 315141240 edges, 409332 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 126522794 markings, 320456534 edges, 411795 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 128573046 markings, 325773202 edges, 410050 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 130623288 markings, 331080283 edges, 410048 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 132662861 markings, 336371571 edges, 407915 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 134709642 markings, 341651325 edges, 409356 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 136754119 markings, 346923343 edges, 408895 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 138520137 markings, 351499941 edges, 353204 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 139834535 markings, 354891798 edges, 262880 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 141173996 markings, 358376857 edges, 267892 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 142617130 markings, 362173486 edges, 288627 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 144429375 markings, 366874172 edges, 362449 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 146156357 markings, 371365096 edges, 345396 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 147768217 markings, 375546079 edges, 322372 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 149403931 markings, 379813445 edges, 327143 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 151310263 markings, 384767237 edges, 381266 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 153168214 markings, 389607355 edges, 371590 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 154816630 markings, 393918641 edges, 329683 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 156401092 markings, 398018420 edges, 316892 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 157862209 markings, 401852025 edges, 292223 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 159488993 markings, 406076858 edges, 325357 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 160626553 markings, 409046672 edges, 227512 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 161770653 markings, 411993664 edges, 228820 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 162567297 markings, 414099866 edges, 159329 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 164056909 markings, 417959602 edges, 297922 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 165703529 markings, 422260574 edges, 329324 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 166939023 markings, 425462635 edges, 247099 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 168266959 markings, 428909801 edges, 265587 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 169818376 markings, 432946685 edges, 310283 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 171492589 markings, 437328697 edges, 334843 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 172358016 markings, 439559676 edges, 173085 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 172991374 markings, 441234074 edges, 126672 markings/sec, 430 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 625 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p5 <= 0) OR (p11 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p5 <= 0) OR (p11 <= 0))))
lola: processed formula length: 34
lola: 9 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p5) AND (1 <= p11))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 5 markings, 5 edges
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 7 will run for 782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (A (G ((1 <= p10)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(EF(AG((1 <= p10))))
lola: processed formula length: 22
lola: 11 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).
sara: try reading problem file CTLFireability-6-0.sara.
sara: place or transition ordering is non-deterministic

lola: 2578076 markings, 10250143 edges, 515615 markings/sec, 0 secs
lola: 5119983 markings, 20370404 edges, 508381 markings/sec, 5 secs
lola: 7760196 markings, 30895618 edges, 528043 markings/sec, 10 secs
lola: 10206714 markings, 41108769 edges, 489304 markings/sec, 15 secs
lola: 12427707 markings, 50618223 edges, 444199 markings/sec, 20 secs
lola: 14603951 markings, 59913892 edges, 435249 markings/sec, 25 secs
lola: 16761801 markings, 69127442 edges, 431570 markings/sec, 30 secs
lola: 18872820 markings, 78182264 edges, 422204 markings/sec, 35 secs
lola: 21122828 markings, 87771564 edges, 450002 markings/sec, 40 secs
lola: 23508224 markings, 97410828 edges, 477079 markings/sec, 45 secs
lola: 25567527 markings, 106358527 edges, 411861 markings/sec, 50 secs
lola: 27514397 markings, 115018358 edges, 389374 markings/sec, 55 secs
lola: 29445487 markings, 123614115 edges, 386218 markings/sec, 60 secs
lola: 31366363 markings, 132118068 edges, 384175 markings/sec, 65 secs
lola: 33303523 markings, 140668431 edges, 387432 markings/sec, 70 secs
lola: 35150860 markings, 148949707 edges, 369467 markings/sec, 75 secs
lola: 36953275 markings, 157045558 edges, 360483 markings/sec, 80 secs
lola: 38769421 markings, 165232790 edges, 363229 markings/sec, 85 secs
lola: 40536598 markings, 173196789 edges, 353435 markings/sec, 90 secs
lola: 42266915 markings, 181008324 edges, 346063 markings/sec, 95 secs
lola: 43964714 markings, 188722011 edges, 339560 markings/sec, 100 secs
lola: 45665937 markings, 196481596 edges, 340245 markings/sec, 105 secs
lola: 47329380 markings, 204074119 edges, 332689 markings/sec, 110 secs
lola: 49005200 markings, 211701491 edges, 335164 markings/sec, 115 secs
lola: 50628634 markings, 219153655 edges, 324687 markings/sec, 120 secs
lola: 52260125 markings, 226613038 edges, 326298 markings/sec, 125 secs
lola: 53923153 markings, 234149417 edges, 332606 markings/sec, 130 secs
lola: 55646367 markings, 241881173 edges, 344643 markings/sec, 135 secs
lola: 57317795 markings, 249464794 edges, 334286 markings/sec, 140 secs
lola: 59044083 markings, 257228453 edges, 345258 markings/sec, 145 secs
lola: 60644414 markings, 264527903 edges, 320066 markings/sec, 150 secs
lola: 62230363 markings, 271777325 edges, 317190 markings/sec, 155 secs
lola: 63788589 markings, 278934080 edges, 311645 markings/sec, 160 secs
lola: 65364991 markings, 286189518 edges, 315280 markings/sec, 165 secs
lola: 66903560 markings, 293266806 edges, 307714 markings/sec, 170 secs
lola: 68471163 markings, 300470753 edges, 313521 markings/sec, 175 secs
lola: 70005256 markings, 307524896 edges, 306819 markings/sec, 180 secs
lola: 71533570 markings, 314551805 edges, 305663 markings/sec, 185 secs
lola: 73110945 markings, 321756606 edges, 315475 markings/sec, 190 secs
lola: 74772815 markings, 329289221 edges, 332374 markings/sec, 195 secs
lola: 76734704 markings, 337979544 edges, 392378 markings/sec, 200 secs
lola: 78431429 markings, 345631765 edges, 339345 markings/sec, 205 secs
lola: 80052949 markings, 352970320 edges, 324304 markings/sec, 210 secs
lola: 81658987 markings, 360259333 edges, 321208 markings/sec, 215 secs
lola: 83199375 markings, 367308727 edges, 308078 markings/sec, 220 secs
lola: 84700302 markings, 374196310 edges, 300185 markings/sec, 225 secs
lola: 86215258 markings, 381199592 edges, 302991 markings/sec, 230 secs
lola: 87712861 markings, 388123762 edges, 299521 markings/sec, 235 secs
lola: 89213365 markings, 395094158 edges, 300101 markings/sec, 240 secs
lola: 90769604 markings, 402271560 edges, 311248 markings/sec, 245 secs
lola: 92341342 markings, 409506747 edges, 314348 markings/sec, 250 secs
lola: 93951468 markings, 416868276 edges, 322025 markings/sec, 255 secs
lola: 95812180 markings, 425200119 edges, 372142 markings/sec, 260 secs
lola: 97603285 markings, 433271129 edges, 358221 markings/sec, 265 secs
lola: 99317039 markings, 441021021 edges, 342751 markings/sec, 270 secs
lola: 101204430 markings, 449470327 edges, 377478 markings/sec, 275 secs
lola: 103085309 markings, 457843829 edges, 376176 markings/sec, 280 secs
lola: 104305787 markings, 463336752 edges, 244096 markings/sec, 285 secs
lola: 104755221 markings, 465420074 edges, 89887 markings/sec, 290 secs
lola: 105215872 markings, 467485474 edges, 92130 markings/sec, 295 secs
lola: 105829689 markings, 470293143 edges, 122763 markings/sec, 300 secs
lola: 106675556 markings, 474140262 edges, 169173 markings/sec, 305 secs
lola: 107139138 markings, 476212183 edges, 92716 markings/sec, 310 secs
lola: 107499065 markings, 477826509 edges, 71985 markings/sec, 315 secs
lola: 107974501 markings, 479965193 edges, 95087 markings/sec, 320 secs
lola: 108451050 markings, 482072203 edges, 95310 markings/sec, 325 secs
lola: 109360074 markings, 486087116 edges, 181805 markings/sec, 330 secs
lola: 109835628 markings, 488229810 edges, 95111 markings/sec, 335 secs
lola: 110275976 markings, 490219900 edges, 88070 markings/sec, 340 secs
lola: 110865995 markings, 492893333 edges, 118004 markings/sec, 345 secs
lola: 111336648 markings, 495025006 edges, 94131 markings/sec, 350 secs
lola: 111757460 markings, 496920183 edges, 84162 markings/sec, 355 secs
lola: 112155768 markings, 498724344 edges, 79662 markings/sec, 360 secs
lola: 112583189 markings, 500668012 edges, 85484 markings/sec, 365 secs
lola: 112940163 markings, 502285078 edges, 71395 markings/sec, 370 secs
lola: 113624321 markings, 505390254 edges, 136832 markings/sec, 375 secs
lola: 113881132 markings, 506552778 edges, 51362 markings/sec, 380 secs
lola: 114227779 markings, 508116436 edges, 69329 markings/sec, 385 secs
lola: 114504601 markings, 509386032 edges, 55364 markings/sec, 390 secs
lola: 114840218 markings, 510923025 edges, 67123 markings/sec, 395 secs
lola: 115080860 markings, 512023004 edges, 48128 markings/sec, 400 secs
lola: 115236233 markings, 512737821 edges, 31075 markings/sec, 405 secs
lola: 115391726 markings, 513451603 edges, 31099 markings/sec, 410 secs
lola: 115756816 markings, 515139124 edges, 73018 markings/sec, 415 secs
lola: 116034250 markings, 516415164 edges, 55487 markings/sec, 420 secs
lola: 116252010 markings, 517421069 edges, 43552 markings/sec, 425 secs
lola: 116520072 markings, 518636279 edges, 53612 markings/sec, 430 secs
lola: 116923285 markings, 520488970 edges, 80643 markings/sec, 435 secs
lola: 117570107 markings, 523459591 edges, 129364 markings/sec, 440 secs
lola: 117844197 markings, 524715500 edges, 54818 markings/sec, 445 secs
lola: 118250273 markings, 526589812 edges, 81215 markings/sec, 450 secs
lola: 118555087 markings, 527979836 edges, 60963 markings/sec, 455 secs
lola: 118865166 markings, 529397354 edges, 62016 markings/sec, 460 secs
lola: 119457168 markings, 532109702 edges, 118400 markings/sec, 465 secs
lola: 120400918 markings, 536448311 edges, 188750 markings/sec, 470 secs
lola: 121041870 markings, 539408402 edges, 128190 markings/sec, 475 secs
lola: 121093369 markings, 539646572 edges, 10300 markings/sec, 480 secs
lola: 121226216 markings, 540259149 edges, 26569 markings/sec, 485 secs
lola: 121460580 markings, 541346548 edges, 46873 markings/sec, 490 secs
lola: 121872677 markings, 543255104 edges, 82419 markings/sec, 495 secs
lola: 122141937 markings, 544518161 edges, 53852 markings/sec, 500 secs
lola: 122390783 markings, 545691861 edges, 49769 markings/sec, 505 secs
lola: 122694756 markings, 547108547 edges, 60795 markings/sec, 510 secs
lola: 123064617 markings, 548831987 edges, 73972 markings/sec, 515 secs
lola: 123545001 markings, 551075994 edges, 96077 markings/sec, 520 secs
lola: 123856892 markings, 552523001 edges, 62378 markings/sec, 525 secs
lola: 124269008 markings, 554418803 edges, 82423 markings/sec, 530 secs
lola: 124714363 markings, 556481535 edges, 89071 markings/sec, 535 secs
lola: 125262759 markings, 559005549 edges, 109679 markings/sec, 540 secs
lola: 125934426 markings, 562105170 edges, 134333 markings/sec, 545 secs
lola: 126633726 markings, 565340488 edges, 139860 markings/sec, 550 secs
lola: 126947665 markings, 566784882 edges, 62788 markings/sec, 555 secs
lola: 127053457 markings, 567268631 edges, 21158 markings/sec, 560 secs
lola: 127510835 markings, 569371349 edges, 91476 markings/sec, 565 secs
lola: 127704527 markings, 570256791 edges, 38738 markings/sec, 570 secs
lola: 128184475 markings, 572471687 edges, 95990 markings/sec, 575 secs
lola: 128515381 markings, 573993185 edges, 66181 markings/sec, 580 secs
lola: 128982718 markings, 576162984 edges, 93467 markings/sec, 585 secs
lola: 129177546 markings, 577061909 edges, 38966 markings/sec, 590 secs
lola: 129719310 markings, 579549880 edges, 108353 markings/sec, 595 secs
lola: 130016548 markings, 580926050 edges, 59448 markings/sec, 600 secs
lola: 130225259 markings, 581882304 edges, 41742 markings/sec, 605 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 837 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p4 <= 0) AND ((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)) AND (p5 <= 0)))) OR (1 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 837 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p1)
lola: processed formula length: 9
lola: 8 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 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 9 will run for 1256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p4 <= 0) AND ((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)) AND (p5 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p4 <= 0) AND ((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)) AND (p5 <= 0))))
lola: processed formula length: 78
lola: 9 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: ((p4 <= 0) AND ((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)) AND (p5 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 201 markings, 200 edges
lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 1256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p4) AND E (((p5 <= 0) U ((1 <= p11) AND (1 <= p6) AND ((1 <= p8) OR (1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p4)
lola: processed formula length: 9
lola: 8 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 2512 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p5 <= 0) U ((1 <= p11) AND (1 <= p6) AND ((1 <= p8) OR (1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((p5 <= 0) U ((1 <= p11) AND (1 <= p6) AND ((1 <= p8) OR (1 <= p2)))))
lola: processed formula length: 74
lola: 11 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
sara: try reading problem file CTLFireability-9-0.sara.
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p11) AND (1 <= p6) AND ((1 <= p8) OR (1 <= p2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-10-0.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-10-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 1 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 2512 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p8) OR (E (F ((1 <= p12))) AND E (F (((1 <= p0) AND (1 <= p7) AND (1 <= p13) AND (1 <= p3) AND (1 <= p9) AND (1 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 2512 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p8)
lola: processed formula length: 9
lola: 8 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 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: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p0) AND (1 <= p7) AND (1 <= p13) AND (1 <= p3) AND (1 <= p9) AND (1 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p0) AND (1 <= p7) AND (1 <= p13) AND (1 <= p3) AND (1 <= p9) AND (1 <= p14))))
lola: processed formula length: 91
lola: 9 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p0) AND (1 <= p7) AND (1 <= p13) AND (1 <= p3) AND (1 <= p9) AND (1 <= p14))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-12-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: 8 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (1 <= p8)
lola: processed formula length: 9
lola: 11 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p8 <= 0)
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 task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (1 <= p8)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-11-0.sara
lola: state equation: write sara problem file to CTLFireability-11-1.sara

lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3511512 markings, 7940465 edges, 702302 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6234327 markings, 14487769 edges, 544563 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 8033494 markings, 18864717 edges, 359833 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 10431480 markings, 24704482 edges, 479597 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 12995758 markings, 31014992 edges, 512856 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 15479113 markings, 37143173 edges, 496671 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 17933576 markings, 43229925 edges, 490893 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 20386157 markings, 49306977 edges, 490516 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 22827233 markings, 55396301 edges, 488215 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 25242784 markings, 61453466 edges, 483110 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 27632445 markings, 67454022 edges, 477932 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 29944555 markings, 73238215 edges, 462422 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 32351091 markings, 79204237 edges, 481307 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 34703160 markings, 85153482 edges, 470414 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 37050661 markings, 91094074 edges, 469500 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 39326193 markings, 96872157 edges, 455106 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 41647740 markings, 102751244 edges, 464309 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 43922587 markings, 108515540 edges, 454969 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 46201501 markings, 114284786 edges, 455783 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 48456110 markings, 120020924 edges, 450922 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 50705219 markings, 125749196 edges, 449822 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 52956895 markings, 131477050 edges, 450335 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 55191660 markings, 137175300 edges, 446953 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 57397019 markings, 142799114 edges, 441072 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 59621175 markings, 148399065 edges, 444831 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 61830671 markings, 154047152 edges, 441899 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 63819295 markings, 159109960 edges, 397725 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 65994749 markings, 164664063 edges, 435091 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 68155687 markings, 170201283 edges, 432188 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 70289464 markings, 175717428 edges, 426755 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 72465032 markings, 181303847 edges, 435114 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 74639447 markings, 186881347 edges, 434883 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 76825742 markings, 192443792 edges, 437259 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 79004892 markings, 198010809 edges, 435830 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 81174934 markings, 203638211 edges, 434008 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 83386473 markings, 209284332 edges, 442308 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 85585979 markings, 214879218 edges, 439901 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 87703446 markings, 220326391 edges, 423493 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 89775331 markings, 225652166 edges, 414377 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 91624975 markings, 230400653 edges, 369929 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 93722028 markings, 235787060 edges, 419411 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 95808068 markings, 241202888 edges, 417208 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 97917402 markings, 246670544 edges, 421867 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 100039831 markings, 252154150 edges, 424486 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 102206806 markings, 257726849 edges, 433395 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 104328982 markings, 263173047 edges, 424435 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 106407972 markings, 268550912 edges, 415798 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 108525699 markings, 273983224 edges, 423545 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 110620949 markings, 279408164 edges, 419050 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 112738998 markings, 284834587 edges, 423610 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 114815559 markings, 290216114 edges, 415312 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 116907599 markings, 295564363 edges, 418408 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 118974537 markings, 300935104 edges, 413388 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 121046600 markings, 306300672 edges, 414413 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 123131034 markings, 311670639 edges, 416887 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 125165022 markings, 316983946 edges, 406798 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 127241854 markings, 322329872 edges, 415366 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 129309036 markings, 327676931 edges, 413436 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 131319054 markings, 332906139 edges, 402004 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 132732976 markings, 336557812 edges, 282784 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 134108496 markings, 340092123 edges, 275104 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 135446655 markings, 343557405 edges, 267632 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 136779604 markings, 346987701 edges, 266590 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 138341798 markings, 351038209 edges, 312439 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 138931628 markings, 352582400 edges, 117966 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 139544845 markings, 354160692 edges, 122643 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 140043019 markings, 355436000 edges, 99635 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 140617617 markings, 356919197 edges, 114920 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 141141695 markings, 358300012 edges, 104816 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 141626368 markings, 359575227 edges, 96935 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 142116028 markings, 360856360 edges, 97932 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 142744181 markings, 362491484 edges, 125631 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 143365722 markings, 364107901 edges, 124308 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 143962118 markings, 365658697 edges, 119279 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 144481338 markings, 367012000 edges, 103844 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 144999447 markings, 368353094 edges, 103622 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 145812786 markings, 370459951 edges, 162668 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 146684286 markings, 372737848 edges, 174300 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 147366785 markings, 374505244 edges, 136500 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 147911962 markings, 375918053 edges, 109035 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 148485759 markings, 377401237 edges, 114759 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 149203449 markings, 379283245 edges, 143538 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 150589154 markings, 382881210 edges, 277141 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 151870911 markings, 386231460 edges, 256351 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 152798833 markings, 388639754 edges, 185584 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 153445898 markings, 390337815 edges, 129413 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 153959071 markings, 391676808 edges, 102635 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 154499272 markings, 393088560 edges, 108040 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 155947016 markings, 396841978 edges, 289549 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 157288987 markings, 400351223 edges, 268394 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 157907923 markings, 401966450 edges, 123787 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 158457686 markings, 403380357 edges, 109953 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 159024303 markings, 404858603 edges, 113323 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 159640944 markings, 406474447 edges, 123328 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 160189320 markings, 407894283 edges, 109675 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 160752114 markings, 409369403 edges, 112559 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 161317434 markings, 410835778 edges, 113064 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 161951164 markings, 412481484 edges, 126746 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 162432741 markings, 413741277 edges, 96315 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 163037944 markings, 415321003 edges, 121041 markings/sec, 495 secs
lola: sara is running 500 secs || sara is running 500 secs || 163460235 markings, 416428260 edges, 84458 markings/sec, 500 secs
lola: sara is running 505 secs || sara is running 505 secs || 164063543 markings, 417974522 edges, 120662 markings/sec, 505 secs
lola: sara is running 510 secs || sara is running 510 secs || 164642877 markings, 419498782 edges, 115867 markings/sec, 510 secs
lola: sara is running 515 secs || sara is running 515 secs || 165144430 markings, 420816313 edges, 100311 markings/sec, 515 secs
lola: sara is running 520 secs || sara is running 520 secs || 165671444 markings, 422172339 edges, 105403 markings/sec, 520 secs
lola: sara is running 525 secs || sara is running 525 secs || 166285820 markings, 423783013 edges, 122875 markings/sec, 525 secs
lola: sara is running 530 secs || sara is running 530 secs || 166862858 markings, 425268289 edges, 115408 markings/sec, 530 secs
lola: sara is running 535 secs || sara is running 535 secs || 167460769 markings, 426825442 edges, 119582 markings/sec, 535 secs
lola: sara is running 540 secs || sara is running 540 secs || 167913119 markings, 427993785 edges, 90470 markings/sec, 540 secs
lola: sara is running 545 secs || sara is running 545 secs || 168466839 markings, 429440595 edges, 110744 markings/sec, 545 secs
lola: sara is running 550 secs || sara is running 550 secs || 169110433 markings, 431119082 edges, 128719 markings/sec, 550 secs
lola: sara is running 555 secs || sara is running 555 secs || 169656009 markings, 432530929 edges, 109115 markings/sec, 555 secs
lola: sara is running 560 secs || sara is running 560 secs || 170177738 markings, 433884928 edges, 104346 markings/sec, 560 secs
lola: sara is running 565 secs || sara is running 565 secs || 170721111 markings, 435301541 edges, 108675 markings/sec, 565 secs
lola: sara is running 570 secs || sara is running 570 secs || 171280574 markings, 436781257 edges, 111893 markings/sec, 570 secs
lola: sara is running 575 secs || sara is running 575 secs || 171725000 markings, 437943831 edges, 88885 markings/sec, 575 secs
lola: sara is running 580 secs || sara is running 580 secs || 172370086 markings, 439588138 edges, 129017 markings/sec, 580 secs
lola: sara is running 585 secs || sara is running 585 secs || 172915619 markings, 441034714 edges, 109107 markings/sec, 585 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (G (E (F (A (G ((1 <= p10)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(EF(AG((1 <= p10))))
lola: processed formula length: 22
lola: 11 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: 2575321 markings, 10236566 edges, 515064 markings/sec, 0 secs
lola: 5126430 markings, 20392524 edges, 510222 markings/sec, 5 secs
lola: 7715641 markings, 30692465 edges, 517842 markings/sec, 10 secs
lola: 10098524 markings, 40665235 edges, 476577 markings/sec, 15 secs
lola: 12297418 markings, 50064361 edges, 439779 markings/sec, 20 secs
lola: 14444974 markings, 59240153 edges, 429511 markings/sec, 25 secs
lola: 16603762 markings, 68470376 edges, 431758 markings/sec, 30 secs
lola: 18732364 markings, 77564465 edges, 425720 markings/sec, 35 secs
lola: 20923679 markings, 86938215 edges, 438263 markings/sec, 40 secs
lola: 23238719 markings, 96330007 edges, 463008 markings/sec, 45 secs
lola: 25370952 markings, 105481553 edges, 426447 markings/sec, 50 secs
lola: 27350130 markings, 114268231 edges, 395836 markings/sec, 55 secs
lola: 29302853 markings, 122980662 edges, 390545 markings/sec, 60 secs
lola: 31249761 markings, 131593778 edges, 389382 markings/sec, 65 secs
lola: 33202170 markings, 140210413 edges, 390482 markings/sec, 70 secs
lola: 35061658 markings, 148549624 edges, 371898 markings/sec, 75 secs
lola: 36885063 markings, 156742434 edges, 364681 markings/sec, 80 secs
lola: 38680152 markings, 164823146 edges, 359018 markings/sec, 85 secs
lola: 40467082 markings, 172886020 edges, 357386 markings/sec, 90 secs
lola: 42226047 markings, 180825834 edges, 351793 markings/sec, 95 secs
lola: 43935273 markings, 188587512 edges, 341845 markings/sec, 100 secs
lola: 45595248 markings, 196159666 edges, 331995 markings/sec, 105 secs
lola: 47267729 markings, 203795919 edges, 334496 markings/sec, 110 secs
lola: 48932788 markings, 211366436 edges, 333012 markings/sec, 115 secs
lola: 50565324 markings, 218846720 edges, 326507 markings/sec, 120 secs
lola: 52181830 markings, 226267796 edges, 323301 markings/sec, 125 secs
lola: 53888849 markings, 233990429 edges, 341404 markings/sec, 130 secs
lola: 55715081 markings, 242197244 edges, 365246 markings/sec, 135 secs
lola: 57499403 markings, 250279669 edges, 356864 markings/sec, 140 secs
lola: 59290965 markings, 258351130 edges, 358312 markings/sec, 145 secs
lola: 60968731 markings, 266000414 edges, 335553 markings/sec, 150 secs
lola: 62592059 markings, 273442439 edges, 324666 markings/sec, 155 secs
lola: 64176011 markings, 280727500 edges, 316790 markings/sec, 160 secs
lola: 65771635 markings, 288077537 edges, 319125 markings/sec, 165 secs
lola: 67343309 markings, 295303476 edges, 314335 markings/sec, 170 secs
lola: 68902606 markings, 302452965 edges, 311859 markings/sec, 175 secs
lola: 70460301 markings, 309626012 edges, 311539 markings/sec, 180 secs
lola: 72126829 markings, 317259696 edges, 333306 markings/sec, 185 secs
lola: 73765980 markings, 324766423 edges, 327830 markings/sec, 190 secs
lola: 75633607 markings, 333104296 edges, 373525 markings/sec, 195 secs
lola: 77513769 markings, 341480668 edges, 376032 markings/sec, 200 secs
lola: 79183456 markings, 349043425 edges, 333937 markings/sec, 205 secs
lola: 80810158 markings, 356402853 edges, 325340 markings/sec, 210 secs
lola: 82444869 markings, 363834695 edges, 326942 markings/sec, 215 secs
lola: 84002229 markings, 371000378 edges, 311472 markings/sec, 220 secs
lola: 85555506 markings, 378142254 edges, 310655 markings/sec, 225 secs
lola: 87099786 markings, 385287027 edges, 308856 markings/sec, 230 secs
lola: 88616018 markings, 392333679 edges, 303246 markings/sec, 235 secs
lola: 90166367 markings, 399489295 edges, 310070 markings/sec, 240 secs
lola: 91701308 markings, 406570621 edges, 306988 markings/sec, 245 secs
lola: 93262799 markings, 413718446 edges, 312298 markings/sec, 250 secs
lola: 94954625 markings, 421389021 edges, 338365 markings/sec, 255 secs
lola: 96772222 markings, 429517964 edges, 363519 markings/sec, 260 secs
lola: 98491993 markings, 437284923 edges, 343954 markings/sec, 265 secs
lola: 100223231 markings, 445083914 edges, 346248 markings/sec, 270 secs
lola: 102164159 markings, 453710497 edges, 388186 markings/sec, 275 secs
lola: 103940015 markings, 461678691 edges, 355171 markings/sec, 280 secs
lola: 105316151 markings, 467937823 edges, 275227 markings/sec, 285 secs
lola: 106541441 markings, 473521064 edges, 245058 markings/sec, 290 secs
lola: 107626260 markings, 478405207 edges, 216964 markings/sec, 295 secs
lola: 109159238 markings, 485193234 edges, 306596 markings/sec, 300 secs
lola: 110353569 markings, 490571571 edges, 238866 markings/sec, 305 secs
lola: 111647585 markings, 496423764 edges, 258803 markings/sec, 310 secs
lola: 112680859 markings, 501107704 edges, 206655 markings/sec, 315 secs
lola: 113084072 markings, 502932732 edges, 80643 markings/sec, 320 secs
lola: 113403691 markings, 504395466 edges, 63924 markings/sec, 325 secs
lola: 113747392 markings, 505948441 edges, 68740 markings/sec, 330 secs
lola: 114009097 markings, 507128869 edges, 52341 markings/sec, 335 secs
lola: 114356278 markings, 508704752 edges, 69436 markings/sec, 340 secs
lola: 114657290 markings, 510092129 edges, 60202 markings/sec, 345 secs
lola: 114905763 markings, 511222638 edges, 49695 markings/sec, 350 secs
lola: 115271573 markings, 512898640 edges, 73162 markings/sec, 355 secs
lola: 115496972 markings, 513939301 edges, 45080 markings/sec, 360 secs
lola: 115803715 markings, 515353453 edges, 61349 markings/sec, 365 secs
lola: 116120868 markings, 516813016 edges, 63431 markings/sec, 370 secs
lola: 116446913 markings, 518305017 edges, 65209 markings/sec, 375 secs
lola: 116794336 markings, 519894049 edges, 69485 markings/sec, 380 secs
lola: 117069812 markings, 521166458 edges, 55095 markings/sec, 385 secs
lola: 117207652 markings, 521790809 edges, 27568 markings/sec, 390 secs
lola: 117500382 markings, 523143709 edges, 58546 markings/sec, 395 secs
lola: 117802399 markings, 524529143 edges, 60403 markings/sec, 400 secs
lola: 118065927 markings, 525740944 edges, 52706 markings/sec, 405 secs
lola: 118400488 markings, 527278517 edges, 66912 markings/sec, 410 secs
lola: 118710186 markings, 528695599 edges, 61940 markings/sec, 415 secs
lola: 118998107 markings, 530010867 edges, 57584 markings/sec, 420 secs
lola: 119327502 markings, 531518080 edges, 65879 markings/sec, 425 secs
lola: 119683021 markings, 533142155 edges, 71104 markings/sec, 430 secs
lola: 120038035 markings, 534791830 edges, 71003 markings/sec, 435 secs
lola: 120373797 markings, 536317437 edges, 67152 markings/sec, 440 secs
lola: 120769111 markings, 538151436 edges, 79063 markings/sec, 445 secs
lola: 121036998 markings, 539386130 edges, 53577 markings/sec, 450 secs
lola: 121190736 markings, 540093285 edges, 30748 markings/sec, 455 secs
lola: 121325461 markings, 540724420 edges, 26945 markings/sec, 460 secs
lola: 121749401 markings, 542684852 edges, 84788 markings/sec, 465 secs
lola: 122311772 markings, 545322654 edges, 112474 markings/sec, 470 secs
lola: 122663094 markings, 546964208 edges, 70264 markings/sec, 475 secs
lola: 122959575 markings, 548338123 edges, 59296 markings/sec, 480 secs
lola: 123401109 markings, 550403479 edges, 88307 markings/sec, 485 secs
lola: 123781358 markings, 552171283 edges, 76050 markings/sec, 490 secs
lola: 124190887 markings, 554064534 edges, 81906 markings/sec, 495 secs
lola: 124594597 markings, 555926986 edges, 80742 markings/sec, 500 secs
lola: 124735550 markings, 556580827 edges, 28191 markings/sec, 505 secs
lola: 125264132 markings, 559012266 edges, 105716 markings/sec, 510 secs
lola: 125906046 markings, 561973852 edges, 128383 markings/sec, 515 secs
lola: 126383761 markings, 564184683 edges, 95543 markings/sec, 520 secs
lola: 126709767 markings, 565686568 edges, 65201 markings/sec, 525 secs
lola: 126798934 markings, 566092207 edges, 17833 markings/sec, 530 secs
lola: 126849413 markings, 566331063 edges, 10096 markings/sec, 535 secs
lola: 126884926 markings, 566492423 edges, 7103 markings/sec, 540 secs
lola: 126921003 markings, 566662418 edges, 7215 markings/sec, 545 secs
lola: 126945958 markings, 566777853 edges, 4991 markings/sec, 550 secs
lola: 126982437 markings, 566945251 edges, 7296 markings/sec, 555 secs
lola: 127078962 markings, 567383717 edges, 19305 markings/sec, 560 secs
lola: 127138781 markings, 567656201 edges, 11964 markings/sec, 565 secs
lola: 127207269 markings, 567975409 edges, 13698 markings/sec, 570 secs
lola: 127300946 markings, 568409113 edges, 18735 markings/sec, 575 secs
lola: 127362330 markings, 568685643 edges, 12277 markings/sec, 580 secs
lola: 127462295 markings, 569142065 edges, 19993 markings/sec, 585 secs
lola: 127561470 markings, 569603953 edges, 19835 markings/sec, 590 secs
lola: 127634618 markings, 569939473 edges, 14630 markings/sec, 595 secs
lola: 127709870 markings, 570281198 edges, 15050 markings/sec, 600 secs
lola: 127960426 markings, 571434832 edges, 50111 markings/sec, 605 secs
lola: 128184297 markings, 572470802 edges, 44774 markings/sec, 610 secs
lola: 128270909 markings, 572871095 edges, 17322 markings/sec, 615 secs
lola: 128368336 markings, 573314334 edges, 19485 markings/sec, 620 secs
lola: 128500334 markings, 573922493 edges, 26400 markings/sec, 625 secs
lola: 128633692 markings, 574537097 edges, 26672 markings/sec, 630 secs
lola: 128936855 markings, 575958011 edges, 60633 markings/sec, 635 secs
lola: 129165915 markings, 577007610 edges, 45812 markings/sec, 640 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((1 <= p8) OR (E (F ((1 <= p12))) AND E (F (((1 <= p0) AND (1 <= p7) AND (1 <= p13) AND (1 <= p3) AND (1 <= p9) AND (1 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p8)
lola: processed formula length: 9
lola: 8 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((1 <= p12)))
lola: processed formula length: 18
lola: 9 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p12)
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: 4 markings, 3 edges
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p0) AND (1 <= p7) AND (1 <= p13) AND (1 <= p3) AND (1 <= p9) AND (1 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p0) AND (1 <= p7) AND (1 <= p13) AND (1 <= p3) AND (1 <= p9) AND (1 <= p14))))
lola: processed formula length: 91
lola: 9 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p0) AND (1 <= p7) AND (1 <= p13) AND (1 <= p3) AND (1 <= p9) AND (1 <= p14))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-15-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: 8 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no yes no unknown yes no no no yes no
lola:
preliminary result: unknown no yes no unknown yes no no no yes no
sara: try reading problem file CTLFireability-14-0.sara.
sara: place or transition ordering is non-deterministic

lola: memory consumption: 3996 KB
lola: time consumption: 2304 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="Kanban-PT-00100"
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 Kanban-PT-00100, 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 r184-oct2-158987928700516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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