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.r174-csrt-158987852800204.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 NeighborGrid-PT-d4n3m2c23, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987852800204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 3.6K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 10 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rwxr-xr-x 1 mcc users 469K Apr 27 15:14 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 NeighborGrid-PT-d4n3m2c23-CTLFireability-00
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLFireability-01
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLFireability-02
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLFireability-03
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLFireability-04
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLFireability-05
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLFireability-06
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLFireability-07
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLFireability-08
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLFireability-09
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLFireability-10
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLFireability-11
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLFireability-12
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLFireability-13
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLFireability-14
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591134366878

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 21:46:09] [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-02 21:46:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 21:46:09] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2020-06-02 21:46:09] [INFO ] Transformed 81 places.
[2020-06-02 21:46:09] [INFO ] Transformed 1632 transitions.
[2020-06-02 21:46:09] [INFO ] Parsed PT model containing 81 places and 1632 transitions in 157 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Finished random walk after 28514 steps, including 0 resets, run visited all 45 properties in 62 ms. (steps per millisecond=459 )
[2020-06-02 21:46:09] [INFO ] Flatten gal took : 132 ms
[2020-06-02 21:46:09] [INFO ] Flatten gal took : 55 ms
[2020-06-02 21:46:09] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-02 21:46:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 16 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ NeighborGrid-PT-d4n3m2c23 @ 3570 seconds

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2026
rslt: Output for CTLFireability @ NeighborGrid-PT-d4n3m2c23

