Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033478000796.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ShieldRVs-PT-004A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033478000796
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.6K May 14 02:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 02:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 19:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 19:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 4.1K May 13 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 13 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 13 09:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 09:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 25K May 12 20:42 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 ShieldRVs-PT-004A-CTLFireability-00
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-01
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-02
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-03
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-04
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-05
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-06
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-07
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-08
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-09
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-10
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-11
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-12
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-13
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-14
FORMULA_NAME ShieldRVs-PT-004A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591326848136

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 03:14:10] [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-05 03:14:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 03:14:10] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2020-06-05 03:14:10] [INFO ] Transformed 59 places.
[2020-06-05 03:14:10] [INFO ] Transformed 79 transitions.
[2020-06-05 03:14:10] [INFO ] Found NUPN structural information;
[2020-06-05 03:14:10] [INFO ] Parsed PT model containing 59 places and 79 transitions in 73 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Incomplete random walk after 100000 steps, including 1531 resets, run finished after 180 ms. (steps per millisecond=555 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 79 rows 59 cols
[2020-06-05 03:14:10] [INFO ] Computed 17 place invariants in 4 ms
[2020-06-05 03:14:10] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-05 03:14:10] [INFO ] Flatten gal took : 41 ms
[2020-06-05 03:14:10] [INFO ] Flatten gal took : 23 ms
[2020-06-05 03:14:10] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2020-06-05 03:14:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ShieldRVs-PT-004A @ 3570 seconds

FORMULA ShieldRVs-PT-004A-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2268
rslt: Output for CTLFireability @ ShieldRVs-PT-004A

