fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r180-ebro-158987899800188
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for DES-PT-00b

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.020 3600000.00 1131332.00 781.90 TFTTTF?FTT?T?F?T normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.3K Mar 30 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 08:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 08:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 26 08:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 26 08:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 66K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591166204213

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:36:47] [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 06:36:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:36:47] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2020-06-03 06:36:47] [INFO ] Transformed 271 places.
[2020-06-03 06:36:47] [INFO ] Transformed 230 transitions.
[2020-06-03 06:36:47] [INFO ] Found NUPN structural information;
[2020-06-03 06:36:47] [INFO ] Parsed PT model containing 271 places and 230 transitions in 336 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 74 ms.
Incomplete random walk after 100000 steps, including 883 resets, run finished after 475 ms. (steps per millisecond=210 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 230 rows 271 cols
[2020-06-03 06:36:48] [INFO ] Computed 59 place invariants in 29 ms
[2020-06-03 06:36:49] [INFO ] [Real]Absence check using 37 positive place invariants in 66 ms returned sat
[2020-06-03 06:36:49] [INFO ] [Real]Absence check using 37 positive and 22 generalized place invariants in 10 ms returned unsat
[2020-06-03 06:36:49] [INFO ] [Real]Absence check using 37 positive place invariants in 21 ms returned unsat
[2020-06-03 06:36:49] [INFO ] [Real]Absence check using 37 positive place invariants in 29 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-03 06:36:49] [INFO ] Flatten gal took : 115 ms
[2020-06-03 06:36:49] [INFO ] Flatten gal took : 43 ms
[2020-06-03 06:36:49] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 19 ms.
[2020-06-03 06:36:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ DES-PT-00b @ 3570 seconds

FORMULA DES-PT-00b-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-00b-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-00b-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA DES-PT-00b-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-00b-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-00b-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-00b-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-00b-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-00b-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-00b-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-00b-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ DES-PT-00b

{
"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",
"--safe",
"--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 06:36:50 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p15)) OR ((1 <= p112) AND (1 <= p114)))",
"processed_size": 48,
"rewrites": 29
},
"result":
{
"edges": 65,
"markings": 66,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 330
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F (((((1 <= p179)) OR ((1 <= p121))) AND (((1 <= p100)) OR ((1 <= p259) AND (1 <= p269))))))",
"processed_size": 97,
"rewrites": 27
},
"result":
{
"edges": 556894,
"markings": 213112,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 413
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 5,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (G ((((((p35 <= 0)) AND ((p78 <= 0))) OR (((p248 <= 0) OR (p256 <= 0)) AND ((p59 <= 0)))) AND (((1 <= p81)) OR (((p155 <= 0) OR (p183 <= 0)) AND ((p264 <= 0)))))))",
"processed_size": 169,
"rewrites": 27
},
"result":
{
"edges": 8268,
"markings": 7616,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 22
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 15,
"problems": 6
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 661
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EG((DEADLOCK OR EG(((p40 <= 0) OR (p229 <= 0)))))",
"processed_size": 50,
"rewrites": 28
},
"net":
{
"conflict_clusters": 186,
"singleton_clusters": 0
},
"result":
{
"edges": 151046,
"markings": 44973,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"error": null,
"memory": 37960,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F(E(G(*)))) : A((E(G(**)) U **)) : E(G((DEADLOCK OR E(G(*))))) : E(G(*)) : E(F(**)) : (A(F(E(X(**)))) AND A(G(E(F(**))))) : (A(F((E(F(**)) AND (** AND **)))) AND (E(F(**)) OR (E(F(**)) OR E(F(**))))) : E(X(A(G(**)))) : E(F(**)) : (E(F(A(G(**)))) OR (E(X(E(F(**)))) OR **)) : (E(G(**)) OR E(F(*))) : E(F(**)) : A(F(E((** U **)))) : A(F(**)) : (E(F(E(G(**)))) OR E(F(A((** U **))))) : E(F(A(X(E(G(**))))))"
},
"net":
{
"arcs": 658,
"conflict_clusters": 186,
"places": 271,
"places_significant": 212,
"singleton_clusters": 0,
"transitions": 230
},
"result":
{
"interim_value": "yes no yes yes yes no unknown no yes yes unknown yes unknown no unknown yes ",
"preliminary_value": "yes no yes yes yes no unknown no yes yes unknown yes unknown no unknown 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: 501/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 271
lola: finding significant places
lola: 271 places, 230 transitions, 212 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p256 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p155 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p189 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p256 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p179 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p259 <= 1)
lola: LP says that atomic proposition is always true: (p269 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: NOT(E (G (A (F (((1 <= p59) AND (1 <= p4))))))) : A ((E (G (((p33 <= 0)))) U ((1 <= p130)))) : E (G ((A (X ((1 <= 0))) OR NOT(A (F (((1 <= p40) AND (1 <= p229)))))))) : NOT(A (F ((((((1 <= p35)) OR ((1 <= p78))) AND (((1 <= p248) AND (1 <= p256)) OR ((1 <= p59)))) OR (((p81 <= 0)) AND (((1 <= p155) AND (1 <= p183)) OR ((1 <= p264)))))))) : E (F (((1 <= p159) AND (1 <= p189)))) : (A (F (E (X ((((1 <= p248) AND (1 <= p253)) OR ((1 <= p244) AND (1 <= p256))))))) AND A (G (E (F ((((1 <= p15)) OR ((1 <= p112) AND (1 <= p114)))))))) : (A (F (((E (F (((1 <= p47)))) AND ((p205 <= 0))) AND (((1 <= p9)) OR ((1 <= p77)))))) AND E (F (((E (F (((1 <= p260)))) OR ((1 <= p1))) OR ((1 <= p51)))))) : E (X (A (G (((1 <= p58)))))) : E (F (A (F (((((1 <= p179)) OR ((1 <= p121))) AND (((1 <= p100)) OR ((1 <= p259) AND (1 <= p269)))))))) : (E (F ((A (G (((1 <= p120)))) OR E (X (((1 <= p147))))))) OR ((1 <= p132) AND (1 <= p235))) : (E (G (((1 <= p191)))) OR NOT(A (G (((p260 <= 0) OR ((1 <= p264))))))) : E (F (((1 <= p109)))) : A (F (E ((((p248 <= 0) OR (p253 <= 0)) U ((1 <= p83) AND (1 <= p35)))))) : A (F (((1 <= p74) AND (1 <= p111)))) : E (F ((E (G (((p145 <= 0)))) OR A ((((1 <= p88)) U ((1 <= p32) AND (1 <= p113))))))) : E (F (A (X (E (G (((1 <= p84))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:548
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (E (X ((((1 <= p248) AND (1 <= p253)) OR ((1 <= p244) AND (1 <= p256))))))) AND A (G (E (F ((((1 <= p15)) OR ((1 <= p112) AND (1 <= p114))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((((1 <= p15)) OR ((1 <= p112) AND (1 <= p114)))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (((1 <= p15)) OR ((1 <= p112) AND (1 <= p114)))
lola: processed formula length: 48
lola: 29 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 66 markings, 65 edges
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((1 <= p15)) OR ((1 <= p112) AND (1 <= p114)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: formula 0: (((p15 <= 0)) AND ((p112 <= 0) OR (p114 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (((1 <= p58))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG(((1 <= p58))))
lola: processed formula length: 20
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (((1 <= p120)))))) OR (E (X (E (F (((1 <= p147)))))) OR ((1 <= p132) AND (1 <= p235))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p132) AND (1 <= p235))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p132) AND (1 <= p235))
lola: processed formula length: 29
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p120))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p120 <= 0))
lola: processed formula length: 13
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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p120))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: 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: ((p120 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-3-0.sara
lola: state equation: write sara problem file to CTLFireability-3-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-3-0.sara.
sara: try reading problem file CTLFireability-3-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 264626 markings, 1398527 edges, 52925 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 524152 markings, 2837434 edges, 51905 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 771844 markings, 4259051 edges, 49538 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 983359 markings, 5645244 edges, 42303 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 1199815 markings, 7064487 edges, 43291 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 1416741 markings, 8493969 edges, 43385 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 1629155 markings, 9849809 edges, 42483 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 1839657 markings, 11229034 edges, 42100 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 2048145 markings, 12624638 edges, 41698 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 2285958 markings, 14020314 edges, 47563 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 2520468 markings, 15427033 edges, 46902 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 2720384 markings, 16807094 edges, 39983 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 2925562 markings, 18195873 edges, 41036 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 3122134 markings, 19553102 edges, 39314 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 3337413 markings, 20923907 edges, 43056 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 3573989 markings, 22309821 edges, 47315 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 3782945 markings, 23664569 edges, 41791 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 3980680 markings, 25023055 edges, 39547 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 4177567 markings, 26360294 edges, 39377 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 4371739 markings, 27693604 edges, 38834 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 4547503 markings, 29043852 edges, 35153 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 4700463 markings, 30401103 edges, 30592 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 4943836 markings, 31752048 edges, 48675 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 5173460 markings, 33090555 edges, 45925 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 5374738 markings, 34411619 edges, 40256 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 5566932 markings, 35703199 edges, 38439 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 5760533 markings, 36986774 edges, 38720 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 5958988 markings, 38319094 edges, 39691 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 6168499 markings, 39670195 edges, 41902 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 6391557 markings, 41032931 edges, 44612 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 6578648 markings, 42342088 edges, 37418 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 6769895 markings, 43671673 edges, 38249 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 6976401 markings, 45013747 edges, 41301 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 7198217 markings, 46370811 edges, 44363 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 7387827 markings, 47698498 edges, 37922 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 7577063 markings, 49013518 edges, 37847 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 7759662 markings, 50351739 edges, 36520 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 7910832 markings, 51685373 edges, 30234 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 8152049 markings, 53052026 edges, 48243 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 8391450 markings, 54447973 edges, 47880 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 8595665 markings, 55789384 edges, 40843 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 8798541 markings, 57159489 edges, 40575 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 9001593 markings, 58497738 edges, 40610 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 9200238 markings, 59835603 edges, 39729 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 9414816 markings, 61198733 edges, 42916 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 9634791 markings, 62567707 edges, 43995 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 9826084 markings, 63915465 edges, 38259 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 10020930 markings, 65259401 edges, 38969 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 10234049 markings, 66611341 edges, 42624 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 10450684 markings, 67971622 edges, 43327 markings/sec, 245 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown no unknown no unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown no unknown no unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 496632 KB
lola: time consumption: 260 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 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((1 <= p147))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: ((1 <= p147))
lola: processed formula length: 13
lola: 28 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 /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: 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 <= p147))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 14 markings, 13 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (E (G (((1 <= p84))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(EG(((1 <= p84)))))
lola: processed formula length: 24
lola: 29 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 81 markings, 160 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p109))))
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 <= p109))))
lola: processed formula length: 21
lola: 27 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 <= p109))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 30 markings, 29 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p159) AND (1 <= p189))))
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 <= p159) AND (1 <= p189))))
lola: processed formula length: 37
lola: 27 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 <= p159) AND (1 <= p189))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((1 <= p179)) OR ((1 <= p121))) AND (((1 <= p100)) OR ((1 <= p259) AND (1 <= p269))))))
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 <= p179)) OR ((1 <= p121))) AND (((1 <= p100)) OR ((1 <= p259) AND (1 <= p269))))))
lola: processed formula length: 97
lola: 27 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 <= p179)) OR ((1 <= p121))) AND (((1 <= p100)) OR ((1 <= p259) AND (1 <= p269))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 213112 markings, 556894 edges
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p74) AND (1 <= p111))))
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: ((p74 <= 0) OR (p111 <= 0))
lola: processed formula length: 28
lola: 29 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p74) AND (1 <= p111))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-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: 11169 markings, 13070 edges
lola: ========================================
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((((p35 <= 0)) AND ((p78 <= 0))) OR (((p248 <= 0) OR (p256 <= 0)) AND ((p59 <= 0)))) AND (((1 <= p81)) OR (((p155 <= 0) OR (p183 <= 0)) AND ((p264 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((((p35 <= 0)) AND ((p78 <= 0))) OR (((p248 <= 0) OR (p256 <= 0)) AND ((p59 <= 0)))) AND (((1 <= p81)) OR (((p155 <= 0) OR (p183 <= 0)) AND ((p264 <= 0)))))))
lola: processed formula length: 169
lola: 27 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((((1 <= p35)) OR ((1 <= p78))) AND (((1 <= p248) AND (1 <= p256)) OR ((1 <= p59)))) OR (((p81 <= 0)) AND (((1 <= p155) AND (1 <= p183)) OR ((1 <= p264)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 15 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.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 7616 markings, 8268 edges
lola: ========================================
lola: subprocess 9 will run for 472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((p59 <= 0) OR (p4 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(((p59 <= 0) OR (p4 <= 0))))
lola: processed formula length: 34
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 84 markings, 84 edges
lola: ========================================
lola: subprocess 10 will run for 551 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (G (((p33 <= 0)))) U ((1 <= p130))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EG(((p33 <= 0))) U ((1 <= p130)))
lola: processed formula length: 35
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 126813 markings, 307354 edges
lola: ========================================
lola: subprocess 11 will run for 661 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((DEADLOCK OR E (G (((p40 <= 0) OR (p229 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((DEADLOCK OR EG(((p40 <= 0) OR (p229 <= 0)))))
lola: processed formula length: 50
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 44973 markings, 151046 edges
lola: ========================================
lola: subprocess 12 will run for 826 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E ((((p248 <= 0) OR (p253 <= 0)) U ((1 <= p83) AND (1 <= p35))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(E(((p248 <= 0) OR (p253 <= 0)) U ((1 <= p83) AND (1 <= p35))))
lola: processed formula length: 66
lola: 28 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: 278583 markings, 1374950 edges, 55717 markings/sec, 0 secs
lola: 503610 markings, 2716163 edges, 45005 markings/sec, 5 secs
lola: 729345 markings, 4049355 edges, 45147 markings/sec, 10 secs
lola: 977770 markings, 5399441 edges, 49685 markings/sec, 15 secs
lola: 1192343 markings, 6731278 edges, 42915 markings/sec, 20 secs
lola: 1425144 markings, 8054379 edges, 46560 markings/sec, 25 secs
lola: 1646298 markings, 9370870 edges, 44231 markings/sec, 30 secs
lola: 1847357 markings, 10699194 edges, 40212 markings/sec, 35 secs
lola: 2011432 markings, 12040480 edges, 32815 markings/sec, 40 secs
lola: 2255531 markings, 13327238 edges, 48820 markings/sec, 45 secs
lola: 2471887 markings, 14628515 edges, 43271 markings/sec, 50 secs
lola: 2699168 markings, 15933658 edges, 45456 markings/sec, 55 secs
lola: 2914281 markings, 17238392 edges, 43023 markings/sec, 60 secs
lola: 3143014 markings, 18532632 edges, 45747 markings/sec, 65 secs
lola: 3347737 markings, 19818963 edges, 40945 markings/sec, 70 secs
lola: 3516113 markings, 21135621 edges, 33675 markings/sec, 75 secs
lola: 3740270 markings, 22438862 edges, 44831 markings/sec, 80 secs
lola: 3960078 markings, 23741687 edges, 43962 markings/sec, 85 secs
lola: 4177462 markings, 25029360 edges, 43477 markings/sec, 90 secs
lola: 4405680 markings, 26343888 edges, 45644 markings/sec, 95 secs
lola: 4624048 markings, 27637893 edges, 43674 markings/sec, 100 secs
lola: 4843808 markings, 28940720 edges, 43952 markings/sec, 105 secs
lola: 5030757 markings, 30249612 edges, 37390 markings/sec, 110 secs
lola: 5190634 markings, 31567592 edges, 31975 markings/sec, 115 secs
lola: 5356187 markings, 32903733 edges, 33111 markings/sec, 120 secs
lola: 5511265 markings, 34224452 edges, 31016 markings/sec, 125 secs
lola: 5674379 markings, 35561269 edges, 32623 markings/sec, 130 secs
lola: 5824444 markings, 36882991 edges, 30013 markings/sec, 135 secs
lola: 5984904 markings, 38195423 edges, 32092 markings/sec, 140 secs
lola: 6126583 markings, 39472596 edges, 28336 markings/sec, 145 secs
lola: 6241947 markings, 40774857 edges, 23073 markings/sec, 150 secs
lola: 6460401 markings, 42050178 edges, 43691 markings/sec, 155 secs
lola: 6688249 markings, 43318180 edges, 45570 markings/sec, 160 secs
lola: 6900611 markings, 44569582 edges, 42472 markings/sec, 165 secs
lola: 7119609 markings, 45839873 edges, 43800 markings/sec, 170 secs
lola: 7344788 markings, 47127803 edges, 45036 markings/sec, 175 secs
lola: 7550762 markings, 48402918 edges, 41195 markings/sec, 180 secs
lola: 7785078 markings, 49681762 edges, 46863 markings/sec, 185 secs
lola: 7990229 markings, 50955230 edges, 41030 markings/sec, 190 secs
lola: 8169413 markings, 52247222 edges, 35837 markings/sec, 195 secs
lola: 8352572 markings, 53520891 edges, 36632 markings/sec, 200 secs
lola: 8580994 markings, 54783062 edges, 45684 markings/sec, 205 secs
lola: 8789157 markings, 56035848 edges, 41633 markings/sec, 210 secs
lola: 9015523 markings, 57298339 edges, 45273 markings/sec, 215 secs
lola: 9215453 markings, 58555058 edges, 39986 markings/sec, 220 secs
lola: 9438354 markings, 59811317 edges, 44580 markings/sec, 225 secs
lola: 9638556 markings, 61064162 edges, 40040 markings/sec, 230 secs
lola: 9797034 markings, 62343047 edges, 31696 markings/sec, 235 secs
lola: 10021550 markings, 63615981 edges, 44903 markings/sec, 240 secs
lola: 10235187 markings, 64891474 edges, 42727 markings/sec, 245 secs
lola: 10448329 markings, 66152953 edges, 42628 markings/sec, 250 secs
lola: 10671747 markings, 67441578 edges, 44684 markings/sec, 255 secs
lola: 10885955 markings, 68713274 edges, 42842 markings/sec, 260 secs
lola: 11104240 markings, 69995717 edges, 43657 markings/sec, 265 secs
lola: 11291172 markings, 71281796 edges, 37386 markings/sec, 270 secs
lola: 11445968 markings, 72572086 edges, 30959 markings/sec, 275 secs
lola: 11609925 markings, 73879178 edges, 32791 markings/sec, 280 secs
lola: 11761089 markings, 75165899 edges, 30233 markings/sec, 285 secs
lola: 11920883 markings, 76468871 edges, 31959 markings/sec, 290 secs
lola: 12067600 markings, 77757595 edges, 29343 markings/sec, 295 secs
lola: 12226146 markings, 79056048 edges, 31709 markings/sec, 300 secs
lola: 12371805 markings, 80339687 edges, 29132 markings/sec, 305 secs
lola: 12490665 markings, 81644546 edges, 23772 markings/sec, 310 secs
lola: 12678538 markings, 82907708 edges, 37575 markings/sec, 315 secs
lola: 12912396 markings, 84160891 edges, 46772 markings/sec, 320 secs
lola: 13124244 markings, 85408802 edges, 42370 markings/sec, 325 secs
lola: 13330194 markings, 86648766 edges, 41190 markings/sec, 330 secs
lola: 13562045 markings, 87910629 edges, 46370 markings/sec, 335 secs
lola: 13763447 markings, 89162149 edges, 40280 markings/sec, 340 secs
lola: 13990343 markings, 90420971 edges, 45379 markings/sec, 345 secs
lola: 14196565 markings, 91669846 edges, 41244 markings/sec, 350 secs
lola: 14386674 markings, 92922926 edges, 38022 markings/sec, 355 secs
lola: 14533405 markings, 94183494 edges, 29346 markings/sec, 360 secs
lola: 14773562 markings, 95427574 edges, 48031 markings/sec, 365 secs
lola: 14979739 markings, 96667990 edges, 41235 markings/sec, 370 secs
lola: 15189482 markings, 97902095 edges, 41949 markings/sec, 375 secs
lola: 15402486 markings, 99154097 edges, 42601 markings/sec, 380 secs
lola: 15612121 markings, 100382431 edges, 41927 markings/sec, 385 secs
lola: 15819716 markings, 101620195 edges, 41519 markings/sec, 390 secs
lola: 15998721 markings, 102863553 edges, 35801 markings/sec, 395 secs
lola: 16169368 markings, 104109871 edges, 34129 markings/sec, 400 secs
lola: 16400719 markings, 105368704 edges, 46270 markings/sec, 405 secs
lola: 16607765 markings, 106614694 edges, 41409 markings/sec, 410 secs
lola: 16829839 markings, 107867080 edges, 44415 markings/sec, 415 secs
lola: 17032132 markings, 109116181 edges, 40459 markings/sec, 420 secs
lola: 17254558 markings, 110369556 edges, 44485 markings/sec, 425 secs
lola: 17448762 markings, 111589041 edges, 38841 markings/sec, 430 secs
lola: 17609453 markings, 112821696 edges, 32138 markings/sec, 435 secs
lola: 17768706 markings, 114088117 edges, 31851 markings/sec, 440 secs
lola: 17919708 markings, 115334239 edges, 30200 markings/sec, 445 secs
lola: 18065491 markings, 116575046 edges, 29157 markings/sec, 450 secs
lola: 18220744 markings, 117845073 edges, 31051 markings/sec, 455 secs
lola: 18362168 markings, 119093652 edges, 28285 markings/sec, 460 secs
lola: 18513186 markings, 120320864 edges, 30204 markings/sec, 465 secs
lola: 18653671 markings, 121563536 edges, 28097 markings/sec, 470 secs
lola: 18767472 markings, 122831337 edges, 22760 markings/sec, 475 secs
lola: 18907526 markings, 124092374 edges, 28011 markings/sec, 480 secs
lola: 19071673 markings, 125404119 edges, 32829 markings/sec, 485 secs
lola: 19217192 markings, 126673233 edges, 29104 markings/sec, 490 secs
lola: 19359141 markings, 127930576 edges, 28390 markings/sec, 495 secs
lola: 19498319 markings, 129163014 edges, 27836 markings/sec, 500 secs
lola: 19644574 markings, 130436810 edges, 29251 markings/sec, 505 secs
lola: 19801111 markings, 131733370 edges, 31307 markings/sec, 510 secs
lola: 19938509 markings, 133002897 edges, 27480 markings/sec, 515 secs
lola: 20076575 markings, 134265264 edges, 27613 markings/sec, 520 secs
lola: 20226684 markings, 135519047 edges, 30022 markings/sec, 525 secs
lola: 20370465 markings, 136779544 edges, 28756 markings/sec, 530 secs
lola: 20508221 markings, 138033959 edges, 27551 markings/sec, 535 secs
lola: 20642376 markings, 139307254 edges, 26831 markings/sec, 540 secs
lola: 20754079 markings, 140575064 edges, 22341 markings/sec, 545 secs
lola: 20887077 markings, 141828677 edges, 26600 markings/sec, 550 secs
lola: 21041737 markings, 143084401 edges, 30932 markings/sec, 555 secs
lola: 21178693 markings, 144322916 edges, 27391 markings/sec, 560 secs
lola: 21318010 markings, 145560300 edges, 27863 markings/sec, 565 secs
lola: 21460478 markings, 146798981 edges, 28494 markings/sec, 570 secs
lola: 21608152 markings, 148073895 edges, 29535 markings/sec, 575 secs
lola: 21744818 markings, 149327054 edges, 27333 markings/sec, 580 secs
lola: 21887874 markings, 150556769 edges, 28611 markings/sec, 585 secs
lola: 22028636 markings, 151802230 edges, 28152 markings/sec, 590 secs
lola: 22164223 markings, 153045615 edges, 27117 markings/sec, 595 secs
lola: 22285336 markings, 154311847 edges, 24223 markings/sec, 600 secs
lola: 22400383 markings, 155557367 edges, 23009 markings/sec, 605 secs
lola: 22561756 markings, 156855470 edges, 32275 markings/sec, 610 secs
lola: 22704203 markings, 158109443 edges, 28489 markings/sec, 615 secs
lola: 22843389 markings, 159345390 edges, 27837 markings/sec, 620 secs
lola: 22984387 markings, 160609110 edges, 28200 markings/sec, 625 secs
lola: 23139168 markings, 161900073 edges, 30956 markings/sec, 630 secs
lola: 23277502 markings, 163169470 edges, 27667 markings/sec, 635 secs
lola: 23421091 markings, 164437737 edges, 28718 markings/sec, 640 secs
lola: 23568237 markings, 165708388 edges, 29429 markings/sec, 645 secs
lola: 23705351 markings, 166965993 edges, 27423 markings/sec, 650 secs
lola: 23832532 markings, 168243295 edges, 25436 markings/sec, 655 secs
lola: 23939740 markings, 169498060 edges, 21442 markings/sec, 660 secs
lola: 24063657 markings, 170785512 edges, 24783 markings/sec, 665 secs
lola: 24175863 markings, 172047168 edges, 22441 markings/sec, 670 secs
lola: 24285154 markings, 173291824 edges, 21858 markings/sec, 675 secs
lola: 24398433 markings, 174555261 edges, 22656 markings/sec, 680 secs
lola: 24511480 markings, 175828278 edges, 22609 markings/sec, 685 secs
lola: 24618361 markings, 177074947 edges, 21376 markings/sec, 690 secs
lola: 24734474 markings, 178346224 edges, 23223 markings/sec, 695 secs
lola: 24838617 markings, 179556177 edges, 20829 markings/sec, 700 secs
lola: 24941079 markings, 180790541 edges, 20492 markings/sec, 705 secs
lola: 25029350 markings, 182048797 edges, 17654 markings/sec, 710 secs
lola: 25170792 markings, 183266207 edges, 28288 markings/sec, 715 secs
lola: 25406934 markings, 184484008 edges, 47228 markings/sec, 720 secs
lola: 25608690 markings, 185698488 edges, 40351 markings/sec, 725 secs
lola: 25811852 markings, 186895706 edges, 40632 markings/sec, 730 secs
lola: 26034443 markings, 188111205 edges, 44518 markings/sec, 735 secs
lola: 26234920 markings, 189323423 edges, 40095 markings/sec, 740 secs
lola: 26437308 markings, 190525894 edges, 40478 markings/sec, 745 secs
lola: 26650174 markings, 191743503 edges, 42573 markings/sec, 750 secs
lola: 26843746 markings, 192944487 edges, 38714 markings/sec, 755 secs
lola: 27003483 markings, 194164610 edges, 31947 markings/sec, 760 secs
lola: 27186423 markings, 195361088 edges, 36588 markings/sec, 765 secs
lola: 27399839 markings, 196551638 edges, 42683 markings/sec, 770 secs
lola: 27596394 markings, 197731757 edges, 39311 markings/sec, 775 secs
lola: 27809126 markings, 198925274 edges, 42546 markings/sec, 780 secs
lola: 28000724 markings, 200109663 edges, 38320 markings/sec, 785 secs
lola: 28211369 markings, 201294459 edges, 42129 markings/sec, 790 secs
lola: 28399690 markings, 202470739 edges, 37664 markings/sec, 795 secs
lola: 28564194 markings, 203670289 edges, 32901 markings/sec, 800 secs
lola: 28739389 markings, 204860990 edges, 35039 markings/sec, 805 secs
lola: 28957200 markings, 206067075 edges, 43562 markings/sec, 810 secs
lola: 29156134 markings, 207262484 edges, 39787 markings/sec, 815 secs
lola: 29370820 markings, 208470607 edges, 42937 markings/sec, 820 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes no yes yes yes no unknown no yes yes unknown yes unknown no unknown yes
lola: memory consumption: 2239664 KB
lola: time consumption: 1091 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 13 will run for 826 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((1 <= p191)))) OR E (F (((1 <= p260) AND ((p264 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: yes no yes yes yes no unknown no yes yes unknown yes unknown no unknown yes
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 37960 KB
lola: time consumption: 1917 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: time limit reached - aborting
lola:
preliminary result: yes no yes yes yes no unknown no yes yes unknown yes unknown no unknown yes
lola:
preliminary result: yes no yes yes yes no unknown no yes yes unknown yes unknown no unknown yes
lola: memory consumption: 37960 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 16111524 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16111768 kB

--------------------
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="DES-PT-00b"
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 DES-PT-00b, 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 r180-ebro-158987899800188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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