About the Execution of LoLA for PhaseVariation-PT-D10CS100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4281.600 | 28750.00 | 8300.00 | 12.10 | TFFFTFFTFTTFTTTF | 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-155272226200630.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 PhaseVariation-PT-D10CS100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r104-oct2-155272226200630
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 4.1K Feb 12 04:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 12 04:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Feb 8 03:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 8 03:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 113 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 351 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.8K Feb 5 00:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 00:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 4 08:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 4 08:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 1 02:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 1 02:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 9 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 2.9M 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 PhaseVariation-PT-D10CS100-ReachabilityFireability-00
FORMULA_NAME PhaseVariation-PT-D10CS100-ReachabilityFireability-01
FORMULA_NAME PhaseVariation-PT-D10CS100-ReachabilityFireability-02
FORMULA_NAME PhaseVariation-PT-D10CS100-ReachabilityFireability-03
FORMULA_NAME PhaseVariation-PT-D10CS100-ReachabilityFireability-04
FORMULA_NAME PhaseVariation-PT-D10CS100-ReachabilityFireability-05
FORMULA_NAME PhaseVariation-PT-D10CS100-ReachabilityFireability-06
FORMULA_NAME PhaseVariation-PT-D10CS100-ReachabilityFireability-07
FORMULA_NAME PhaseVariation-PT-D10CS100-ReachabilityFireability-08
FORMULA_NAME PhaseVariation-PT-D10CS100-ReachabilityFireability-09
FORMULA_NAME PhaseVariation-PT-D10CS100-ReachabilityFireability-10
FORMULA_NAME PhaseVariation-PT-D10CS100-ReachabilityFireability-11
FORMULA_NAME PhaseVariation-PT-D10CS100-ReachabilityFireability-12
FORMULA_NAME PhaseVariation-PT-D10CS100-ReachabilityFireability-13
FORMULA_NAME PhaseVariation-PT-D10CS100-ReachabilityFireability-14
FORMULA_NAME PhaseVariation-PT-D10CS100-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1552811246868
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ PhaseVariation-PT-D10CS100 @ 3570 seconds
FORMULA PhaseVariation-PT-D10CS100-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PhaseVariation-PT-D10CS100-ReachabilityFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PhaseVariation-PT-D10CS100-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PhaseVariation-PT-D10CS100-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PhaseVariation-PT-D10CS100-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PhaseVariation-PT-D10CS100-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PhaseVariation-PT-D10CS100-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PhaseVariation-PT-D10CS100-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PhaseVariation-PT-D10CS100-ReachabilityFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PhaseVariation-PT-D10CS100-ReachabilityFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PhaseVariation-PT-D10CS100-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PhaseVariation-PT-D10CS100-ReachabilityFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PhaseVariation-PT-D10CS100-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PhaseVariation-PT-D10CS100-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PhaseVariation-PT-D10CS100-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PhaseVariation-PT-D10CS100-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3541
rslt: Output for ReachabilityFireability @ PhaseVariation-PT-D10CS100
{
"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": "Sun Mar 17 08:27:26 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(division2_mutate_5_1_A_4_1)))",
"processed_size": 44,
"rewrites": 1
},
"result":
{
"edges": 4,
"markings": 5,
"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": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": 1,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (G (NOT FIREABLE(division2_replicate_2_7_A_1_6)))",
"processed_size": 51,
"rewrites": 2
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"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(division2_replicate_2_2_B_2_1)))",
"processed_size": 47,
"rewrites": 1
},
"result":
{
"edges": 4,
"markings": 5,
"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": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": 1,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (G (NOT FIREABLE(division2_mutate_2_10_A_1_9)))",
"processed_size": 49,
"rewrites": 2
},
"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"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": 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(division2_replicate_10_8_B_10_9) OR NOT FIREABLE(division2_mutate_7_8_B_6_7))))",
"processed_size": 100,
"rewrites": 2
},
"result":
{
"edges": 6,
"markings": 7,
"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"
},
"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": 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 ((FIREABLE(division2_mutate_2_1_B_3_2) AND FIREABLE(division2_replicate_3_3_B_3_4) AND NOT FIREABLE(division2_mutate_9_2_B_8_3))))",
"processed_size": 135,
"rewrites": 1
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 14,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 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(division1_mutate_2_1_A) OR FIREABLE(division2_replicate_9_6_A_10_6) OR FIREABLE(division2_mutate_8_3_B_9_2))))",
"processed_size": 128,
"rewrites": 1
},
"result":
{
"edges": 4,
"markings": 5,
"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": 9,
"problems": 3
},
"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": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "E (F (((NOT FIREABLE(division2_replicate_3_5_A_4_4) OR NOT FIREABLE(division2_mutate_5_4_A_6_3)) AND NOT FIREABLE(division2_mutate_3_9_A_2_8) AND FIREABLE(division2_mutate_3_10_B_2_10))))",
"processed_size": 188,
"rewrites": 1
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 40,
"problems": 8
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 5,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "A (G ((((NOT FIREABLE(division2_replicate_5_8_B_5_9) AND NOT FIREABLE(stop_constant)) OR (NOT FIREABLE(division1_replicate_2_1_A) AND NOT FIREABLE(division2_mutate_7_7_B_6_6))) AND NOT FIREABLE(division2_replicate_5_9_B_4_9))))",
"processed_size": 228,
"rewrites": 2
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"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": 509
},
"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": 5,
"unfir": 5,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "A (G ((NOT FIREABLE(division2_replicate_7_2_A_8_3) AND NOT FIREABLE(division2_replicate_2_6_B_2_5) AND (NOT FIREABLE(division2_replicate_8_3_B_9_3) OR NOT FIREABLE(division2_mutate_8_6_B_8_7)) AND NOT FIREABLE(division2_replicate_1_3_B_1_4))))",
"processed_size": 244,
"rewrites": 2
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 15,
"problems": 4
},
"type": "invariance",
"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": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "A (G ((NOT FIREABLE(division2_mutate_9_8_B_10_7) OR NOT FIREABLE(division2_replicate_6_1_B_7_1) OR (NOT FIREABLE(division2_mutate_2_4_B_3_4) AND FIREABLE(division2_replicate_9_1_B_10_1)) OR NOT FIREABLE(division2_replicate_7_8_B_8_7))))",
"processed_size": 239,
"rewrites": 2
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"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": "A (G ((((NOT FIREABLE(division2_replicate_4_1_B_4_2) OR (FIREABLE(division2_mutate_2_9_B_3_10) AND FIREABLE(division2_mutate_3_8_A_3_9))) AND (NOT FIREABLE(division2_replicate_7_5_B_7_6) OR NOT FIREABLE(division2_mutate_5_10_A_4_9))) OR NOT FIREABLE(division2_mutate_1_10_A_1_9))))",
"processed_size": 284,
"rewrites": 2
},
"result":
{
"edges": 9,
"markings": 10,
"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"
},
"stateequation":
{
"literals": 37,
"problems": 5
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": 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": "A (G ((NOT FIREABLE(division2_replicate_9_5_B_8_5) OR NOT FIREABLE(division2_replicate_9_6_A_9_7) OR FIREABLE(division2_mutate_2_6_B_3_5) OR (NOT FIREABLE(division2_replicate_9_2_A_8_1) AND NOT FIREABLE(division2_replicate_9_5_B_10_6) AND NOT FIREABLE(division2_mutate_2_9_A_1_8)))))",
"processed_size": 286,
"rewrites": 2
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 60,
"problems": 6
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"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": 8,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 9,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 9
},
"processed": "E (F ((FIREABLE(division2_mutate_4_8_B_5_9) AND FIREABLE(division2_replicate_2_7_A_3_6) AND NOT FIREABLE(division2_mutate_3_2_B_3_3) AND (FIREABLE(division2_mutate_9_4_B_8_5) OR FIREABLE(division2_replicate_8_5_A_7_6)) AND (FIREABLE(division2_replicate_5_6_B_5_7) OR FIREABLE(division1_mutate_7_7_B) OR FIREABLE(division2_mutate_2_4_B_3_4) OR FIREABLE(division2_mutate_2_1_B_2_2)))))",
"processed_size": 387,
"rewrites": 1
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"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": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"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": "E (F ((NOT FIREABLE(division2_mutate_2_6_A_3_6) AND NOT FIREABLE(division2_mutate_1_7_B_2_6) AND (NOT FIREABLE(division2_replicate_9_9_A_10_10) OR NOT FIREABLE(division2_mutate_8_2_A_9_1)) AND FIREABLE(division2_mutate_10_6_B_10_7) AND (FIREABLE(division2_replicate_7_9_B_7_8) OR FIREABLE(division2_mutate_1_2_A_1_3) OR (FIREABLE(division2_replicate_2_7_B_3_7) AND FIREABLE(division2_mutate_2_9_A_1_9))))))",
"processed_size": 409,
"rewrites": 1
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 480,
"problems": 48
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"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": 9,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 9,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 9
},
"processed": "E (F ((FIREABLE(division2_replicate_9_9_A_8_10) OR FIREABLE(division2_mutate_6_2_A_5_1) OR (FIREABLE(division2_mutate_6_10_A_6_9) AND FIREABLE(division2_mutate_7_3_B_6_2)) OR (FIREABLE(division2_replicate_2_7_B_2_6) AND FIREABLE(division2_replicate_3_4_A_4_4) AND FIREABLE(division2_mutate_1_8_A_2_7)) OR (FIREABLE(division2_replicate_1_2_A_2_3) AND FIREABLE(division2_replicate_8_4_B_7_5)))))",
"processed_size": 397,
"rewrites": 1
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 27,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 38820,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 21755,
"conflict_clusters": 1,
"places": 302,
"places_significant": 201,
"singleton_clusters": 0,
"transitions": 3137
},
"result":
{
"preliminary_value": "yes no no no yes no no yes no yes yes no yes yes yes no ",
"value": "yes no no no yes no no yes no yes yes no yes yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 3439/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 9664
lola: finding significant places
lola: 302 places, 3137 transitions, 201 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: E (F (FIREABLE(division2_mutate_5_1_A_4_1))) : A (G ((NOT FIREABLE(division2_replicate_7_2_A_8_3) AND NOT FIREABLE(division2_replicate_2_6_B_2_5) AND (NOT FIREABLE(division2_replicate_8_3_B_9_3) OR NOT FIREABLE(division2_mutate_8_6_B_8_7)) AND NOT FIREABLE(division2_replicate_1_3_B_1_4)))) : A (G ((((NOT FIREABLE(division2_replicate_5_8_B_5_9) AND NOT FIREABLE(stop_constant)) OR (NOT FIREABLE(division1_replicate_2_1_A) AND NOT FIREABLE(division2_mutate_7_7_B_6_6))) AND NOT FIREABLE(division2_replicate_5_9_B_4_9)))) : A (G (NOT FIREABLE(division2_replicate_2_7_A_1_6))) : E (F ((NOT FIREABLE(division2_mutate_2_6_A_3_6) AND NOT FIREABLE(division2_mutate_1_7_B_2_6) AND (NOT FIREABLE(division2_replicate_9_9_A_10_10) OR NOT FIREABLE(division2_mutate_8_2_A_9_1)) AND FIREABLE(division2_mutate_10_6_B_10_7) AND (FIREABLE(division2_replicate_7_9_B_7_8) OR FIREABLE(division2_mutate_1_2_A_1_3) OR (FIREABLE(division2_replicate_2_7_B_3_7) AND FIREABLE(division2_mutate_2_9_A_1_9)))))) : A (G ((NOT FIREABLE(division2_mutate_9_8_B_10_7) OR NOT FIREABLE(division2_replicate_6_1_B_7_1) OR (NOT FIREABLE(division2_mutate_2_4_B_3_4) AND FIREABLE(division2_replicate_9_1_B_10_1)) OR NOT FIREABLE(division2_replicate_7_8_B_8_7)))) : A (G ((((NOT FIREABLE(division2_replicate_4_1_B_4_2) OR (FIREABLE(division2_mutate_2_9_B_3_10) AND FIREABLE(division2_mutate_3_8_A_3_9))) AND (NOT FIREABLE(division2_replicate_7_5_B_7_6) OR NOT FIREABLE(division2_mutate_5_10_A_4_9))) OR NOT FIREABLE(division2_mutate_1_10_A_1_9)))) : E (F ((FIREABLE(division2_mutate_2_1_B_3_2) AND FIREABLE(division2_replicate_3_3_B_3_4) AND NOT FIREABLE(division2_mutate_9_2_B_8_3)))) : A (G ((NOT FIREABLE(division2_replicate_10_8_B_10_9) OR NOT FIREABLE(division2_mutate_7_8_B_6_7)))) : E (F (((NOT FIREABLE(division2_replicate_3_5_A_4_4) OR NOT FIREABLE(division2_mutate_5_4_A_6_3)) AND NOT FIREABLE(division2_mutate_3_9_A_2_8) AND FIREABLE(division2_mutate_3_10_B_2_10)))) : E (F ((FIREABLE(division1_mutate_2_1_A) OR FIREABLE(division2_replicate_9_6_A_10_6) OR FIREABLE(division2_mutate_8_3_B_9_2)))) : A (G ((NOT FIREABLE(division2_replicate_9_5_B_8_5) OR NOT FIREABLE(division2_replicate_9_6_A_9_7) OR FIREABLE(division2_mutate_2_6_B_3_5) OR (NOT FIREABLE(division2_replicate_9_2_A_8_1) AND NOT FIREABLE(division2_replicate_9_5_B_10_6) AND NOT FIREABLE(division2_mutate_2_9_A_1_8))))) : E (F ((FIREABLE(division2_replicate_9_9_A_8_10) OR FIREABLE(division2_mutate_6_2_A_5_1) OR (FIREABLE(division2_mutate_6_10_A_6_9) AND FIREABLE(division2_mutate_7_3_B_6_2)) OR (FIREABLE(division2_replicate_2_7_B_2_6) AND FIREABLE(division2_replicate_3_4_A_4_4) AND FIREABLE(division2_mutate_1_8_A_2_7)) OR (FIREABLE(division2_replicate_1_2_A_2_3) AND FIREABLE(division2_replicate_8_4_B_7_5))))) : E (F ((FIREABLE(division2_mutate_4_8_B_5_9) AND FIREABLE(division2_replicate_2_7_A_3_6) AND NOT FIREABLE(division2_mutate_3_2_B_3_3) AND (FIREABLE(division2_mutate_9_4_B_8_5) OR FIREABLE(division2_replicate_8_5_A_7_6)) AND (FIREABLE(division2_replicate_5_6_B_5_7) OR FIREABLE(division1_mutate_7_7_B) OR FIREABLE(division2_mutate_2_4_B_3_4) OR FIREABLE(division2_mutate_2_1_B_2_2))))) : E (F (FIREABLE(division2_replicate_2_2_B_2_1))) : A (G (NOT FIREABLE(division2_mutate_2_10_A_1_9)))
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(division2_mutate_5_1_A_4_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(division2_mutate_5_1_A_4_1)))
lola: processed formula length: 44
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(division2_mutate_5_1_A_4_1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(division2_replicate_2_7_A_1_6)))
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(division2_replicate_2_7_A_1_6)))
lola: processed formula length: 51
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(division2_replicate_2_7_A_1_6)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_replicate_2_2_B_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(division2_replicate_2_2_B_2_1)))
lola: processed formula length: 47
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(division2_replicate_2_2_B_2_1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(division2_mutate_2_10_A_1_9)))
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(division2_mutate_2_10_A_1_9)))
lola: processed formula length: 49
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(division2_replicate_10_8_B_10_9) OR NOT FIREABLE(division2_mutate_7_8_B_6_7))))
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(division2_replicate_10_8_B_10_9) OR NOT FIREABLE(division2_mutate_7_8_B_6_7))))
lola: processed formula length: 100
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division2_mutate_2_1_B_3_2) AND FIREABLE(division2_replicate_3_3_B_3_4) AND NOT FIREABLE(division2_mutate_9_2_B_8_3))))
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(division2_mutate_2_1_B_3_2) AND FIREABLE(division2_replicate_3_3_B_3_4) AND NOT FIREABLE(division2_mutate_9_2_B_8_3))))
lola: processed formula length: 135
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(division2_mutate_2_1_B_3_2) AND FIREABLE(division2_replicate_3_3_B_3_4) AND NOT FIREABLE(division2_mutate_9_2_B_8_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 14 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division1_mutate_2_1_A) OR FIREABLE(division2_replicate_9_6_A_10_6) OR FIREABLE(division2_mutate_8_3_B_9_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 ((FIREABLE(division1_mutate_2_1_A) OR FIREABLE(division2_replicate_9_6_A_10_6) OR FIREABLE(division2_mutate_8_3_B_9_2))))
lola: processed formula length: 128
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(division1_mutate_2_1_A) OR FIREABLE(division2_replicate_9_6_A_10_6) OR FIREABLE(division2_mutate_8_3_B_9_2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(division2_replicate_3_5_A_4_4) OR NOT FIREABLE(division2_mutate_5_4_A_6_3)) AND NOT FIREABLE(division2_mutate_3_9_A_2_8) AND FIREABLE(division2_mutate_3_10_B_2_10))))
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(division2_replicate_3_5_A_4_4) OR NOT FIREABLE(division2_mutate_5_4_A_6_3)) AND NOT FIREABLE(division2_mutate_3_9_A_2_8) AND FIREABLE(division2_mutate_3_10_B_2_10))))
lola: processed formula length: 188
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(division2_replicate_3_5_A_4_4) OR NOT FIREABLE(division2_mutate_5_4_A_6_3)) AND NOT FIREABLE(division2_mutate_3_9_A_2_8) AND FIREABLE(division2_mutate_3_10_B_2_10))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 40 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(division2_replicate_5_8_B_5_9) AND NOT FIREABLE(stop_constant)) OR (NOT FIREABLE(division1_replicate_2_1_A) AND NOT FIREABLE(division2_mutate_7_7_B_6_6))) AND NOT FIREABLE(division2_replicate_5_9_B_4_9))))
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(division2_replicate_5_8_B_5_9) AND NOT FIREABLE(stop_constant)) OR (NOT FIREABLE(division1_replicate_2_1_A) AND NOT FIREABLE(division2_mutate_7_7_B_6_6))) AND NOT FIREABLE(division2_replicate_5_9_B_4_9))))
lola: processed formula length: 228
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: ========================================
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(division2_replicate_5_8_B_5_9) OR FIREABLE(stop_constant)) AND (FIREABLE(division1_replicate_2_1_A) OR FIREABLE(division2_mutate_7_7_B_6_6))) OR FIREABLE(division2_replicate_5_9_B_4_9))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 25 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(division2_replicate_7_2_A_8_3) AND NOT FIREABLE(division2_replicate_2_6_B_2_5) AND (NOT FIREABLE(division2_replicate_8_3_B_9_3) OR NOT FIREABLE(division2_mutate_8_6_B_8_7)) AND NOT FIREABLE(division2_replicate_1_3_B_1_4))))
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(division2_replicate_7_2_A_8_3) AND NOT FIREABLE(division2_replicate_2_6_B_2_5) AND (NOT FIREABLE(division2_replicate_8_3_B_9_3) OR NOT FIREABLE(division2_mutate_8_6_B_8_7)) AND NOT FIREABLE(division2_replicate_1_3_B_1_4))))
lola: processed formula length: 244
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(division2_replicate_7_2_A_8_3) OR FIREABLE(division2_replicate_2_6_B_2_5) OR (FIREABLE(division2_replicate_8_3_B_9_3) AND FIREABLE(division2_mutate_8_6_B_8_7)) OR FIREABLE(division2_replicate_1_3_B_1_4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 15 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
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(division2_mutate_9_8_B_10_7) OR NOT FIREABLE(division2_replicate_6_1_B_7_1) OR (NOT FIREABLE(division2_mutate_2_4_B_3_4) AND FIREABLE(division2_replicate_9_1_B_10_1)) OR NOT FIREABLE(division2_replicate_7_8_B_8_7))))
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(division2_mutate_9_8_B_10_7) OR NOT FIREABLE(division2_replicate_6_1_B_7_1) OR (NOT FIREABLE(division2_mutate_2_4_B_3_4) AND FIREABLE(division2_replicate_9_1_B_10_1)) OR NOT FIREABLE(division2_replicate_7_8_B_8_7))))
lola: processed formula length: 239
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: SUBRESULT
lola: result: no
lola: produced by: state space
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: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(division2_mutate_9_8_B_10_7) AND FIREABLE(division2_replicate_6_1_B_7_1) AND (FIREABLE(division2_mutate_2_4_B_3_4) OR NOT FIREABLE(division2_replicate_9_1_B_10_1)) AND FIREABLE(division2_replicate_7_8_B_8_7))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 32 literals and 3 conjunctive subformulaslola:
lola: ========================================
subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(division2_replicate_4_1_B_4_2) OR (FIREABLE(division2_mutate_2_9_B_3_10) AND FIREABLE(division2_mutate_3_8_A_3_9))) AND (NOT FIREABLE(division2_replicate_7_5_B_7_6) OR NOT FIREABLE(division2_mutate_5_10_A_4_9))) OR NOT FIREABLE(division2_mutate_1_10_A_1_9))))
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(division2_replicate_4_1_B_4_2) OR (FIREABLE(division2_mutate_2_9_B_3_10) AND FIREABLE(division2_mutate_3_8_A_3_9))) AND (NOT FIREABLE(division2_replicate_7_5_B_7_6) OR NOT FIREABLE(division2_mutate_5_10_A_4_9))) OR NOT FIREABLE(division2_mutate_1_10_A_1_9))))
lola: processed formula length: 284
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(division2_replicate_4_1_B_4_2) AND (NOT FIREABLE(division2_mutate_2_9_B_3_10) OR NOT FIREABLE(division2_mutate_3_8_A_3_9))) OR (FIREABLE(division2_replicate_7_5_B_7_6) AND FIREABLE(division2_mutate_5_10_A_4_9))) AND FIREABLE(division2_mutate_1_10_A_1_9))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 37 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(division2_replicate_9_5_B_8_5) OR NOT FIREABLE(division2_replicate_9_6_A_9_7) OR FIREABLE(division2_mutate_2_6_B_3_5) OR (NOT FIREABLE(division2_replicate_9_2_A_8_1) AND NOT FIREABLE(division2_replicate_9_5_B_10_6) AND NOT FIREABLE(division2_mutate_2_9_A_1_8)))))
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(division2_replicate_9_5_B_8_5) OR NOT FIREABLE(division2_replicate_9_6_A_9_7) OR FIREABLE(division2_mutate_2_6_B_3_5) OR (NOT FIREABLE(division2_replicate_9_2_A_8_1) AND NOT FIREABLE(division2_replicate_9_5_B_10_6) AND NOT FIREABLE(division2_mutate_2_9_A_1_8)))))
lola: processed formula length: 286
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(division2_replicate_9_5_B_8_5) AND FIREABLE(division2_replicate_9_6_A_9_7) AND NOT FIREABLE(division2_mutate_2_6_B_3_5) AND (FIREABLE(division2_replicate_9_2_A_8_1) OR FIREABLE(division2_replicate_9_5_B_10_6) OR FIREABLE(division2_mutate_2_9_A_1_8)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 60 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division2_mutate_4_8_B_5_9) AND FIREABLE(division2_replicate_2_7_A_3_6) AND NOT FIREABLE(division2_mutate_3_2_B_3_3) AND (FIREABLE(division2_mutate_9_4_B_8_5) OR FIREABLE(division2_replicate_8_5_A_7_6)) AND (FIREABLE(division2_replicate_5_6_B_5_7) OR FIREABLE(division1_mutate_7_7_B) OR FIREABLE(division2_mutate_2_4_B_3_4) OR FIREABLE(division2_mutate_2_1_B_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 ((FIREABLE(division2_mutate_4_8_B_5_9) AND FIREABLE(division2_replicate_2_7_A_3_6) AND NOT FIREABLE(division2_mutate_3_2_B_3_3) AND (FIREABLE(division2_mutate_9_4_B_8_5) OR FIREABLE(division2_replicate_8_5_A_7_6)) AND (FIREABLE(division2_replicate_5_6_B_5_7) OR FIREABLE(division1_mutate_7_7_B) OR FIREABLE(division2_mutate_2_4_B_3_4) OR FIREABLE(division2_mutate_2_1_B_2_2)))))
lola: processed formula length: 387
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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(division2_mutate_2_6_A_3_6) AND NOT FIREABLE(division2_mutate_1_7_B_2_6) AND (NOT FIREABLE(division2_replicate_9_9_A_10_10) OR NOT FIREABLE(division2_mutate_8_2_A_9_1)) AND FIREABLE(division2_mutate_10_6_B_10_7) AND (FIREABLE(division2_replicate_7_9_B_7_8) OR FIREABLE(division2_mutate_1_2_A_1_3) OR (FIREABLE(division2_replicate_2_7_B_3_7) AND FIREABLE(division2_mutate_2_9_A_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((NOT FIREABLE(division2_mutate_2_6_A_3_6) AND NOT FIREABLE(division2_mutate_1_7_B_2_6) AND (NOT FIREABLE(division2_replicate_9_9_A_10_10) OR NOT FIREABLE(division2_mutate_8_2_A_9_1)) AND FIREABLE(division2_mutate_10_6_B_10_7) AND (FIREABLE(division2_replicate_7_9_B_7_8) OR FIREABLE(division2_mutate_1_2_A_1_3) OR (FIREABLE(division2_replicate_2_7_B_3_7) AND FIREABLE(division2_mutate_2_9_A_... (shortened)
lola: processed formula length: 409
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(division2_mutate_2_6_A_3_6) AND NOT FIREABLE(division2_mutate_1_7_B_2_6) AND (NOT FIREABLE(division2_replicate_9_9_A_10_10) OR NOT FIREABLE(division2_mutate_8_2_A_9_1)) AND FIREABLE(division2_mutate_10_6_B_10_7) AND (FIREABLE(division2_replicate_7_9_B_7_8) OR FIREABLE(division2_mutate_1_2_A_1_3) OR (FIREABLE(division2_replicate_2_7_B_3_7) AND FIREABLE(division2_mutate_2_9_A_1_9))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 480 literals and 48 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division2_replicate_9_9_A_8_10) OR FIREABLE(division2_mutate_6_2_A_5_1) OR (FIREABLE(division2_mutate_6_10_A_6_9) AND FIREABLE(division2_mutate_7_3_B_6_2)) OR (FIREABLE(division2_replicate_2_7_B_2_6) AND FIREABLE(division2_replicate_3_4_A_4_4) AND FIREABLE(division2_mutate_1_8_A_2_7)) OR (FIREABLE(division2_replicate_1_2_A_2_3) AND FIREABLE(division2_replicate_8_4_B_7_5)))))
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(division2_replicate_9_9_A_8_10) OR FIREABLE(division2_mutate_6_2_A_5_1) OR (FIREABLE(division2_mutate_6_10_A_6_9) AND FIREABLE(division2_mutate_7_3_B_6_2)) OR (FIREABLE(division2_replicate_2_7_B_2_6) AND FIREABLE(division2_replicate_3_4_A_4_4) AND FIREABLE(division2_mutate_1_8_A_2_7)) OR (FIREABLE(division2_replicate_1_2_A_2_3) AND FIREABLE(division2_replicate_8_4_B_7_5)))))
lola: processed formula length: 397
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(division2_replicate_9_9_A_8_10) OR FIREABLE(division2_mutate_6_2_A_5_1) OR (FIREABLE(division2_mutate_6_10_A_6_9) AND FIREABLE(division2_mutate_7_3_B_6_2)) OR (FIREABLE(division2_replicate_2_7_B_2_6) AND FIREABLE(division2_replicate_3_4_A_4_4) AND FIREABLE(division2_mutate_1_8_A_2_7)) OR (FIREABLE(division2_replicate_1_2_A_2_3) AND FIREABLE(division2_replicate_8_4_B_7_5)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 27 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes no no yes no yes yes no yes yes yes no
lola:
preliminary result: yes no no no yes no no yes no yes yes no yes yes yes no
lola: memory consumption: 38820 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
BK_STOP 1552811275618
--------------------
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="PhaseVariation-PT-D10CS100"
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 PhaseVariation-PT-D10CS100, 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-155272226200630"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PhaseVariation-PT-D10CS100.tgz
mv PhaseVariation-PT-D10CS100 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 ;