About the Execution of LoLA for FlexibleBarrier-PT-14b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4303.440 | 561678.00 | 1145552.00 | 69.80 | FFFTFFFFTTFTTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2019-input.r082-csrt-155246549100234.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is FlexibleBarrier-PT-14b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-csrt-155246549100234
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 3.9K Feb 11 00:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 11 00:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 6 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 6 22:22 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 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.7K Feb 4 23:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 4 23:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K Feb 4 22:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 3 08:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 3 08:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Jan 31 01:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Jan 31 01:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 0 Jan 29 09:34 model-fix.log
-rw-r--r-- 1 mcc users 726K 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 FlexibleBarrier-PT-14b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1552660396583
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ FlexibleBarrier-PT-14b @ 3570 seconds
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3008
rslt: Output for ReachabilityFireability @ FlexibleBarrier-PT-14b
{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Mar 15 14:33:16 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(t1850)))",
"processed_size": 23,
"rewrites": 1
},
"result":
{
"edges": 11,
"markings": 12,
"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(t2548)))",
"processed_size": 23,
"rewrites": 1
},
"result":
{
"edges": 67,
"markings": 68,
"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": 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(t2616)))",
"processed_size": 23,
"rewrites": 1
},
"result":
{
"edges": 76,
"markings": 77,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 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": 2,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (G ((NOT FIREABLE(t1722) AND NOT FIREABLE(t192))))",
"processed_size": 52,
"rewrites": 2
},
"result":
{
"edges": 16,
"markings": 17,
"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": 2,
"problems": 2
},
"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": 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": 2,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (G ((NOT FIREABLE(t1535) AND NOT FIREABLE(t1450))))",
"processed_size": 53,
"rewrites": 2
},
"result":
{
"edges": 24,
"markings": 25,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"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": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "E (F ((FIREABLE(t519) AND FIREABLE(t675) AND FIREABLE(t2347))))",
"processed_size": 63,
"rewrites": 1
},
"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": 3,
"problems": 3
},
"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": 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": "E (F (((NOT FIREABLE(t2921) OR FIREABLE(t2531)) AND FIREABLE(t2123))))",
"processed_size": 71,
"rewrites": 1
},
"result":
{
"edges": 165,
"markings": 166,
"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": 8,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 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": "E (F ((FIREABLE(t125) AND FIREABLE(t2802) AND FIREABLE(t469))))",
"processed_size": 63,
"rewrites": 1
},
"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": 5,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 444
},
"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": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "A (G (((NOT FIREABLE(t1507) OR NOT FIREABLE(t961) OR NOT FIREABLE(t2347)) AND NOT FIREABLE(t872))))",
"processed_size": 101,
"rewrites": 2
},
"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": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 506
},
"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": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "E (F (((FIREABLE(t1230) OR FIREABLE(t1850)) AND (FIREABLE(t1132) OR FIREABLE(t141)))))",
"processed_size": 88,
"rewrites": 1
},
"result":
{
"edges": 16,
"markings": 17,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 590
},
"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": 4,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "E (F ((NOT FIREABLE(t2231) AND NOT FIREABLE(t693) AND FIREABLE(t2787) AND FIREABLE(t2308))))",
"processed_size": 92,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 708
},
"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": 4,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "A (G ((NOT FIREABLE(t831) OR NOT FIREABLE(t930) OR FIREABLE(t30) OR FIREABLE(t2543))))",
"processed_size": 89,
"rewrites": 2
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 841
},
"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": 5,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "E (F ((FIREABLE(t1381) OR (FIREABLE(t791) AND FIREABLE(t3060)) OR FIREABLE(t2968) OR FIREABLE(t251))))",
"processed_size": 105,
"rewrites": 1
},
"result":
{
"edges": 77,
"markings": 78,
"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"
},
"stateequation":
{
"literals": 7,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1122
},
"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": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 7,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "A (G (((NOT FIREABLE(t2811) AND NOT FIREABLE(t2371)) OR NOT FIREABLE(t2202) OR (NOT FIREABLE(t2482) AND NOT FIREABLE(t685) AND NOT FIREABLE(t2559) AND NOT FIREABLE(t2271)))))",
"processed_size": 176,
"rewrites": 2
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 32,
"problems": 8
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1504
},
"exit": null,
"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": 8,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 10,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "A (G ((FIREABLE(t2732) OR (FIREABLE(t56) AND FIREABLE(t2637)) OR FIREABLE(t350) OR FIREABLE(t1179) OR (FIREABLE(t1065) AND FIREABLE(t1487)) OR NOT FIREABLE(t2894) OR NOT FIREABLE(t2576) OR FIREABLE(t1035))))",
"processed_size": 214,
"rewrites": 2
},
"result":
{
"edges": 53,
"markings": 54,
"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": 180,
"problems": 18
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3008
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 5,
"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 ((((NOT FIREABLE(t242) OR FIREABLE(t1785)) AND (NOT FIREABLE(t1518) OR FIREABLE(t3084))) OR (FIREABLE(t2687) AND FIREABLE(t1018) AND (FIREABLE(t1790) OR FIREABLE(t447)) AND (NOT FIREABLE(t2900) OR (FIREABLE(t2426) AND FIREABLE(t1151)))))))",
"processed_size": 249,
"rewrites": 2
},
"result":
{
"edges": 51,
"markings": 52,
"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": 50,
"problems": 12
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 56512,
"runtime": 562.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 7733,
"conflict_clusters": 2073,
"places": 2678,
"places_significant": 2662,
"singleton_clusters": 0,
"transitions": 3085
},
"result":
{
"preliminary_value": "no no no yes no no no no yes yes no yes yes yes no no ",
"value": "no no no yes no no no no yes yes no yes yes yes no 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 place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 5763/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2678
lola: finding significant places
lola: 2678 places, 3085 transitions, 2662 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 ((NOT FIREABLE(t1535) AND NOT FIREABLE(t1450)))) : A (G ((((NOT FIREABLE(t242) OR FIREABLE(t1785)) AND (NOT FIREABLE(t1518) OR FIREABLE(t3084))) OR (FIREABLE(t2687) AND FIREABLE(t1018) AND (FIREABLE(t1790) OR FIREABLE(t447)) AND (NOT FIREABLE(t2900) OR (FIREABLE(t2426) AND FIREABLE(t1151))))))) : E (F ((FIREABLE(t125) AND FIREABLE(t2802) AND FIREABLE(t469)))) : E (F (FIREABLE(t1850))) : E (F ((FIREABLE(t519) AND FIREABLE(t675) AND FIREABLE(t2347)))) : A (G (((NOT FIREABLE(t2811) AND NOT FIREABLE(t2371)) OR NOT FIREABLE(t2202) OR (NOT FIREABLE(t2482) AND NOT FIREABLE(t685) AND NOT FIREABLE(t2559) AND NOT FIREABLE(t2271))))) : E (F ((NOT FIREABLE(t2231) AND NOT FIREABLE(t693) AND FIREABLE(t2787) AND FIREABLE(t2308)))) : A (G (((NOT FIREABLE(t1507) OR NOT FIREABLE(t961) OR NOT FIREABLE(t2347)) AND NOT FIREABLE(t872)))) : E (F (((FIREABLE(t1230) OR FIREABLE(t1850)) AND (FIREABLE(t1132) OR FIREABLE(t141))))) : E (F (FIREABLE(t2548))) : A (G ((NOT FIREABLE(t1722) AND NOT FIREABLE(t192)))) : E (F (((NOT FIREABLE(t2921) OR FIREABLE(t2531)) AND FIREABLE(t2123)))) : E (F (FIREABLE(t2616))) : E (F ((FIREABLE(t1381) OR (FIREABLE(t791) AND FIREABLE(t3060)) OR FIREABLE(t2968) OR FIREABLE(t251)))) : A (G ((NOT FIREABLE(t831) OR NOT FIREABLE(t930) OR FIREABLE(t30) OR FIREABLE(t2543)))) : A (G ((FIREABLE(t2732) OR (FIREABLE(t56) AND FIREABLE(t2637)) OR FIREABLE(t350) OR FIREABLE(t1179) OR (FIREABLE(t1065) AND FIREABLE(t1487)) OR NOT FIREABLE(t2894) OR NOT FIREABLE(t2576) OR FIREABLE(t1035))))
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(t1850)))
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(t1850)))
lola: processed formula length: 23
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(t1850)
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: 12 markings, 11 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t2548)))
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(t2548)))
lola: processed formula length: 23
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(t2548)
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: 68 markings, 67 edges
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t2616)))
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(t2616)))
lola: processed formula length: 23
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: ========================================
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(t2616)
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: 77 markings, 76 edges
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1722) AND NOT FIREABLE(t192))))
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(t1722) AND NOT FIREABLE(t192))))
lola: processed formula length: 52
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: ========================================
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(t1722) OR FIREABLE(t192))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1535) AND NOT FIREABLE(t1450))))
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(t1535) AND NOT FIREABLE(t1450))))
lola: processed formula length: 53
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(t1535) OR FIREABLE(t1450))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 25 markings, 24 edges
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t519) AND FIREABLE(t675) AND FIREABLE(t2347))))
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(t519) AND FIREABLE(t675) AND FIREABLE(t2347))))
lola: processed formula length: 63
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(t519) AND FIREABLE(t675) AND FIREABLE(t2347))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-4-0.sara
lola: ========================================
lola: state equation: write sara problem file to ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-5-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: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t2921) OR FIREABLE(t2531)) AND FIREABLE(t2123))))
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(t2921) OR FIREABLE(t2531)) AND FIREABLE(t2123))))
lola: processed formula length: 71
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(t2921) OR FIREABLE(t2531)) AND FIREABLE(t2123))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 166 markings, 165 edges
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t125) AND FIREABLE(t2802) AND FIREABLE(t469))))
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(t125) AND FIREABLE(t2802) AND FIREABLE(t469))))
lola: processed formula length: 63
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(t125) AND FIREABLE(t2802) AND FIREABLE(t469))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: ========================================
lola: state equation: write sara problem file to ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-7-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 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t1507) OR NOT FIREABLE(t961) OR NOT FIREABLE(t2347)) AND NOT FIREABLE(t872))))
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(t1507) OR NOT FIREABLE(t961) OR NOT FIREABLE(t2347)) AND NOT FIREABLE(t872))))
lola: processed formula length: 101
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(t1507) AND FIREABLE(t961) AND FIREABLE(t2347)) OR FIREABLE(t872))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 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: sara is running 0 secs || 47297 markings, 86903 edges, 9459 markings/sec, 0 secs
lola: sara is running 5 secs || 104155 markings, 195347 edges, 11372 markings/sec, 5 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: subprocess 9 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t1230) OR FIREABLE(t1850)) AND (FIREABLE(t1132) OR FIREABLE(t141)))))
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(t1230) OR FIREABLE(t1850)) AND (FIREABLE(t1132) OR FIREABLE(t141)))))
lola: processed formula length: 88
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: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t2231) AND NOT FIREABLE(t693) AND FIREABLE(t2787) AND FIREABLE(t2308))))
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(t2231) AND NOT FIREABLE(t693) AND FIREABLE(t2787) AND FIREABLE(t2308))))
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(t2231) AND NOT FIREABLE(t693) AND FIREABLE(t2787) AND FIREABLE(t2308))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: ========================================
lola: state equation: write sara problem file to ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-10-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 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t831) OR NOT FIREABLE(t930) OR FIREABLE(t30) OR FIREABLE(t2543))))
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(t831) OR NOT FIREABLE(t930) OR FIREABLE(t30) OR FIREABLE(t2543))))
lola: processed formula length: 89
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(t831) AND FIREABLE(t930) AND NOT FIREABLE(t30) AND NOT FIREABLE(t2543))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 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 || 57197 markings, 104727 edges, 11439 markings/sec, 0 secs
lola: sara is running 5 secs || 116081 markings, 225352 edges, 11777 markings/sec, 5 secs
lola: sara is running 10 secs || 159215 markings, 361132 edges, 8627 markings/sec, 10 secs
lola: sara is running 15 secs || 206556 markings, 464984 edges, 9468 markings/sec, 15 secs
lola: sara is running 20 secs || 259449 markings, 561464 edges, 10579 markings/sec, 20 secs
lola: sara is running 25 secs || 306919 markings, 669507 edges, 9494 markings/sec, 25 secs
lola: sara is running 30 secs || 345834 markings, 796600 edges, 7783 markings/sec, 30 secs
lola: sara is running 35 secs || 398992 markings, 902039 edges, 10632 markings/sec, 35 secs
lola: sara is running 40 secs || 459826 markings, 1015853 edges, 12167 markings/sec, 40 secs
lola: sara is running 45 secs || 493646 markings, 1104571 edges, 6764 markings/sec, 45 secs
lola: sara is running 50 secs || 533530 markings, 1231723 edges, 7977 markings/sec, 50 secs
lola: sara is running 55 secs || 585930 markings, 1330187 edges, 10480 markings/sec, 55 secs
lola: sara is running 60 secs || 642024 markings, 1438022 edges, 11219 markings/sec, 60 secs
lola: sara is running 65 secs || 670834 markings, 1512950 edges, 5762 markings/sec, 65 secs
lola: sara is running 70 secs || 712071 markings, 1644270 edges, 8247 markings/sec, 70 secs
lola: sara is running 75 secs || 773701 markings, 1759441 edges, 12326 markings/sec, 75 secs
lola: sara is running 80 secs || 831269 markings, 1878303 edges, 11514 markings/sec, 80 secs
lola: sara is running 85 secs || 872002 markings, 1994630 edges, 8147 markings/sec, 85 secs
lola: sara is running 90 secs || 913783 markings, 2101544 edges, 8356 markings/sec, 90 secs
lola: sara is running 95 secs || 972457 markings, 2209477 edges, 11735 markings/sec, 95 secs
lola: sara is running 100 secs || 1024707 markings, 2328399 edges, 10450 markings/sec, 100 secs
lola: sara is running 105 secs || 1068351 markings, 2466260 edges, 8729 markings/sec, 105 secs
lola: sara is running 110 secs || 1129527 markings, 2581954 edges, 12235 markings/sec, 110 secs
lola: sara is running 115 secs || 1185466 markings, 2695083 edges, 11188 markings/sec, 115 secs
lola: sara is running 120 secs || 1231098 markings, 2828252 edges, 9126 markings/sec, 120 secs
lola: sara is running 125 secs || 1283858 markings, 2950219 edges, 10552 markings/sec, 125 secs
lola: sara is running 130 secs || 1349770 markings, 3072882 edges, 13182 markings/sec, 130 secs
lola: sara is running 135 secs || 1398706 markings, 3204231 edges, 9787 markings/sec, 135 secs
lola: sara is running 140 secs || 1447354 markings, 3335042 edges, 9730 markings/sec, 140 secs
lola: sara is running 145 secs || 1507674 markings, 3446410 edges, 12064 markings/sec, 145 secs
lola: sara is running 150 secs || 1563401 markings, 3573584 edges, 11145 markings/sec, 150 secs
lola: sara is running 155 secs || 1606911 markings, 3710937 edges, 8702 markings/sec, 155 secs
lola: sara is running 160 secs || 1669256 markings, 3827891 edges, 12469 markings/sec, 160 secs
lola: sara is running 165 secs || 1729399 markings, 3953898 edges, 12029 markings/sec, 165 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 841 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1381) OR (FIREABLE(t791) AND FIREABLE(t3060)) OR FIREABLE(t2968) OR FIREABLE(t251))))
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(t1381) OR (FIREABLE(t791) AND FIREABLE(t3060)) OR FIREABLE(t2968) OR FIREABLE(t251))))
lola: processed formula length: 105
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(t1381) OR (FIREABLE(t791) AND FIREABLE(t3060)) OR FIREABLE(t2968) OR FIREABLE(t251))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 78 markings, 77 edges
lola: subprocess 13 will run for 1122 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t2811) AND NOT FIREABLE(t2371)) OR NOT FIREABLE(t2202) OR (NOT FIREABLE(t2482) AND NOT FIREABLE(t685) AND NOT FIREABLE(t2559) AND NOT FIREABLE(t2271)))))
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(t2811) AND NOT FIREABLE(t2371)) OR NOT FIREABLE(t2202) OR (NOT FIREABLE(t2482) AND NOT FIREABLE(t685) AND NOT FIREABLE(t2559) AND NOT FIREABLE(t2271)))))
lola: processed formula length: 176
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(t2811) OR FIREABLE(t2371)) AND FIREABLE(t2202) AND (FIREABLE(t2482) OR FIREABLE(t685) OR FIREABLE(t2559) OR FIREABLE(t2271)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 32 literals and 8 conjunctive subformulas
lola: ========================================
lola: state equation: write sara problem file to ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 59208 markings, 112659 edges, 11842 markings/sec, 0 secs
lola: sara is running 5 secs || 120095 markings, 227970 edges, 12177 markings/sec, 5 secs
lola: sara is running 10 secs || 168616 markings, 350706 edges, 9704 markings/sec, 10 secs
lola: sara is running 15 secs || 213387 markings, 486116 edges, 8954 markings/sec, 15 secs
lola: sara is running 20 secs || 269821 markings, 601779 edges, 11287 markings/sec, 20 secs
lola: sara is running 25 secs || 326799 markings, 716286 edges, 11396 markings/sec, 25 secs
lola: sara is running 30 secs || 375542 markings, 837167 edges, 9749 markings/sec, 30 secs
lola: sara is running 35 secs || 420093 markings, 960818 edges, 8910 markings/sec, 35 secs
lola: sara is running 40 secs || 464669 markings, 1083018 edges, 8915 markings/sec, 40 secs
lola: sara is running 45 secs || 515369 markings, 1192093 edges, 10140 markings/sec, 45 secs
sara: warning, failure of lp_solve (at job 182)
lola: sara is running 50 secs || 564211 markings, 1305744 edges, 9768 markings/sec, 50 secs
lola: sara is running 55 secs || 605495 markings, 1431246 edges, 8257 markings/sec, 55 secs
lola: sara is running 60 secs || 641190 markings, 1553383 edges, 7139 markings/sec, 60 secs
lola: sara is running 65 secs || 699096 markings, 1669556 edges, 11581 markings/sec, 65 secs
lola: sara is running 70 secs || 755863 markings, 1787082 edges, 11353 markings/sec, 70 secs
lola: sara is running 75 secs || 797540 markings, 1908129 edges, 8335 markings/sec, 75 secs
lola: sara is running 80 secs || 850244 markings, 2030561 edges, 10541 markings/sec, 80 secs
lola: sara is running 85 secs || 909238 markings, 2146165 edges, 11799 markings/sec, 85 secs
lola: sara is running 90 secs || 953480 markings, 2264190 edges, 8848 markings/sec, 90 secs
lola: sara is running 95 secs || 1000907 markings, 2399077 edges, 9485 markings/sec, 95 secs
lola: sara is running 100 secs || 1056840 markings, 2513126 edges, 11187 markings/sec, 100 secs
lola: sara is running 105 secs || 1108709 markings, 2627686 edges, 10374 markings/sec, 105 secs
lola: sara is running 110 secs || 1152742 markings, 2743954 edges, 8807 markings/sec, 110 secs
lola: sara is running 115 secs || 1194425 markings, 2871103 edges, 8337 markings/sec, 115 secs
lola: sara is running 120 secs || 1239400 markings, 2967688 edges, 8995 markings/sec, 120 secs
lola: sara is running 125 secs || 1285428 markings, 3073428 edges, 9206 markings/sec, 125 secs
lola: sara is running 130 secs || 1327775 markings, 3199865 edges, 8469 markings/sec, 130 secs
lola: sara is running 135 secs || 1374450 markings, 3334312 edges, 9335 markings/sec, 135 secs
lola: sara is running 140 secs || 1421728 markings, 3423912 edges, 9456 markings/sec, 140 secs
lola: sara is running 145 secs || 1461652 markings, 3521757 edges, 7985 markings/sec, 145 secs
lola: sara is running 150 secs || 1501009 markings, 3653437 edges, 7871 markings/sec, 150 secs
lola: sara is running 155 secs || 1557142 markings, 3767112 edges, 11227 markings/sec, 155 secs
lola: sara is running 160 secs || 1612124 markings, 3885077 edges, 10996 markings/sec, 160 secs
lola: sara is running 165 secs || 1656348 markings, 4002002 edges, 8845 markings/sec, 165 secs
lola: sara is running 170 secs || 1697506 markings, 4131275 edges, 8232 markings/sec, 170 secs
lola: sara is running 175 secs || 1745736 markings, 4233646 edges, 9646 markings/sec, 175 secs
lola: sara is running 180 secs || 1789832 markings, 4344815 edges, 8819 markings/sec, 180 secs
lola: sara is running 185 secs || 1829293 markings, 4471280 edges, 7892 markings/sec, 185 secs
lola: sara is running 190 secs || 1881277 markings, 4595065 edges, 10397 markings/sec, 190 secs
lola: sara is running 195 secs || 1938053 markings, 4710891 edges, 11355 markings/sec, 195 secs
lola: sara is running 200 secs || 1984460 markings, 4834141 edges, 9281 markings/sec, 200 secs
lola: sara is running 205 secs || 2035474 markings, 4961782 edges, 10203 markings/sec, 205 secs
lola: sara is running 210 secs || 2093266 markings, 5076834 edges, 11558 markings/sec, 210 secs
lola: sara is running 215 secs || 2138782 markings, 5200534 edges, 9103 markings/sec, 215 secs
lola: sara is running 220 secs || 2188412 markings, 5327050 edges, 9926 markings/sec, 220 secs
lola: sara is running 225 secs || 2245259 markings, 5437422 edges, 11369 markings/sec, 225 secs
lola: sara is running 230 secs || 2292638 markings, 5562006 edges, 9476 markings/sec, 230 secs
lola: sara is running 235 secs || 2336851 markings, 5683688 edges, 8843 markings/sec, 235 secs
lola: sara is running 240 secs || 2385344 markings, 5776018 edges, 9699 markings/sec, 240 secs
lola: sara is running 245 secs || 2437303 markings, 5892822 edges, 10392 markings/sec, 245 secs
lola: sara is running 250 secs || 2478169 markings, 6025853 edges, 8173 markings/sec, 250 secs
lola: sara is running 255 secs || 2537618 markings, 6140277 edges, 11890 markings/sec, 255 secs
lola: sara is running 260 secs || 2590146 markings, 6258297 edges, 10506 markings/sec, 260 secs
lola: sara is running 265 secs || 2631241 markings, 6386753 edges, 8219 markings/sec, 265 secs
lola: sara is running 270 secs || 2687817 markings, 6501100 edges, 11315 markings/sec, 270 secs
lola: sara is running 275 secs || 2740207 markings, 6616657 edges, 10478 markings/sec, 275 secs
lola: sara is running 280 secs || 2784047 markings, 6744915 edges, 8768 markings/sec, 280 secs
lola: sara is running 285 secs || 2841380 markings, 6868260 edges, 11467 markings/sec, 285 secs
lola: sara is running 290 secs || 2893474 markings, 6983203 edges, 10419 markings/sec, 290 secs
lola: sara is running 295 secs || 2933851 markings, 7097849 edges, 8075 markings/sec, 295 secs
lola: sara is running 300 secs || 2987808 markings, 7221832 edges, 10791 markings/sec, 300 secs
lola: sara is running 305 secs || 3039692 markings, 7331965 edges, 10377 markings/sec, 305 secs
lola: sara is running 310 secs || 3083465 markings, 7452825 edges, 8755 markings/sec, 310 secs
lola: sara is running 315 secs || 3136596 markings, 7580009 edges, 10626 markings/sec, 315 secs
lola: sara is running 320 secs || 3192008 markings, 7695830 edges, 11082 markings/sec, 320 secs
lola: sara is running 325 secs || 3236235 markings, 7817640 edges, 8845 markings/sec, 325 secs
lola: sara is running 330 secs || 3285396 markings, 7938766 edges, 9832 markings/sec, 330 secs
lola: sara is running 335 secs || 3340926 markings, 8051554 edges, 11106 markings/sec, 335 secs
lola: sara is running 340 secs || 3385378 markings, 8171710 edges, 8890 markings/sec, 340 secs
lola: sara is running 345 secs || 3434294 markings, 8296240 edges, 9783 markings/sec, 345 secs
lola: sara is running 350 secs || 3490332 markings, 8407999 edges, 11208 markings/sec, 350 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t2732) OR (FIREABLE(t56) AND FIREABLE(t2637)) OR FIREABLE(t350) OR FIREABLE(t1179) OR (FIREABLE(t1065) AND FIREABLE(t1487)) OR NOT FIREABLE(t2894) OR NOT FIREABLE(t2576) OR FIREABLE(t1035))))
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(t2732) OR (FIREABLE(t56) AND FIREABLE(t2637)) OR FIREABLE(t350) OR FIREABLE(t1179) OR (FIREABLE(t1065) AND FIREABLE(t1487)) OR NOT FIREABLE(t2894) OR NOT FIREABLE(t2576) OR FIREABLE(t1035))))
lola: processed formula length: 214
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(t2732) AND (NOT FIREABLE(t56) OR NOT FIREABLE(t2637)) AND NOT FIREABLE(t350) AND NOT FIREABLE(t1179) AND (NOT FIREABLE(t1065) OR NOT FIREABLE(t1487)) AND FIREABLE(t2894) AND FIREABLE(t2576) AND NOT FIREABLE(t1035))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 180 literals and 18 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 54 markings, 53 edges
lola: ========================================
lola: subprocess 15 will run for 3008 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(t242) OR FIREABLE(t1785)) AND (NOT FIREABLE(t1518) OR FIREABLE(t3084))) OR (FIREABLE(t2687) AND FIREABLE(t1018) AND (FIREABLE(t1790) OR FIREABLE(t447)) AND (NOT FIREABLE(t2900) OR (FIREABLE(t2426) AND FIREABLE(t1151)))))))
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(t242) OR FIREABLE(t1785)) AND (NOT FIREABLE(t1518) OR FIREABLE(t3084))) OR (FIREABLE(t2687) AND FIREABLE(t1018) AND (FIREABLE(t1790) OR FIREABLE(t447)) AND (NOT FIREABLE(t2900) OR (FIREABLE(t2426) AND FIREABLE(t1151)))))))
lola: processed formula length: 249
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(t242) AND NOT FIREABLE(t1785)) OR (FIREABLE(t1518) AND NOT FIREABLE(t3084))) AND (NOT FIREABLE(t2687) OR NOT FIREABLE(t1018) OR (NOT FIREABLE(t1790) AND NOT FIREABLE(t447)) OR (FIREABLE(t2900) AND (NOT FIREABLE(t2426) OR NOT FIREABLE(t1151)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 50 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 52 markings, 51 edges
lola: RESULT
lola:
SUMMARY: no no no yes no no no no yes yes no yes yes yes no no
lola:
preliminary result: no no no yes no no no no yes yes no yes yes yes no no
lola: ========================================
lola: memory consumption: 56512 KB
lola: time consumption: 562 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
BK_STOP 1552660958261
--------------------
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="FlexibleBarrier-PT-14b"
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 FlexibleBarrier-PT-14b, 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 r082-csrt-155246549100234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-14b.tgz
mv FlexibleBarrier-PT-14b 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 ;