Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.5K Apr 12 18:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 18:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 11 20:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 11 20:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 14 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 21:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 21:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 10 05:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 10 05:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rwxr-xr-x 1 mcc users 24K Mar 24 05:38 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591215777432

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:22:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 20:22:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:22:59] [WARNING] Skipping unknown tool specific annotation : Tina
[2020-06-03 20:22:59] [WARNING] Unknown XML tag in source file: size
[2020-06-03 20:22:59] [WARNING] Unknown XML tag in source file: color
[2020-06-03 20:22:59] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2020-06-03 20:22:59] [INFO ] Transformed 30 places.
[2020-06-03 20:22:59] [INFO ] Transformed 32 transitions.
[2020-06-03 20:22:59] [INFO ] Parsed PT model containing 30 places and 32 transitions in 97 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Finished random walk after 4396 steps, including 0 resets, run visited all 30 properties in 15 ms. (steps per millisecond=293 )
[2020-06-03 20:23:00] [INFO ] Flatten gal took : 30 ms
[2020-06-03 20:23:00] [INFO ] Flatten gal took : 8 ms
[2020-06-03 20:23:00] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-03 20:23:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ TCPcondis-PT-15 @ 3570 seconds

FORMULA TCPcondis-PT-15-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-15-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-15-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-15-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-15-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-15-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-15-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-15-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-15-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-15-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-15-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-15-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-15-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA TCPcondis-PT-15-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-15-CTLFireability-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1894
rslt: Output for CTLFireability @ TCPcondis-PT-15

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 20:23:00 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "E(((p8 <= 0) OR (p20 <= 0) OR ((1 <= p12) AND (1 <= p26) AND (1 <= p6) AND (1 <= p20) AND (((1 <= p13) AND (1 <= p25)) OR ((1 <= p10) AND (1 <= p11) AND (1 <= p28))))) U AX(((1 <= p4) AND (1 <= p18) AND (1 <= p15))))",
"processed_size": 219,
"rewrites": 31
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 426212,
"markings": 188026,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "((1 <= p12) AND (1 <= p26))",
"processed_size": 27,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "AF(EX(((((1 <= p10) AND (1 <= p11) AND (1 <= p28)) OR ((1 <= p11) AND (1 <= p27))) AND (((1 <= p5) AND (1 <= p21)) OR ((1 <= p6) AND (1 <= p20))))))",
"processed_size": 150,
"rewrites": 31
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 141,
"markings": 141,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 1,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "((((p13 <= 0) OR (p25 <= 0)) AND ((p3 <= 0) OR (p19 <= 0))) OR ((1 <= p15) AND (1 <= p13) AND (1 <= p25) AND (1 <= p26) AND ((p10 <= 0) OR (p28 <= 0))))",
"processed_size": 156,
"rewrites": 32
},
"result":
{
"edges": 51634,
"markings": 11853,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 26,
"problems": 8
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 3,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "E (G (((p6 <= 0) OR (p20 <= 0) OR ((p16 <= 0) AND ((p4 <= 0) OR (p22 <= 0)) AND ((1 <= p1) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p11) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p20)))))))",
"processed_size": 192,
"rewrites": 30
},
"result":
{
"edges": 141,
"markings": 141,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 23
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 31,
"problems": 6
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 611
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "EG(AF((p18 <= 0)))",
"processed_size": 18,
"rewrites": 31
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 55593699,
"markings": 15894687,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 599
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((p10 <= 0) OR (p28 <= 0)) AND ((p5 <= 0) OR (p21 <= 0)))",
"processed_size": 60,
"rewrites": 32
},
"result":
{
"edges": 141,
"markings": 141,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 749
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (((1 <= p0) U ((1 <= p3) AND (1 <= p19) AND (1 <= p12) AND (1 <= p26))))",
"processed_size": 74,
"rewrites": 31
},
"result":
{
"edges": 27,
"markings": 27,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 999
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"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": "(((p11 <= 0) OR (p27 <= 0)) AND ((p6 <= 0) OR (p19 <= 0) OR (p4 <= 0) OR (p22 <= 0)))",
"processed_size": 89,
"rewrites": 33
},
"result":
{
"edges": 141,
"markings": 141,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 16,
"problems": 8
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2998
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F (((((1 <= p3) AND (1 <= p19) AND (1 <= p5) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p15))) AND (1 <= p5) AND (1 <= p23))))",
"processed_size": 127,
"rewrites": 30
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2998
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"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": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((1 <= p10) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p19)))",
"processed_size": 59,
"rewrites": 30
},
"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": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p29) AND (1 <= p9) AND (1 <= p25))))",
"processed_size": 49,
"rewrites": 30
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3452,
"runtime": 1676.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G(E(F(*)))) : E((** U A(X(**)))) : E(G(**)) : A(F(A(G(**)))) : A(F(*)) : E(((E(G(**)) AND **) U A(G(**)))) : (A(X((E(X(**)) OR A(G(**))))) OR (A(F(**)) AND (E(F(**)) OR (** OR **)))) : E(F(**)) : (E(G(A(F(*)))) AND **) : E(G(*)) : (A((** U **)) OR (E(G(**)) OR (E(F(**)) OR (** OR **)))) : A(G(A((** U **)))) : E(G(**)) : A(F(E(X(**)))) : A(F(**)) : (E(F(**)) AND (** OR (E(G(*)) OR **)))"
},
"net":
{
"arcs": 108,
"conflict_clusters": 10,
"places": 30,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 32
},
"result":
{
"preliminary_value": "yes yes yes no no unknown yes yes no yes yes no yes no no yes ",
"value": "yes yes yes no no unknown yes yes no yes yes no yes no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 62/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 960
lola: finding significant places
lola: 30 places, 32 transitions, 21 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: NOT(A (F (A (G ((((1 <= p10) AND (1 <= p28)) OR ((1 <= p5) AND (1 <= p21)))))))) : E ((((p8 <= 0) OR (p20 <= 0) OR ((1 <= p12) AND (1 <= p26) AND (1 <= p6) AND (1 <= p20) AND (((1 <= p13) AND (1 <= p25)) OR ((1 <= p10) AND (1 <= p11) AND (1 <= p28))))) U A (X (((1 <= p4) AND (1 <= p18) AND (1 <= p15)))))) : E (G (((p6 <= 0) OR (p20 <= 0) OR ((p16 <= 0) AND ((p4 <= 0) OR (p22 <= 0)) AND ((1 <= p1) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p11) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p20))))))) : A (F (A (G ((((1 <= p11) AND (1 <= p27)) OR ((1 <= p6) AND (1 <= p19) AND (1 <= p4) AND (1 <= p22))))))) : NOT(E (G (E (G ((1 <= p0)))))) : E (((E (G ((1 <= p0))) AND ((p2 <= 0) OR (p20 <= 0) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p23)))) U A (G (((p4 <= 0) OR (p22 <= 0)))))) : (A (X ((E (X (((1 <= p13) AND (1 <= p25)))) OR A (G (((1 <= p8) AND (1 <= p20))))))) OR (A (F (((p12 <= 0) OR (p26 <= 0)))) AND ((E (F ((1 <= p14))) OR (1 <= p24)) OR ((p0 <= 0) AND ((p6 <= 0) OR (p19 <= 0)))))) : E ((E (X (((1 <= p14) OR ((1 <= p5) AND (1 <= p17))))) U E (F ((p0 <= 0))))) : (NOT(A (F (E (G ((1 <= p18)))))) AND (p9 <= 0)) : NOT(A (F ((p0 <= 0)))) : ((((A ((((1 <= p16) AND (1 <= p15)) U ((1 <= p13) AND (1 <= p25)))) OR E (G ((1 <= p16)))) OR E (F (((1 <= p29) AND (1 <= p9) AND (1 <= p25))))) OR ((1 <= p10) AND (1 <= p24))) OR ((1 <= p7) AND (1 <= p19))) : A (G (A (((1 <= p0) U ((1 <= p3) AND (1 <= p19) AND (1 <= p12) AND (1 <= p26)))))) : E (G (((p11 <= 0) OR (p27 <= 0) OR (p4 <= 0) OR (p21 <= 0) OR ((1 <= p13) AND (1 <= p25))))) : A (F (E (X (((((1 <= p10) AND (1 <= p11) AND (1 <= p28)) OR ((1 <= p11) AND (1 <= p27))) AND (((1 <= p5) AND (1 <= p21)) OR ((1 <= p6) AND (1 <= p20)))))))) : A (F (((((1 <= p13) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p19))) AND ((p15 <= 0) OR (p13 <= 0) OR (p25 <= 0) OR (p26 <= 0) OR ((1 <= p10) AND (1 <= p28)))))) : (E (F (((((1 <= p3) AND (1 <= p19) AND (1 <= p5) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p15))) AND (1 <= p5) AND (1 <= p23)))) AND ((((p9 <= 0) OR (p25 <= 0)) OR NOT(A (F ((1 <= p15))))) OR (1 <= p15)))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k: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: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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p8 <= 0) OR (p20 <= 0) OR ((1 <= p12) AND (1 <= p26) AND (1 <= p6) AND (1 <= p20) AND (((1 <= p13) AND (1 <= p25)) OR ((1 <= p10) AND (1 <= p11) AND (1 <= p28))))) U A (X (((1 <= p4) AND (1 <= p18) AND (1 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((p8 <= 0) OR (p20 <= 0) OR ((1 <= p12) AND (1 <= p26) AND (1 <= p6) AND (1 <= p20) AND (((1 <= p13) AND (1 <= p25)) OR ((1 <= p10) AND (1 <= p11) AND (1 <= p28))))) U AX(((1 <= p4) AND (1 <= p18) AND (1 <= p15))))
lola: processed formula length: 219
lola: 31 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: 188026 markings, 426212 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((E (X (((1 <= p13) AND (1 <= p25)))) OR A (G (((1 <= p8) AND (1 <= p20))))))) OR (A (F (((p12 <= 0) OR (p26 <= 0)))) AND (E (F ((1 <= p14))) OR ((1 <= p24) OR ((p0 <= 0) AND ((p6 <= 0) OR (p19 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p24) OR ((p0 <= 0) AND ((p6 <= 0) OR (p19 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((1 <= p24) OR ((p0 <= 0) AND ((p6 <= 0) OR (p19 <= 0))))
lola: processed formula length: 58
lola: 30 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p14)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((1 <= p14)))
lola: processed formula length: 18
lola: 30 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: yes
lola: formula 0: (1 <= p14)
lola: state equation task get result unparse finished id 0
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p12 <= 0) OR (p26 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p12) AND (1 <= p26))
lola: processed formula length: 27
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p12 <= 0) OR (p26 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to CTLFireability-3-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (X (((((1 <= p10) AND (1 <= p11) AND (1 <= p28)) OR ((1 <= p11) AND (1 <= p27))) AND (((1 <= p5) AND (1 <= p21)) OR ((1 <= p6) AND (1 <= p20))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EX(((((1 <= p10) AND (1 <= p11) AND (1 <= p28)) OR ((1 <= p11) AND (1 <= p27))) AND (((1 <= p5) AND (1 <= p21)) OR ((1 <= p6) AND (1 <= p20))))))
lola: processed formula length: 150
lola: 31 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: 141 markings, 141 edges
lola: ========================================
sara: try reading problem file CTLFireability-3-0.sara.
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p0 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p0 <= 0)))
lola: processed formula length: 17
lola: 30 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: sara: place or transition ordering is non-deterministicrewrite Frontend/Parser/formula_rewrite.k:583

lola: processed formula: E (G ((1 <= p0)))
lola: processed formula length: 17
lola: 30 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: (p0 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola:
state equation: write sara problem file to CTLFireability-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 28 markings, 28 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p0 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (1 <= p0)
lola: processed formula length: 9
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p0 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 28 markings, 28 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p11 <= 0) OR (p27 <= 0) OR (p4 <= 0) OR (p21 <= 0) OR ((1 <= p13) AND (1 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p11 <= 0) OR (p27 <= 0) OR (p4 <= 0) OR (p21 <= 0) OR ((1 <= p13) AND (1 <= p25)))))
lola: processed formula length: 96
lola: 30 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: 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: The predicate is possibly preserved.
lola: 141 markings, 141 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p11) AND (1 <= p27) AND (1 <= p4) AND (1 <= p21) AND ((p13 <= 0) OR (p25 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((((1 <= p13) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p19))) AND ((p15 <= 0) OR (p13 <= 0) OR (p25 <= 0) OR (p26 <= 0) OR ((1 <= p10) AND (1 <= p28))))))
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: ((((p13 <= 0) OR (p25 <= 0)) AND ((p3 <= 0) OR (p19 <= 0))) OR ((1 <= p15) AND (1 <= p13) AND (1 <= p25) AND (1 <= p26) AND ((p10 <= 0) OR (p28 <= 0))))
lola: processed formula length: 156
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
sara: try reading problem file CTLFireability-6-0.sara.
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 <= p13) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p19))) AND ((p15 <= 0) OR (p13 <= 0) OR (p25 <= 0) OR (p26 <= 0) OR ((1 <= p10) AND (1 <= p28))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 26 literals and 8 conjunctive subformulas
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara

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

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 11853 markings, 51634 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p6 <= 0) OR (p20 <= 0) OR ((p16 <= 0) AND ((p4 <= 0) OR (p22 <= 0)) AND ((1 <= p1) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p11) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p20)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p6 <= 0) OR (p20 <= 0) OR ((p16 <= 0) AND ((p4 <= 0) OR (p22 <= 0)) AND ((1 <= p1) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p11) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p20)))))))
lola: processed formula length: 192
lola: 30 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 <= p6) AND (1 <= p20) AND ((1 <= p16) OR ((1 <= p4) AND (1 <= p22)) OR ((p1 <= 0) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p11 <= 0) OR (p27 <= 0)) AND ((p2 <= 0) OR (p20 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 31 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 141 markings, 141 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((E (G ((1 <= p0))) AND ((p2 <= 0) OR (p20 <= 0) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p23)))) U A (G (((p4 <= 0) OR (p22 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((EG((1 <= p0)) AND ((p2 <= 0) OR (p20 <= 0) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p23)))) U AG(((p4 <= 0) OR (p22 <= 0))))
lola: processed formula length: 127
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: 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: 666814 markings, 4747276 edges, 133363 markings/sec, 0 secs
lola: 1201298 markings, 8724215 edges, 106897 markings/sec, 5 secs
lola: 1778611 markings, 13065275 edges, 115463 markings/sec, 10 secs
lola: 2385654 markings, 17693075 edges, 121409 markings/sec, 15 secs
lola: 2974225 markings, 22185976 edges, 117714 markings/sec, 20 secs
lola: 3557732 markings, 26666168 edges, 116701 markings/sec, 25 secs
lola: 4953456 markings, 31224438 edges, 279145 markings/sec, 30 secs
lola: 6336277 markings, 35637869 edges, 276564 markings/sec, 35 secs
lola: 8256433 markings, 39966291 edges, 384031 markings/sec, 40 secs
lola: 9770958 markings, 44496147 edges, 302905 markings/sec, 45 secs
lola: 10317912 markings, 48744052 edges, 109391 markings/sec, 50 secs
lola: 10898795 markings, 53009492 edges, 116177 markings/sec, 55 secs
lola: 11431573 markings, 57153605 edges, 106556 markings/sec, 60 secs
lola: 13456083 markings, 61619555 edges, 404902 markings/sec, 65 secs
lola: 15626645 markings, 65704243 edges, 434112 markings/sec, 70 secs
lola: 17774964 markings, 69887311 edges, 429664 markings/sec, 75 secs
lola: 19702975 markings, 73945751 edges, 385602 markings/sec, 80 secs
lola: 20955472 markings, 78044912 edges, 250499 markings/sec, 85 secs
lola: 21452851 markings, 81954584 edges, 99476 markings/sec, 90 secs
lola: 22166708 markings, 85824641 edges, 142771 markings/sec, 95 secs
lola: 23370052 markings, 89527047 edges, 240669 markings/sec, 100 secs
lola: 23961949 markings, 93161262 edges, 118379 markings/sec, 105 secs
lola: 25937401 markings, 96948311 edges, 395090 markings/sec, 110 secs
lola: 27865170 markings, 100664420 edges, 385554 markings/sec, 115 secs
lola: 29726806 markings, 104402168 edges, 372327 markings/sec, 120 secs
lola: 31550671 markings, 107924636 edges, 364773 markings/sec, 125 secs
lola: 32570289 markings, 111351591 edges, 203924 markings/sec, 130 secs
lola: 33954791 markings, 115048914 edges, 276900 markings/sec, 135 secs
lola: 34686035 markings, 118804925 edges, 146249 markings/sec, 140 secs
lola: 35759336 markings, 122604786 edges, 214660 markings/sec, 145 secs
lola: 36227946 markings, 126205133 edges, 93722 markings/sec, 150 secs
lola: 36846128 markings, 129935271 edges, 123636 markings/sec, 155 secs
lola: 38438129 markings, 133799126 edges, 318400 markings/sec, 160 secs
lola: 39404474 markings, 137581847 edges, 193269 markings/sec, 165 secs
lola: 40080046 markings, 141277349 edges, 135114 markings/sec, 170 secs
lola: 41218059 markings, 144984994 edges, 227603 markings/sec, 175 secs
lola: 42089046 markings, 148702654 edges, 174197 markings/sec, 180 secs
lola: 43099163 markings, 152424354 edges, 202023 markings/sec, 185 secs
lola: 44821164 markings, 155939073 edges, 344400 markings/sec, 190 secs
lola: 46271049 markings, 159487599 edges, 289977 markings/sec, 195 secs
lola: 47874406 markings, 163198310 edges, 320671 markings/sec, 200 secs
lola: 49544456 markings, 166754543 edges, 334010 markings/sec, 205 secs
lola: 50582607 markings, 170407282 edges, 207630 markings/sec, 210 secs
lola: 51856657 markings, 174103597 edges, 254810 markings/sec, 215 secs
lola: 53566026 markings, 177613218 edges, 341874 markings/sec, 220 secs
lola: 55208081 markings, 180972499 edges, 328411 markings/sec, 225 secs
lola: 56898059 markings, 184406390 edges, 337996 markings/sec, 230 secs
lola: 58511044 markings, 187773680 edges, 322597 markings/sec, 235 secs
lola: 60114192 markings, 191053352 edges, 320630 markings/sec, 240 secs
lola: 61894798 markings, 194260927 edges, 356121 markings/sec, 245 secs
lola: 63498927 markings, 197233183 edges, 320826 markings/sec, 250 secs
lola: 64987548 markings, 200911948 edges, 297724 markings/sec, 255 secs
lola: 66651000 markings, 204320108 edges, 332690 markings/sec, 260 secs
lola: 67864290 markings, 207631245 edges, 242658 markings/sec, 265 secs
lola: 68560535 markings, 211175023 edges, 139249 markings/sec, 270 secs
lola: 69816501 markings, 214866702 edges, 251193 markings/sec, 275 secs
lola: 70914213 markings, 218794384 edges, 219542 markings/sec, 280 secs
lola: 73062483 markings, 223686896 edges, 429654 markings/sec, 285 secs
lola: 74970311 markings, 228516806 edges, 381566 markings/sec, 290 secs
lola: 76810281 markings, 233151707 edges, 367994 markings/sec, 295 secs
lola: 78397365 markings, 237521433 edges, 317417 markings/sec, 300 secs
lola: 79612150 markings, 241911885 edges, 242957 markings/sec, 305 secs
lola: 81074502 markings, 246383238 edges, 292470 markings/sec, 310 secs
lola: 82775722 markings, 250827841 edges, 340244 markings/sec, 315 secs
lola: 84416991 markings, 255389975 edges, 328254 markings/sec, 320 secs
lola: 85979701 markings, 259834417 edges, 312542 markings/sec, 325 secs
lola: 87428069 markings, 264046084 edges, 289674 markings/sec, 330 secs
lola: 88706271 markings, 268409900 edges, 255640 markings/sec, 335 secs
lola: 90001563 markings, 272705203 edges, 259058 markings/sec, 340 secs
lola: 91668033 markings, 277043992 edges, 333294 markings/sec, 345 secs
lola: 93260095 markings, 281344996 edges, 318412 markings/sec, 350 secs
lola: 94756976 markings, 285563199 edges, 299376 markings/sec, 355 secs
lola: 96216178 markings, 289754576 edges, 291840 markings/sec, 360 secs
lola: 97587467 markings, 293928618 edges, 274258 markings/sec, 365 secs
lola: 98558979 markings, 297983237 edges, 194302 markings/sec, 370 secs
lola: 100115058 markings, 302211058 edges, 311216 markings/sec, 375 secs
lola: 101687977 markings, 306326809 edges, 314584 markings/sec, 380 secs
lola: 103046938 markings, 310300772 edges, 271792 markings/sec, 385 secs
lola: 104440877 markings, 314124779 edges, 278788 markings/sec, 390 secs
lola: 105235923 markings, 317907820 edges, 159009 markings/sec, 395 secs
lola: 106071159 markings, 321422712 edges, 167047 markings/sec, 400 secs
lola: 107769970 markings, 324913701 edges, 339762 markings/sec, 405 secs
lola: 108701914 markings, 328389305 edges, 186389 markings/sec, 410 secs
lola: 110048426 markings, 332334448 edges, 269302 markings/sec, 415 secs
lola: 112092761 markings, 336484046 edges, 408867 markings/sec, 420 secs
lola: 113782409 markings, 340461023 edges, 337930 markings/sec, 425 secs
lola: 114536639 markings, 344231646 edges, 150846 markings/sec, 430 secs
lola: 116135658 markings, 347830496 edges, 319804 markings/sec, 435 secs
lola: 117442965 markings, 351427561 edges, 261461 markings/sec, 440 secs
lola: 118523597 markings, 355151350 edges, 216126 markings/sec, 445 secs
lola: 119896363 markings, 358880534 edges, 274553 markings/sec, 450 secs
lola: 120718173 markings, 362716445 edges, 164362 markings/sec, 455 secs
lola: 122278757 markings, 366052923 edges, 312117 markings/sec, 460 secs
lola: 123689614 markings, 369619778 edges, 282171 markings/sec, 465 secs
lola: 125407382 markings, 373323410 edges, 343554 markings/sec, 470 secs
lola: 127179952 markings, 376962612 edges, 354514 markings/sec, 475 secs
lola: 128271892 markings, 380435747 edges, 218388 markings/sec, 480 secs
lola: 129388330 markings, 384300865 edges, 223288 markings/sec, 485 secs
lola: 130302843 markings, 388108389 edges, 182903 markings/sec, 490 secs
lola: 131908604 markings, 391878398 edges, 321152 markings/sec, 495 secs
lola: 133777634 markings, 395932560 edges, 373806 markings/sec, 500 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes yes unknown no unknown yes yes unknown yes unknown unknown yes no no unknown
lola: memory consumption: 11512076 KB
lola: time consumption: 513 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 (A (F ((p18 <= 0))))) AND (p9 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p9 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p9 <= 0)
lola: processed formula length: 9
lola: 29 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 611 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((p18 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF((p18 <= 0)))
lola: processed formula length: 18
lola: 31 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: 2035581 markings, 5084952 edges, 407116 markings/sec, 0 secs
lola: 3709073 markings, 9996702 edges, 334698 markings/sec, 5 secs
lola: 5220634 markings, 14733256 edges, 302312 markings/sec, 10 secs
lola: 6694051 markings, 19536242 edges, 294683 markings/sec, 15 secs
lola: 8123202 markings, 24202295 edges, 285830 markings/sec, 20 secs
lola: 9435531 markings, 28793223 edges, 262466 markings/sec, 25 secs
lola: 10699139 markings, 33494743 edges, 252722 markings/sec, 30 secs
lola: 11943378 markings, 38127484 edges, 248848 markings/sec, 35 secs
lola: 13073227 markings, 42557559 edges, 225970 markings/sec, 40 secs
lola: 14153643 markings, 47095074 edges, 216083 markings/sec, 45 secs
lola: 15141726 markings, 51652819 edges, 197617 markings/sec, 50 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 15894687 markings, 55593699 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 599 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((((p10 <= 0) OR (p28 <= 0)) AND ((p5 <= 0) OR (p21 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: (((p10 <= 0) OR (p28 <= 0)) AND ((p5 <= 0) OR (p21 <= 0)))
lola: processed formula length: 60
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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: 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 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: (((p10 <= 0) OR (p28 <= 0)) AND ((p5 <= 0) OR (p21 <= 0)))
lola: state equation task get result unparse finished++ id 0
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: formula 0: (((1 <= p10) AND (1 <= p28)) OR ((1 <= p5) AND (1 <= p21)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: state equation: write sara problem file to CTLFireability-11-1.sara
lola: Reachability of the predicate is possibly preserved.
lola: 141 markings, 141 edges
lola: state equation: write sara problem file to CTLFireability-11-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-1.sara.
sara: place or transition ordering is non-deterministic

lola: ========================================
sara: try reading problem file CTLFireability-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: subprocess 12 will run for 749 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (((1 <= p0) U ((1 <= p3) AND (1 <= p19) AND (1 <= p12) AND (1 <= p26))))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p0) U ((1 <= p3) AND (1 <= p19) AND (1 <= p12) AND (1 <= p26))))
lola: processed formula length: 74
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)

lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 27 markings, 27 edges
lola: ========================================
lola: subprocess 13 will run for 999 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((((1 <= p11) AND (1 <= p27)) OR ((1 <= p6) AND (1 <= p19) AND (1 <= p4) AND (1 <= p22)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p11 <= 0) OR (p27 <= 0)) AND ((p6 <= 0) OR (p19 <= 0) OR (p4 <= 0) OR (p22 <= 0)))
lola: processed formula length: 89
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p11 <= 0) OR (p27 <= 0)) AND ((p6 <= 0) OR (p19 <= 0) OR (p4 <= 0) OR (p22 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 16 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-1.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 141 markings, 141 edges
lola: ========================================
lola: subprocess 14 will run for 1499 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((((1 <= p3) AND (1 <= p19) AND (1 <= p5) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p15))) AND (1 <= p5) AND (1 <= p23)))) AND (((p9 <= 0) OR (p25 <= 0)) OR (E (G ((p15 <= 0))) OR (1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1499 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p15)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p15)
lola: processed formula length: 10
lola: 29 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2998 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((1 <= p3) AND (1 <= p19) AND (1 <= p5) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p15))) AND (1 <= p5) AND (1 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((((1 <= p3) AND (1 <= p19) AND (1 <= p5) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p15))) AND (1 <= p5) AND (1 <= p23))))
lola: processed formula length: 127
lola: 30 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((1 <= p3) AND (1 <= p19) AND (1 <= p5) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p15))) AND (1 <= p5) AND (1 <= p23))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-15-0.sara.
sara: place or transition ordering is non-deterministic

lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2998 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((((1 <= p16) AND (1 <= p15)) U ((1 <= p13) AND (1 <= p25)))) OR (E (G ((1 <= p16))) OR (E (F (((1 <= p29) AND (1 <= p9) AND (1 <= p25)))) OR (((1 <= p10) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p19))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2998 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p10) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p19)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (((1 <= p10) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p19)))
lola: processed formula length: 59
lola: 30 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: 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 (F (((1 <= p29) AND (1 <= p9) AND (1 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p29) AND (1 <= p9) AND (1 <= p25))))
lola: processed formula length: 49
lola: 30 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p29) AND (1 <= p9) AND (1 <= p25))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-17-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (((E (G ((1 <= p0))) AND ((p2 <= 0) OR (p20 <= 0) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p23)))) U A (G (((p4 <= 0) OR (p22 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((EG((1 <= p0)) AND ((p2 <= 0) OR (p20 <= 0) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p23)))) U AG(((p4 <= 0) OR (p22 <= 0))))
lola: processed formula length: 127
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: 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: 768453 markings, 5496450 edges, 153691 markings/sec, 0 secs
lola: 1457465 markings, 10639378 edges, 137802 markings/sec, 5 secs
lola: 2086366 markings, 15400507 edges, 125780 markings/sec, 10 secs
lola: 2697645 markings, 20078368 edges, 122256 markings/sec, 15 secs
lola: 3292591 markings, 24624358 edges, 118989 markings/sec, 20 secs
lola: 3865420 markings, 29038691 edges, 114566 markings/sec, 25 secs
lola: 6075378 markings, 33676777 edges, 441992 markings/sec, 30 secs
lola: 7251688 markings, 37973379 edges, 235262 markings/sec, 35 secs
lola: 9513897 markings, 42503764 edges, 452442 markings/sec, 40 secs
lola: 10048926 markings, 46654811 edges, 107006 markings/sec, 45 secs
lola: 10587818 markings, 50855429 edges, 107778 markings/sec, 50 secs
lola: 11195146 markings, 55313195 edges, 121466 markings/sec, 55 secs
lola: 12586702 markings, 59856850 edges, 278311 markings/sec, 60 secs
lola: 14650835 markings, 63845622 edges, 412827 markings/sec, 65 secs
lola: 16652694 markings, 67631204 edges, 400372 markings/sec, 70 secs
lola: 18591521 markings, 71567850 edges, 387765 markings/sec, 75 secs
lola: 20127631 markings, 75475053 edges, 307222 markings/sec, 80 secs
lola: 21108801 markings, 79251201 edges, 196234 markings/sec, 85 secs
lola: 21589860 markings, 83030428 edges, 96212 markings/sec, 90 secs
lola: 22657576 markings, 86759118 edges, 213543 markings/sec, 95 secs
lola: 23477064 markings, 90373665 edges, 163898 markings/sec, 100 secs
lola: 24580133 markings, 94387693 edges, 220614 markings/sec, 105 secs
lola: 26491459 markings, 98004004 edges, 382265 markings/sec, 110 secs
lola: 28342038 markings, 101657896 edges, 370116 markings/sec, 115 secs
lola: 30108820 markings, 105131407 edges, 353356 markings/sec, 120 secs
lola: 31790522 markings, 108375817 edges, 336340 markings/sec, 125 secs
lola: 32648749 markings, 111944291 edges, 171645 markings/sec, 130 secs
lola: 34049206 markings, 115773669 edges, 280091 markings/sec, 135 secs
lola: 34892731 markings, 119277222 edges, 168705 markings/sec, 140 secs
lola: 35829086 markings, 123158260 edges, 187271 markings/sec, 145 secs
lola: 36366154 markings, 127247409 edges, 107414 markings/sec, 150 secs
lola: 37139139 markings, 131212368 edges, 154597 markings/sec, 155 secs
lola: 39020116 markings, 135419373 edges, 376195 markings/sec, 160 secs
lola: 39856355 markings, 139526312 edges, 167248 markings/sec, 165 secs
lola: 40550214 markings, 143427711 edges, 138772 markings/sec, 170 secs
lola: 41725979 markings, 147357598 edges, 235153 markings/sec, 175 secs
lola: 42835728 markings, 151125081 edges, 221950 markings/sec, 180 secs
lola: 44263734 markings, 154851854 edges, 285601 markings/sec, 185 secs
lola: 45804394 markings, 158429969 edges, 308132 markings/sec, 190 secs
lola: 47372252 markings, 162205876 edges, 313572 markings/sec, 195 secs
lola: 49093264 markings, 166014272 edges, 344202 markings/sec, 200 secs
lola: 50392848 markings, 169654981 edges, 259917 markings/sec, 205 secs
lola: 51811764 markings, 173757850 edges, 283783 markings/sec, 210 secs
lola: 53359793 markings, 177255748 edges, 309606 markings/sec, 215 secs
lola: 55167325 markings, 180843199 edges, 361506 markings/sec, 220 secs
lola: 56800673 markings, 184216413 edges, 326670 markings/sec, 225 secs
lola: 58244165 markings, 187265605 edges, 288698 markings/sec, 230 secs
lola: 59715558 markings, 190211173 edges, 294279 markings/sec, 235 secs
lola: 61371399 markings, 193264678 edges, 331168 markings/sec, 240 secs
lola: 62915008 markings, 196134781 edges, 308722 markings/sec, 245 secs
lola: 64081026 markings, 199109490 edges, 233204 markings/sec, 250 secs
lola: 65948904 markings, 202885597 edges, 373576 markings/sec, 255 secs
lola: 67365100 markings, 206225281 edges, 283239 markings/sec, 260 secs
lola: 68370544 markings, 209681481 edges, 201089 markings/sec, 265 secs
lola: 69227870 markings, 213212277 edges, 171465 markings/sec, 270 secs
lola: 70334572 markings, 216970202 edges, 221340 markings/sec, 275 secs
lola: 72006564 markings, 221246552 edges, 334398 markings/sec, 280 secs
lola: 73753203 markings, 225370213 edges, 349328 markings/sec, 285 secs
lola: 75391384 markings, 229443612 edges, 327636 markings/sec, 290 secs
lola: 76960707 markings, 233491770 edges, 313865 markings/sec, 295 secs
lola: 78399724 markings, 237524782 edges, 287803 markings/sec, 300 secs
lola: 79531701 markings, 241518851 edges, 226395 markings/sec, 305 secs
lola: 80779446 markings, 245617694 edges, 249549 markings/sec, 310 secs
lola: 82318060 markings, 249602090 edges, 307723 markings/sec, 315 secs
lola: 83884653 markings, 253800455 edges, 313319 markings/sec, 320 secs
lola: 85381794 markings, 257981919 edges, 299428 markings/sec, 325 secs
lola: 86779124 markings, 261971322 edges, 279466 markings/sec, 330 secs
lola: 88103266 markings, 265933854 edges, 264828 markings/sec, 335 secs
lola: 89037475 markings, 269849687 edges, 186842 markings/sec, 340 secs
lola: 90491829 markings, 273979547 edges, 290871 markings/sec, 345 secs
lola: 92017305 markings, 277967024 edges, 305095 markings/sec, 350 secs
lola: 93361042 markings, 281646513 edges, 268747 markings/sec, 355 secs
lola: 94722356 markings, 285449359 edges, 272263 markings/sec, 360 secs
lola: 96046511 markings, 289280578 edges, 264831 markings/sec, 365 secs
lola: 97271965 markings, 293042519 edges, 245091 markings/sec, 370 secs
lola: 98259497 markings, 296689341 edges, 197506 markings/sec, 375 secs
lola: 99364783 markings, 300393484 edges, 221057 markings/sec, 380 secs
lola: 100894379 markings, 304165136 edges, 305919 markings/sec, 385 secs
lola: 102198943 markings, 307839827 edges, 260913 markings/sec, 390 secs
lola: 103483273 markings, 311481454 edges, 256866 markings/sec, 395 secs
lola: 104744360 markings, 315030152 edges, 252217 markings/sec, 400 secs
lola: 105292588 markings, 318367315 edges, 109646 markings/sec, 405 secs
lola: 106106394 markings, 321502967 edges, 162761 markings/sec, 410 secs
lola: 107618630 markings, 324610988 edges, 302447 markings/sec, 415 secs
lola: 108605993 markings, 327621891 edges, 197473 markings/sec, 420 secs
lola: 109413911 markings, 331023799 edges, 161584 markings/sec, 425 secs
lola: 111090149 markings, 334362407 edges, 335248 markings/sec, 430 secs
lola: 112693806 markings, 337722099 edges, 320731 markings/sec, 435 secs
lola: 113855178 markings, 341010834 edges, 232274 markings/sec, 440 secs
lola: 114539889 markings, 344243297 edges, 136942 markings/sec, 445 secs
lola: 115913474 markings, 347395312 edges, 274717 markings/sec, 450 secs
lola: 117194765 markings, 350409076 edges, 256258 markings/sec, 455 secs
lola: 117870550 markings, 353775693 edges, 135157 markings/sec, 460 secs
lola: 119265801 markings, 356809124 edges, 279050 markings/sec, 465 secs
lola: 120026891 markings, 359904995 edges, 152218 markings/sec, 470 secs
lola: 120857639 markings, 363016489 edges, 166150 markings/sec, 475 secs
lola: 122163389 markings, 365855862 edges, 261150 markings/sec, 480 secs
lola: 123329291 markings, 368802558 edges, 233180 markings/sec, 485 secs
lola: 124875610 markings, 371885438 edges, 309264 markings/sec, 490 secs
lola: 126210616 markings, 374971350 edges, 267001 markings/sec, 495 secs
lola: 127640555 markings, 377968087 edges, 285988 markings/sec, 500 secs
lola: 128376527 markings, 381024550 edges, 147194 markings/sec, 505 secs
lola: 129380519 markings, 384236868 edges, 200798 markings/sec, 510 secs
lola: 130099309 markings, 387525472 edges, 143758 markings/sec, 515 secs
lola: 131412091 markings, 390769853 edges, 262556 markings/sec, 520 secs
lola: 132966425 markings, 394026345 edges, 310867 markings/sec, 525 secs
lola: 134375482 markings, 397340648 edges, 281811 markings/sec, 530 secs
lola: 135100767 markings, 400621293 edges, 145057 markings/sec, 535 secs
lola: 135727230 markings, 403923376 edges, 125293 markings/sec, 540 secs
lola: 136153493 markings, 407155497 edges, 85253 markings/sec, 545 secs
lola: 137186657 markings, 410413757 edges, 206633 markings/sec, 550 secs
lola: 138681256 markings, 413732540 edges, 298920 markings/sec, 555 secs
lola: 139851125 markings, 417004442 edges, 233974 markings/sec, 560 secs
lola: 141324861 markings, 420205165 edges, 294747 markings/sec, 565 secs
lola: 142691397 markings, 423228549 edges, 273307 markings/sec, 570 secs
lola: 143499324 markings, 426468523 edges, 161585 markings/sec, 575 secs
lola: 144555165 markings, 429780591 edges, 211168 markings/sec, 580 secs
lola: 145810641 markings, 432850894 edges, 251095 markings/sec, 585 secs
lola: 146497901 markings, 436514918 edges, 137452 markings/sec, 590 secs
lola: 147163576 markings, 439901338 edges, 133135 markings/sec, 595 secs
lola: 148026796 markings, 443218346 edges, 172644 markings/sec, 600 secs
lola: 149228964 markings, 446575278 edges, 240434 markings/sec, 605 secs
lola: 150183850 markings, 449891863 edges, 190977 markings/sec, 610 secs
lola: 151639949 markings, 453237975 edges, 291220 markings/sec, 615 secs
lola: 152581869 markings, 456355062 edges, 188384 markings/sec, 620 secs
lola: 153394705 markings, 460242190 edges, 162567 markings/sec, 625 secs
lola: 154308832 markings, 463715489 edges, 182825 markings/sec, 630 secs
lola: 155231033 markings, 466900591 edges, 184440 markings/sec, 635 secs
lola: 155819067 markings, 470226445 edges, 117607 markings/sec, 640 secs
lola: 157275074 markings, 473677415 edges, 291201 markings/sec, 645 secs
lola: 158624886 markings, 477000237 edges, 269962 markings/sec, 650 secs
lola: 160218480 markings, 480296278 edges, 318719 markings/sec, 655 secs
lola: 161447936 markings, 483701428 edges, 245891 markings/sec, 660 secs
lola: 162519286 markings, 487847487 edges, 214270 markings/sec, 665 secs
lola: 163740280 markings, 491499278 edges, 244199 markings/sec, 670 secs
lola: 164458334 markings, 494694703 edges, 143611 markings/sec, 675 secs
lola: 165921768 markings, 497811809 edges, 292687 markings/sec, 680 secs
lola: 167296166 markings, 500804056 edges, 274880 markings/sec, 685 secs
lola: 168715917 markings, 503747651 edges, 283950 markings/sec, 690 secs
lola: 169658784 markings, 506779810 edges, 188573 markings/sec, 695 secs
lola: 171177825 markings, 510209493 edges, 303808 markings/sec, 700 secs
lola: 172309351 markings, 513479401 edges, 226305 markings/sec, 705 secs
lola: 173230607 markings, 516728687 edges, 184251 markings/sec, 710 secs
lola: 173794189 markings, 520005943 edges, 112716 markings/sec, 715 secs
lola: 175295263 markings, 523411792 edges, 300215 markings/sec, 720 secs
lola: 176145404 markings, 526582361 edges, 170028 markings/sec, 725 secs
lola: 177024014 markings, 529756817 edges, 175722 markings/sec, 730 secs
lola: 178457487 markings, 532802561 edges, 286695 markings/sec, 735 secs
lola: 179588166 markings, 535764121 edges, 226136 markings/sec, 740 secs
lola: 180429502 markings, 538817056 edges, 168267 markings/sec, 745 secs
lola: 181483736 markings, 542080234 edges, 210847 markings/sec, 750 secs
lola: 182619377 markings, 545094701 edges, 227128 markings/sec, 755 secs
lola: 183744197 markings, 548389310 edges, 224964 markings/sec, 760 secs
lola: 184870797 markings, 551494301 edges, 225320 markings/sec, 765 secs
lola: 185376089 markings, 554659513 edges, 101058 markings/sec, 770 secs
lola: 185996537 markings, 558180179 edges, 124090 markings/sec, 775 secs
lola: 187350089 markings, 561461171 edges, 270710 markings/sec, 780 secs
lola: 187985102 markings, 565118343 edges, 127003 markings/sec, 785 secs
lola: 188450305 markings, 568165781 edges, 93041 markings/sec, 790 secs
lola: 188931667 markings, 570944370 edges, 96272 markings/sec, 795 secs
lola: 189461208 markings, 573494942 edges, 105908 markings/sec, 800 secs
lola: 189988635 markings, 576108764 edges, 105485 markings/sec, 805 secs
lola: 190804810 markings, 578528998 edges, 163235 markings/sec, 810 secs
lola: 191412735 markings, 580918930 edges, 121585 markings/sec, 815 secs
lola: 192191305 markings, 583319874 edges, 155714 markings/sec, 820 secs
lola: 192874540 markings, 585430223 edges, 136647 markings/sec, 825 secs
lola: 193612040 markings, 587455258 edges, 147500 markings/sec, 830 secs
lola: 194337472 markings, 589707234 edges, 145086 markings/sec, 835 secs
lola: 194936325 markings, 592012642 edges, 119771 markings/sec, 840 secs
lola: 195361771 markings, 594095797 edges, 85089 markings/sec, 845 secs
lola: 196272346 markings, 596579593 edges, 182115 markings/sec, 850 secs
lola: 196670287 markings, 598436062 edges, 79588 markings/sec, 855 secs
lola: 197964592 markings, 601288908 edges, 258861 markings/sec, 860 secs
lola: 199285881 markings, 604207833 edges, 264258 markings/sec, 865 secs
lola: 199835604 markings, 606368911 edges, 109945 markings/sec, 870 secs
lola: 201144233 markings, 609242184 edges, 261726 markings/sec, 875 secs
lola: 202453213 markings, 612140592 edges, 261796 markings/sec, 880 secs
lola: 203257646 markings, 614230416 edges, 160887 markings/sec, 885 secs
lola: 204114451 markings, 617402526 edges, 171361 markings/sec, 890 secs
lola: 204642536 markings, 619226558 edges, 105617 markings/sec, 895 secs
lola: 205157345 markings, 620787565 edges, 102962 markings/sec, 900 secs
lola: 205521332 markings, 622875297 edges, 72797 markings/sec, 905 secs
lola: 206187585 markings, 624806511 edges, 133251 markings/sec, 910 secs
lola: 207550303 markings, 627735653 edges, 272544 markings/sec, 915 secs
lola: 208739773 markings, 630314201 edges, 237894 markings/sec, 920 secs
lola: 208978362 markings, 631652161 edges, 47718 markings/sec, 925 secs
lola: 209376308 markings, 633354644 edges, 79589 markings/sec, 930 secs
lola: 210749877 markings, 636326980 edges, 274714 markings/sec, 935 secs
lola: 211829839 markings, 639016057 edges, 215992 markings/sec, 940 secs
lola: 212195797 markings, 640626685 edges, 73192 markings/sec, 945 secs
lola: 212769502 markings, 642396406 edges, 114741 markings/sec, 950 secs
lola: 214004426 markings, 645496674 edges, 246985 markings/sec, 955 secs
lola: 214837997 markings, 648822181 edges, 166714 markings/sec, 960 secs
lola: 215193873 markings, 650930503 edges, 71175 markings/sec, 965 secs
lola: 215446275 markings, 652659529 edges, 50480 markings/sec, 970 secs
lola: 215674835 markings, 654329735 edges, 45712 markings/sec, 975 secs
lola: 216092420 markings, 656051984 edges, 83517 markings/sec, 980 secs
lola: 216791955 markings, 658458255 edges, 139907 markings/sec, 985 secs
lola: 217474091 markings, 660936966 edges, 136427 markings/sec, 990 secs
lola: 218691865 markings, 663801388 edges, 243555 markings/sec, 995 secs
lola: 219645787 markings, 666259639 edges, 190784 markings/sec, 1000 secs
lola: 220486772 markings, 668203553 edges, 168197 markings/sec, 1005 secs
lola: 220929724 markings, 670681722 edges, 88590 markings/sec, 1010 secs
lola: 221679509 markings, 673139996 edges, 149957 markings/sec, 1015 secs
lola: 222964613 markings, 676142127 edges, 257021 markings/sec, 1020 secs
lola: 224012133 markings, 678796555 edges, 209504 markings/sec, 1025 secs
lola: 224932995 markings, 681313943 edges, 184172 markings/sec, 1030 secs
lola: 225587639 markings, 683744764 edges, 130929 markings/sec, 1035 secs
lola: 226023968 markings, 685971446 edges, 87266 markings/sec, 1040 secs
lola: 226872853 markings, 688747914 edges, 169777 markings/sec, 1045 secs
lola: 227501571 markings, 691252746 edges, 125744 markings/sec, 1050 secs
lola: 228181448 markings, 693439533 edges, 135975 markings/sec, 1055 secs
lola: 228973042 markings, 695924637 edges, 158319 markings/sec, 1060 secs
lola: 229389651 markings, 698128579 edges, 83322 markings/sec, 1065 secs
lola: 230213191 markings, 700219484 edges, 164708 markings/sec, 1070 secs
lola: 231530408 markings, 702908444 edges, 263443 markings/sec, 1075 secs
lola: 232132586 markings, 704616484 edges, 120436 markings/sec, 1080 secs
lola: 232949898 markings, 706720654 edges, 163462 markings/sec, 1085 secs
lola: 233819896 markings, 710183149 edges, 174000 markings/sec, 1090 secs
lola: 234587970 markings, 713259083 edges, 153615 markings/sec, 1095 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes yes yes no no unknown yes yes no yes yes no yes no no yes
lola:
preliminary result: yes yes yes no no unknown yes yes no yes yes no yes no no yes
lola: memory consumption: 3452 KB
lola: time consumption: 1676 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="TCPcondis-PT-15"
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 TCPcondis-PT-15, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-csrt-159033389800340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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