fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r126-oct2-155274853300216
Last Updated
Apr 15, 2019

About the Execution of LoLA for QuasiCertifProtocol-COL-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4318.520 82415.00 92655.00 27.50 TFTFFFTTFTFTTTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r126-oct2-155274853300216.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is QuasiCertifProtocol-COL-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-oct2-155274853300216
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 3.5K Feb 12 10:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 12 10:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 8 12:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 8 12:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 113 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 351 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 00:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 22:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 4 13:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 4 13:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 1 10:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 1 10:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:26 UpperBounds.xml

-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 72K Mar 10 17:31 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 QuasiCertifProtocol-COL-10-ReachabilityFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1553893289938

info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ QuasiCertifProtocol-COL-10 @ 3570 seconds

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3487
rslt: Output for ReachabilityFireability @ QuasiCertifProtocol-COL-10

{
"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": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Mar 29 21:01:30 2019
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "E (F (((NOT FIREABLE(t119) OR NOT FIREABLE(t12) OR NOT FIREABLE(t37)) AND FIREABLE(t25))))",
"processed_size": 92,
"rewrites": 1
},
"result":
{
"edges": 38,
"markings": 39,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 26,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 11,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 11,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 11
},
"processed": "E (F ((FIREABLE(t132) OR FIREABLE(t133) OR FIREABLE(t134) OR FIREABLE(t135) OR FIREABLE(t136) OR FIREABLE(t137) OR FIREABLE(t138) OR FIREABLE(t139) OR FIREABLE(t140) OR FIREABLE(t141) OR FIREABLE(t142))))",
"processed_size": 214,
"rewrites": 1
},
"result":
{
"edges": 61,
"markings": 62,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 22,
"problems": 11
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 11,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 11,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 11
},
"processed": "E (F ((FIREABLE(t38) OR FIREABLE(t39) OR FIREABLE(t40) OR FIREABLE(t41) OR FIREABLE(t42) OR FIREABLE(t43) OR FIREABLE(t44) OR FIREABLE(t45) OR FIREABLE(t46) OR FIREABLE(t47) OR FIREABLE(t48))))",
"processed_size": 203,
"rewrites": 1
},
"result":
{
"edges": 28,
"markings": 29,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 11,
"problems": 11
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 11,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 11,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 11
},
"processed": "E (F ((FIREABLE(t38) OR FIREABLE(t39) OR FIREABLE(t40) OR FIREABLE(t41) OR FIREABLE(t42) OR FIREABLE(t43) OR FIREABLE(t44) OR FIREABLE(t45) OR FIREABLE(t46) OR FIREABLE(t47) OR FIREABLE(t48))))",
"processed_size": 203,
"rewrites": 1
},
"result":
{
"edges": 28,
"markings": 29,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 11,
"problems": 11
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 11,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 11,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 11
},
"processed": "E (F ((FIREABLE(t38) OR FIREABLE(t39) OR FIREABLE(t40) OR FIREABLE(t41) OR FIREABLE(t42) OR FIREABLE(t43) OR FIREABLE(t44) OR FIREABLE(t45) OR FIREABLE(t46) OR FIREABLE(t47) OR FIREABLE(t48))))",
"processed_size": 203,
"rewrites": 1
},
"result":
{
"edges": 28,
"markings": 29,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 11,
"problems": 11
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 11,
"unfir": 11,
"visible_places": 0,
"visible_transitions": 11
},
"processed": "A (G ((NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15) AND NOT FIREABLE(t16) AND NOT FIREABLE(t17) AND NOT FIREABLE(t18) AND NOT FIREABLE(t19) AND NOT FIREABLE(t20) AND NOT FIREABLE(t21) AND NOT FIREABLE(t22) AND NOT FIREABLE(t23))))",
"processed_size": 247,
"rewrites": 2
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 22,
"problems": 11
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 13,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 13,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 13
},
"processed": "E (F (((FIREABLE(t165) OR FIREABLE(t166) OR FIREABLE(t167) OR FIREABLE(t168) OR FIREABLE(t169) OR FIREABLE(t170) OR FIREABLE(t171) OR FIREABLE(t172) OR FIREABLE(t173) OR FIREABLE(t174) OR FIREABLE(t175) OR FIREABLE(t61)) AND FIREABLE(t0))))",
"processed_size": 251,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 156,
"problems": 12
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 13,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 13,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 13
},
"processed": "E (F (((FIREABLE(t143) OR FIREABLE(t144) OR FIREABLE(t145) OR FIREABLE(t146) OR FIREABLE(t147) OR FIREABLE(t148) OR FIREABLE(t149) OR FIREABLE(t150) OR FIREABLE(t151) OR FIREABLE(t152) OR FIREABLE(t153)) AND FIREABLE(t119) AND FIREABLE(t0))))",
"processed_size": 252,
"rewrites": 1
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 24,
"unfir": 23,
"visible_places": 0,
"visible_transitions": 24
},
"processed": "A (G ((NOT FIREABLE(t38) AND NOT FIREABLE(t39) AND NOT FIREABLE(t40) AND NOT FIREABLE(t41) AND NOT FIREABLE(t42) AND NOT FIREABLE(t43) AND NOT FIREABLE(t44) AND NOT FIREABLE(t45) AND NOT FIREABLE(t46) AND NOT FIREABLE(t47) AND NOT FIREABLE(t48) AND ((NOT FIREABLE(t120) AND NOT FIREABLE(t121) AND NOT FIREABLE(t122) AND NOT FIREABLE(t123) AND NOT FIREABLE(t124) AND NOT FIREABLE(t125) AND NOT FIREABLE(t126) AND NOT FIREABLE(t127) AND NOT FIREABLE(t128) AND NOT FIREABLE(t129) AND NOT FIREABLE(t130)) OR NOT FIREABLE(t119) OR FIREABLE(t61)))))",
"processed_size": 545,
"rewrites": 2
},
"result":
{
"edges": 28,
"markings": 29,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 35,
"unfir": 35,
"visible_places": 0,
"visible_transitions": 24
},
"processed": "A (G (((NOT FIREABLE(t120) AND NOT FIREABLE(t121) AND NOT FIREABLE(t122) AND NOT FIREABLE(t123) AND NOT FIREABLE(t124) AND NOT FIREABLE(t125) AND NOT FIREABLE(t126) AND NOT FIREABLE(t127) AND NOT FIREABLE(t128) AND NOT FIREABLE(t129) AND NOT FIREABLE(t130)) OR (NOT FIREABLE(t132) AND NOT FIREABLE(t133) AND NOT FIREABLE(t134) AND NOT FIREABLE(t135) AND NOT FIREABLE(t136) AND NOT FIREABLE(t137) AND NOT FIREABLE(t138) AND NOT FIREABLE(t139) AND NOT FIREABLE(t140) AND NOT FIREABLE(t141) AND NOT FIREABLE(t142)) OR (NOT FIREABLE(t132) AND NOT FIREABLE(t133) AND NOT FIREABLE(t134) AND NOT FIREABLE(t135) AND NOT FIREABLE(t136) AND NOT FIREABLE(t137) AND NOT FIREABLE(t138) AND NOT FIREABLE(t139) AND NOT FIREABLE(t140) AND NOT FIREABLE(t141) AND NOT FIREABLE(t142) AND NOT FIREABLE(t131)) OR NOT FIREABLE(t0))))",
"processed_size": 814,
"rewrites": 2
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 24563,
"problems": 1452
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 883
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 24,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 25,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 25
},
"processed": "E (F (((NOT FIREABLE(t0) OR ((FIREABLE(t86) OR FIREABLE(t87) OR FIREABLE(t88) OR FIREABLE(t89) OR FIREABLE(t90) OR FIREABLE(t91) OR FIREABLE(t92) OR FIREABLE(t93) OR FIREABLE(t94) OR FIREABLE(t95) OR FIREABLE(t96)) AND (FIREABLE(t120) OR FIREABLE(t121) OR FIREABLE(t122) OR FIREABLE(t123) OR FIREABLE(t124) OR FIREABLE(t125) OR FIREABLE(t126) OR FIREABLE(t127) OR FIREABLE(t128) OR FIREABLE(t129) OR FIREABLE(t130))) OR FIREABLE(t12)) AND FIREABLE(t24))))",
"processed_size": 477,
"rewrites": 1
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1177
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 22,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 33,
"unfir": 11,
"visible_places": 0,
"visible_transitions": 33
},
"processed": "A (G (((NOT FIREABLE(t75) AND NOT FIREABLE(t76) AND NOT FIREABLE(t77) AND NOT FIREABLE(t78) AND NOT FIREABLE(t79) AND NOT FIREABLE(t80) AND NOT FIREABLE(t81) AND NOT FIREABLE(t82) AND NOT FIREABLE(t83) AND NOT FIREABLE(t84) AND NOT FIREABLE(t85)) OR ((FIREABLE(t165) OR FIREABLE(t166) OR FIREABLE(t167) OR FIREABLE(t168) OR FIREABLE(t169) OR FIREABLE(t170) OR FIREABLE(t171) OR FIREABLE(t172) OR FIREABLE(t173) OR FIREABLE(t174) OR FIREABLE(t175)) AND (FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR FIREABLE(t10) OR FIREABLE(t11))))))",
"processed_size": 653,
"rewrites": 2
},
"result":
{
"edges": 27,
"markings": 28,
"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"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1766
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 4,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 44,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 67,
"unfir": 23,
"visible_places": 0,
"visible_transitions": 45
},
"processed": "A (G ((((FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR FIREABLE(t10) OR FIREABLE(t11)) AND (FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR FIREABLE(t10) OR FIREABLE(t11)) AND NOT FIREABLE(t26) AND NOT FIREABLE(t27) AND NOT FIREABLE(t28) AND NOT FIREABLE(t29) AND NOT FIREABLE(t30) AND NOT FIREABLE(t31) AND NOT FIREABLE(t32) AND NOT FIREABLE(t33) AND NOT FIREABLE(t34) AND NOT FIREABLE(t35) AND NOT FIREABLE(t36) AND (FIREABLE(t26) OR FIREABLE(t27) OR FIREABLE(t28) OR FIREABLE(t29) OR FIREABLE(t30) OR FIREABLE(t31) OR FIREABLE(t32) OR FIREABLE(t33) OR FIREABLE(t34) OR FIREABLE(t35) OR FIREABLE(t36) OR FIREABLE(t120) OR FIREABLE(t121) OR FIREABLE(t122) OR FIREABLE(t123) OR FIREABLE(t124) OR FIREABLE(t125) OR FIREABLE(t126) OR FIREABLE(t127) OR FIREABLE(t128) OR FIREABLE(t129) OR FIREABLE(t130) OR (NOT FIREABLE(t75) AND NOT FIREABLE(t76) AND NOT FIREABLE(t77) AND NOT FIREABLE(t78) AND NOT FIREABLE(t79) AND NOT FIREABLE(t80) AND NOT FIREABLE(t81) AND NOT FIREABLE(t82) AND NOT FIREABLE(t83) AND NOT FIREABLE(t84) AND NOT FIREABLE(t85)))) OR NOT FIREABLE(t49))))",
"processed_size": 1306,
"rewrites": 2
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"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": 3533
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 7,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 73,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 84,
"unfir": 11,
"visible_places": 0,
"visible_transitions": 61
},
"processed": "E (F (((FIREABLE(t97) OR FIREABLE(t98) OR FIREABLE(t99) OR FIREABLE(t100) OR FIREABLE(t101) OR FIREABLE(t102) OR FIREABLE(t103) OR FIREABLE(t104) OR FIREABLE(t105) OR FIREABLE(t106) OR FIREABLE(t107)) AND (FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19) OR FIREABLE(t20) OR FIREABLE(t21) OR FIREABLE(t22) OR FIREABLE(t23)) AND (FIREABLE(t24) OR FIREABLE(t12)) AND (FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19) OR FIREABLE(t20) OR FIREABLE(t21) OR FIREABLE(t22) OR FIREABLE(t23)) AND FIREABLE(t61) AND (FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t120) OR FIREABLE(t121) OR FIREABLE(t122) OR FIREABLE(t123) OR FIREABLE(t124) OR FIREABLE(t125) OR FIREABLE(t126) OR FIREABLE(t127) OR FIREABLE(t128) OR FIREABLE(t129) OR FIREABLE(t130)) AND ((NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9) AND NOT FIREABLE(t10) AND NOT FIREABLE(t11) AND (FIREABLE(t143) OR FIREABLE(t144) OR FIREABLE(t145) OR FIREABLE(t146) OR FIREABLE(t147) OR FIREABLE(t148) OR FIREABLE(t149) OR FIREABLE(t150) OR FIREABLE(t151) OR FIREABLE(t152) OR FIREABLE(t153) OR FIREABLE(t62))) OR (FIREABLE(t61) AND FIREABLE(t0) AND FIREABLE(t131))))))",
"processed_size": 1591,
"rewrites": 1
},
"result":
{
"edges": 14382279,
"markings": 3043331,
"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": null,
"problems": null
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 71548,
"runtime": 58.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 1287,
"conflict_clusters": 44,
"places": 550,
"places_significant": 175,
"singleton_clusters": 0,
"transitions": 176
},
"result":
{
"preliminary_value": "yes no yes no no no yes yes no yes no yes yes yes yes no ",
"value": "yes no yes no no no yes yes no yes no yes yes yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains High-Level net
lola: Places: 550, Transitions: 176
lola: @ trans malA4
lola: @ trans SgetTS
lola: @ trans malA5
lola: @ trans malS3
lola: @ trans AreqCS
lola: @ trans AendCS
lola: @ trans ScertCS
lola: @ trans malA2
lola: @ trans SreqTS
lola: @ trans AackCS
lola: @ trans malS2
lola: @ trans AgetTS
lola: @ trans malA3
lola: @ trans malC1
lola: @ trans AstartCS
lola: @ trans Sperform
lola: @ trans malS1
lola: @ trans SsendTS
lola: @ trans malS4
lola: @ trans AreqTS
lola: @ trans CsendTS1
lola: @ trans malA1
lola: @ trans malS6
lola: @ trans malS5
lola: @ trans SackCS
lola: @ trans CgenCertif
lola: finished unfolding
lola: finished parsing
lola: closed net file model.pnml
lola: 726/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 17600
lola: finding significant places
lola: 550 places, 176 transitions, 175 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 ReachabilityFireability.xml
lola: E (F (FIREABLE(t12))) : A (G ((NOT FIREABLE(t38) AND NOT FIREABLE(t39) AND NOT FIREABLE(t40) AND NOT FIREABLE(t41) AND NOT FIREABLE(t42) AND NOT FIREABLE(t43) AND NOT FIREABLE(t44) AND NOT FIREABLE(t45) AND NOT FIREABLE(t46) AND NOT FIREABLE(t47) AND NOT FIREABLE(t48) AND ((NOT FIREABLE(t120) AND NOT FIREABLE(t121) AND NOT FIREABLE(t122) AND NOT FIREABLE(t123) AND NOT FIREABLE(t124) AND NOT FIREABLE(t125) AND NOT FIREABLE(t126) AND NOT FIREABLE(t127) AND NOT FIREABLE(t128) AND NOT FIREABLE(t129) AND NOT FIREABLE(t130)) OR NOT FIREABLE(t119) OR FIREABLE(t61))))) : E (F ((FIREABLE(t38) OR FIREABLE(t39) OR FIREABLE(t40) OR FIREABLE(t41) OR FIREABLE(t42) OR FIREABLE(t43) OR FIREABLE(t44) OR FIREABLE(t45) OR FIREABLE(t46) OR FIREABLE(t47) OR FIREABLE(t48)))) : E (F (((FIREABLE(t165) OR FIREABLE(t166) OR FIREABLE(t167) OR FIREABLE(t168) OR FIREABLE(t169) OR FIREABLE(t170) OR FIREABLE(t171) OR FIREABLE(t172) OR FIREABLE(t173) OR FIREABLE(t174) OR FIREABLE(t175) OR FIREABLE(t61)) AND FIREABLE(t0)))) : E (F (((FIREABLE(t143) OR FIREABLE(t144) OR FIREABLE(t145) OR FIREABLE(t146) OR FIREABLE(t147) OR FIREABLE(t148) OR FIREABLE(t149) OR FIREABLE(t150) OR FIREABLE(t151) OR FIREABLE(t152) OR FIREABLE(t153)) AND FIREABLE(t119) AND FIREABLE(t0)))) : A (G ((NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15) AND NOT FIREABLE(t16) AND NOT FIREABLE(t17) AND NOT FIREABLE(t18) AND NOT FIREABLE(t19) AND NOT FIREABLE(t20) AND NOT FIREABLE(t21) AND NOT FIREABLE(t22) AND NOT FIREABLE(t23)))) : E (F (((NOT FIREABLE(t0) OR ((FIREABLE(t86) OR FIREABLE(t87) OR FIREABLE(t88) OR FIREABLE(t89) OR FIREABLE(t90) OR FIREABLE(t91) OR FIREABLE(t92) OR FIREABLE(t93) OR FIREABLE(t94) OR FIREABLE(t95) OR FIREABLE(t96)) AND (FIREABLE(t120) OR FIREABLE(t121) OR FIREABLE(t122) OR FIREABLE(t123) OR FIREABLE(t124) OR FIREABLE(t125) OR FIREABLE(t126) OR FIREABLE(t127) OR FIREABLE(t128) OR FIREABLE(t129) OR FIREABLE(t130))) OR FIREABLE(t12)) AND FIREABLE(t24)))) : E (F ((FIREABLE(t132) OR FIREABLE(t133) OR FIREABLE(t134) OR FIREABLE(t135) OR FIREABLE(t136) OR FIREABLE(t137) OR FIREABLE(t138) OR FIREABLE(t139) OR FIREABLE(t140) OR FIREABLE(t141) OR FIREABLE(t142)))) : A (G ((((FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR FIREABLE(t10) OR FIREABLE(t11)) AND (FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR FIREABLE(t10) OR FIREABLE(t11)) AND NOT FIREABLE(t26) AND NOT FIREABLE(t27) AND NOT FIREABLE(t28) AND NOT FIREABLE(t29) AND NOT FIREABLE(t30) AND NOT FIREABLE(t31) AND NOT FIREABLE(t32) AND NOT FIREABLE(t33) AND NOT FIREABLE(t34) AND NOT FIREABLE(t35) AND NOT FIREABLE(t36) AND (FIREABLE(t26) OR FIREABLE(t27) OR FIREABLE(t28) OR FIREABLE(t29) OR FIREABLE(t30) OR FIREABLE(t31) OR FIREABLE(t32) OR FIREABLE(t33) OR FIREABLE(t34) OR FIREABLE(t35) OR FIREABLE(t36) OR FIREABLE(t120) OR FIREABLE(t121) OR FIREABLE(t122) OR FIREABLE(t123) OR FIREABLE(t124) OR FIREABLE(t125) OR FIREABLE(t126) OR FIREABLE(t127) OR FIREABLE(t128) OR FIREABLE(t129) OR FIREABLE(t130) OR (NOT FIREABLE(t75) AND NOT FIREABLE(t76) AND NOT FIREABLE(t77) AND NOT FIREABLE(t78) AND NOT FIREABLE(t79) AND NOT FIREABLE(t80) AND NOT FIREABLE(t81) AND NOT FIREABLE(t82) AND NOT FIREABLE(t83) AND NOT FIREABLE(t84) AND NOT FIREABLE(t85)))) OR NOT FIREABLE(t49)))) : E (F (FIREABLE(t62))) : E (F (((FIREABLE(t97) OR FIREABLE(t98) OR FIREABLE(t99) OR FIREABLE(t100) OR FIREABLE(t101) OR FIREABLE(t102) OR FIREABLE(t103) OR FIREABLE(t104) OR FIREABLE(t105) OR FIREABLE(t106) OR FIREABLE(t107)) AND (FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19) OR FIREABLE(t20) OR FIREABLE(t21) OR FIREABLE(t22) OR FIREABLE(t23)) AND (FIREABLE(t24) OR FIREABLE(t12)) AND (FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19) OR FIREABLE(t20) OR FIREABLE(t21) OR FIREABLE(t22) OR FIREABLE(t23)) AND FIREABLE(t61) AND (FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t120) OR FIREABLE(t121) OR FIREABLE(t122) OR FIREABLE(t123) OR FIREABLE(t124) OR FIREABLE(t125) OR FIREABLE(t126) OR FIREABLE(t127) OR FIREABLE(t128) OR FIREABLE(t129) OR FIREABLE(t130)) AND ((NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9) AND NOT FIREABLE(t10) AND NOT FIREABLE(t11) AND (FIREABLE(t143) OR FIREABLE(t144) OR FIREABLE(t145) OR FIREABLE(t146) OR FIREABLE(t147) OR FIREABLE(t148) OR FIREABLE(t149) OR FIREABLE(t150) OR FIREABLE(t151) OR FIREABLE(t152) OR FIREABLE(t153) OR FIREABLE(t62))) OR (FIREABLE(t61) AND FIREABLE(t0) AND FIREABLE(t131)))))) : E (F ((FIREABLE(t38) OR FIREABLE(t39) OR FIREABLE(t40) OR FIREABLE(t41) OR FIREABLE(t42) OR FIREABLE(t43) OR FIREABLE(t44) OR FIREABLE(t45) OR FIREABLE(t46) OR FIREABLE(t47) OR FIREABLE(t48)))) : A (G (((NOT FIREABLE(t120) AND NOT FIREABLE(t121) AND NOT FIREABLE(t122) AND NOT FIREABLE(t123) AND NOT FIREABLE(t124) AND NOT FIREABLE(t125) AND NOT FIREABLE(t126) AND NOT FIREABLE(t127) AND NOT FIREABLE(t128) AND NOT FIREABLE(t129) AND NOT FIREABLE(t130)) OR (NOT FIREABLE(t132) AND NOT FIREABLE(t133) AND NOT FIREABLE(t134) AND NOT FIREABLE(t135) AND NOT FIREABLE(t136) AND NOT FIREABLE(t137) AND NOT FIREABLE(t138) AND NOT FIREABLE(t139) AND NOT FIREABLE(t140) AND NOT FIREABLE(t141) AND NOT FIREABLE(t142)) OR (NOT FIREABLE(t132) AND NOT FIREABLE(t133) AND NOT FIREABLE(t134) AND NOT FIREABLE(t135) AND NOT FIREABLE(t136) AND NOT FIREABLE(t137) AND NOT FIREABLE(t138) AND NOT FIREABLE(t139) AND NOT FIREABLE(t140) AND NOT FIREABLE(t141) AND NOT FIREABLE(t142) AND NOT FIREABLE(t131)) OR NOT FIREABLE(t0)))) : E (F ((FIREABLE(t38) OR FIREABLE(t39) OR FIREABLE(t40) OR FIREABLE(t41) OR FIREABLE(t42) OR FIREABLE(t43) OR FIREABLE(t44) OR FIREABLE(t45) OR FIREABLE(t46) OR FIREABLE(t47) OR FIREABLE(t48)))) : E (F (((NOT FIREABLE(t119) OR NOT FIREABLE(t12) OR NOT FIREABLE(t37)) AND FIREABLE(t25)))) : A (G (((NOT FIREABLE(t75) AND NOT FIREABLE(t76) AND NOT FIREABLE(t77) AND NOT FIREABLE(t78) AND NOT FIREABLE(t79) AND NOT FIREABLE(t80) AND NOT FIREABLE(t81) AND NOT FIREABLE(t82) AND NOT FIREABLE(t83) AND NOT FIREABLE(t84) AND NOT FIREABLE(t85)) OR ((FIREABLE(t165) OR FIREABLE(t166) OR FIREABLE(t167) OR FIREABLE(t168) OR FIREABLE(t169) OR FIREABLE(t170) OR FIREABLE(t171) OR FIREABLE(t172) OR FIREABLE(t173) OR FIREABLE(t174) OR FIREABLE(t175)) AND (FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR FIREABLE(t10) OR FIREABLE(t11))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t12)))
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 (FIREABLE(t12)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: 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: FIREABLE(t12)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 28 markings, 27 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t62)))
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 (FIREABLE(t62)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: FIREABLE(t62)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t119) OR NOT FIREABLE(t12) OR NOT FIREABLE(t37)) AND FIREABLE(t25))))
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 (((NOT FIREABLE(t119) OR NOT FIREABLE(t12) OR NOT FIREABLE(t37)) AND FIREABLE(t25))))
lola: processed formula length: 92
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: ((NOT FIREABLE(t119) OR NOT FIREABLE(t12) OR NOT FIREABLE(t37)) AND FIREABLE(t25))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 26 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 39 markings, 38 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t132) OR FIREABLE(t133) OR FIREABLE(t134) OR FIREABLE(t135) OR FIREABLE(t136) OR FIREABLE(t137) OR FIREABLE(t138) OR FIREABLE(t139) OR FIREABLE(t140) OR FIREABLE(t141) OR FIREABLE(t142))))
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 ((FIREABLE(t132) OR FIREABLE(t133) OR FIREABLE(t134) OR FIREABLE(t135) OR FIREABLE(t136) OR FIREABLE(t137) OR FIREABLE(t138) OR FIREABLE(t139) OR FIREABLE(t140) OR FIREABLE(t141) OR FIREABLE(t142))))
lola: processed formula length: 214
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: (FIREABLE(t132) OR FIREABLE(t133) OR FIREABLE(t134) OR FIREABLE(t135) OR FIREABLE(t136) OR FIREABLE(t137) OR FIREABLE(t138) OR FIREABLE(t139) OR FIREABLE(t140) OR FIREABLE(t141) OR FIREABLE(t142))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 22 literals and 11 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 62 markings, 61 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t38) OR FIREABLE(t39) OR FIREABLE(t40) OR FIREABLE(t41) OR FIREABLE(t42) OR FIREABLE(t43) OR FIREABLE(t44) OR FIREABLE(t45) OR FIREABLE(t46) OR FIREABLE(t47) OR FIREABLE(t48))))
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 ((FIREABLE(t38) OR FIREABLE(t39) OR FIREABLE(t40) OR FIREABLE(t41) OR FIREABLE(t42) OR FIREABLE(t43) OR FIREABLE(t44) OR FIREABLE(t45) OR FIREABLE(t46) OR FIREABLE(t47) OR FIREABLE(t48))))
lola: processed formula length: 203
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: (FIREABLE(t38) OR FIREABLE(t39) OR FIREABLE(t40) OR FIREABLE(t41) OR FIREABLE(t42) OR FIREABLE(t43) OR FIREABLE(t44) OR FIREABLE(t45) OR FIREABLE(t46) OR FIREABLE(t47) OR FIREABLE(t48))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 11 literals and 11 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t38) OR FIREABLE(t39) OR FIREABLE(t40) OR FIREABLE(t41) OR FIREABLE(t42) OR FIREABLE(t43) OR FIREABLE(t44) OR FIREABLE(t45) OR FIREABLE(t46) OR FIREABLE(t47) OR FIREABLE(t48))))
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 ((FIREABLE(t38) OR FIREABLE(t39) OR FIREABLE(t40) OR FIREABLE(t41) OR FIREABLE(t42) OR FIREABLE(t43) OR FIREABLE(t44) OR FIREABLE(t45) OR FIREABLE(t46) OR FIREABLE(t47) OR FIREABLE(t48))))
lola: processed formula length: 203
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: (FIREABLE(t38) OR FIREABLE(t39) OR FIREABLE(t40) OR FIREABLE(t41) OR FIREABLE(t42) OR FIREABLE(t43) OR FIREABLE(t44) OR FIREABLE(t45) OR FIREABLE(t46) OR FIREABLE(t47) OR FIREABLE(t48))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 11 literals and 11 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t38) OR FIREABLE(t39) OR FIREABLE(t40) OR FIREABLE(t41) OR FIREABLE(t42) OR FIREABLE(t43) OR FIREABLE(t44) OR FIREABLE(t45) OR FIREABLE(t46) OR FIREABLE(t47) OR FIREABLE(t48))))
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 ((FIREABLE(t38) OR FIREABLE(t39) OR FIREABLE(t40) OR FIREABLE(t41) OR FIREABLE(t42) OR FIREABLE(t43) OR FIREABLE(t44) OR FIREABLE(t45) OR FIREABLE(t46) OR FIREABLE(t47) OR FIREABLE(t48))))
lola: processed formula length: 203
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: (FIREABLE(t38) OR FIREABLE(t39) OR FIREABLE(t40) OR FIREABLE(t41) OR FIREABLE(t42) OR FIREABLE(t43) OR FIREABLE(t44) OR FIREABLE(t45) OR FIREABLE(t46) OR FIREABLE(t47) OR FIREABLE(t48))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 11 literals and 11 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15) AND NOT FIREABLE(t16) AND NOT FIREABLE(t17) AND NOT FIREABLE(t18) AND NOT FIREABLE(t19) AND NOT FIREABLE(t20) AND NOT FIREABLE(t21) AND NOT FIREABLE(t22) AND NOT FIREABLE(t23))))
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 ((NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15) AND NOT FIREABLE(t16) AND NOT FIREABLE(t17) AND NOT FIREABLE(t18) AND NOT FIREABLE(t19) AND NOT FIREABLE(t20) AND NOT FIREABLE(t21) AND NOT FIREABLE(t22) AND NOT FIREABLE(t23))))
lola: processed formula length: 247
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.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: (FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19) OR FIREABLE(t20) OR FIREABLE(t21) OR FIREABLE(t22) OR FIREABLE(t23))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 22 literals and 11 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t165) OR FIREABLE(t166) OR FIREABLE(t167) OR FIREABLE(t168) OR FIREABLE(t169) OR FIREABLE(t170) OR FIREABLE(t171) OR FIREABLE(t172) OR FIREABLE(t173) OR FIREABLE(t174) OR FIREABLE(t175) OR FIREABLE(t61)) AND FIREABLE(t0))))
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 (((FIREABLE(t165) OR FIREABLE(t166) OR FIREABLE(t167) OR FIREABLE(t168) OR FIREABLE(t169) OR FIREABLE(t170) OR FIREABLE(t171) OR FIREABLE(t172) OR FIREABLE(t173) OR FIREABLE(t174) OR FIREABLE(t175) OR FIREABLE(t61)) AND FIREABLE(t0))))
lola: processed formula length: 251
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: ((FIREABLE(t165) OR FIREABLE(t166) OR FIREABLE(t167) OR FIREABLE(t168) OR FIREABLE(t169) OR FIREABLE(t170) OR FIREABLE(t171) OR FIREABLE(t172) OR FIREABLE(t173) OR FIREABLE(t174) OR FIREABLE(t175) OR FIREABLE(t61)) AND FIREABLE(t0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 156 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t143) OR FIREABLE(t144) OR FIREABLE(t145) OR FIREABLE(t146) OR FIREABLE(t147) OR FIREABLE(t148) OR FIREABLE(t149) OR FIREABLE(t150) OR FIREABLE(t151) OR FIREABLE(t152) OR FIREABLE(t153)) AND FIREABLE(t119) AND FIREABLE(t0))))
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 (((FIREABLE(t143) OR FIREABLE(t144) OR FIREABLE(t145) OR FIREABLE(t146) OR FIREABLE(t147) OR FIREABLE(t148) OR FIREABLE(t149) OR FIREABLE(t150) OR FIREABLE(t151) OR FIREABLE(t152) OR FIREABLE(t153)) AND FIREABLE(t119) AND FIREABLE(t0))))
lola: processed formula length: 252
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2 markings, 1 edges
lola: formula 0: ((FIREABLE(t143) OR FIREABLE(t144) OR FIREABLE(t145) OR FIREABLE(t146) OR FIREABLE(t147) OR FIREABLE(t148) OR FIREABLE(t149) OR FIREABLE(t150) OR FIREABLE(t151) OR FIREABLE(t152) OR FIREABLE(t153)) AND FIREABLE(t119) AND FIREABLE(t0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 44 literals and 11 conjunctive subformulas
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t38) AND NOT FIREABLE(t39) AND NOT FIREABLE(t40) AND NOT FIREABLE(t41) AND NOT FIREABLE(t42) AND NOT FIREABLE(t43) AND NOT FIREABLE(t44) AND NOT FIREABLE(t45) AND NOT FIREABLE(t46) AND NOT FIREABLE(t47) AND NOT FIREABLE(t48) AND ((NOT FIREABLE(t120) AND NOT FIREABLE(t121) AND NOT FIREABLE(t122) AND NOT FIREABLE(t123) AND NOT FIREABLE(t124) AND NOT FIREABLE(t125) AND NOT FIREABL... (shortened)
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 ((NOT FIREABLE(t38) AND NOT FIREABLE(t39) AND NOT FIREABLE(t40) AND NOT FIREABLE(t41) AND NOT FIREABLE(t42) AND NOT FIREABLE(t43) AND NOT FIREABLE(t44) AND NOT FIREABLE(t45) AND NOT FIREABLE(t46) AND NOT FIREABLE(t47) AND NOT FIREABLE(t48) AND ((NOT FIREABLE(t120) AND NOT FIREABLE(t121) AND NOT FIREABLE(t122) AND NOT FIREABLE(t123) AND NOT FIREABLE(t124) AND NOT FIREABLE(t125) AND NOT FIREABL... (shortened)
lola: processed formula length: 545
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.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: (FIREABLE(t38) OR FIREABLE(t39) OR FIREABLE(t40) OR FIREABLE(t41) OR FIREABLE(t42) OR FIREABLE(t43) OR FIREABLE(t44) OR FIREABLE(t45) OR FIREABLE(t46) OR FIREABLE(t47) OR FIREABLE(t48) OR ((FIREABLE(t120) OR FIREABLE(t121) OR FIREABLE(t122) OR FIREABLE(t123) OR FIREABLE(t124) OR FIREABLE(t125) OR FIREABLE(t126) OR FIREABLE(t127) OR FIREABLE(t128) OR FIREABLE(t129) OR FIREABLE(t130)) AND FIREABLE(t119) AND NOT FIREABLE(t61)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 29 markings, 28 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t120) AND NOT FIREABLE(t121) AND NOT FIREABLE(t122) AND NOT FIREABLE(t123) AND NOT FIREABLE(t124) AND NOT FIREABLE(t125) AND NOT FIREABLE(t126) AND NOT FIREABLE(t127) AND NOT FIREABLE(t128) AND NOT FIREABLE(t129) AND NOT FIREABLE(t130)) OR (NOT FIREABLE(t132) AND NOT FIREABLE(t133) AND NOT FIREABLE(t134) AND NOT FIREABLE(t135) AND NOT FIREABLE(t136) AND NOT FIREABLE(t137) AND... (shortened)
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 (((NOT FIREABLE(t120) AND NOT FIREABLE(t121) AND NOT FIREABLE(t122) AND NOT FIREABLE(t123) AND NOT FIREABLE(t124) AND NOT FIREABLE(t125) AND NOT FIREABLE(t126) AND NOT FIREABLE(t127) AND NOT FIREABLE(t128) AND NOT FIREABLE(t129) AND NOT FIREABLE(t130)) OR (NOT FIREABLE(t132) AND NOT FIREABLE(t133) AND NOT FIREABLE(t134) AND NOT FIREABLE(t135) AND NOT FIREABLE(t136) AND NOT FIREABLE(t137) AND... (shortened)
lola: processed formula length: 814
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.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: ((FIREABLE(t120) OR FIREABLE(t121) OR FIREABLE(t122) OR FIREABLE(t123) OR FIREABLE(t124) OR FIREABLE(t125) OR FIREABLE(t126) OR FIREABLE(t127) OR FIREABLE(t128) OR FIREABLE(t129) OR FIREABLE(t130)) AND (FIREABLE(t132) OR FIREABLE(t133) OR FIREABLE(t134) OR FIREABLE(t135) OR FIREABLE(t136) OR FIREABLE(t137) OR FIREABLE(t138) OR FIREABLE(t139) OR FIREABLE(t140) OR FIREABLE(t141) OR FIREABLE(t142)) AND (FIREABLE(t132) OR FIREABLE(t133) OR FIREABLE(t134) OR FIREABLE(t135) OR FIREABLE(t136) OR FIREABLE(t137) OR FIREABLE(t138) OR FIREABLE(t139) OR FIREABLE(t140) OR FIREABLE(t141) OR FIREABLE(t142) OR FIREABLE(t131)) AND FIREABLE(t0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24563 literals and 1452 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 755207 markings, 3338748 edges, 151041 markings/sec, 0 secs
lola: sara is running 5 secs || 1434531 markings, 6478960 edges, 135865 markings/sec, 5 secs
lola: sara is running 10 secs || 2103394 markings, 9577878 edges, 133773 markings/sec, 10 secs
lola: sara is running 15 secs || 2718291 markings, 12554075 edges, 122979 markings/sec, 15 secs
lola: sara is running 20 secs || 3378452 markings, 15724972 edges, 132032 markings/sec, 20 secs
lola: sara is running 25 secs || 4132799 markings, 19036468 edges, 150869 markings/sec, 25 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 883 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t0) OR ((FIREABLE(t86) OR FIREABLE(t87) OR FIREABLE(t88) OR FIREABLE(t89) OR FIREABLE(t90) OR FIREABLE(t91) OR FIREABLE(t92) OR FIREABLE(t93) OR FIREABLE(t94) OR FIREABLE(t95) OR FIREABLE(t96)) AND (FIREABLE(t120) OR FIREABLE(t121) OR FIREABLE(t122) OR FIREABLE(t123) OR FIREABLE(t124) OR FIREABLE(t125) OR FIREABLE(t126) OR FIREABLE(t127) OR FIREABLE(t128) OR... (shortened)
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 (((NOT FIREABLE(t0) OR ((FIREABLE(t86) OR FIREABLE(t87) OR FIREABLE(t88) OR FIREABLE(t89) OR FIREABLE(t90) OR FIREABLE(t91) OR FIREABLE(t92) OR FIREABLE(t93) OR FIREABLE(t94) OR FIREABLE(t95) OR FIREABLE(t96)) AND (FIREABLE(t120) OR FIREABLE(t121) OR FIREABLE(t122) OR FIREABLE(t123) OR FIREABLE(t124) OR FIREABLE(t125) OR FIREABLE(t126) OR FIREABLE(t127) OR FIREABLE(t128) OR... (shortened)
lola: processed formula length: 477
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: ((NOT FIREABLE(t0) OR ((FIREABLE(t86) OR FIREABLE(t87) OR FIREABLE(t88) OR FIREABLE(t89) OR FIREABLE(t90) OR FIREABLE(t91) OR FIREABLE(t92) OR FIREABLE(t93) OR FIREABLE(t94) OR FIREABLE(t95) OR FIREABLE(t96)) AND (FIREABLE(t120) OR FIREABLE(t121) OR FIREABLE(t122) OR FIREABLE(t123) OR FIREABLE(t124) OR FIREABLE(t125) OR FIREABLE(t126) OR FIREABLE(t127) OR FIREABLE(t128) OR FIREABLE(t129) OR FIREABLE(t130))) OR FIREABLE(t12)) AND FIREABLE(t24))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 13 will run for 1177 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t75) AND NOT FIREABLE(t76) AND NOT FIREABLE(t77) AND NOT FIREABLE(t78) AND NOT FIREABLE(t79) AND NOT FIREABLE(t80) AND NOT FIREABLE(t81) AND NOT FIREABLE(t82) AND NOT FIREABLE(t83) AND NOT FIREABLE(t84) AND NOT FIREABLE(t85)) OR ((FIREABLE(t165) OR FIREABLE(t166) OR FIREABLE(t167) OR FIREABLE(t168) OR FIREABLE(t169) OR FIREABLE(t170) OR FIREABLE(t171) OR FIREABLE(t172)... (shortened)
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 (((NOT FIREABLE(t75) AND NOT FIREABLE(t76) AND NOT FIREABLE(t77) AND NOT FIREABLE(t78) AND NOT FIREABLE(t79) AND NOT FIREABLE(t80) AND NOT FIREABLE(t81) AND NOT FIREABLE(t82) AND NOT FIREABLE(t83) AND NOT FIREABLE(t84) AND NOT FIREABLE(t85)) OR ((FIREABLE(t165) OR FIREABLE(t166) OR FIREABLE(t167) OR FIREABLE(t168) OR FIREABLE(t169) OR FIREABLE(t170) OR FIREABLE(t171) OR FIREABLE(t172)... (shortened)
lola: processed formula length: 653
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.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: ((FIREABLE(t75) OR FIREABLE(t76) OR FIREABLE(t77) OR FIREABLE(t78) OR FIREABLE(t79) OR FIREABLE(t80) OR FIREABLE(t81) OR FIREABLE(t82) OR FIREABLE(t83) OR FIREABLE(t84) OR FIREABLE(t85)) AND ((NOT FIREABLE(t165) AND NOT FIREABLE(t166) AND NOT FIREABLE(t167) AND NOT FIREABLE(t168) AND NOT FIREABLE(t169) AND NOT FIREABLE(t170) AND NOT FIREABLE(t171) AND NOT FIREABLE(t172) AND NOT FIREABLE(t173) AND NOT FIREABLE(t174) AND NOT FIREABLE(t175)) OR (NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9) AND NOT FIREABLE(t10) AND NOT FIREABLE(t11))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 28 markings, 27 edges
lola: ========================================
lola: subprocess 14 will run for 1766 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR FIREABLE(t10) OR FIREABLE(t11)) AND (FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR FIREABLE(t10) OR FIREABLE(t11)) AND NOT FIREAB... (shortened)
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 ((((FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR FIREABLE(t10) OR FIREABLE(t11)) AND (FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR FIREABLE(t10) OR FIREABLE(t11)) AND NOT FIREAB... (shortened)
lola: processed formula length: 1306
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.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: (((NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9) AND NOT FIREABLE(t10) AND NOT FIREABLE(t11)) OR (NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9) AND NOT FIREABLE(t10) AND NOT FIREABLE(t11)) OR FIREABLE(t26) OR FIREABLE(t27) OR FIREABLE(t28) OR FIREABLE(t29) OR FIREABLE(t30) OR FIREABLE(t31) OR FIREABLE(t32) OR FIREABLE(t33) OR FIREABLE(t34) OR FIREABLE(t35) OR FIREABLE(t36) OR (NOT FIREABLE(t26) AND NOT FIREABLE(t27) AND NOT FIREABLE(t28) AND NOT FIREABLE(t29) AND NOT FIREABLE(t30) AND NOT FIREABLE(t31) AND NOT FIREABLE(t32) AND NOT FIREABLE(t33) AND NOT FIREABLE(t34) AND NOT FIREABLE(t35) AND NOT FIREABLE(t36) AND NOT FIREABLE(t120) AND NOT FIREABLE(t121) AND NOT FIREABLE(t122) AND NOT FIREABLE(t123) AND NOT FIREABLE(t124) AND NOT FIREABLE(t125) AND NOT FIREABLE(t126) AND NOT FIREABLE(t127) AND NOT FIREABLE(t128) AND NOT FIREABLE(t129) AND NOT FIREABLE(t130) AND (FIREABLE(t75) OR FIREABLE(t76) OR FIREABLE(t77) OR FIREABLE(t78) OR FIREABLE(t79) OR FIREABLE(t80) OR FIREABLE(t81) OR FIREABLE(t82) OR FIREABLE(t83) OR FIREABLE(t84) OR FIREABLE(t85)))) AND FIREABLE(t49))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 26 markings, 25 edges
lola: ========================================
lola: subprocess 15 will run for 3533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t97) OR FIREABLE(t98) OR FIREABLE(t99) OR FIREABLE(t100) OR FIREABLE(t101) OR FIREABLE(t102) OR FIREABLE(t103) OR FIREABLE(t104) OR FIREABLE(t105) OR FIREABLE(t106) OR FIREABLE(t107)) AND (FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19) OR FIREABLE(t20) OR FIREABLE(t21) OR FIREABLE(t22) OR FIRE... (shortened)
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 (((FIREABLE(t97) OR FIREABLE(t98) OR FIREABLE(t99) OR FIREABLE(t100) OR FIREABLE(t101) OR FIREABLE(t102) OR FIREABLE(t103) OR FIREABLE(t104) OR FIREABLE(t105) OR FIREABLE(t106) OR FIREABLE(t107)) AND (FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19) OR FIREABLE(t20) OR FIREABLE(t21) OR FIREABLE(t22) OR FIRE... (shortened)
lola: processed formula length: 1591
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: ((FIREABLE(t97) OR FIREABLE(t98) OR FIREABLE(t99) OR FIREABLE(t100) OR FIREABLE(t101) OR FIREABLE(t102) OR FIREABLE(t103) OR FIREABLE(t104) OR FIREABLE(t105) OR FIREABLE(t106) OR FIREABLE(t107)) AND (FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19) OR FIREABLE(t20) OR FIREABLE(t21) OR FIREABLE(t22) OR FIREABLE(t23)) AND (FIREABLE(t24) OR FIREABLE(t12)) AND (FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15) OR FIREABLE(t16) OR FIREABLE(t17) OR FIREABLE(t18) OR FIREABLE(t19) OR FIREABLE(t20) OR FIREABLE(t21) OR FIREABLE(t22) OR FIREABLE(t23)) AND FIREABLE(t61) AND (FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7) OR FIREABLE(t8) OR FIREABLE(t9) OR FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t120) OR FIREABLE(t121) OR FIREABLE(t122) OR FIREABLE(t123) OR FIREABLE(t124) OR FIREABLE(t125) OR FIREABLE(t126) OR FIREABLE(t127) OR FIREABLE(t128) OR FIREABLE(t129) OR FIREABLE(t130)) AND ((NOT FIREABLE(t1) AND NOT FIREABLE(t2) AND NOT FIREABLE(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t5) AND NOT FIREABLE(t6) AND NOT FIREABLE(t7) AND NOT FIREABLE(t8) AND NOT FIREABLE(t9) AND NOT FIREABLE(t10) AND NOT FIREABLE(t11) AND (FIREABLE(t143) OR FIREABLE(t144) OR FIREABLE(t145) OR FIREABLE(t146) OR FIREABLE(t147) OR FIREABLE(t148) OR FIREABLE(t149) OR FIREABLE(t150) OR FIREABLE(t151) OR FIREABLE(t152) OR FIREABLE(t153) OR FIREABLE(t62))) OR (FIREABLE(t61) AND FIREABLE(t0) AND FIREABLE(t131))))
lola: state equation task get result unparse finished id 0
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara not yet started (preprocessing) || 787322 markings, 3488603 edges, 157464 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 1514234 markings, 6941760 edges, 145382 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 2277003 markings, 10387308 edges, 152554 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 2957180 markings, 13842792 edges, 136035 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 3043331 markings, 14382279 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no no no yes yes no yes no yes yes yes yes no
lola:
preliminary result: yes no yes no no no yes yes no yes no yes yes yes yes no
lola: memory consumption: 71548 KB
lola: time consumption: 58 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

BK_STOP 1553893372353

--------------------
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="QuasiCertifProtocol-COL-10"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
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-3954"
echo " Executing tool lola"
echo " Input is QuasiCertifProtocol-COL-10, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r126-oct2-155274853300216"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-10.tgz
mv QuasiCertifProtocol-COL-10 execution
cd execution
if [ "ReachabilityFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "ReachabilityFireability" = "UpperBounds" ] ; 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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;