About the Execution of LoLA for NeighborGrid-PT-d2n3m1t12
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4264.220 | 28059.00 | 4666.00 | 15.00 | FTFFFFFFTFFFFFTT | 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.r104-oct2-155272225400090.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 NeighborGrid-PT-d2n3m1t12, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r104-oct2-155272225400090
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.1K Feb 11 23:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 11 23:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 8 00:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 8 00:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 112 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 350 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 00:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K Feb 5 00:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 4 06:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 4 06:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 1 00:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 1 00:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rwxr-xr-x 1 mcc users 19K 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 NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-00
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-01
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-02
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-03
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-04
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-05
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-06
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-07
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-08
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-09
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-10
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-11
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-12
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-13
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-14
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1552772946611
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ NeighborGrid-PT-d2n3m1t12 @ 3570 seconds
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d2n3m1t12-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3542
rslt: Output for ReachabilityFireability @ NeighborGrid-PT-d2n3m1t12
{
"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": "Sat Mar 16 21:49:06 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 6
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 6
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": 3,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "E (F ((NOT FIREABLE(to_0_2v_1_1) AND NOT FIREABLE(to_0_1v_2_1) AND FIREABLE(ti_0_1v_0_2))))",
"processed_size": 91,
"rewrites": 7
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 0,
"problems": 0
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A (G ((FIREABLE(ti_1_0v_2_0) OR FIREABLE(to_0_1v_0_2) OR FIREABLE(to_1_2v_2_0))))",
"processed_size": 83,
"rewrites": 8
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"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": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A (G ((NOT FIREABLE(to_0_2v_1_1) OR FIREABLE(to_0_2v_2_0) OR FIREABLE(ti_0_2v_2_0))))",
"processed_size": 87,
"rewrites": 8
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 0,
"problems": 0
},
"type": "invariance",
"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": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "E (F ((FIREABLE(to_0_2v_1_2) AND FIREABLE(to_0_1v_1_2) AND NOT FIREABLE(ti_0_1v_0_2) AND FIREABLE(ti_0_1v_1_0))))",
"processed_size": 113,
"rewrites": 7
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 0,
"problems": 0
},
"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": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "E (F ((NOT FIREABLE(to_1_1v_2_2) AND FIREABLE(to_1_1v_1_2) AND NOT FIREABLE(ti_0_2v_2_1) AND NOT FIREABLE(to_0_1v_1_0) AND FIREABLE(ti_1_0v_2_2))))",
"processed_size": 147,
"rewrites": 7
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 0,
"problems": 0
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F ((FIREABLE(ti_1_2v_2_0) AND FIREABLE(to_0_0v_2_0) AND ((NOT FIREABLE(to_1_0v_1_2) AND NOT FIREABLE(to_2_0v_2_1)) OR (NOT FIREABLE(to_0_0v_1_2) AND NOT FIREABLE(to_0_2v_2_1))))))",
"processed_size": 183,
"rewrites": 7
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 0,
"problems": 0
},
"type": "reachability",
"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": 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": 6,
"unfir": 5,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F ((NOT FIREABLE(to_1_0v_2_1) AND NOT FIREABLE(ti_1_1v_2_1) AND NOT FIREABLE(ti_1_2v_2_1) AND NOT FIREABLE(ti_1_0v_2_0) AND NOT FIREABLE(ti_0_0v_0_2) AND FIREABLE(ti_0_0v_1_0))))",
"processed_size": 181,
"rewrites": 7
},
"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": 0,
"problems": 0
},
"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": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "E (F ((NOT FIREABLE(ti_1_0v_2_1) AND NOT FIREABLE(to_1_0v_2_2) AND NOT FIREABLE(to_0_1v_1_0) AND (FIREABLE(to_0_1v_1_1) OR FIREABLE(ti_0_0v_0_2) OR NOT FIREABLE(ti_1_0v_1_1) OR FIREABLE(to_0_1v_2_1)))))",
"processed_size": 205,
"rewrites": 7
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"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": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 8,
"unfir": 5,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "A (G ((NOT FIREABLE(ti_0_2v_1_2) OR NOT FIREABLE(to_0_2v_1_2) OR NOT FIREABLE(to_0_1v_1_0) OR NOT FIREABLE(to_0_0v_1_0) OR (FIREABLE(to_0_2v_1_2) AND FIREABLE(ti_0_0v_0_1)) OR NOT FIREABLE(to_0_2v_1_1) OR FIREABLE(ti_2_0v_2_2))))",
"processed_size": 235,
"rewrites": 8
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 0,
"problems": 0
},
"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": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 6,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 8,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "A (G ((FIREABLE(ti_0_1v_1_0) OR FIREABLE(ti_1_2v_2_0) OR (FIREABLE(ti_0_2v_1_2) AND FIREABLE(to_0_0v_2_2)) OR FIREABLE(ti_0_0v_2_1) OR FIREABLE(to_0_1v_1_0) OR (NOT FIREABLE(ti_0_0v_0_2) AND NOT FIREABLE(ti_1_0v_2_0)))))",
"processed_size": 225,
"rewrites": 8
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 6,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 8,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "E (F ((NOT FIREABLE(to_0_2v_1_1) AND (FIREABLE(to_1_2v_2_1) OR FIREABLE(ti_0_2v_1_0)) AND FIREABLE(to_1_0v_2_0) AND FIREABLE(ti_1_0v_1_2) AND (FIREABLE(ti_0_1v_1_0) OR FIREABLE(ti_0_0v_0_2)) AND NOT FIREABLE(ti_1_1v_1_2))))",
"processed_size": 225,
"rewrites": 7
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 0,
"problems": 0
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"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": 5,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 9,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 9
},
"processed": "A (G ((NOT FIREABLE(to_0_0v_0_1) OR NOT FIREABLE(ti_0_2v_2_1) OR (NOT FIREABLE(ti_0_1v_1_1) AND NOT FIREABLE(to_0_1v_0_2)) OR (FIREABLE(to_1_0v_2_0) AND FIREABLE(ti_1_0v_2_1) AND FIREABLE(to_1_0v_2_1) AND FIREABLE(to_0_2v_1_0)) OR FIREABLE(ti_1_2v_2_1))))",
"processed_size": 259,
"rewrites": 8
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 0,
"problems": 0
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"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": 9,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 10,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "A (G (((FIREABLE(to_1_1v_2_1) AND FIREABLE(ti_1_1v_1_2) AND NOT FIREABLE(to_0_0v_2_0)) OR FIREABLE(ti_0_2v_1_0) OR ((FIREABLE(to_0_0v_1_2) OR FIREABLE(to_1_0v_2_0) OR FIREABLE(ti_0_2v_1_2)) AND (FIREABLE(ti_1_1v_2_0) OR FIREABLE(to_1_2v_2_2) OR FIREABLE(to_2_0v_2_1))))))",
"processed_size": 277,
"rewrites": 8
},
"result":
{
"edges": 5,
"markings": 6,
"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"
},
"stateequation":
{
"literals": 25,
"problems": 5
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"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": 8,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 11,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 11
},
"processed": "A (G ((FIREABLE(to_0_0v_1_2) OR FIREABLE(to_1_0v_2_0) OR FIREABLE(ti_0_1v_2_1) OR FIREABLE(ti_0_0v_1_1) OR ((FIREABLE(ti_1_0v_1_1) OR FIREABLE(to_1_1v_1_2)) AND NOT FIREABLE(ti_0_2v_2_0)) OR (FIREABLE(to_0_1v_0_2) AND FIREABLE(ti_0_0v_2_0) AND (NOT FIREABLE(to_0_1v_2_2) OR NOT FIREABLE(ti_0_0v_2_1))))))",
"processed_size": 311,
"rewrites": 8
},
"result":
{
"edges": 8,
"markings": 9,
"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": 20,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 15056,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : A(G(**)) : FALSE : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : FALSE : E(F(**)) : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 144,
"conflict_clusters": 9,
"places": 9,
"places_significant": 8,
"singleton_clusters": 0,
"transitions": 72
},
"result":
{
"preliminary_value": "no yes no no no no no no yes no no no no no yes yes ",
"value": "no yes no no no no no no yes no no no no 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: 81/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 72 transitions, 8 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: A (G (((FIREABLE(to_1_1v_2_1) AND FIREABLE(ti_1_1v_1_2) AND NOT FIREABLE(to_0_0v_2_0)) OR FIREABLE(ti_0_2v_1_0) OR ((FIREABLE(to_0_0v_1_2) OR FIREABLE(to_1_0v_2_0) OR FIREABLE(ti_0_2v_1_2)) AND (FIREABLE(ti_1_1v_2_0) OR FIREABLE(to_1_2v_2_2) OR FIREABLE(to_2_0v_2_1)))))) : A (G ((NOT FIREABLE(ti_0_2v_1_2) OR NOT FIREABLE(to_0_2v_1_2) OR NOT FIREABLE(to_0_1v_1_0) OR NOT FIREABLE(to_0_0v_1_0) OR (FIREABLE(to_0_2v_1_2) AND FIREABLE(ti_0_0v_0_1)) OR NOT FIREABLE(to_0_2v_1_1) OR FIREABLE(ti_2_0v_2_2)))) : E (F (())) : E (F ((FIREABLE(to_0_2v_1_2) AND FIREABLE(to_0_1v_1_2) AND NOT FIREABLE(ti_0_1v_0_2) AND FIREABLE(ti_0_1v_1_0)))) : A (G ((FIREABLE(ti_1_0v_2_0) OR FIREABLE(to_0_1v_0_2) OR FIREABLE(to_1_2v_2_0)))) : E (F ((NOT FIREABLE(to_1_1v_2_2) AND FIREABLE(to_1_1v_1_2) AND NOT FIREABLE(ti_0_2v_2_1) AND NOT FIREABLE(to_0_1v_1_0) AND FIREABLE(ti_1_0v_2_2)))) : E (F ((NOT FIREABLE(to_0_2v_1_1) AND NOT FIREABLE(to_0_1v_2_1) AND FIREABLE(ti_0_1v_0_2)))) : E (F ((NOT FIREABLE(to_1_0v_2_1) AND NOT FIREABLE(ti_1_1v_2_1) AND NOT FIREABLE(ti_1_2v_2_1) AND NOT FIREABLE(ti_1_0v_2_0) AND NOT FIREABLE(ti_0_0v_0_2) AND FIREABLE(ti_0_0v_1_0)))) : E (F ((NOT FIREABLE(ti_1_0v_2_1) AND NOT FIREABLE(to_1_0v_2_2) AND NOT FIREABLE(to_0_1v_1_0) AND (FIREABLE(to_0_1v_1_1) OR FIREABLE(ti_0_0v_0_2) OR NOT FIREABLE(ti_1_0v_1_1) OR FIREABLE(to_0_1v_2_1))))) : E (F ((NOT FIREABLE(to_0_2v_1_1) AND (FIREABLE(to_1_2v_2_1) OR FIREABLE(ti_0_2v_1_0)) AND FIREABLE(to_1_0v_2_0) AND FIREABLE(ti_1_0v_1_2) AND (FIREABLE(ti_0_1v_1_0) OR FIREABLE(ti_0_0v_0_2)) AND NOT FIREABLE(ti_1_1v_1_2)))) : A (G ((FIREABLE(ti_0_1v_1_0) OR FIREABLE(ti_1_2v_2_0) OR (FIREABLE(ti_0_2v_1_2) AND FIREABLE(to_0_0v_2_2)) OR FIREABLE(ti_0_0v_2_1) OR FIREABLE(to_0_1v_1_0) OR (NOT FIREABLE(ti_0_0v_0_2) AND NOT FIREABLE(ti_1_0v_2_0))))) : A (G ((FIREABLE(to_0_0v_1_2) OR FIREABLE(to_1_0v_2_0) OR FIREABLE(ti_0_1v_2_1) OR FIREABLE(ti_0_0v_1_1) OR ((FIREABLE(ti_1_0v_1_1) OR FIREABLE(to_1_1v_1_2)) AND NOT FIREABLE(ti_0_2v_2_0)) OR (FIREABLE(to_0_1v_0_2) AND FIREABLE(ti_0_0v_2_0) AND (NOT FIREABLE(to_0_1v_2_2) OR NOT FIREABLE(ti_0_0v_2_1)))))) : E (F (())) : E (F ((FIREABLE(ti_1_2v_2_0) AND FIREABLE(to_0_0v_2_0) AND ((NOT FIREABLE(to_1_0v_1_2) AND NOT FIREABLE(to_2_0v_2_1)) OR (NOT FIREABLE(to_0_0v_1_2) AND NOT FIREABLE(to_0_2v_2_1)))))) : A (G ((NOT FIREABLE(to_0_2v_1_1) OR FIREABLE(to_0_2v_2_0) OR FIREABLE(ti_0_2v_2_0)))) : A (G ((NOT FIREABLE(to_0_0v_0_1) OR NOT FIREABLE(ti_0_2v_2_1) OR (NOT FIREABLE(ti_0_1v_1_1) AND NOT FIREABLE(to_0_1v_0_2)) OR (FIREABLE(to_1_0v_2_0) AND FIREABLE(ti_1_0v_2_1) AND FIREABLE(to_1_0v_2_1) AND FIREABLE(to_0_2v_1_0)) OR FIREABLE(ti_1_2v_2_1))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 6 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: processed formula with 0 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 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 6 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(to_0_2v_1_1) AND NOT FIREABLE(to_0_1v_2_1) AND FIREABLE(ti_0_1v_0_2))))
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(to_0_2v_1_1) AND NOT FIREABLE(to_0_1v_2_1) AND FIREABLE(ti_0_1v_0_2))))
lola: processed formula length: 91
lola: 7 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(to_0_2v_1_1) AND NOT FIREABLE(to_0_1v_2_1) AND FIREABLE(ti_0_1v_0_2))
lola: state equation task get result unparse finished id 0
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(ti_1_0v_2_0) OR FIREABLE(to_0_1v_0_2) OR FIREABLE(to_1_2v_2_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:787
lola: processed formula: A (G ((FIREABLE(ti_1_0v_2_0) OR FIREABLE(to_0_1v_0_2) OR FIREABLE(to_1_2v_2_0))))
lola: processed formula length: 83
lola: 8 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: SUBRESULT
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(ti_1_0v_2_0) AND NOT FIREABLE(to_0_1v_0_2) AND NOT FIREABLE(to_1_2v_2_0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(to_0_2v_1_1) OR FIREABLE(to_0_2v_2_0) OR FIREABLE(ti_0_2v_2_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:787
lola: processed formula: A (G ((NOT FIREABLE(to_0_2v_1_1) OR FIREABLE(to_0_2v_2_0) OR FIREABLE(ti_0_2v_2_0))))
lola: processed formula length: 87
lola: 8 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(to_0_2v_1_1) AND NOT FIREABLE(to_0_2v_2_0) AND NOT FIREABLE(ti_0_2v_2_0))
lola: state equation task get result unparse finished id 0
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(to_0_2v_1_2) AND FIREABLE(to_0_1v_1_2) AND NOT FIREABLE(ti_0_1v_0_2) AND FIREABLE(ti_0_1v_1_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 ((FIREABLE(to_0_2v_1_2) AND FIREABLE(to_0_1v_1_2) AND NOT FIREABLE(ti_0_1v_0_2) AND FIREABLE(ti_0_1v_1_0))))
lola: processed formula length: 113
lola: 7 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(to_0_2v_1_2) AND FIREABLE(to_0_1v_1_2) AND NOT FIREABLE(ti_0_1v_0_2) AND FIREABLE(ti_0_1v_1_0))
lola: state equation task get result unparse finished id 0
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(to_1_1v_2_2) AND FIREABLE(to_1_1v_1_2) AND NOT FIREABLE(ti_0_2v_2_1) AND NOT FIREABLE(to_0_1v_1_0) AND FIREABLE(ti_1_0v_2_2))))
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(to_1_1v_2_2) AND FIREABLE(to_1_1v_1_2) AND NOT FIREABLE(ti_0_2v_2_1) AND NOT FIREABLE(to_0_1v_1_0) AND FIREABLE(ti_1_0v_2_2))))
lola: processed formula length: 147
lola: 7 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(to_1_1v_2_2) AND FIREABLE(to_1_1v_1_2) AND NOT FIREABLE(ti_0_2v_2_1) AND NOT FIREABLE(to_0_1v_1_0) AND FIREABLE(ti_1_0v_2_2))
lola: state equation task get result unparse finished id 0
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(ti_1_2v_2_0) AND FIREABLE(to_0_0v_2_0) AND ((NOT FIREABLE(to_1_0v_1_2) AND NOT FIREABLE(to_2_0v_2_1)) OR (NOT FIREABLE(to_0_0v_1_2) AND NOT FIREABLE(to_0_2v_2_1))))))
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(ti_1_2v_2_0) AND FIREABLE(to_0_0v_2_0) AND ((NOT FIREABLE(to_1_0v_1_2) AND NOT FIREABLE(to_2_0v_2_1)) OR (NOT FIREABLE(to_0_0v_1_2) AND NOT FIREABLE(to_0_2v_2_1))))))
lola: processed formula length: 183
lola: 7 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(ti_1_2v_2_0) AND FIREABLE(to_0_0v_2_0) AND ((NOT FIREABLE(to_1_0v_1_2) AND NOT FIREABLE(to_2_0v_2_1)) OR (NOT FIREABLE(to_0_0v_1_2) AND NOT FIREABLE(to_0_2v_2_1))))
lola: state equation task get result unparse finished id 0
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(to_1_0v_2_1) AND NOT FIREABLE(ti_1_1v_2_1) AND NOT FIREABLE(ti_1_2v_2_1) AND NOT FIREABLE(ti_1_0v_2_0) AND NOT FIREABLE(ti_0_0v_0_2) AND FIREABLE(ti_0_0v_1_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 ((NOT FIREABLE(to_1_0v_2_1) AND NOT FIREABLE(ti_1_1v_2_1) AND NOT FIREABLE(ti_1_2v_2_1) AND NOT FIREABLE(ti_1_0v_2_0) AND NOT FIREABLE(ti_0_0v_0_2) AND FIREABLE(ti_0_0v_1_0))))
lola: processed formula length: 181
lola: 7 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(to_1_0v_2_1) AND NOT FIREABLE(ti_1_1v_2_1) AND NOT FIREABLE(ti_1_2v_2_1) AND NOT FIREABLE(ti_1_0v_2_0) AND NOT FIREABLE(ti_0_0v_0_2) AND FIREABLE(ti_0_0v_1_0))
lola: state equation task get result unparse finished id 0
lola: state equation: State predicate is contradiction.
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 ((NOT FIREABLE(ti_1_0v_2_1) AND NOT FIREABLE(to_1_0v_2_2) AND NOT FIREABLE(to_0_1v_1_0) AND (FIREABLE(to_0_1v_1_1) OR FIREABLE(ti_0_0v_0_2) OR NOT FIREABLE(ti_1_0v_1_1) OR FIREABLE(to_0_1v_2_1)))))
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(ti_1_0v_2_1) AND NOT FIREABLE(to_1_0v_2_2) AND NOT FIREABLE(to_0_1v_1_0) AND (FIREABLE(to_0_1v_1_1) OR FIREABLE(ti_0_0v_0_2) OR NOT FIREABLE(ti_1_0v_1_1) OR FIREABLE(to_0_1v_2_1)))))
lola: processed formula length: 205
lola: 7 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(ti_1_0v_2_1) AND NOT FIREABLE(to_1_0v_2_2) AND NOT FIREABLE(to_0_1v_1_0) AND (FIREABLE(to_0_1v_1_1) OR FIREABLE(ti_0_0v_0_2) OR NOT FIREABLE(ti_1_0v_1_1) OR FIREABLE(to_0_1v_2_1)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation task get result unparse finished id 0
lola: The predicate is reachable.
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(ti_0_2v_1_2) OR NOT FIREABLE(to_0_2v_1_2) OR NOT FIREABLE(to_0_1v_1_0) OR NOT FIREABLE(to_0_0v_1_0) OR (FIREABLE(to_0_2v_1_2) AND FIREABLE(ti_0_0v_0_1)) OR NOT FIREABLE(to_0_2v_1_1) OR FIREABLE(ti_2_0v_2_2))))
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(ti_0_2v_1_2) OR NOT FIREABLE(to_0_2v_1_2) OR NOT FIREABLE(to_0_1v_1_0) OR NOT FIREABLE(to_0_0v_1_0) OR (FIREABLE(to_0_2v_1_2) AND FIREABLE(ti_0_0v_0_1)) OR NOT FIREABLE(to_0_2v_1_1) OR FIREABLE(ti_2_0v_2_2))))
lola: processed formula length: 235
lola: 8 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(ti_0_2v_1_2) AND FIREABLE(to_0_2v_1_2) AND FIREABLE(to_0_1v_1_0) AND FIREABLE(to_0_0v_1_0) AND (NOT FIREABLE(to_0_2v_1_2) OR NOT FIREABLE(ti_0_0v_0_1)) AND FIREABLE(to_0_2v_1_1) AND NOT FIREABLE(ti_2_0v_2_2))
lola: state equation task get result unparse finished id 0
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(ti_0_1v_1_0) OR FIREABLE(ti_1_2v_2_0) OR (FIREABLE(ti_0_2v_1_2) AND FIREABLE(to_0_0v_2_2)) OR FIREABLE(ti_0_0v_2_1) OR FIREABLE(to_0_1v_1_0) OR (NOT FIREABLE(ti_0_0v_0_2) AND NOT FIREABLE(ti_1_0v_2_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:787
lola: processed formula: A (G ((FIREABLE(ti_0_1v_1_0) OR FIREABLE(ti_1_2v_2_0) OR (FIREABLE(ti_0_2v_1_2) AND FIREABLE(to_0_0v_2_2)) OR FIREABLE(ti_0_0v_2_1) OR FIREABLE(to_0_1v_1_0) OR (NOT FIREABLE(ti_0_0v_0_2) AND NOT FIREABLE(ti_1_0v_2_0)))))
lola: processed formula length: 225
lola: 8 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
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: 12 markings, 11 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(ti_0_1v_1_0) AND NOT FIREABLE(ti_1_2v_2_0) AND (NOT FIREABLE(ti_0_2v_1_2) OR NOT FIREABLE(to_0_0v_2_2)) AND NOT FIREABLE(ti_0_0v_2_1) AND NOT FIREABLE(to_0_1v_1_0) AND (FIREABLE(ti_0_0v_0_2) OR FIREABLE(ti_1_0v_2_0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(to_0_2v_1_1) AND (FIREABLE(to_1_2v_2_1) OR FIREABLE(ti_0_2v_1_0)) AND FIREABLE(to_1_0v_2_0) AND FIREABLE(ti_1_0v_1_2) AND (FIREABLE(ti_0_1v_1_0) OR FIREABLE(ti_0_0v_0_2)) AND NOT FIREABLE(ti_1_1v_1_2))))
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(to_0_2v_1_1) AND (FIREABLE(to_1_2v_2_1) OR FIREABLE(ti_0_2v_1_0)) AND FIREABLE(to_1_0v_2_0) AND FIREABLE(ti_1_0v_1_2) AND (FIREABLE(ti_0_1v_1_0) OR FIREABLE(ti_0_0v_0_2)) AND NOT FIREABLE(ti_1_1v_1_2))))
lola: processed formula length: 225
lola: 7 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(to_0_2v_1_1) AND (FIREABLE(to_1_2v_2_1) OR FIREABLE(ti_0_2v_1_0)) AND FIREABLE(to_1_0v_2_0) AND FIREABLE(ti_1_0v_1_2) AND (FIREABLE(ti_0_1v_1_0) OR FIREABLE(ti_0_0v_0_2)) AND NOT FIREABLE(ti_1_1v_1_2))
lola: state equation task get result unparse finished id 0
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(to_0_0v_0_1) OR NOT FIREABLE(ti_0_2v_2_1) OR (NOT FIREABLE(ti_0_1v_1_1) AND NOT FIREABLE(to_0_1v_0_2)) OR (FIREABLE(to_1_0v_2_0) AND FIREABLE(ti_1_0v_2_1) AND FIREABLE(to_1_0v_2_1) AND FIREABLE(to_0_2v_1_0)) OR FIREABLE(ti_1_2v_2_1))))
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(to_0_0v_0_1) OR NOT FIREABLE(ti_0_2v_2_1) OR (NOT FIREABLE(ti_0_1v_1_1) AND NOT FIREABLE(to_0_1v_0_2)) OR (FIREABLE(to_1_0v_2_0) AND FIREABLE(ti_1_0v_2_1) AND FIREABLE(to_1_0v_2_1) AND FIREABLE(to_0_2v_1_0)) OR FIREABLE(ti_1_2v_2_1))))
lola: processed formula length: 259
lola: 8 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(to_0_0v_0_1) AND FIREABLE(ti_0_2v_2_1) AND (FIREABLE(ti_0_1v_1_1) OR FIREABLE(to_0_1v_0_2)) AND (NOT FIREABLE(to_1_0v_2_0) OR NOT FIREABLE(ti_1_0v_2_1) OR NOT FIREABLE(to_1_0v_2_1) OR NOT FIREABLE(to_0_2v_1_0)) AND NOT FIREABLE(ti_1_2v_2_1))
lola: state equation task get result unparse finished id 0
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(to_1_1v_2_1) AND FIREABLE(ti_1_1v_1_2) AND NOT FIREABLE(to_0_0v_2_0)) OR FIREABLE(ti_0_2v_1_0) OR ((FIREABLE(to_0_0v_1_2) OR FIREABLE(to_1_0v_2_0) OR FIREABLE(ti_0_2v_1_2)) AND (FIREABLE(ti_1_1v_2_0) OR FIREABLE(to_1_2v_2_2) OR FIREABLE(to_2_0v_2_1))))))
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(to_1_1v_2_1) AND FIREABLE(ti_1_1v_1_2) AND NOT FIREABLE(to_0_0v_2_0)) OR FIREABLE(ti_0_2v_1_0) OR ((FIREABLE(to_0_0v_1_2) OR FIREABLE(to_1_0v_2_0) OR FIREABLE(ti_0_2v_1_2)) AND (FIREABLE(ti_1_1v_2_0) OR FIREABLE(to_1_2v_2_2) OR FIREABLE(to_2_0v_2_1))))))
lola: processed formula length: 277
lola: 8 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: The predicate is not invariant.
lola: formula 0: ((NOT FIREABLE(to_1_1v_2_1) OR NOT FIREABLE(ti_1_1v_1_2) OR FIREABLE(to_0_0v_2_0)) AND NOT FIREABLE(ti_0_2v_1_0) AND ((NOT FIREABLE(to_0_0v_1_2) AND NOT FIREABLE(to_1_0v_2_0) AND NOT FIREABLE(ti_0_2v_1_2)) OR (NOT FIREABLE(ti_1_1v_2_0) AND NOT FIREABLE(to_1_2v_2_2) AND NOT FIREABLE(to_2_0v_2_1))))
lola: 6 markings, 5 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 25 literals and 5 conjunctive subformulas
lola: ========================================
lola: subprocess 15 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(to_0_0v_1_2) OR FIREABLE(to_1_0v_2_0) OR FIREABLE(ti_0_1v_2_1) OR FIREABLE(ti_0_0v_1_1) OR ((FIREABLE(ti_1_0v_1_1) OR FIREABLE(to_1_1v_1_2)) AND NOT FIREABLE(ti_0_2v_2_0)) OR (FIREABLE(to_0_1v_0_2) AND FIREABLE(ti_0_0v_2_0) AND (NOT FIREABLE(to_0_1v_2_2) OR NOT FIREABLE(ti_0_0v_2_1))))))
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(to_0_0v_1_2) OR FIREABLE(to_1_0v_2_0) OR FIREABLE(ti_0_1v_2_1) OR FIREABLE(ti_0_0v_1_1) OR ((FIREABLE(ti_1_0v_1_1) OR FIREABLE(to_1_1v_1_2)) AND NOT FIREABLE(ti_0_2v_2_0)) OR (FIREABLE(to_0_1v_0_2) AND FIREABLE(ti_0_0v_2_0) AND (NOT FIREABLE(to_0_1v_2_2) OR NOT FIREABLE(ti_0_0v_2_1))))))
lola: processed formula length: 311
lola: 8 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: The predicate is not invariant.
lola: formula 0: (NOT FIREABLE(to_0_0v_1_2) AND NOT FIREABLE(to_1_0v_2_0) AND NOT FIREABLE(ti_0_1v_2_1) AND NOT FIREABLE(ti_0_0v_1_1) AND ((NOT FIREABLE(ti_1_0v_1_1) AND NOT FIREABLE(to_1_1v_1_2)) OR FIREABLE(ti_0_2v_2_0)) AND (NOT FIREABLE(to_0_1v_0_2) OR NOT FIREABLE(ti_0_0v_2_0) OR (FIREABLE(to_0_1v_2_2) AND FIREABLE(ti_0_0v_2_1))))
lola: 9 markings, 8 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 20 literals and 3 conjunctive subformulas
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no no no yes no no no no no yes yes
lola:
preliminary result: no yes no no no no no no yes no no no no no yes yes
lola: memory consumption: 15056 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
BK_STOP 1552772974670
--------------------
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-d2n3m1t12"
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 NeighborGrid-PT-d2n3m1t12, 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 r104-oct2-155272225400090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NeighborGrid-PT-d2n3m1t12.tgz
mv NeighborGrid-PT-d2n3m1t12 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 '
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 ;