{
"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": "Fri Jun 5 03:14:11 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AF(AX(((1 <= p6) AND (1 <= p7) AND (1 <= p11))))",
"processed_size": 48,
"rewrites": 33
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 78,
"markings": 78,
"produced_by": "CTL model checker",
"value": false
},
"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": 3,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "EX(AF((((1 <= p24)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p15)) OR ((1 <= p47) AND (1 <= p49) AND (1 <= p53)))))",
"processed_size": 114,
"rewrites": 33
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 79,
"markings": 79,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "AF((AF(((1 <= p40) AND (1 <= p42) AND (1 <= p51))) OR (((p17 <= 0)) OR (((p32 <= 0)) OR ((p43 <= 0))))))",
"processed_size": 104,
"rewrites": 33
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 79,
"markings": 78,
"produced_by": "CTL model checker",
"value": true
},
"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": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EG(AX(((p38 <= 0) OR (p42 <= 0) OR (p51 <= 0))))",
"processed_size": 50,
"rewrites": 33
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 78,
"markings": 78,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 3,
"F": 2,
"G": 1,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(AX(AF(((1 <= p3) AND (1 <= p20) AND (1 <= p29) AND (1 <= p12) AND (1 <= p16) AND (1 <= p23)))) AND E(EF(((1 <= p12) AND (1 <= p14) AND (1 <= p23))) U EG(((1 <= p32)))))",
"processed_size": 169,
"rewrites": 36
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 77,
"markings": 77,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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 <= p43))",
"processed_size": 12,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AX(EX(((1 <= p17) AND (1 <= p34) AND (1 <= p43))))",
"processed_size": 50,
"rewrites": 33
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E ((((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0)) U (((1 <= p17) AND (1 <= p34) AND (1 <= p43)) OR ((1 <= p43)))))",
"processed_size": 110,
"rewrites": 34
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 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": "((p25 <= 0) OR ((1 <= p56)))",
"processed_size": 29,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((1 <= p5)) OR ((1 <= p19) AND (1 <= p21) AND (1 <= p26)) OR ((1 <= p50) AND (1 <= p55)))",
"processed_size": 92,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p33 <= 0) OR (p20 <= 0) OR (p21 <= 0) OR (p25 <= 0))",
"processed_size": 57,
"rewrites": 34
},
"result":
{
"edges": 90,
"markings": 91,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 18
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 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": "((p32 <= 0))",
"processed_size": 12,
"rewrites": 34
},
"result":
{
"edges": 3352,
"markings": 1665,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 762
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 2,
"G": 0,
"U": 1,
"X": 0,
"aconj": 6,
"adisj": 1,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "E(((((1 <= p56)) OR ((1 <= p24))) OR (AF(((1 <= p20) AND (1 <= p21) AND (1 <= p26))) OR ((1 <= p47) AND (1 <= p49) AND (1 <= p53)))) U (((1 <= p26) AND (1 <= p30) AND (1 <= p37)) AND EF(((1 <= p31) AND (1 <= p46) AND (1 <= p57)))))",
"processed_size": 232,
"rewrites": 34
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 79,
"markings": 78,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1016
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((1 <= p18) AND (1 <= p6) AND (1 <= p7) AND (1 <= p12))",
"processed_size": 55,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1524
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "((p8 <= 0) OR (p13 <= 0))",
"processed_size": 26,
"rewrites": 34
},
"result":
{
"edges": 592315,
"markings": 256009,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1524
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p20 <= 0) OR (p21 <= 0) OR (p26 <= 0))",
"processed_size": 42,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3048
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (G (((p5 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (((p2 <= 0) OR (p4 <= 0) OR (p16 <= 0)) AND ((p40 <= 0) OR (p44 <= 0) OR (p51 <= 0))))))",
"processed_size": 142,
"rewrites": 32
},
"result":
{
"edges": 75,
"markings": 75,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 35
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3048
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p2) AND (1 <= p6) AND (1 <= p15))",
"processed_size": 40,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": 5,
"visible_transitions": 0
},
"processed": "E (G (((p26 <= 0) OR (p28 <= 0) OR (p37 <= 0) OR (p52 <= 0) OR (p56 <= 0))))",
"processed_size": 80,
"rewrites": 32
},
"result":
{
"edges": 67,
"markings": 67,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 29
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": "(((p43 <= 0)) AND ((p11 <= 0)))",
"processed_size": 31,
"rewrites": 34
},
"result":
{
"edges": 836429929,
"markings": 127641980,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "E (G (((p19 <= 0) OR (p21 <= 0) OR (p26 <= 0))))",
"processed_size": 50,
"rewrites": 32
},
"result":
{
"edges": 56,
"markings": 56,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 15
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": 5,
"visible_transitions": 0
},
"processed": "E (G (((p26 <= 0) OR (p28 <= 0) OR (p37 <= 0) OR (p52 <= 0) OR (p56 <= 0))))",
"processed_size": 80,
"rewrites": 32
},
"result":
{
"edges": 67,
"markings": 67,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 29
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 57068,
"runtime": 1302.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F(A(X(**)))) : E(X(A(F(**)))) : A(F(**)) : (E(F(E(G(*)))) OR **) : (E(G(*)) AND **) : (A(F((A(F(**)) OR (** OR (** OR **))))) AND E(G(A(X(**))))) : (A(X(A(F(**)))) AND E((E(F(**)) U E(G(**))))) : A(G(E(X(*)))) : (** OR (E(G(*)) AND E(G(*)))) : A(G(E(F(*)))) : A(X(A(F(E(G(**)))))) : A(F(E((** U **)))) : (** OR A(X(E(X(**))))) : E(G(**)) : E(((** OR (A(F(**)) OR **)) U (** AND E(F(**))))) : (E((** U **)) AND ((A(F(**)) OR (E(X(**)) AND **)) AND (** OR (A(X(*)) OR **))))"
},
"net":
{
"arcs": 368,
"conflict_clusters": 11,
"places": 59,
"places_significant": 42,
"singleton_clusters": 0,
"transitions": 79
},
"result":
{
"preliminary_value": "no no no yes yes yes no no yes yes no no no yes no no ",
"value": "no no no yes yes yes no no yes yes no no no yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 138/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1888
lola: finding significant places
lola: 59 places, 79 transitions, 42 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: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: A (F (A (X (((1 <= p6) AND (1 <= p7) AND (1 <= p11)))))) : E (X (A (F ((((1 <= p24)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p15)) OR ((1 <= p47) AND (1 <= p49) AND (1 <= p53))))))) : A (F (((1 <= p32)))) : (NOT(A (G (A (F (((1 <= p8) AND (1 <= p13))))))) OR ((1 <= p18) AND (1 <= p6) AND (1 <= p7) AND (1 <= p12))) : (NOT(A (F (((1 <= p5) AND (1 <= p7) AND (1 <= p12) AND (((1 <= p2) AND (1 <= p4) AND (1 <= p16)) OR ((1 <= p40) AND (1 <= p44) AND (1 <= p51))))))) AND ((p20 <= 0) OR (p21 <= 0) OR (p26 <= 0))) : (A (F ((((A (F (((1 <= p40) AND (1 <= p42) AND (1 <= p51)))) OR ((p17 <= 0))) OR ((p32 <= 0))) OR ((p43 <= 0))))) AND E (G (A (X (((p38 <= 0) OR (p42 <= 0) OR (p51 <= 0))))))) : (A (X (A (F (((1 <= p3) AND (1 <= p20) AND (1 <= p29) AND (1 <= p12) AND (1 <= p16) AND (1 <= p23)))))) AND E ((E (F (((1 <= p12) AND (1 <= p14) AND (1 <= p23)))) U E (G (((1 <= p32))))))) : A (G (NOT(A (X (((1 <= p1) AND (1 <= p9))))))) : (((1 <= p2) AND (1 <= p6) AND (1 <= p15)) OR (NOT(A (F (((1 <= p19) AND (1 <= p21) AND (1 <= p26))))) AND NOT(A (F (((1 <= p26) AND (1 <= p28) AND (1 <= p37) AND (1 <= p52) AND (1 <= p56))))))) : NOT(E (F (A (G ((((1 <= p43)) OR ((1 <= p11)))))))) : A (X (A (F (E (G (((1 <= p19)))))))) : A (F (E ((((1 <= p56)) U ((1 <= p33) AND (1 <= p35) AND (1 <= p39)))))) : (((1 <= p43)) OR A (X (E (X (((1 <= p17) AND (1 <= p34) AND (1 <= p43))))))) : E (G (((p38 <= 0) OR (p44 <= 0) OR (p51 <= 0)))) : E (((((((1 <= p56)) OR ((1 <= p24))) OR A (F (((1 <= p20) AND (1 <= p21) AND (1 <= p26))))) OR ((1 <= p47) AND (1 <= p49) AND (1 <= p53))) U (((1 <= p26) AND (1 <= p30) AND (1 <= p37)) AND E (F (((1 <= p31) AND (1 <= p46) AND (1 <= p57))))))) : ((E ((((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0)) U (((1 <= p17) AND (1 <= p34) AND (1 <= p43)) OR ((1 <= p43))))) AND (A (F (((1 <= p33) AND (1 <= p20) AND (1 <= p21) AND (1 <= p25)))) OR (E (X (((1 <= p12) AND (1 <= p16) AND (1 <= p23)))) AND (((1 <= p5)) OR ((1 <= p19) AND (1 <= p21) AND (1 <= p26)) OR ((1 <= p50) AND (1 <= p55)))))) AND ((((p25 <= 0) OR ((1 <= p56))) OR NOT(E (X (((p12 <= 0) OR (p14 <= 0) OR (p23 <= 0)))))) OR ((1 <= p47) AND (1 <= p49) AND (1 <= p53) AND ((p15 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((1 <= p6) AND (1 <= p7) AND (1 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AX(((1 <= p6) AND (1 <= p7) AND (1 <= p11))))
lola: processed formula length: 48
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: 78 markings, 78 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((((1 <= p24)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p15)) OR ((1 <= p47) AND (1 <= p49) AND (1 <= p53)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AF((((1 <= p24)) OR ((1 <= p2) AND (1 <= p4) AND (1 <= p15)) OR ((1 <= p47) AND (1 <= p49) AND (1 <= p53)))))
lola: processed formula length: 114
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: 79 markings, 79 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((A (F (((1 <= p40) AND (1 <= p42) AND (1 <= p51)))) OR (((p17 <= 0)) OR (((p32 <= 0)) OR ((p43 <= 0))))))) AND E (G (A (X (((p38 <= 0) OR (p42 <= 0) OR (p51 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (F (((1 <= p40) AND (1 <= p42) AND (1 <= p51)))) OR (((p17 <= 0)) OR (((p32 <= 0)) OR ((p43 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AF(((1 <= p40) AND (1 <= p42) AND (1 <= p51))) OR (((p17 <= 0)) OR (((p32 <= 0)) OR ((p43 <= 0))))))
lola: processed formula length: 104
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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 78 markings, 79 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (X (((p38 <= 0) OR (p42 <= 0) OR (p51 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AX(((p38 <= 0) OR (p42 <= 0) OR (p51 <= 0))))
lola: processed formula length: 50
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: 78 markings, 78 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F (((1 <= p3) AND (1 <= p20) AND (1 <= p29) AND (1 <= p12) AND (1 <= p16) AND (1 <= p23)))))) AND E ((E (F (((1 <= p12) AND (1 <= p14) AND (1 <= p23)))) U E (G (((1 <= p32)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: (AX(AF(((1 <= p3) AND (1 <= p20) AND (1 <= p29) AND (1 <= p12) AND (1 <= p16) AND (1 <= p23)))) AND E(EF(((1 <= p12) AND (1 <= p14) AND (1 <= p23))) U EG(((1 <= p32)))))
lola: processed formula length: 169
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 4 significant temporal operators and needs 17 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 77 markings, 77 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((p1 <= 0) OR (p9 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((p1 <= 0) OR (p9 <= 0))))
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: 54 markings, 53 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (E (G (((1 <= p19))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(AF(EG(((1 <= p19)))))
lola: processed formula length: 24
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 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: 77 markings, 154 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p43)) OR A (X (E (X (((1 <= p17) AND (1 <= p34) AND (1 <= p43)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p43))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p43))
lola: processed formula length: 12
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 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (X (((1 <= p17) AND (1 <= p34) AND (1 <= p43))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EX(((1 <= p17) AND (1 <= p34) AND (1 <= p43))))
lola: processed formula length: 50
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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0)) U (((1 <= p17) AND (1 <= p34) AND (1 <= p43)) OR ((1 <= p43))))) AND ((A (F (((1 <= p33) AND (1 <= p20) AND (1 <= p21) AND (1 <= p25)))) OR (E (X (((1 <= p12) AND (1 <= p16) AND (1 <= p23)))) AND (((1 <= p5)) OR ((1 <= p19) AND (1 <= p21) AND (1 <= p26)) OR ((1 <= p50) AND (1 <= p55))))) AND (((p25 <= 0) OR ((1 <= p56))) OR (A (X (((1 <= p12) AND (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0)) U (((1 <= p17) AND (1 <= p34) AND (1 <= p43)) OR ((1 <= p43)))))
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 ((((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0)) U (((1 <= p17) AND (1 <= p34) AND (1 <= p43)) OR ((1 <= p43)))))
lola: processed formula length: 110
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: (((1 <= p17) AND (1 <= p34) AND (1 <= p43)) OR ((1 <= p43)))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p25 <= 0) OR ((1 <= p56)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p25 <= 0) OR ((1 <= p56)))
lola: processed formula length: 29
lola: 31 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
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p5)) OR ((1 <= p19) AND (1 <= p21) AND (1 <= p26)) OR ((1 <= p50) AND (1 <= p55)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p5)) OR ((1 <= p19) AND (1 <= p21) AND (1 <= p26)) OR ((1 <= p50) AND (1 <= p55)))
lola: processed formula length: 92
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 6 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 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p33) AND (1 <= p20) AND (1 <= p21) AND (1 <= p25))))
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: ((p33 <= 0) OR (p20 <= 0) OR (p21 <= 0) OR (p25 <= 0))
lola: processed formula length: 57
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 <= p33) AND (1 <= p20) AND (1 <= p21) AND (1 <= p25))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: The predicate does not eventually occur.
lola: 91 markings, 90 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p32))))
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: ((p32 <= 0))
lola: processed formula length: 12
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 <= p32))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 1665 markings, 3352 edges
lola: state equation: write sara problem file to CTLFireability-8-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((((p43 <= 0)) AND ((p11 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (((p43 <= 0)) AND ((p11 <= 0)))
lola: processed formula length: 31
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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p43)) OR ((1 <= p11)))
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 task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p43 <= 0)) AND ((p11 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
sara: try reading problem file CTLFireability-8-0.sara.
lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation: write sara problem file to CTLFireability-9-1.sara
lola: state equation: calling and running sara

sara: try reading problem file CTLFireability-9-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1237980 markings, 7004903 edges, 247596 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2428933 markings, 13639343 edges, 238191 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 3630440 markings, 20771205 edges, 240301 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 4700693 markings, 27404633 edges, 214051 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 5688769 markings, 33594965 edges, 197615 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 6718558 markings, 40122300 edges, 205958 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 7676253 markings, 46223034 edges, 191539 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 8607431 markings, 51992732 edges, 186236 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 9495795 markings, 57506220 edges, 177673 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 10304784 markings, 63252903 edges, 161798 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 11112461 markings, 68763990 edges, 161535 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 12089619 markings, 73802815 edges, 195432 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 12962197 markings, 79313368 edges, 174516 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 13753528 markings, 84224412 edges, 158266 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 14545762 markings, 89076244 edges, 158447 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 15337087 markings, 94162667 edges, 158265 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 16212631 markings, 99310637 edges, 175109 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 16980889 markings, 104169611 edges, 153652 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 17805553 markings, 109203639 edges, 164933 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 18646946 markings, 114695531 edges, 168279 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 19474294 markings, 120116104 edges, 165470 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 20255170 markings, 125378881 edges, 156175 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 21033821 markings, 130347626 edges, 155730 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 21717482 markings, 135303359 edges, 136732 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 22468106 markings, 140655817 edges, 150125 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 23173007 markings, 145524004 edges, 140980 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 23968337 markings, 150891889 edges, 159066 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 24686175 markings, 155939906 edges, 143568 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 25506831 markings, 161248527 edges, 164131 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 26429841 markings, 166188932 edges, 184602 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 27144833 markings, 170901554 edges, 142998 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 27944902 markings, 175672527 edges, 160014 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 28648095 markings, 180579320 edges, 140639 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 29492646 markings, 186025994 edges, 168910 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 30248928 markings, 191365354 edges, 151256 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 30985404 markings, 196541047 edges, 147295 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 31792965 markings, 201945247 edges, 161512 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 32534697 markings, 207212936 edges, 148346 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 33258382 markings, 212248000 edges, 144737 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 34025162 markings, 217172821 edges, 153356 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 34766203 markings, 222345627 edges, 148208 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 35609573 markings, 228139685 edges, 168674 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 36445434 markings, 233989653 edges, 167172 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 37229917 markings, 239766073 edges, 156897 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 38160078 markings, 245632098 edges, 186032 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 38974952 markings, 250485832 edges, 162975 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 39787892 markings, 255771671 edges, 162588 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 40514539 markings, 260549052 edges, 145329 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 41194311 markings, 265098151 edges, 135954 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 41849376 markings, 269633219 edges, 131013 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 42535803 markings, 273946816 edges, 137285 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 43160073 markings, 278605012 edges, 124854 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 43766341 markings, 283052520 edges, 121254 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 44437820 markings, 287705728 edges, 134296 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 45150739 markings, 292390041 edges, 142584 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 45991281 markings, 298000191 edges, 168108 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 46873983 markings, 303369995 edges, 176540 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 47754257 markings, 309327915 edges, 176055 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 48579580 markings, 314814634 edges, 165065 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 49430568 markings, 320318429 edges, 170198 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 50216870 markings, 325728051 edges, 157260 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 51070351 markings, 331224651 edges, 170696 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 51899585 markings, 336795987 edges, 165847 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 52783779 markings, 342593758 edges, 176839 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 53668512 markings, 348366656 edges, 176947 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 54494015 markings, 354267624 edges, 165101 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 55284748 markings, 359969945 edges, 158147 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 56029419 markings, 365414614 edges, 148934 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 56790194 markings, 371344858 edges, 152155 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 57591508 markings, 377450612 edges, 160263 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 58406858 markings, 383496336 edges, 163070 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 59280019 markings, 389343582 edges, 174632 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 60056561 markings, 395040733 edges, 155308 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 60819160 markings, 400282849 edges, 152520 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 61641963 markings, 405483899 edges, 164561 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 62477232 markings, 410401016 edges, 167054 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 63396274 markings, 415815888 edges, 183808 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 64364341 markings, 421393761 edges, 193613 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 65192793 markings, 426727745 edges, 165690 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 66027916 markings, 431987243 edges, 167025 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 66832680 markings, 437361437 edges, 160953 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 67691648 markings, 442789580 edges, 171794 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 68607616 markings, 448245680 edges, 183194 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 69454191 markings, 453750509 edges, 169315 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 70262806 markings, 459493703 edges, 161723 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 71107223 markings, 465088581 edges, 168883 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 72155461 markings, 470641799 edges, 209648 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 73032811 markings, 476230248 edges, 175470 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 73856269 markings, 481446311 edges, 164692 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 74672980 markings, 486699634 edges, 163342 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 75655529 markings, 491947100 edges, 196510 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 76580435 markings, 497204986 edges, 184981 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 77428953 markings, 502379221 edges, 169704 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 78273306 markings, 507456745 edges, 168871 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 79131332 markings, 512123344 edges, 171605 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 79822099 markings, 516448875 edges, 138153 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 80568943 markings, 520856466 edges, 149369 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 81282956 markings, 525240749 edges, 142803 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 81985091 markings, 529361509 edges, 140427 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 82758976 markings, 533599523 edges, 154777 markings/sec, 495 secs
lola: sara is running 500 secs || sara is running 500 secs || 83583060 markings, 538263724 edges, 164817 markings/sec, 500 secs
lola: local time limit reached - aborting
lola:
preliminary result: no no no unknown unknown yes no no unknown unknown no unknown no unknown unknown no
lola: memory consumption: 3277196 KB
lola: time consumption: 512 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p38 <= 0) OR (p44 <= 0) OR (p51 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p38 <= 0) OR (p44 <= 0) OR (p51 <= 0))))
lola: processed formula length: 50
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p38) AND (1 <= p44) AND (1 <= p51))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 71 markings, 71 edges
lola: state equation: write sara problem file to CTLFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: ========================================

