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

About the Execution of ITS-LoLa for SmallOperatingSystem-PT-MT0128DC0064

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15797.620 3600000.00 1049673.00 5388.70 TFTTFTTTT?FFTTFT normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r194-csrt-159033389400052.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is SmallOperatingSystem-PT-MT0128DC0064, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033389400052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.8K Apr 12 17:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 12 17:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 11 20:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 20:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 14 12:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 14 12:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 10 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 05:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 10 05:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 8.2K Mar 24 05:38 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591199109869

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 15:45:12] [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 15:45:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 15:45:12] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2020-06-03 15:45:12] [INFO ] Transformed 9 places.
[2020-06-03 15:45:12] [INFO ] Transformed 8 transitions.
[2020-06-03 15:45:12] [INFO ] Parsed PT model containing 9 places and 8 transitions in 90 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Incomplete random walk after 100080 steps, including 0 resets, run finished after 78 ms. (steps per millisecond=1283 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 8 rows 9 cols
[2020-06-03 15:45:12] [INFO ] Computed 4 place invariants in 3 ms
[2020-06-03 15:45:12] [INFO ] [Real]Absence check using 4 positive place invariants in 19 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
[2020-06-03 15:45:13] [INFO ] Flatten gal took : 26 ms
[2020-06-03 15:45:13] [INFO ] Flatten gal took : 4 ms
[2020-06-03 15:45:13] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2020-06-03 15:45:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ SmallOperatingSystem-PT-MT0128DC0064 @ 3570 seconds

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2616
rslt: Output for CTLFireability @ SmallOperatingSystem-PT-MT0128DC0064

{
"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 15:45:13 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EF((EX(((p1 <= 0) OR (p2 <= 0))) AND ((1 <= p2) AND (1 <= p5))))",
"processed_size": 65,
"rewrites": 33
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 1730636,
"markings": 698883,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"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": "AF(((1 <= p4) AND EX((((1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p2))))))",
"processed_size": 81,
"rewrites": 33
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 128,
"markings": 129,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((p1 <= 0) OR (p2 <= 0))))",
"processed_size": 33,
"rewrites": 32
},
"result":
{
"edges": 64,
"markings": 65,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"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": 296
},
"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": "(p4 <= 0)",
"processed_size": 9,
"rewrites": 34
},
"result":
{
"edges": 64,
"markings": 65,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "E(AG(((p4 <= 0) OR (p6 <= 0))) R ((p4 <= 0) OR (p6 <= 0)))",
"processed_size": 60,
"rewrites": 33
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 258,
"markings": 129,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"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": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AG(((1 <= p3) OR E((1 <= p4) U ((1 <= p1) AND (1 <= p2)))))",
"processed_size": 59,
"rewrites": 33
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 1845563,
"markings": 731775,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 452
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(E(AG(((1 <= p1) AND (1 <= p2))) U (((1 <= p5) AND (1 <= p6)) OR (1 <= p3))) OR (1 <= p3))",
"processed_size": 91,
"rewrites": 33
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 1771655,
"markings": 715393,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 632
},
"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 <= p7)",
"processed_size": 9,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 791
},
"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": 34
},
"result":
{
"edges": 64,
"markings": 65,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 791
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((p3 <= 0)))",
"processed_size": 17,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1563
},
"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 <= p8)))",
"processed_size": 17,
"rewrites": 32
},
"result":
{
"edges": 1,
"markings": 2,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3127
},
"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": 34
},
"result":
{
"edges": 64,
"markings": 65,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

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

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

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

{
"child":
[

{
"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 <= p8)))",
"processed_size": 17,
"rewrites": 32
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 17,
"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": 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": 34
},
"result":
{
"edges": 64,
"markings": 65,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p1) AND (1 <= p2))",
"processed_size": 25,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 19,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
},

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((1 <= p3) AND (1 <= p8)) OR (((p4 <= 0) OR (p6 <= 0)) AND (p3 <= 0)))",
"processed_size": 73,
"rewrites": 34
},
"result":
{
"edges": 64,
"markings": 65,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3888,
"runtime": 954.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(F(**)) OR A(G(**))) : E((A(G(*)) R *)) : (A(F(**)) OR **) : (E(F(*)) AND A(F(*))) : E(G((A(G(**)) OR **))) : E(F((E(X(*)) AND (** AND **)))) : A(F((** AND E(X(**))))) : A(F(**)) : E(F(*)) : E((E(F(**)) U A(G(*)))) : (E((A(G(**)) U **)) OR **) : E(X(A(G(**)))) : E((** U **)) : A(F(*)) : A(G((** OR E((** U **))))) : ((A(F(**)) AND (** AND **)) OR (E(F(**)) AND A(G(*))))"
},
"net":
{
"arcs": 27,
"conflict_clusters": 4,
"places": 9,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "yes no yes yes no yes yes yes yes unknown no no yes yes no yes ",
"value": "yes no yes yes no yes yes yes yes unknown no no yes yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 17/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 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: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: (A (F ((((p3 <= 0) OR (p8 <= 0)) AND (((1 <= p4) AND (1 <= p6)) OR (1 <= p3))))) OR A (G (((1 <= p2) AND (1 <= p5))))) : NOT(A ((E (F (((1 <= p4) AND (1 <= p6)))) U ((1 <= p4) AND (1 <= p6))))) : (A (F ((1 <= p4))) OR (1 <= p7)) : (NOT(A (G ((1 <= p3)))) AND NOT(E (G (((p4 <= 0) OR (p6 <= 0)))))) : E (G ((A (G ((((1 <= p1) AND (1 <= p2)) OR ((1 <= p4) AND (1 <= p6))))) OR (1 <= p8)))) : E (F (((NOT(A (X (((1 <= p1) AND (1 <= p2))))) AND (1 <= p2)) AND (1 <= p5)))) : A (F (((1 <= p4) AND E (X ((((1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p2)))))))) : A (F ((((1 <= p4) AND (1 <= p6)) OR ((1 <= p5) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p3)) OR (((p4 <= 0) OR (p6 <= 0)) AND ((1 <= p7) OR ((1 <= p5) AND (1 <= p6))))))) : NOT(A (G (((1 <= p1) AND (1 <= p2))))) : E ((E (F ((1 <= p8))) U NOT(E (F ((1 <= p7)))))) : (E ((A (G (((1 <= p1) AND (1 <= p2)))) U (((1 <= p5) AND (1 <= p6)) OR (1 <= p3)))) OR (1 <= p3)) : E (X (A (G (((1 <= p1) AND (1 <= p2)))))) : E ((((1 <= p1) AND (1 <= p2)) U ((p8 <= 0) AND ((p1 <= 0) OR (p2 <= 0)) AND ((p4 <= 0) OR (p6 <= 0) OR (p5 <= 0))))) : NOT(E (G ((p4 <= 0)))) : A (G (((1 <= p3) OR E (((1 <= p4) U ((1 <= p1) AND (1 <= p2))))))) : (((A (F (A (F ((1 <= p4))))) AND (1 <= p1)) AND (1 <= p2)) OR (E (F (E (F ((1 <= p8))))) AND NOT(E (F (((1 <= p3) AND (1 <= p1) AND (1 <= p2)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (X (((p1 <= 0) OR (p2 <= 0)))) AND ((1 <= p2) AND (1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((EX(((p1 <= 0) OR (p2 <= 0))) AND ((1 <= p2) AND (1 <= p5))))
lola: processed formula length: 65
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 698883 markings, 1730636 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p4) AND E (X ((((1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p2))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(((1 <= p4) AND EX((((1 <= p5) AND (1 <= p6)) OR ((1 <= p1) AND (1 <= p2))))))
lola: processed formula length: 81
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 129 markings, 128 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (((1 <= p1) AND (1 <= p2))))))
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(((1 <= p1) AND (1 <= p2))))
lola: processed formula length: 33
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: 715393 markings, 1771654 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p1 <= 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 (((p1 <= 0) OR (p2 <= 0))))
lola: processed formula length: 33
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p1 <= 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 65 markings, 64 edges
lola: state equation: write sara problem file to CTLFireability-3-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p4 <= 0)
lola: processed formula length: 9
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 65 markings, 64 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p4)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p4) AND (1 <= p6)) OR ((1 <= p5) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p3)) OR (((p4 <= 0) OR (p6 <= 0)) AND ((1 <= p7) OR ((1 <= p5) AND (1 <= p6)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p4 <= 0) OR (p6 <= 0)) AND ((p5 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p5 <= 0) OR (p3 <= 0)) AND (((1 <= p4) AND (1 <= p6)) OR ((p7 <= 0) AND ((p5 <= 0) OR (p6 <= 0)))))
lola: processed formula length: 179
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: lola: ========================================
sara: try reading problem file CTLFireability-3-0.sara.
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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: 65 markings, 64 edges
lola: formula 0: (((1 <= p4) AND (1 <= p6)) OR ((1 <= p5) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p3)) OR (((p4 <= 0) OR (p6 <= 0)) AND ((1 <= p7) OR ((1 <= p5) AND (1 <= p6)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 14 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (G (((p4 <= 0) OR (p6 <= 0)))) R ((p4 <= 0) OR (p6 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:810
lola: processed formula: E(AG(((p4 <= 0) OR (p6 <= 0))) R ((p4 <= 0) OR (p6 <= 0)))
lola: processed formula length: 60
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 129 markings, 258 edges
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((1 <= p8))) U A (G ((p7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((1 <= p8)) U AG((p7 <= 0)))
lola: processed formula length: 32
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-0.sara.
lola: ========================================
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: 1789623 markings, 8640633 edges, 357925 markings/sec, 0 secs
lola: 3338090 markings, 16423613 edges, 309693 markings/sec, 5 secs
lola: 4855745 markings, 24026364 edges, 303531 markings/sec, 10 secs
lola: 6304322 markings, 31290642 edges, 289715 markings/sec, 15 secs
lola: 7798357 markings, 38790502 edges, 298807 markings/sec, 20 secs
lola: 9213149 markings, 45870436 edges, 282958 markings/sec, 25 secs
lola: 10621464 markings, 52919063 edges, 281663 markings/sec, 30 secs
lola: 11908580 markings, 59393950 edges, 257423 markings/sec, 35 secs
lola: 13342680 markings, 66572311 edges, 286820 markings/sec, 40 secs
lola: 14734411 markings, 73558864 edges, 278346 markings/sec, 45 secs
lola: 16116325 markings, 80482952 edges, 276383 markings/sec, 50 secs
lola: 17519827 markings, 87524076 edges, 280700 markings/sec, 55 secs
lola: 19003707 markings, 94987637 edges, 296776 markings/sec, 60 secs
lola: 20420735 markings, 102095606 edges, 283406 markings/sec, 65 secs
lola: 21817099 markings, 109104430 edges, 279273 markings/sec, 70 secs
lola: 23170351 markings, 115876569 edges, 270650 markings/sec, 75 secs
lola: 24563756 markings, 122857325 edges, 278681 markings/sec, 80 secs
lola: 25930577 markings, 129722087 edges, 273364 markings/sec, 85 secs
lola: 27400321 markings, 137095302 edges, 293949 markings/sec, 90 secs
lola: 28824548 markings, 144202931 edges, 284845 markings/sec, 95 secs
lola: 30174883 markings, 151018812 edges, 270067 markings/sec, 100 secs
lola: 31544949 markings, 157875979 edges, 274013 markings/sec, 105 secs
lola: 32997227 markings, 165163713 edges, 290456 markings/sec, 110 secs
lola: 34456920 markings, 172488921 edges, 291939 markings/sec, 115 secs
lola: 35841724 markings, 179431861 edges, 276961 markings/sec, 120 secs
lola: 37207371 markings, 186313285 edges, 273129 markings/sec, 125 secs
lola: 38511350 markings, 192845602 edges, 260796 markings/sec, 130 secs
lola: 39771960 markings, 199189984 edges, 252122 markings/sec, 135 secs
lola: 41114641 markings, 205892443 edges, 268536 markings/sec, 140 secs
lola: 42376233 markings, 212260592 edges, 252318 markings/sec, 145 secs
lola: 43614846 markings, 218514501 edges, 247723 markings/sec, 150 secs
lola: 45056866 markings, 225707342 edges, 288404 markings/sec, 155 secs
lola: 46350535 markings, 232185164 edges, 258734 markings/sec, 160 secs
lola: 47645062 markings, 238686848 edges, 258905 markings/sec, 165 secs
lola: 48880654 markings, 244888879 edges, 247118 markings/sec, 170 secs
lola: 50269544 markings, 251923107 edges, 277778 markings/sec, 175 secs
lola: 51739369 markings, 259308410 edges, 293965 markings/sec, 180 secs
lola: 53223863 markings, 266743755 edges, 296899 markings/sec, 185 secs
lola: 54684722 markings, 274109802 edges, 292172 markings/sec, 190 secs
lola: 56063089 markings, 281024125 edges, 275673 markings/sec, 195 secs
lola: 57410960 markings, 287771998 edges, 269574 markings/sec, 200 secs
lola: 58688215 markings, 294194169 edges, 255451 markings/sec, 205 secs
lola: 60083881 markings, 301209570 edges, 279133 markings/sec, 210 secs
lola: 61350104 markings, 307589372 edges, 253245 markings/sec, 215 secs
lola: 62726304 markings, 314491488 edges, 275240 markings/sec, 220 secs
lola: 64010908 markings, 320934882 edges, 256921 markings/sec, 225 secs
lola: 65407403 markings, 327978128 edges, 279299 markings/sec, 230 secs
lola: 66872140 markings, 335287579 edges, 292947 markings/sec, 235 secs
lola: 68148315 markings, 341684070 edges, 255235 markings/sec, 240 secs
lola: 69425262 markings, 348115073 edges, 255389 markings/sec, 245 secs
lola: 70738328 markings, 354752056 edges, 262613 markings/sec, 250 secs
lola: 71987605 markings, 361036694 edges, 249855 markings/sec, 255 secs
lola: 73305184 markings, 367664902 edges, 263516 markings/sec, 260 secs
lola: 74585504 markings, 374091225 edges, 256064 markings/sec, 265 secs
lola: 75846480 markings, 380448874 edges, 252195 markings/sec, 270 secs
lola: 77148524 markings, 387007287 edges, 260409 markings/sec, 275 secs
lola: 78474135 markings, 393652583 edges, 265122 markings/sec, 280 secs
lola: 80028004 markings, 401464058 edges, 310774 markings/sec, 285 secs
lola: 81599271 markings, 409281815 edges, 314253 markings/sec, 290 secs
lola: 83024254 markings, 416492693 edges, 284997 markings/sec, 295 secs
lola: 84511225 markings, 424000089 edges, 297394 markings/sec, 300 secs
lola: 86059027 markings, 431751787 edges, 309560 markings/sec, 305 secs
lola: 87549964 markings, 439242777 edges, 298187 markings/sec, 310 secs
lola: 89065101 markings, 446887848 edges, 303027 markings/sec, 315 secs
lola: 90588892 markings, 454526423 edges, 304758 markings/sec, 320 secs
lola: 92041910 markings, 461814180 edges, 290604 markings/sec, 325 secs
lola: 93498012 markings, 469212239 edges, 291220 markings/sec, 330 secs
lola: 94985129 markings, 476680237 edges, 297423 markings/sec, 335 secs
lola: 96608199 markings, 484755091 edges, 324614 markings/sec, 340 secs
lola: 98111137 markings, 492332769 edges, 300588 markings/sec, 345 secs
lola: 99573798 markings, 499766408 edges, 292532 markings/sec, 350 secs
lola: 101040879 markings, 507127161 edges, 293416 markings/sec, 355 secs
lola: 102523586 markings, 514633999 edges, 296541 markings/sec, 360 secs
lola: 103996186 markings, 522015048 edges, 294520 markings/sec, 365 secs
lola: 105442434 markings, 529325689 edges, 289250 markings/sec, 370 secs
lola: 106954849 markings, 536877513 edges, 302483 markings/sec, 375 secs
lola: 108416878 markings, 544244552 edges, 292406 markings/sec, 380 secs
lola: 109973812 markings, 552043287 edges, 311387 markings/sec, 385 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown unknown unknown yes yes yes yes unknown unknown no unknown yes unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p3) OR E (((1 <= p4) U ((1 <= p1) AND (1 <= p2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(((1 <= p3) OR E((1 <= p4) U ((1 <= p1) AND (1 <= p2)))))
lola: processed formula length: 59
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 731775 markings, 1845563 edges
lola: ========================================
lola: subprocess 9 will run for 452 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((A (G (((1 <= p1) AND (1 <= p2)))) U (((1 <= p5) AND (1 <= p6)) OR (1 <= p3)))) OR (1 <= p3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: (E(AG(((1 <= p1) AND (1 <= p2))) U (((1 <= p5) AND (1 <= p6)) OR (1 <= p3))) OR (1 <= p3))
lola: processed formula length: 91
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 715393 markings, 1771655 edges
lola: subprocess 10 will run for 527 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (G ((((1 <= p1) AND (1 <= p2)) OR ((1 <= p4) AND (1 <= p6))))) OR (1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AG((((1 <= p1) AND (1 <= p2)) OR ((1 <= p4) AND (1 <= p6)))) OR (1 <= p8)))
lola: processed formula length: 80
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 715393 markings, 1771655 edges
lola: ========================================
lola: subprocess 11 will run for 632 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((1 <= p4))) OR (1 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 632 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p7)
lola: processed formula length: 9
lola: 31 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 12 will run for 791 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p4 <= 0)
lola: processed formula length: 9
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= 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-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-12-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 65 markings, 64 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 791 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((p3 <= 0))) AND A (F (((1 <= p4) AND (1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 791 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p3 <= 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 ((p3 <= 0)))
lola: processed formula length: 17
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p3 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-12-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: ========================================
lola: subprocess 13 will run for 1054 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p4) AND (1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((p4 <= 0) OR (p6 <= 0))
lola: processed formula length: 25
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p4) AND (1 <= p6))
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 eventually occurs.
lola: 65 markings, 64 edges
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-13-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 1054 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p1) AND (1 <= p2)) U ((p8 <= 0) AND ((p1 <= 0) OR (p2 <= 0)) AND ((p4 <= 0) OR (p6 <= 0) OR (p5 <= 0)))))
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 ((((1 <= p1) AND (1 <= p2)) U ((p8 <= 0) AND ((p1 <= 0) OR (p2 <= 0)) AND ((p4 <= 0) OR (p6 <= 0) OR (p5 <= 0)))))
lola: processed formula length: 119
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /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: ((p8 <= 0) AND ((p1 <= 0) OR (p2 <= 0)) AND ((p4 <= 0) OR (p6 <= 0) OR (p5 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 18 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-13-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 3275500 markings, 9026252 edges, 655100 markings/sec, 0 secs
lola: sara is running 5 secs || 6076367 markings, 17095334 edges, 560173 markings/sec, 5 secs
lola: sara is running 10 secs || 8698032 markings, 24690743 edges, 524333 markings/sec, 10 secs
lola: sara is running 15 secs || 11182410 markings, 31907582 edges, 496876 markings/sec, 15 secs
lola: sara is running 20 secs || 13781970 markings, 39461381 edges, 519912 markings/sec, 20 secs
lola: sara is running 25 secs || 16278794 markings, 46749726 edges, 499365 markings/sec, 25 secs
lola: sara is running 30 secs || 18758374 markings, 53988346 edges, 495916 markings/sec, 30 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 19914660 markings, 57335958 edges
lola: subprocess 14 will run for 1563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (F ((1 <= p4))) AND ((1 <= p1) AND (1 <= p2))) OR (E (F ((1 <= p8))) AND A (G (((p3 <= 0) OR (p1 <= 0) OR (p2 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 14 will run for 1563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((1 <= p8)))
lola: processed formula length: 17
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p8)
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: state equation: write sara problem file to CTLFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-14-0.sara.
sara: place or transition ordering is non-deterministic

lola: ========================================
lola: subprocess 15 will run for 3127 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p4 <= 0)
lola: processed formula length: 9
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= 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-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 65 markings, 64 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p3 <= 0) OR (p1 <= 0) OR (p2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p3 <= 0) OR (p1 <= 0) OR (p2 <= 0))))
lola: processed formula length: 47
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p3) AND (1 <= p1) AND (1 <= p2))
lola: result: no
lola: produced by: state space
lola: state equation task get result unparse finished id 0
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: 6 markings, 5 edges
lola: state equation: write sara problem file to CTLFireability-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-17-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3127 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((p3 <= 0) OR (p8 <= 0)) AND (((1 <= p4) AND (1 <= p6)) OR (1 <= p3))))) OR A (G (((1 <= p2) AND (1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3127 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p2) AND (1 <= p5))))
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 <= p2) AND (1 <= p5))))
lola: processed formula length: 33
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: ((p2 <= 0) OR (p5 <= 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-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((E (F ((1 <= p8))) U A (G ((p7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((1 <= p8)) U AG((p7 <= 0)))
lola: processed formula length: 32
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1902954 markings, 9211331 edges, 380591 markings/sec, 0 secs
lola: 3554273 markings, 17508741 edges, 330264 markings/sec, 5 secs
lola: 5144810 markings, 25479513 edges, 318107 markings/sec, 10 secs
lola: 6465304 markings, 32097448 edges, 264099 markings/sec, 15 secs
lola: 7787359 markings, 38732653 edges, 264411 markings/sec, 20 secs
lola: 9392108 markings, 46764962 edges, 320950 markings/sec, 25 secs
lola: 10911035 markings, 54379740 edges, 303785 markings/sec, 30 secs
lola: 12463922 markings, 62179149 edges, 310577 markings/sec, 35 secs
lola: 14078461 markings, 70277196 edges, 322908 markings/sec, 40 secs
lola: 15678462 markings, 78277943 edges, 320000 markings/sec, 45 secs
lola: 17201950 markings, 85943958 edges, 304698 markings/sec, 50 secs
lola: 18807507 markings, 93995089 edges, 321111 markings/sec, 55 secs
lola: 20432651 markings, 102156491 edges, 325029 markings/sec, 60 secs
lola: 21998256 markings, 110017245 edges, 313121 markings/sec, 65 secs
lola: 23549052 markings, 117754477 edges, 310159 markings/sec, 70 secs
lola: 25082637 markings, 125480854 edges, 306717 markings/sec, 75 secs
lola: 26642340 markings, 133279224 edges, 311941 markings/sec, 80 secs
lola: 28152895 markings, 140860339 edges, 302111 markings/sec, 85 secs
lola: 29648543 markings, 148384589 edges, 299130 markings/sec, 90 secs
lola: 31224971 markings, 156270384 edges, 315286 markings/sec, 95 secs
lola: 32734400 markings, 163861518 edges, 301886 markings/sec, 100 secs
lola: 34294312 markings, 171683790 edges, 311982 markings/sec, 105 secs
lola: 35833866 markings, 179392875 edges, 307911 markings/sec, 110 secs
lola: 37360464 markings, 187076200 edges, 305320 markings/sec, 115 secs
lola: 38911845 markings, 194875851 edges, 310276 markings/sec, 120 secs
lola: 40435937 markings, 202486140 edges, 304818 markings/sec, 125 secs
lola: 41950126 markings, 210106593 edges, 302838 markings/sec, 130 secs
lola: 43445531 markings, 217671246 edges, 299081 markings/sec, 135 secs
lola: 44973286 markings, 225298113 edges, 305551 markings/sec, 140 secs
lola: 46526327 markings, 233065251 edges, 310608 markings/sec, 145 secs
lola: 48037542 markings, 240665612 edges, 302243 markings/sec, 150 secs
lola: 49572979 markings, 248406877 edges, 307087 markings/sec, 155 secs
lola: 51137907 markings, 256303189 edges, 312986 markings/sec, 160 secs
lola: 52694068 markings, 264101672 edges, 311232 markings/sec, 165 secs
lola: 54164335 markings, 271513168 edges, 294053 markings/sec, 170 secs
lola: 55705467 markings, 279219168 edges, 308226 markings/sec, 175 secs
lola: 57208200 markings, 286750177 edges, 300547 markings/sec, 180 secs
lola: 58698405 markings, 294244538 edges, 298041 markings/sec, 185 secs
lola: 60177054 markings, 301687427 edges, 295730 markings/sec, 190 secs
lola: 61679654 markings, 309255732 edges, 300520 markings/sec, 195 secs
lola: 63213199 markings, 316960443 edges, 306709 markings/sec, 200 secs
lola: 64747406 markings, 324671941 edges, 306841 markings/sec, 205 secs
lola: 66319621 markings, 332514241 edges, 314443 markings/sec, 210 secs
lola: 67833772 markings, 340098473 edges, 302830 markings/sec, 215 secs
lola: 69324925 markings, 347607612 edges, 298231 markings/sec, 220 secs
lola: 70822673 markings, 355176681 edges, 299550 markings/sec, 225 secs
lola: 72320773 markings, 362697324 edges, 299620 markings/sec, 230 secs
lola: 73828620 markings, 370295543 edges, 301569 markings/sec, 235 secs
lola: 75338409 markings, 377890691 edges, 301958 markings/sec, 240 secs
lola: 76869035 markings, 385604585 edges, 306125 markings/sec, 245 secs
lola: 78377554 markings, 393172784 edges, 301704 markings/sec, 250 secs
lola: 79909701 markings, 400867536 edges, 306429 markings/sec, 255 secs
lola: 81471303 markings, 408643243 edges, 312320 markings/sec, 260 secs
lola: 82906535 markings, 415907958 edges, 287046 markings/sec, 265 secs
lola: 84388765 markings, 423376589 edges, 296446 markings/sec, 270 secs
lola: 85880450 markings, 430866074 edges, 298337 markings/sec, 275 secs
lola: 87362738 markings, 438289290 edges, 296458 markings/sec, 280 secs
lola: 88810054 markings, 445606293 edges, 289463 markings/sec, 285 secs
lola: 90254023 markings, 452885351 edges, 288794 markings/sec, 290 secs
lola: 91776999 markings, 460459060 edges, 304595 markings/sec, 295 secs
lola: 93185944 markings, 467627984 edges, 281789 markings/sec, 300 secs
lola: 94681158 markings, 475176239 edges, 299043 markings/sec, 305 secs
lola: 96262799 markings, 483033000 edges, 316328 markings/sec, 310 secs
lola: 97795611 markings, 490743664 edges, 306562 markings/sec, 315 secs
lola: 99288523 markings, 498315676 edges, 298582 markings/sec, 320 secs
lola: 100810434 markings, 505953962 edges, 304382 markings/sec, 325 secs
lola: 102290055 markings, 513471571 edges, 295924 markings/sec, 330 secs
lola: 103815753 markings, 521112318 edges, 305140 markings/sec, 335 secs
lola: 105303492 markings, 528636183 edges, 297548 markings/sec, 340 secs
lola: 106869955 markings, 536457932 edges, 313293 markings/sec, 345 secs
lola: 108394287 markings, 544130234 edges, 304866 markings/sec, 350 secs
lola: 109968026 markings, 552015858 edges, 314748 markings/sec, 355 secs
lola: 111377966 markings, 559169990 edges, 281988 markings/sec, 360 secs
lola: 112659776 markings, 565598964 edges, 256362 markings/sec, 365 secs
lola: 113769394 markings, 571187369 edges, 221924 markings/sec, 370 secs
lola: 114641509 markings, 575594419 edges, 174423 markings/sec, 375 secs
lola: 115873900 markings, 581789647 edges, 246478 markings/sec, 380 secs
lola: 116842260 markings, 586658855 edges, 193672 markings/sec, 385 secs
lola: 117835358 markings, 591639572 edges, 198620 markings/sec, 390 secs
lola: 118767151 markings, 596360806 edges, 186359 markings/sec, 395 secs
lola: 119908011 markings, 602073336 edges, 228172 markings/sec, 400 secs
lola: 120815783 markings, 606637094 edges, 181554 markings/sec, 405 secs
lola: 121888548 markings, 612049594 edges, 214553 markings/sec, 410 secs
lola: 122852656 markings, 616907950 edges, 192822 markings/sec, 415 secs
lola: 124069463 markings, 623064069 edges, 243361 markings/sec, 420 secs
lola: 125198870 markings, 628716991 edges, 225881 markings/sec, 425 secs
lola: 126401245 markings, 634694942 edges, 240475 markings/sec, 430 secs
lola: 127601725 markings, 640738707 edges, 240096 markings/sec, 435 secs
lola: 128772591 markings, 646613300 edges, 234173 markings/sec, 440 secs
lola: 129621229 markings, 650895779 edges, 169728 markings/sec, 445 secs
lola: 130651240 markings, 656084957 edges, 206002 markings/sec, 450 secs
lola: 131696038 markings, 661359841 edges, 208960 markings/sec, 455 secs
lola: 132626265 markings, 666028980 edges, 186045 markings/sec, 460 secs
lola: 133674441 markings, 671319099 edges, 209635 markings/sec, 465 secs
lola: 134926037 markings, 677628113 edges, 250319 markings/sec, 470 secs
lola: 135877291 markings, 682440737 edges, 190251 markings/sec, 475 secs
lola: 136619078 markings, 686198008 edges, 148357 markings/sec, 480 secs
lola: 137233651 markings, 689303548 edges, 122915 markings/sec, 485 secs
lola: 137896995 markings, 692623510 edges, 132669 markings/sec, 490 secs
lola: 138962846 markings, 697983810 edges, 213170 markings/sec, 495 secs
lola: 139976081 markings, 703102175 edges, 202647 markings/sec, 500 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((A (F ((1 <= p4))) AND ((1 <= p1) AND (1 <= p2))) OR (E (F ((1 <= p8))) AND A (G (((p3 <= 0) OR (p1 <= 0) OR (p2 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((1 <= p8)))
lola: processed formula length: 17
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p8)
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: state equation: write sara problem file to CTLFireability-17-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p4 <= 0)
lola: processed formula length: 9
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p4)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 65 markings, 64 edges
lola: state equation: write sara problem file to CTLFireability-18-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((1 <= p1) AND (1 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((1 <= p1) AND (1 <= p2))
lola: processed formula length: 25
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 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
sara: try reading problem file CTLFireability-18-0.sara.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
sara: try reading problem file CTLFireability-17-0.sara.
lola: ========================================
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: ========================================


lola: ...considering subproblem: (A (F ((((p3 <= 0) OR (p8 <= 0)) AND (((1 <= p4) AND (1 <= p6)) OR (1 <= p3))))) OR A (G (((1 <= p2) AND (1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p2) AND (1 <= p5))))
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 <= p2) AND (1 <= p5))))
lola: processed formula length: 33
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: ((p2 <= 0) OR (p5 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLFireability-18-0.sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((((p3 <= 0) OR (p8 <= 0)) AND (((1 <= p4) AND (1 <= p6)) OR (1 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p3) AND (1 <= p8)) OR (((p4 <= 0) OR (p6 <= 0)) AND (p3 <= 0)))
lola: processed formula length: 73
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p3 <= 0) OR (p8 <= 0)) AND (((1 <= p4) AND (1 <= p6)) OR (1 <= p3)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 65 markings, 64 edges
lola: state equation: write sara problem file to CTLFireability-19-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-19-0.sara.
sara: place or transition ordering is non-deterministic

lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes no yes yes yes yes unknown no no yes yes no yes
lola:
preliminary result: yes no yes yes no yes yes yes yes unknown no no yes yes no yes
lola: memory consumption: 3888 KB
lola: time consumption: 954 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="SmallOperatingSystem-PT-MT0128DC0064"
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 SmallOperatingSystem-PT-MT0128DC0064, 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 r194-csrt-159033389400052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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