{
"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": "Tue Jun 2 21:46:10 2020
",
"timelimit": 3570
},
"child":
[

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": "A (G ((p24 <= 0)))",
"processed_size": 18,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"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": 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": "(p77 <= 0)",
"processed_size": 10,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"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": 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": "(p48 <= 0)",
"processed_size": 10,
"rewrites": 34
},
"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": 50
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": "A (G ((1 <= p54)))",
"processed_size": 18,
"rewrites": 33
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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": "EG(AX(EX((1 <= p7))))",
"processed_size": 21,
"rewrites": 34
},
"net":
{
"conflict_clusters": 81,
"singleton_clusters": 0
},
"result":
{
"edges": 1087,
"markings": 1086,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"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": "(p17 <= 0)",
"processed_size": 10,
"rewrites": 33
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 5,
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"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 (((p16 <= 0) AND (p30 <= 0))))",
"processed_size": 35,
"rewrites": 32
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"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": "EG((((p76 <= 0) OR (p48 <= 0) OR (1 <= p1)) OR AF((p30 <= 0))))",
"processed_size": 65,
"rewrites": 33
},
"net":
{
"conflict_clusters": 81,
"singleton_clusters": 0
},
"result":
{
"edges": 1153,
"markings": 1153,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A((EG((1 <= p49)) OR ((p65 <= 0) AND ((1 <= p75) OR (1 <= p70)))) U (((p30 <= 0) OR (p46 <= 0)) AND ((p20 <= 0) OR (p41 <= 0))))",
"processed_size": 131,
"rewrites": 33
},
"net":
{
"conflict_clusters": 81,
"singleton_clusters": 0
},
"result":
{
"edges": 19171,
"markings": 18846,
"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": 610
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A(AF((p46 <= 0)) U EG(((1 <= p17) AND (1 <= p80))))",
"processed_size": 51,
"rewrites": 34
},
"net":
{
"conflict_clusters": 81,
"singleton_clusters": 0
},
"result":
{
"edges": 7925,
"markings": 7916,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 763
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 2,
"F": 1,
"G": 3,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 2,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "(A(((1 <= p66) OR ((1 <= p68) AND (1 <= p37))) U AG((1 <= p34))) AND (EG((((1 <= p22) OR (1 <= p36)) AND (1 <= p61) AND (1 <= p12))) OR (EG(((1 <= p3) OR (1 <= p46))) AND (AF((1 <= p1)) OR ((1 <= p71) OR ((1 <= p45) OR (1 <= p49)))))))",
"processed_size": 238,
"rewrites": 36
},
"net":
{
"conflict_clusters": 81,
"singleton_clusters": 0
},
"result":
{
"edges": 417,
"markings": 369,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1018
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": "A (G ((1 <= p51)))",
"processed_size": 18,
"rewrites": 33
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1527
},
"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": "(p28 <= 0)",
"processed_size": 10,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3054
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (((1 <= p41) U (p54 <= 0)))",
"processed_size": 29,
"rewrites": 36
},
"result":
{
"edges": 37,
"markings": 37,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 48
},
"threads": 1,
"type": "dfs"
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3054
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": "A (G (((1 <= p10) AND (1 <= p34))))",
"processed_size": 35,
"rewrites": 33
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 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": "(p28 <= 0)",
"processed_size": 10,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (((1 <= p41) U (p54 <= 0)))",
"processed_size": 29,
"rewrites": 36
},
"result":
{
"edges": 37,
"markings": 37,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 48
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F ((((p36 <= 0) OR (p70 <= 0)) AND ((p25 <= 0) OR (p66 <= 0)))))",
"processed_size": 69,
"rewrites": 32
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 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": "A (G (((1 <= p10) AND (1 <= p34))))",
"processed_size": 35,
"rewrites": 33
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(EG(((1 <= p5) AND (1 <= p55))))",
"processed_size": 34,
"rewrites": 33
},
"net":
{
"conflict_clusters": 81,
"singleton_clusters": 0
},
"result":
{
"edges": 8864,
"markings": 8736,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 4116,
"runtime": 1543.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G((** OR A(F(*))))) : (A(G(*)) OR A(F(E(G(**))))) : A((A(F(*)) U E(G(**)))) : A(X(E(F(*)))) : A(G(**)) : (E(F(**)) OR (A((** U **)) OR **)) : A(((E(G(**)) OR **) U **)) : E(G(A(X(**)))) : E(F(**)) : (A((** U A(G(**)))) AND (E(G(**)) OR (E(G(**)) AND (A(F(**)) OR (** OR (** OR **)))))) : ((** AND (E(G(**)) AND (E(F(**)) AND **))) OR (A(G(A(F(**)))) AND (A(X(**)) OR A(G(*))))) : (A(G(**)) AND (A(X(**)) AND (A((** U **)) AND (A(F(**)) AND E(G((A(G(**)) OR **))))))) : E((** U A(G(**)))) : (A(F(**)) AND A(G(**))) : E(G(A(X(E(X(**)))))) : E(X(E(F(**))))"
},
"net":
{
"arcs": 3264,
"conflict_clusters": 81,
"places": 81,
"places_significant": 80,
"singleton_clusters": 0,
"transitions": 1632
},
"result":
{
"preliminary_value": "yes yes yes yes no yes no yes yes no no no unknown no yes yes ",
"value": "yes yes yes yes no yes no yes yes no no no unknown no yes 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: 1713/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2592
lola: finding significant places
lola: 81 places, 1632 transitions, 80 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: E (G ((((p76 <= 0) OR (p48 <= 0) OR (1 <= p1)) OR NOT(E (G ((1 <= p30))))))) : (NOT(E (F (((p10 <= 0) OR (p34 <= 0))))) OR A (F (E (G (((1 <= p5) AND (1 <= p55))))))) : A ((NOT(E (G ((1 <= p46)))) U E (G (((1 <= p17) AND (1 <= p80)))))) : A (X (NOT(A (G (((1 <= p66) AND (1 <= p10))))))) : A (G (((1 <= p32) AND (1 <= p74)))) : ((E (F ((((p36 <= 0) OR (p70 <= 0)) AND ((p25 <= 0) OR (p66 <= 0))))) OR A (((1 <= p41) U (p54 <= 0)))) OR (p28 <= 0)) : A (((E (G ((1 <= p49))) OR ((p65 <= 0) AND ((1 <= p75) OR (1 <= p70)))) U (((p30 <= 0) OR (p46 <= 0)) AND ((p20 <= 0) OR (p41 <= 0))))) : E (G (A (X (((p67 <= 0) OR (1 <= p11)))))) : E (F (E (F (((p16 <= 0) AND (p30 <= 0)))))) : (A ((((1 <= p66) OR ((1 <= p68) AND (1 <= p37))) U A (G ((1 <= p34))))) AND (E (G ((((1 <= p22) OR (1 <= p36)) AND (1 <= p61) AND (1 <= p12)))) OR (E (G (((1 <= p3) OR (1 <= p46)))) AND (((A (F ((1 <= p1))) OR (1 <= p71)) OR (1 <= p45)) OR (1 <= p49))))) : (((((p77 <= 0) AND E (G (((1 <= p38) AND (1 <= p36))))) AND E (F (((1 <= p10) AND (p2 <= 0))))) AND ((p64 <= 0) OR (p44 <= 0))) OR (A (G (A (F ((1 <= p74))))) AND (A (X (((1 <= p34) AND (1 <= p12)))) OR NOT(E (F ((1 <= p24))))))) : ((((A (G ((1 <= p54))) AND A (X ((1 <= p13)))) AND A (((1 <= p44) U (1 <= p10)))) AND A (F ((1 <= p48)))) AND E (G ((A (G ((1 <= p40))) OR ((p34 <= 0) AND (1 <= p50)))))) : E ((((1 <= p9) AND (((1 <= p44) AND (1 <= p27)) OR ((1 <= p46) AND (1 <= p70)))) U A (G ((1 <= p36))))) : (A (F (A (F (((1 <= p49) OR (1 <= p12)))))) AND A (G ((1 <= p51)))) : E (G (A (X (E (X ((1 <= p7))))))) : E (F (E (X ((p17 <= 0)))))
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:401
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:395
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 (X (E (F (((p66 <= 0) OR (p10 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(((p66 <= 0) OR (p10 <= 0))))
lola: processed formula length: 35
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 22971 markings, 23145 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (X (((p67 <= 0) OR (1 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AX(((p67 <= 0) OR (1 <= p11))))
lola: processed formula length: 35
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1177 markings, 1179 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p77 <= 0) AND (E (G (((1 <= p38) AND (1 <= p36)))) AND (E (F (((1 <= p10) AND (p2 <= 0)))) AND ((p64 <= 0) OR (p44 <= 0))))) OR (A (G (A (F ((1 <= p74))))) AND (A (X (((1 <= p34) AND (1 <= p12)))) OR A (G ((p24 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p24 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p24 <= 0)))
lola: processed formula length: 18
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p24)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p77 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p77 <= 0)
lola: processed formula length: 10
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((1 <= p74)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p74 <= 0)
lola: processed formula length: 10
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: 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)
lola: state equation task get result unparse finished id 0
lola: state equation task get result started, id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
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: (p74 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate does not eventually occur from all states.
lola: 69 markings, 69 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((1 <= p54))) AND (A (X ((1 <= p13))) AND (A (((1 <= p44) U (1 <= p10))) AND (A (F ((1 <= p48))) AND E (G ((A (G ((1 <= p40))) OR ((p34 <= 0) AND (1 <= p50)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p48)))
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: (p48 <= 0)
lola: processed formula length: 10
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p48)
lola: state equation task get result unparse finished id 0
lola: The predicate eventually occurs.
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p54)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((1 <= p54)))
lola: processed formula length: 18
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p54 <= 0)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (X (E (X ((1 <= p7)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AX(EX((1 <= p7))))
lola: processed formula length: 21
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: 1086 markings, 1087 edges
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((p17 <= 0)))))
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: (p17 <= 0)
lola: processed formula length: 10
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 /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: (p17 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 3 markings, 2 edges
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p32) AND (1 <= p74))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((1 <= p32) AND (1 <= p74))))
lola: processed formula length: 35
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
sara: try reading problem file CTLFireability-5-0.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p32 <= 0) OR (p74 <= 0))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p16 <= 0) AND (p30 <= 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 (((p16 <= 0) AND (p30 <= 0))))
lola: processed formula length: 35
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p16 <= 0) AND (p30 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p76 <= 0) OR (p48 <= 0) OR (1 <= p1)) OR A (F ((p30 <= 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((((p76 <= 0) OR (p48 <= 0) OR (1 <= p1)) OR AF((p30 <= 0))))
lola: processed formula length: 65
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: 1153 markings, 1153 edges
lola: ========================================
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p9) AND (((1 <= p44) AND (1 <= p27)) OR ((1 <= p46) AND (1 <= p70)))) U A (G ((1 <= p36)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((1 <= p9) AND (((1 <= p44) AND (1 <= p27)) OR ((1 <= p46) AND (1 <= p70)))) U AG((1 <= p36)))
lola: processed formula length: 97
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic

lola: 1076648 markings, 2656586 edges, 215330 markings/sec, 0 secs
lola: 2023413 markings, 5070411 edges, 189353 markings/sec, 5 secs
lola: 2950166 markings, 7582099 edges, 185351 markings/sec, 10 secs
lola: 3883578 markings, 9964813 edges, 186682 markings/sec, 15 secs
lola: 4711458 markings, 12323949 edges, 165576 markings/sec, 20 secs
lola: 5608917 markings, 14614329 edges, 179492 markings/sec, 25 secs
lola: 6491128 markings, 17027620 edges, 176442 markings/sec, 30 secs
lola: 7337530 markings, 19325804 edges, 169280 markings/sec, 35 secs
lola: 8215031 markings, 21699298 edges, 175500 markings/sec, 40 secs
lola: 9118609 markings, 24105102 edges, 180716 markings/sec, 45 secs
lola: 9935946 markings, 26274237 edges, 163467 markings/sec, 50 secs
lola: 10720897 markings, 28390207 edges, 156990 markings/sec, 55 secs
lola: 11407407 markings, 30487020 edges, 137302 markings/sec, 60 secs
lola: 12105069 markings, 32495300 edges, 139532 markings/sec, 65 secs
lola: 12886554 markings, 34689850 edges, 156297 markings/sec, 70 secs
lola: 13553731 markings, 36635679 edges, 133435 markings/sec, 75 secs
lola: 14159248 markings, 38549597 edges, 121103 markings/sec, 80 secs
lola: 15005575 markings, 40888120 edges, 169265 markings/sec, 85 secs
lola: 15964862 markings, 43333714 edges, 191857 markings/sec, 90 secs
lola: 16757853 markings, 45466311 edges, 158598 markings/sec, 95 secs
lola: 17612531 markings, 47621708 edges, 170936 markings/sec, 100 secs
lola: 18361645 markings, 49702087 edges, 149823 markings/sec, 105 secs
lola: 19054768 markings, 51717956 edges, 138625 markings/sec, 110 secs
lola: 19834532 markings, 53761025 edges, 155953 markings/sec, 115 secs
lola: 20639343 markings, 56076124 edges, 160962 markings/sec, 120 secs
lola: 21428952 markings, 58359776 edges, 157922 markings/sec, 125 secs
lola: 22159055 markings, 60444267 edges, 146021 markings/sec, 130 secs
lola: 22873126 markings, 62557495 edges, 142814 markings/sec, 135 secs
lola: 23544952 markings, 64475429 edges, 134365 markings/sec, 140 secs
lola: 24192061 markings, 66426321 edges, 129422 markings/sec, 145 secs
lola: 24918820 markings, 68339885 edges, 145352 markings/sec, 150 secs
lola: 25629477 markings, 70412800 edges, 142131 markings/sec, 155 secs
lola: 26323459 markings, 72363700 edges, 138796 markings/sec, 160 secs
lola: 26949358 markings, 74213930 edges, 125180 markings/sec, 165 secs
lola: 27666407 markings, 76200261 edges, 143410 markings/sec, 170 secs
lola: 28363101 markings, 78277868 edges, 139339 markings/sec, 175 secs
lola: 29542355 markings, 81221223 edges, 235851 markings/sec, 180 secs
lola: 30621226 markings, 83992729 edges, 215774 markings/sec, 185 secs
lola: 31623275 markings, 86591125 edges, 200410 markings/sec, 190 secs
lola: 32534051 markings, 89036500 edges, 182155 markings/sec, 195 secs
lola: 33331414 markings, 91434727 edges, 159473 markings/sec, 200 secs
lola: 34339830 markings, 93987227 edges, 201683 markings/sec, 205 secs
lola: 35223477 markings, 96254891 edges, 176729 markings/sec, 210 secs
lola: 36148247 markings, 98613721 edges, 184954 markings/sec, 215 secs
lola: 36916756 markings, 100890398 edges, 153702 markings/sec, 220 secs
lola: 37814056 markings, 103498959 edges, 179460 markings/sec, 225 secs
lola: 38584253 markings, 105760392 edges, 154039 markings/sec, 230 secs
lola: 39489148 markings, 108126188 edges, 180979 markings/sec, 235 secs
lola: 40497131 markings, 110705884 edges, 201597 markings/sec, 240 secs
lola: 41447004 markings, 113310391 edges, 189975 markings/sec, 245 secs
lola: 42448819 markings, 115780819 edges, 200363 markings/sec, 250 secs
lola: 43400797 markings, 118234998 edges, 190396 markings/sec, 255 secs
lola: 44154045 markings, 120486906 edges, 150650 markings/sec, 260 secs
lola: 44998832 markings, 122896054 edges, 168957 markings/sec, 265 secs
lola: 45662290 markings, 124846296 edges, 132692 markings/sec, 270 secs
lola: 46323023 markings, 126867619 edges, 132147 markings/sec, 275 secs
lola: 47059943 markings, 128997848 edges, 147384 markings/sec, 280 secs
lola: 47701873 markings, 130969430 edges, 128386 markings/sec, 285 secs
lola: 48380351 markings, 132858609 edges, 135696 markings/sec, 290 secs
lola: 49182969 markings, 134904619 edges, 160524 markings/sec, 295 secs
lola: 49845709 markings, 136891020 edges, 132548 markings/sec, 300 secs
lola: 50540455 markings, 138980771 edges, 138949 markings/sec, 305 secs
lola: 51300930 markings, 141154334 edges, 152095 markings/sec, 310 secs
lola: 52045257 markings, 143264906 edges, 148865 markings/sec, 315 secs
lola: 52715020 markings, 145230451 edges, 133953 markings/sec, 320 secs
lola: 53368341 markings, 147306526 edges, 130664 markings/sec, 325 secs
lola: 54192935 markings, 149742606 edges, 164919 markings/sec, 330 secs
lola: 55083380 markings, 152269165 edges, 178089 markings/sec, 335 secs
lola: 56037642 markings, 154664789 edges, 190852 markings/sec, 340 secs
lola: 56971658 markings, 157246244 edges, 186803 markings/sec, 345 secs
lola: 57625117 markings, 159371501 edges, 130692 markings/sec, 350 secs
lola: 58408673 markings, 161563314 edges, 156711 markings/sec, 355 secs
lola: 59119105 markings, 163651922 edges, 142086 markings/sec, 360 secs
lola: 59931250 markings, 165929852 edges, 162429 markings/sec, 365 secs
lola: 60722370 markings, 168229534 edges, 158224 markings/sec, 370 secs
lola: 61436459 markings, 170394100 edges, 142818 markings/sec, 375 secs
lola: 62160341 markings, 172534697 edges, 144776 markings/sec, 380 secs
lola: 62917753 markings, 174661548 edges, 151482 markings/sec, 385 secs
lola: 63623359 markings, 176792375 edges, 141121 markings/sec, 390 secs
lola: 64328465 markings, 178908109 edges, 141021 markings/sec, 395 secs
lola: 64920564 markings, 180862197 edges, 118420 markings/sec, 400 secs
lola: 65872792 markings, 183231894 edges, 190446 markings/sec, 405 secs
lola: 66882367 markings, 185935796 edges, 201915 markings/sec, 410 secs
lola: 67786742 markings, 188277369 edges, 180875 markings/sec, 415 secs
lola: 68493671 markings, 190410344 edges, 141386 markings/sec, 420 secs
lola: 69367723 markings, 192610206 edges, 174810 markings/sec, 425 secs
lola: 70065852 markings, 194717622 edges, 139626 markings/sec, 430 secs
lola: 70760855 markings, 196866506 edges, 139001 markings/sec, 435 secs
lola: 71459027 markings, 198917365 edges, 139634 markings/sec, 440 secs
lola: 72160927 markings, 200955195 edges, 140380 markings/sec, 445 secs
lola: 72900156 markings, 203082414 edges, 147846 markings/sec, 450 secs
lola: 73686312 markings, 205338560 edges, 157231 markings/sec, 455 secs
lola: 74312191 markings, 207329609 edges, 125176 markings/sec, 460 secs
lola: 75014400 markings, 209409753 edges, 140442 markings/sec, 465 secs
lola: 75777276 markings, 211579409 edges, 152575 markings/sec, 470 secs
lola: 76423199 markings, 213658959 edges, 129185 markings/sec, 475 secs
lola: 77100974 markings, 215704548 edges, 135555 markings/sec, 480 secs
lola: 77917564 markings, 217774837 edges, 163318 markings/sec, 485 secs
lola: 78500348 markings, 219543970 edges, 116557 markings/sec, 490 secs
lola: 79075606 markings, 221362082 edges, 115052 markings/sec, 495 secs
lola: 79675286 markings, 223165199 edges, 119936 markings/sec, 500 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown unknown yes no unknown unknown yes yes unknown no no unknown unknown yes yes
lola: memory consumption: 10712600 KB
lola: time consumption: 516 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: A (((E (G ((1 <= p49))) OR ((p65 <= 0) AND ((1 <= p75) OR (1 <= p70)))) U (((p30 <= 0) OR (p46 <= 0)) AND ((p20 <= 0) OR (p41 <= 0)))))
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((1 <= p49)) OR ((p65 <= 0) AND ((1 <= p75) OR (1 <= p70)))) U (((p30 <= 0) OR (p46 <= 0)) AND ((p20 <= 0) OR (p41 <= 0))))
lola: processed formula length: 131
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 18846 markings, 19171 edges
lola: ========================================
lola: subprocess 11 will run for 610 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((p46 <= 0))) U E (G (((1 <= p17) AND (1 <= p80))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(AF((p46 <= 0)) U EG(((1 <= p17) AND (1 <= p80))))
lola: processed formula length: 51
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 7916 markings, 7925 edges
lola: ========================================
lola: subprocess 12 will run for 763 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((((1 <= p66) OR ((1 <= p68) AND (1 <= p37))) U A (G ((1 <= p34))))) AND (E (G ((((1 <= p22) OR (1 <= p36)) AND (1 <= p61) AND (1 <= p12)))) OR (E (G (((1 <= p3) OR (1 <= p46)))) AND (A (F ((1 <= p1))) OR ((1 <= p71) OR ((1 <= p45) OR (1 <= p49)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: (A(((1 <= p66) OR ((1 <= p68) AND (1 <= p37))) U AG((1 <= p34))) AND (EG((((1 <= p22) OR (1 <= p36)) AND (1 <= p61) AND (1 <= p12))) OR (EG(((1 <= p3) OR (1 <= p46))) AND (AF((1 <= p1)) OR ((1 <= p71) OR ((1 <= p45) OR (1 <= p49)))))))
lola: processed formula length: 238
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 5 significant temporal operators and needs 22 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: 369 markings, 417 edges
lola: ========================================
lola: subprocess 13 will run for 1018 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p49) OR (1 <= p12)))) AND A (G ((1 <= p51))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1018 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p51)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((1 <= p51)))
lola: processed formula length: 18
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p51 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1527 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((p36 <= 0) OR (p70 <= 0)) AND ((p25 <= 0) OR (p66 <= 0))))) OR (A (((1 <= p41) U (p54 <= 0))) OR (p28 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1527 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p28 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p28 <= 0)
lola: processed formula length: 10
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3054 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p41) U (p54 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((1 <= p41) U (p54 <= 0)))
lola: processed formula length: 29
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 37 markings, 37 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3054 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((1 <= p10) AND (1 <= p34)))) OR A (F (E (G (((1 <= p5) AND (1 <= p55)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3054 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p10) AND (1 <= p34))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((1 <= p10) AND (1 <= p34))))
lola: processed formula length: 35
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p10 <= 0) OR (p34 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p9) AND (((1 <= p44) AND (1 <= p27)) OR ((1 <= p46) AND (1 <= p70)))) U A (G ((1 <= p36)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((1 <= p9) AND (((1 <= p44) AND (1 <= p27)) OR ((1 <= p46) AND (1 <= p70)))) U AG((1 <= p36)))
lola: processed formula length: 97
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1153475 markings, 2850900 edges, 230695 markings/sec, 0 secs
lola: 2120265 markings, 5352891 edges, 193358 markings/sec, 5 secs
lola: 3076830 markings, 7880326 edges, 191313 markings/sec, 10 secs
lola: 3979656 markings, 10245765 edges, 180565 markings/sec, 15 secs
lola: 4776669 markings, 12531693 edges, 159403 markings/sec, 20 secs
lola: 5672184 markings, 14774785 edges, 179103 markings/sec, 25 secs
lola: 6530396 markings, 17141329 edges, 171642 markings/sec, 30 secs
lola: 7352880 markings, 19371614 edges, 164497 markings/sec, 35 secs
lola: 8212114 markings, 21690826 edges, 171847 markings/sec, 40 secs
lola: 9090103 markings, 24022691 edges, 175598 markings/sec, 45 secs
lola: 9842673 markings, 26055349 edges, 150514 markings/sec, 50 secs
lola: 10603589 markings, 28067127 edges, 152183 markings/sec, 55 secs
lola: 11271709 markings, 30072831 edges, 133624 markings/sec, 60 secs
lola: 11932836 markings, 32033899 edges, 132225 markings/sec, 65 secs
lola: 12721383 markings, 34203015 edges, 157709 markings/sec, 70 secs
lola: 13377423 markings, 36121051 edges, 131208 markings/sec, 75 secs
lola: 14003127 markings, 38008506 edges, 125141 markings/sec, 80 secs
lola: 14660232 markings, 40062493 edges, 131421 markings/sec, 85 secs
lola: 15739021 markings, 42698239 edges, 215758 markings/sec, 90 secs
lola: 16552253 markings, 44866074 edges, 162646 markings/sec, 95 secs
lola: 17423508 markings, 47091516 edges, 174251 markings/sec, 100 secs
lola: 18144392 markings, 49114106 edges, 144177 markings/sec, 105 secs
lola: 18879030 markings, 51211503 edges, 146928 markings/sec, 110 secs
lola: 19591602 markings, 53219201 edges, 142514 markings/sec, 115 secs
lola: 20490559 markings, 55596406 edges, 179791 markings/sec, 120 secs
lola: 21265701 markings, 57888282 edges, 155028 markings/sec, 125 secs
lola: 21990889 markings, 59921366 edges, 145038 markings/sec, 130 secs
lola: 22693235 markings, 62019809 edges, 140469 markings/sec, 135 secs
lola: 23364669 markings, 63974486 edges, 134287 markings/sec, 140 secs
lola: 24016295 markings, 65882855 edges, 130325 markings/sec, 145 secs
lola: 24689189 markings, 67791986 edges, 134579 markings/sec, 150 secs
lola: 25496900 markings, 70060877 edges, 161542 markings/sec, 155 secs
lola: 26201151 markings, 72073615 edges, 140850 markings/sec, 160 secs
lola: 26889576 markings, 74031056 edges, 137685 markings/sec, 165 secs
lola: 27611408 markings, 76062291 edges, 144366 markings/sec, 170 secs
lola: 28352378 markings, 78237872 edges, 148194 markings/sec, 175 secs
lola: 29476906 markings, 81043805 edges, 224906 markings/sec, 180 secs
lola: 30567226 markings, 83872972 edges, 218064 markings/sec, 185 secs
lola: 31599939 markings, 86519293 edges, 206543 markings/sec, 190 secs
lola: 32564409 markings, 89110211 edges, 192894 markings/sec, 195 secs
lola: 33391560 markings, 91622308 edges, 165430 markings/sec, 200 secs
lola: 34469608 markings, 94288008 edges, 215610 markings/sec, 205 secs
lola: 35386398 markings, 96655315 edges, 183358 markings/sec, 210 secs
lola: 36296558 markings, 99065163 edges, 182032 markings/sec, 215 secs
lola: 37064654 markings, 101368187 edges, 153619 markings/sec, 220 secs
lola: 37975136 markings, 104014822 edges, 182096 markings/sec, 225 secs
lola: 38783710 markings, 106261004 edges, 161715 markings/sec, 230 secs
lola: 39658722 markings, 108556262 edges, 175002 markings/sec, 235 secs
lola: 40694724 markings, 111261680 edges, 207200 markings/sec, 240 secs
lola: 41703386 markings, 113993735 edges, 201732 markings/sec, 245 secs
lola: 42635654 markings, 116348283 edges, 186454 markings/sec, 250 secs
lola: 43611192 markings, 118890262 edges, 195108 markings/sec, 255 secs
lola: 44384828 markings, 121190856 edges, 154727 markings/sec, 260 secs
lola: 45244997 markings, 123653523 edges, 172034 markings/sec, 265 secs
lola: 45926853 markings, 125695469 edges, 136371 markings/sec, 270 secs
lola: 46715712 markings, 127926426 edges, 157772 markings/sec, 275 secs
lola: 47473644 markings, 130250402 edges, 151586 markings/sec, 280 secs
lola: 48211968 markings, 132416756 edges, 147665 markings/sec, 285 secs
lola: 49096149 markings, 134677445 edges, 176836 markings/sec, 290 secs
lola: 49829531 markings, 136839424 edges, 146676 markings/sec, 295 secs
lola: 50525241 markings, 138941255 edges, 139142 markings/sec, 300 secs
lola: 51305498 markings, 141172119 edges, 156051 markings/sec, 305 secs
lola: 52064085 markings, 143334448 edges, 151717 markings/sec, 310 secs
lola: 52754342 markings, 145363447 edges, 138051 markings/sec, 315 secs
lola: 53424079 markings, 147478992 edges, 133947 markings/sec, 320 secs
lola: 54259215 markings, 149950053 edges, 167027 markings/sec, 325 secs
lola: 55178562 markings, 152551218 edges, 183869 markings/sec, 330 secs
lola: 56132457 markings, 154907573 edges, 190779 markings/sec, 335 secs
lola: 57039709 markings, 157464353 edges, 181450 markings/sec, 340 secs
lola: 57688573 markings, 159551350 edges, 129773 markings/sec, 345 secs
lola: 58431749 markings, 161630175 edges, 148635 markings/sec, 350 secs
lola: 59143931 markings, 163738371 edges, 142436 markings/sec, 355 secs
lola: 59924374 markings, 165910035 edges, 156089 markings/sec, 360 secs
lola: 60701916 markings, 168169609 edges, 155508 markings/sec, 365 secs
lola: 61426946 markings, 170362001 edges, 145006 markings/sec, 370 secs
lola: 62157583 markings, 172528091 edges, 146127 markings/sec, 375 secs
lola: 62930669 markings, 174695626 edges, 154617 markings/sec, 380 secs
lola: 63658397 markings, 176912286 edges, 145546 markings/sec, 385 secs
lola: 64366333 markings, 179039617 edges, 141587 markings/sec, 390 secs
lola: 64987873 markings, 181035119 edges, 124308 markings/sec, 395 secs
lola: 65962258 markings, 183450467 edges, 194877 markings/sec, 400 secs
lola: 67000715 markings, 186192193 edges, 207691 markings/sec, 405 secs
lola: 67854887 markings, 188498337 edges, 170834 markings/sec, 410 secs
lola: 68582586 markings, 190625040 edges, 145540 markings/sec, 415 secs
lola: 69432433 markings, 192788134 edges, 169969 markings/sec, 420 secs
lola: 70084357 markings, 194791059 edges, 130385 markings/sec, 425 secs
lola: 70771433 markings, 196903581 edges, 137415 markings/sec, 430 secs
lola: 71444508 markings, 198871025 edges, 134615 markings/sec, 435 secs
lola: 72091808 markings, 200772059 edges, 129460 markings/sec, 440 secs
lola: 72797186 markings, 202831768 edges, 141076 markings/sec, 445 secs
lola: 73599741 markings, 205097308 edges, 160511 markings/sec, 450 secs
lola: 74251621 markings, 207099870 edges, 130376 markings/sec, 455 secs
lola: 74929882 markings, 209128814 edges, 135652 markings/sec, 460 secs
lola: 75690115 markings, 211296754 edges, 152047 markings/sec, 465 secs
lola: 76355168 markings, 213431518 edges, 133011 markings/sec, 470 secs
lola: 77098947 markings, 215698944 edges, 148756 markings/sec, 475 secs
lola: 77994846 markings, 217981957 edges, 179180 markings/sec, 480 secs
lola: 78617138 markings, 219942194 edges, 124458 markings/sec, 485 secs
lola: 79308592 markings, 222050803 edges, 138291 markings/sec, 490 secs
lola: 79998345 markings, 224210986 edges, 137951 markings/sec, 495 secs
lola: 80728080 markings, 226479928 edges, 145947 markings/sec, 500 secs
lola: 81716365 markings, 229037858 edges, 197657 markings/sec, 505 secs
lola: 82483960 markings, 231286190 edges, 153519 markings/sec, 510 secs
lola: 83102875 markings, 233227907 edges, 123783 markings/sec, 515 secs
lola: 83770769 markings, 235187083 edges, 133579 markings/sec, 520 secs
lola: 84370803 markings, 237118317 edges, 120007 markings/sec, 525 secs
lola: 85013845 markings, 239056463 edges, 128608 markings/sec, 530 secs
lola: 85710574 markings, 241101987 edges, 139346 markings/sec, 535 secs
lola: 86337082 markings, 243087249 edges, 125302 markings/sec, 540 secs
lola: 87065068 markings, 245118751 edges, 145597 markings/sec, 545 secs
lola: 87646218 markings, 247102249 edges, 116230 markings/sec, 550 secs
lola: 88283323 markings, 249035147 edges, 127421 markings/sec, 555 secs
lola: 88868961 markings, 250864044 edges, 117128 markings/sec, 560 secs
lola: 89494464 markings, 252746953 edges, 125101 markings/sec, 565 secs
lola: 90335057 markings, 254981937 edges, 168119 markings/sec, 570 secs
lola: 91290034 markings, 257511637 edges, 190995 markings/sec, 575 secs
lola: 92185575 markings, 260021612 edges, 179108 markings/sec, 580 secs
lola: 92888034 markings, 262098125 edges, 140492 markings/sec, 585 secs
lola: 93621485 markings, 264291773 edges, 146690 markings/sec, 590 secs
lola: 94424967 markings, 266527284 edges, 160696 markings/sec, 595 secs
lola: 95130918 markings, 268660293 edges, 141190 markings/sec, 600 secs
lola: 95726841 markings, 270442764 edges, 119185 markings/sec, 605 secs
lola: 96394895 markings, 272347810 edges, 133611 markings/sec, 610 secs
lola: 96944939 markings, 274111327 edges, 110009 markings/sec, 615 secs
lola: 97685734 markings, 276212622 edges, 148159 markings/sec, 620 secs
lola: 98252439 markings, 278038363 edges, 113341 markings/sec, 625 secs
lola: 98879854 markings, 279926716 edges, 125483 markings/sec, 630 secs
lola: 99490762 markings, 281798781 edges, 122182 markings/sec, 635 secs
lola: 100051348 markings, 283618726 edges, 112117 markings/sec, 640 secs
lola: 100700740 markings, 285576112 edges, 129878 markings/sec, 645 secs
lola: 101297924 markings, 287456751 edges, 119437 markings/sec, 650 secs
lola: 102011135 markings, 289367287 edges, 142642 markings/sec, 655 secs
lola: 102612859 markings, 291254154 edges, 120345 markings/sec, 660 secs
lola: 103497172 markings, 293607835 edges, 176863 markings/sec, 665 secs
lola: 104098863 markings, 295436879 edges, 120338 markings/sec, 670 secs
lola: 104952394 markings, 297729920 edges, 170706 markings/sec, 675 secs
lola: 105652836 markings, 299807033 edges, 140088 markings/sec, 680 secs
lola: 106268833 markings, 301695845 edges, 123199 markings/sec, 685 secs
lola: 106882803 markings, 303607702 edges, 122794 markings/sec, 690 secs
lola: 107489995 markings, 305451746 edges, 121438 markings/sec, 695 secs
lola: 108057992 markings, 307221303 edges, 113599 markings/sec, 700 secs
lola: 108661514 markings, 308988994 edges, 120704 markings/sec, 705 secs
lola: 109132770 markings, 310596965 edges, 94251 markings/sec, 710 secs
lola: 109688829 markings, 312404720 edges, 111212 markings/sec, 715 secs
lola: 110294090 markings, 314220764 edges, 121052 markings/sec, 720 secs
lola: 110934835 markings, 316108078 edges, 128149 markings/sec, 725 secs
lola: 111741927 markings, 318347486 edges, 161418 markings/sec, 730 secs
lola: 112734767 markings, 320871697 edges, 198568 markings/sec, 735 secs
lola: 113737128 markings, 323428147 edges, 200472 markings/sec, 740 secs
lola: 114720087 markings, 325941285 edges, 196592 markings/sec, 745 secs
lola: 115529977 markings, 328280667 edges, 161978 markings/sec, 750 secs
lola: 116326756 markings, 330447324 edges, 159356 markings/sec, 755 secs
lola: 117136566 markings, 332533013 edges, 161962 markings/sec, 760 secs
lola: 117829448 markings, 334428699 edges, 138576 markings/sec, 765 secs
lola: 118545862 markings, 336370297 edges, 143283 markings/sec, 770 secs
lola: 119226511 markings, 338375659 edges, 136130 markings/sec, 775 secs
lola: 119818039 markings, 340241064 edges, 118306 markings/sec, 780 secs
lola: 120405462 markings, 342013128 edges, 117485 markings/sec, 785 secs
lola: 121070567 markings, 344040638 edges, 133021 markings/sec, 790 secs
lola: 121753937 markings, 346105206 edges, 136674 markings/sec, 795 secs
lola: 122362025 markings, 348059863 edges, 121618 markings/sec, 800 secs
lola: 122905750 markings, 349842412 edges, 108745 markings/sec, 805 secs
lola: 123506695 markings, 351643996 edges, 120189 markings/sec, 810 secs
lola: 124250914 markings, 353645931 edges, 148844 markings/sec, 815 secs
lola: 124859790 markings, 355404636 edges, 121775 markings/sec, 820 secs
lola: 125473651 markings, 357351085 edges, 122772 markings/sec, 825 secs
lola: 126128832 markings, 359436071 edges, 131036 markings/sec, 830 secs
lola: 126686724 markings, 361195214 edges, 111578 markings/sec, 835 secs
lola: 127282749 markings, 362975548 edges, 119205 markings/sec, 840 secs
lola: 127876661 markings, 364739109 edges, 118782 markings/sec, 845 secs
lola: 128396441 markings, 366455315 edges, 103956 markings/sec, 850 secs
lola: 128968272 markings, 368215679 edges, 114366 markings/sec, 855 secs
lola: 129540686 markings, 370025591 edges, 114483 markings/sec, 860 secs
lola: 130078149 markings, 371762198 edges, 107493 markings/sec, 865 secs
lola: 130785160 markings, 373719901 edges, 141402 markings/sec, 870 secs
lola: 131470531 markings, 375710740 edges, 137074 markings/sec, 875 secs
lola: 132016112 markings, 377514631 edges, 109116 markings/sec, 880 secs
lola: 132602667 markings, 379311777 edges, 117311 markings/sec, 885 secs
lola: 133178042 markings, 381141484 edges, 115075 markings/sec, 890 secs
lola: 133767875 markings, 383034663 edges, 117967 markings/sec, 895 secs
lola: 134441986 markings, 385019592 edges, 134822 markings/sec, 900 secs
lola: 135043333 markings, 386929938 edges, 120269 markings/sec, 905 secs
lola: 135784445 markings, 388987698 edges, 148222 markings/sec, 910 secs
lola: 136420509 markings, 390968591 edges, 127213 markings/sec, 915 secs
lola: 137240729 markings, 393262059 edges, 164044 markings/sec, 920 secs
lola: 137940904 markings, 395300846 edges, 140035 markings/sec, 925 secs
lola: 138597895 markings, 397302301 edges, 131398 markings/sec, 930 secs
lola: 139207556 markings, 399166698 edges, 121932 markings/sec, 935 secs
lola: 139814369 markings, 401091896 edges, 121363 markings/sec, 940 secs
lola: 140668377 markings, 403439392 edges, 170802 markings/sec, 945 secs
lola: 141541398 markings, 405761982 edges, 174604 markings/sec, 950 secs
lola: 142520715 markings, 408285742 edges, 195863 markings/sec, 955 secs
lola: 143241049 markings, 410434873 edges, 144067 markings/sec, 960 secs
lola: 143859661 markings, 412308390 edges, 123722 markings/sec, 965 secs
lola: 144419812 markings, 413968542 edges, 112030 markings/sec, 970 secs
lola: 144981015 markings, 415689331 edges, 112241 markings/sec, 975 secs
lola: 145400687 markings, 417147738 edges, 83934 markings/sec, 980 secs
lola: 145872483 markings, 418642023 edges, 94359 markings/sec, 985 secs
lola: 146294309 markings, 420092083 edges, 84365 markings/sec, 990 secs
lola: 147073572 markings, 422151398 edges, 155853 markings/sec, 995 secs
lola: 147710288 markings, 423992401 edges, 127343 markings/sec, 1000 secs
lola: 148243950 markings, 425674642 edges, 106732 markings/sec, 1005 secs
lola: 148873812 markings, 427388547 edges, 125972 markings/sec, 1010 secs
lola: 149190067 markings, 428427974 edges, 63251 markings/sec, 1015 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (F ((((p36 <= 0) OR (p70 <= 0)) AND ((p25 <= 0) OR (p66 <= 0))))) OR (A (((1 <= p41) U (p54 <= 0))) OR (p28 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p28 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p28 <= 0)
lola: processed formula length: 10
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (((1 <= p41) U (p54 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((1 <= p41) U (p54 <= 0)))
lola: processed formula length: 29
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl 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 <= p41)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 37 markings, 37 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((((p36 <= 0) OR (p70 <= 0)) AND ((p25 <= 0) OR (p66 <= 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 ((((p36 <= 0) OR (p70 <= 0)) AND ((p25 <= 0) OR (p66 <= 0)))))
lola: processed formula length: 69
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p36 <= 0) OR (p70 <= 0)) AND ((p25 <= 0) OR (p66 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G (((1 <= p10) AND (1 <= p34)))) OR A (F (E (G (((1 <= p5) AND (1 <= p55)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p10) AND (1 <= p34))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((1 <= p10) AND (1 <= p34))))
lola: processed formula length: 35
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p10 <= 0) OR (p34 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((1 <= p5) AND (1 <= p55))))))
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(((1 <= p5) AND (1 <= p55))))
lola: processed formula length: 34
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 8736 markings, 8864 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================lola: RESULT
lola:
SUMMARY: yes yes yes yes no yes no yes yes no no no unknown no yes yes
lola:
preliminary result: yes yes yes yes no yes no yes yes no no no unknown no yes yes

lola: memory consumption: 4116 KB
lola: time consumption: 1543 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="NeighborGrid-PT-d4n3m2c23"
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 NeighborGrid-PT-d4n3m2c23, 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 r174-csrt-158987852800204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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