lola: subprocess 11 will run for 611 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E ((((1 <= p56)) U ((1 <= p33) AND (1 <= p35) AND (1 <= p39))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(E(((1 <= p56)) U ((1 <= p33) AND (1 <= p35) AND (1 <= p39))))
lola: processed formula length: 64
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: 1988014 markings, 6522854 edges, 397603 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 3546322 markings, 11388458 edges
lola: ========================================
lola: subprocess 12 will run for 762 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((((1 <= p56)) OR ((1 <= p24))) OR (A (F (((1 <= p20) AND (1 <= p21) AND (1 <= p26)))) OR ((1 <= p47) AND (1 <= p49) AND (1 <= p53)))) U (((1 <= p26) AND (1 <= p30) AND (1 <= p37)) AND E (F (((1 <= p31) AND (1 <= p46) AND (1 <= p57)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((((1 <= p56)) OR ((1 <= p24))) OR (AF(((1 <= p20) AND (1 <= p21) AND (1 <= p26))) OR ((1 <= p47) AND (1 <= p49) AND (1 <= p53)))) U (((1 <= p26) AND (1 <= p30) AND (1 <= p37)) AND EF(((1 <= p31) AND (1 <= p46) AND (1 <= p57)))))
lola: processed formula length: 232
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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 78 markings, 79 edges
lola: ========================================
lola: subprocess 13 will run for 1016 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (E (G (((p8 <= 0) OR (p13 <= 0)))))) OR ((1 <= p18) AND (1 <= p6) AND (1 <= p7) AND (1 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1016 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p18) AND (1 <= p6) AND (1 <= p7) AND (1 <= p12))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p18) AND (1 <= p6) AND (1 <= p7) AND (1 <= p12))
lola: processed formula length: 55
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1524 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((p8 <= 0) OR (p13 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: ((p8 <= 0) OR (p13 <= 0))
lola: processed formula length: 26
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p8 <= 0) OR (p13 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p8) AND (1 <= p13))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-14-1.sara.
lola: state equation: write sara problem file to CTLFireability-14-0.sara
sara: place or transition ordering is non-deterministic

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: state equation 1: solution produced
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 256009 markings, 592315 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1524 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((p5 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (((p2 <= 0) OR (p4 <= 0) OR (p16 <= 0)) AND ((p40 <= 0) OR (p44 <= 0) OR (p51 <= 0)))))) AND ((p20 <= 0) OR (p21 <= 0) OR (p26 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1524 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p20 <= 0) OR (p21 <= 0) OR (p26 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p20 <= 0) OR (p21 <= 0) OR (p26 <= 0))
lola: processed formula length: 42
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3048 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p5 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (((p2 <= 0) OR (p4 <= 0) OR (p16 <= 0)) AND ((p40 <= 0) OR (p44 <= 0) OR (p51 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p5 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (((p2 <= 0) OR (p4 <= 0) OR (p16 <= 0)) AND ((p40 <= 0) OR (p44 <= 0) OR (p51 <= 0))))))
lola: processed formula length: 142
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p5) AND (1 <= p7) AND (1 <= p12) AND (((1 <= p2) AND (1 <= p4) AND (1 <= p16)) OR ((1 <= p40) AND (1 <= p44) AND (1 <= p51))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 2 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 is possibly preserved.
lola: 75 markings, 75 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 3048 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p2) AND (1 <= p6) AND (1 <= p15)) OR (E (G (((p19 <= 0) OR (p21 <= 0) OR (p26 <= 0)))) AND E (G (((p26 <= 0) OR (p28 <= 0) OR (p37 <= 0) OR (p52 <= 0) OR (p56 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3048 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p2) AND (1 <= p6) AND (1 <= p15))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p2) AND (1 <= p6) AND (1 <= p15))
lola: processed formula length: 40
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p26 <= 0) OR (p28 <= 0) OR (p37 <= 0) OR (p52 <= 0) OR (p56 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p26 <= 0) OR (p28 <= 0) OR (p37 <= 0) OR (p52 <= 0) OR (p56 <= 0))))
lola: processed formula length: 80
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p26) AND (1 <= p28) AND (1 <= p37) AND (1 <= p52) AND (1 <= p56))
lola: state equation task get result unparse finished id 0
lola: The predicate is possibly preserved.
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: 67 markings, 67 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((((p43 <= 0)) AND ((p11 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (((p43 <= 0)) AND ((p11 <= 0)))
lola: processed formula length: 31
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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p43)) OR ((1 <= p11)))
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 task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p43 <= 0)) AND ((p11 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-16-0.sara.
lola: state equation: write sara problem file to CTLFireability-16-1.sara
sara: place or transition ordering is non-deterministic

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

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1270183 markings, 7204743 edges, 254037 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2496123 markings, 14003350 edges, 245188 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 3620880 markings, 20702695 edges, 224951 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 4593713 markings, 26712924 edges, 194567 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 5598147 markings, 33052896 edges, 200887 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 6525026 markings, 38936669 edges, 185376 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 7420874 markings, 44767872 edges, 179170 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 8437412 markings, 50941839 edges, 203308 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 9357403 markings, 56718873 edges, 183998 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 10228935 markings, 62726362 edges, 174306 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 11101252 markings, 68715570 edges, 174463 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 12241758 markings, 74740391 edges, 228101 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 13236705 markings, 81118253 edges, 198989 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 14236739 markings, 87142547 edges, 200007 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 15198885 markings, 93298106 edges, 192429 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 16206439 markings, 99265571 edges, 201511 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 17160561 markings, 105394945 edges, 190824 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 18202471 markings, 111701926 edges, 208382 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 19175980 markings, 118085675 edges, 194702 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 20108143 markings, 124340435 edges, 186433 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 21033352 markings, 130345258 edges, 185042 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 21847373 markings, 136335396 edges, 162804 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 22771708 markings, 142642909 edges, 184867 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 23682216 markings, 148936236 edges, 182102 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 24563191 markings, 155057785 edges, 176195 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 25517294 markings, 161313679 edges, 190821 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 26612060 markings, 167422113 edges, 218953 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 27558917 markings, 173361913 edges, 189371 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 28461736 markings, 179148464 edges, 180564 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 29336935 markings, 184989563 edges, 175040 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 30184050 markings, 190989782 edges, 169423 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 31019222 markings, 196814547 edges, 167034 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 31988570 markings, 203303018 edges, 193870 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 32858423 markings, 209595802 edges, 173971 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 33807588 markings, 215684808 edges, 189833 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 34728826 markings, 222121795 edges, 184248 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 35620298 markings, 228185843 edges, 178294 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 36414191 markings, 233786364 edges, 158779 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 37183453 markings, 239433755 edges, 153852 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 38096493 markings, 245248821 edges, 182608 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 39019752 markings, 250737882 edges, 184652 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 39918209 markings, 256681554 edges, 179691 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 40734359 markings, 261992569 edges, 163230 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 41527743 markings, 267415020 edges, 158677 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 42390808 markings, 273104831 edges, 172613 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 43157559 markings, 278587642 edges, 153350 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 43870029 markings, 283748097 edges, 142494 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 44595895 markings, 288755435 edges, 145173 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 45342594 markings, 293690335 edges, 149340 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 46047255 markings, 298349476 edges, 140932 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 46767072 markings, 302653834 edges, 143963 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 47492994 markings, 307565361 edges, 145184 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 48150855 markings, 312095138 edges, 131572 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 48847834 markings, 316281583 edges, 139396 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 49504823 markings, 320839497 edges, 131398 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 50093907 markings, 324853546 edges, 117817 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 50731816 markings, 329289093 edges, 127582 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 51465190 markings, 333751261 edges, 146675 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 52162642 markings, 338563426 edges, 139490 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 52979568 markings, 343833230 edges, 163385 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 53839530 markings, 349495995 edges, 171992 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 54614713 markings, 355250985 edges, 155037 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 55358064 markings, 360384644 edges, 148670 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 56055350 markings, 365620132 edges, 139457 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 56677885 markings, 370389951 edges, 124507 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 57331681 markings, 375448679 edges, 130759 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 57999287 markings, 380411463 edges, 133521 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 58707554 markings, 385508005 edges, 141653 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 59446954 markings, 390506320 edges, 147880 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 60132011 markings, 395583390 edges, 137011 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 60885020 markings, 400779716 edges, 150602 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 61695597 markings, 405836609 edges, 162115 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 62453015 markings, 410251983 edges, 151484 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 63304806 markings, 415282819 edges, 170358 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 64181928 markings, 420176796 edges, 175424 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 64844974 markings, 424896418 edges, 132609 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 65692314 markings, 429542443 edges, 169468 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 66334454 markings, 434138598 edges, 128428 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 67092474 markings, 438988163 edges, 151604 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 67862835 markings, 443782127 edges, 154072 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 68713624 markings, 448938890 edges, 170158 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 69520347 markings, 454154495 edges, 161345 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 70202951 markings, 458992847 edges, 136521 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 70757349 markings, 463190165 edges, 110880 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 71574210 markings, 467457125 edges, 163372 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 72444265 markings, 472482138 edges, 174011 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 73205860 markings, 477269138 edges, 152319 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 73900764 markings, 481741783 edges, 138981 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 74609636 markings, 486274577 edges, 141774 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 75430772 markings, 490753005 edges, 164227 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 76262230 markings, 495488904 edges, 166292 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 77065267 markings, 500193366 edges, 160607 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 77816869 markings, 504780690 edges, 150320 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 78652109 markings, 509463572 edges, 167048 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 79531807 markings, 514574212 edges, 175940 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 80377942 markings, 519792636 edges, 169227 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 81265373 markings, 525123069 edges, 177486 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 82149382 markings, 530219392 edges, 176802 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 83121863 markings, 535543493 edges, 194496 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 84027449 markings, 541374170 edges, 181117 markings/sec, 495 secs
lola: sara is running 500 secs || sara is running 500 secs || 84859546 markings, 546944162 edges, 166419 markings/sec, 500 secs
lola: sara is running 505 secs || sara is running 505 secs || 85619341 markings, 552543500 edges, 151959 markings/sec, 505 secs
lola: sara is running 510 secs || sara is running 510 secs || 86383602 markings, 558057850 edges, 152852 markings/sec, 510 secs
lola: sara is running 515 secs || sara is running 515 secs || 87148290 markings, 562947888 edges, 152938 markings/sec, 515 secs
lola: sara is running 520 secs || sara is running 520 secs || 87833996 markings, 568114425 edges, 137141 markings/sec, 520 secs
lola: sara is running 525 secs || sara is running 525 secs || 88628527 markings, 573625027 edges, 158906 markings/sec, 525 secs
lola: sara is running 530 secs || sara is running 530 secs || 89405203 markings, 579226475 edges, 155335 markings/sec, 530 secs
lola: sara is running 535 secs || sara is running 535 secs || 90173598 markings, 584487966 edges, 153679 markings/sec, 535 secs
lola: sara is running 540 secs || sara is running 540 secs || 90882835 markings, 589960116 edges, 141847 markings/sec, 540 secs
lola: sara is running 545 secs || sara is running 545 secs || 91680998 markings, 595581913 edges, 159633 markings/sec, 545 secs
lola: sara is running 550 secs || sara is running 550 secs || 92489613 markings, 601014439 edges, 161723 markings/sec, 550 secs
lola: sara is running 555 secs || sara is running 555 secs || 93234770 markings, 606512533 edges, 149031 markings/sec, 555 secs
lola: sara is running 560 secs || sara is running 560 secs || 93963673 markings, 611882190 edges, 145781 markings/sec, 560 secs
lola: sara is running 565 secs || sara is running 565 secs || 94734632 markings, 617385429 edges, 154192 markings/sec, 565 secs
lola: sara is running 570 secs || sara is running 570 secs || 95503287 markings, 622742256 edges, 153731 markings/sec, 570 secs
lola: sara is running 575 secs || sara is running 575 secs || 96277316 markings, 628293386 edges, 154806 markings/sec, 575 secs
lola: sara is running 580 secs || sara is running 580 secs || 96980693 markings, 633593941 edges, 140675 markings/sec, 580 secs
lola: sara is running 585 secs || sara is running 585 secs || 97719699 markings, 638725887 edges, 147801 markings/sec, 585 secs
lola: sara is running 590 secs || sara is running 590 secs || 98522485 markings, 644102642 edges, 160557 markings/sec, 590 secs
lola: sara is running 595 secs || sara is running 595 secs || 99287889 markings, 649694480 edges, 153081 markings/sec, 595 secs
lola: sara is running 600 secs || sara is running 600 secs || 100100263 markings, 655368823 edges, 162475 markings/sec, 600 secs
lola: sara is running 605 secs || sara is running 605 secs || 100883128 markings, 661170155 edges, 156573 markings/sec, 605 secs
lola: sara is running 610 secs || sara is running 610 secs || 101660028 markings, 666903875 edges, 155380 markings/sec, 610 secs
lola: sara is running 615 secs || sara is running 615 secs || 102460820 markings, 672785386 edges, 160158 markings/sec, 615 secs
lola: sara is running 620 secs || sara is running 620 secs || 103225704 markings, 678191135 edges, 152977 markings/sec, 620 secs
lola: sara is running 625 secs || sara is running 625 secs || 103970245 markings, 683154827 edges, 148908 markings/sec, 625 secs
lola: sara is running 630 secs || sara is running 630 secs || 104696991 markings, 688092559 edges, 145349 markings/sec, 630 secs
lola: sara is running 635 secs || sara is running 635 secs || 105423392 markings, 693213451 edges, 145280 markings/sec, 635 secs
lola: sara is running 640 secs || sara is running 640 secs || 106118449 markings, 698305621 edges, 139011 markings/sec, 640 secs
lola: sara is running 645 secs || sara is running 645 secs || 106837865 markings, 703399316 edges, 143883 markings/sec, 645 secs
lola: sara is running 650 secs || sara is running 650 secs || 107691522 markings, 708966422 edges, 170731 markings/sec, 650 secs
lola: sara is running 655 secs || sara is running 655 secs || 108558541 markings, 714468773 edges, 173404 markings/sec, 655 secs
lola: sara is running 660 secs || sara is running 660 secs || 109392602 markings, 719850130 edges, 166812 markings/sec, 660 secs
lola: sara is running 665 secs || sara is running 665 secs || 110320091 markings, 725097896 edges, 185498 markings/sec, 665 secs
lola: sara is running 670 secs || sara is running 670 secs || 111119556 markings, 730418291 edges, 159893 markings/sec, 670 secs
lola: sara is running 675 secs || sara is running 675 secs || 111887746 markings, 735587908 edges, 153638 markings/sec, 675 secs
lola: sara is running 680 secs || sara is running 680 secs || 112743745 markings, 740721169 edges, 171200 markings/sec, 680 secs
lola: sara is running 685 secs || sara is running 685 secs || 113600745 markings, 745806210 edges, 171400 markings/sec, 685 secs
lola: sara is running 690 secs || sara is running 690 secs || 114399222 markings, 750873150 edges, 159695 markings/sec, 690 secs
lola: sara is running 695 secs || sara is running 695 secs || 115249475 markings, 755864216 edges, 170051 markings/sec, 695 secs
lola: sara is running 700 secs || sara is running 700 secs || 116075763 markings, 761197146 edges, 165258 markings/sec, 700 secs
lola: sara is running 705 secs || sara is running 705 secs || 116840675 markings, 765949510 edges, 152982 markings/sec, 705 secs
lola: sara is running 710 secs || sara is running 710 secs || 117641074 markings, 770804991 edges, 160080 markings/sec, 710 secs
lola: sara is running 715 secs || sara is running 715 secs || 118483571 markings, 775826497 edges, 168499 markings/sec, 715 secs
lola: sara is running 720 secs || sara is running 720 secs || 119345775 markings, 781455431 edges, 172441 markings/sec, 720 secs
lola: sara is running 725 secs || sara is running 725 secs || 120127558 markings, 786677419 edges, 156357 markings/sec, 725 secs
lola: sara is running 730 secs || sara is running 730 secs || 120842278 markings, 792054931 edges, 142944 markings/sec, 730 secs
lola: sara is running 735 secs || sara is running 735 secs || 121551557 markings, 797179428 edges, 141856 markings/sec, 735 secs
lola: sara is running 740 secs || sara is running 740 secs || 122270457 markings, 802018320 edges, 143780 markings/sec, 740 secs
lola: sara is running 745 secs || sara is running 745 secs || 123007295 markings, 807134736 edges, 147368 markings/sec, 745 secs
lola: sara is running 750 secs || sara is running 750 secs || 123701380 markings, 812079785 edges, 138817 markings/sec, 750 secs
lola: sara is running 755 secs || sara is running 755 secs || 124442912 markings, 816734200 edges, 148306 markings/sec, 755 secs
lola: sara is running 760 secs || sara is running 760 secs || 125230695 markings, 821419217 edges, 157557 markings/sec, 760 secs
lola: sara is running 765 secs || sara is running 765 secs || 126037576 markings, 826489292 edges, 161376 markings/sec, 765 secs
lola: sara is running 770 secs || sara is running 770 secs || 126847439 markings, 831516460 edges, 161973 markings/sec, 770 secs
lola: sara is running 775 secs || sara is running 775 secs || 127638369 markings, 836416266 edges, 158186 markings/sec, 775 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 127641980 markings, 836429929 edges
lola: ========================================
lola: ...considering subproblem: (((1 <= p2) AND (1 <= p6) AND (1 <= p15)) OR (E (G (((p19 <= 0) OR (p21 <= 0) OR (p26 <= 0)))) AND E (G (((p26 <= 0) OR (p28 <= 0) OR (p37 <= 0) OR (p52 <= 0) OR (p56 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p2) AND (1 <= p6) AND (1 <= p15))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p2) AND (1 <= p6) AND (1 <= p15))
lola: processed formula length: 40
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G (((p19 <= 0) OR (p21 <= 0) OR (p26 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p19 <= 0) OR (p21 <= 0) OR (p26 <= 0))))
lola: processed formula length: 50
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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 is possibly preserved.
lola: 56 markings, 56 edges
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G (((p26 <= 0) OR (p28 <= 0) OR (p37 <= 0) OR (p52 <= 0) OR (p56 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p26 <= 0) OR (p28 <= 0) OR (p37 <= 0) OR (p52 <= 0) OR (p56 <= 0))))
lola: processed formula length: 80
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p26) AND (1 <= p28) AND (1 <= p37) AND (1 <= p52) AND (1 <= p56))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 67 markings, 67 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: no no no yes yes yes no no yes yes no no no yes no no
lola:
preliminary result: no no no yes yes yes no no yes yes no no no yes no no
lola: memory consumption: 57068 KB
lola: time consumption: 1302 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="ShieldRVs-PT-004A"
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 ShieldRVs-PT-004A, 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 r211-tajo-159033478000796"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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