About the Execution of LoLA for Diffusion2D-PT-D20N100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4272.230 | 7325.00 | 8062.00 | 17.50 | FTFTTTTFTTTTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2019-input.r060-ebro-155234654700144.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is Diffusion2D-PT-D20N100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-ebro-155234654700144
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 3.9K Feb 10 21:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 10 21:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 6 17:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 6 17:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K 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.6K Feb 4 23:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K Feb 4 23:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 3 07:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 3 07:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Jan 30 23:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Jan 30 23:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 4 22:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 8 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 Diffusion2D-PT-D20N100-ReachabilityFireability-00
FORMULA_NAME Diffusion2D-PT-D20N100-ReachabilityFireability-01
FORMULA_NAME Diffusion2D-PT-D20N100-ReachabilityFireability-02
FORMULA_NAME Diffusion2D-PT-D20N100-ReachabilityFireability-03
FORMULA_NAME Diffusion2D-PT-D20N100-ReachabilityFireability-04
FORMULA_NAME Diffusion2D-PT-D20N100-ReachabilityFireability-05
FORMULA_NAME Diffusion2D-PT-D20N100-ReachabilityFireability-06
FORMULA_NAME Diffusion2D-PT-D20N100-ReachabilityFireability-07
FORMULA_NAME Diffusion2D-PT-D20N100-ReachabilityFireability-08
FORMULA_NAME Diffusion2D-PT-D20N100-ReachabilityFireability-09
FORMULA_NAME Diffusion2D-PT-D20N100-ReachabilityFireability-10
FORMULA_NAME Diffusion2D-PT-D20N100-ReachabilityFireability-11
FORMULA_NAME Diffusion2D-PT-D20N100-ReachabilityFireability-12
FORMULA_NAME Diffusion2D-PT-D20N100-ReachabilityFireability-13
FORMULA_NAME Diffusion2D-PT-D20N100-ReachabilityFireability-14
FORMULA_NAME Diffusion2D-PT-D20N100-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1552571389307
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ Diffusion2D-PT-D20N100 @ 3570 seconds
FORMULA Diffusion2D-PT-D20N100-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D20N100-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D20N100-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D20N100-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D20N100-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D20N100-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D20N100-ReachabilityFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D20N100-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D20N100-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D20N100-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D20N100-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D20N100-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D20N100-ReachabilityFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D20N100-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D20N100-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D20N100-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3563
rslt: Output for ReachabilityFireability @ Diffusion2D-PT-D20N100
{
"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": "Thu Mar 14 13:49:49 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(t1_7_18_6_19)))",
"processed_size": 30,
"rewrites": 1
},
"result":
{
"edges": 7,
"markings": 8,
"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(t1_18_18_18_19)))",
"processed_size": 32,
"rewrites": 1
},
"result":
{
"edges": 7,
"markings": 8,
"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(t1_2_4_2_3)))",
"processed_size": 28,
"rewrites": 1
},
"result":
{
"edges": 9,
"markings": 10,
"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": 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(t1_15_19_14_20)))",
"processed_size": 32,
"rewrites": 1
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "E (F ((FIREABLE(t1_5_17_6_18) OR FIREABLE(t1_16_15_15_14))))",
"processed_size": 61,
"rewrites": 1
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"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": 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(t1_9_20_8_20) AND NOT FIREABLE(t1_6_4_6_5)) OR FIREABLE(t1_7_17_7_18) OR FIREABLE(t1_18_12_17_12))))",
"processed_size": 123,
"rewrites": 2
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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": 5,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "A (G ((FIREABLE(t1_2_12_3_13) OR NOT FIREABLE(t1_19_5_20_6) OR NOT FIREABLE(t1_2_4_1_5) OR NOT FIREABLE(t1_4_16_4_17) OR FIREABLE(t1_6_18_7_19))))",
"processed_size": 150,
"rewrites": 2
},
"result":
{
"edges": 24,
"markings": 25,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"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": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "A (G ((FIREABLE(t1_4_12_3_11) OR FIREABLE(t1_5_8_4_7) OR NOT FIREABLE(t1_19_7_20_6) OR FIREABLE(t1_17_13_17_14) OR (NOT FIREABLE(t1_16_7_17_8) AND FIREABLE(t1_4_9_3_9)))))",
"processed_size": 175,
"rewrites": 2
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "invariance",
"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": 0,
"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(t1_6_5_7_6) OR NOT FIREABLE(t1_10_16_10_17) OR NOT FIREABLE(t1_14_12_13_12) OR NOT FIREABLE(t1_7_10_8_11) OR FIREABLE(t1_10_18_11_18) OR NOT FIREABLE(t1_10_9_11_9))))",
"processed_size": 191,
"rewrites": 2
},
"result":
{
"edges": 83,
"markings": 41,
"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": 6,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 6,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "E (F ((FIREABLE(t1_4_11_3_11) OR (((FIREABLE(t1_9_19_8_18) AND FIREABLE(t1_13_11_14_11)) OR (FIREABLE(t1_10_19_9_18) AND FIREABLE(t1_10_8_11_8))) AND (FIREABLE(t1_10_5_11_6) OR NOT FIREABLE(t1_20_10_20_9))))))",
"processed_size": 212,
"rewrites": 1
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 13,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"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": 7,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "E (F ((NOT FIREABLE(t1_11_2_10_2) AND FIREABLE(t1_5_2_5_1) AND FIREABLE(t1_10_10_10_11) AND FIREABLE(t1_8_7_8_6) AND (FIREABLE(t1_7_2_8_2) OR FIREABLE(t1_9_7_10_7)) AND NOT FIREABLE(t1_3_2_3_3))))",
"processed_size": 197,
"rewrites": 1
},
"result":
{
"edges": 3817,
"markings": 1888,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"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": 7,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "E (F ((FIREABLE(t1_19_3_18_3) OR (FIREABLE(t1_16_4_17_5) AND FIREABLE(t1_4_18_5_19)) OR FIREABLE(t1_6_16_7_16) OR (FIREABLE(t1_9_6_10_6) AND (NOT FIREABLE(t1_10_12_11_13) OR NOT FIREABLE(t1_19_12_20_11))))))",
"processed_size": 211,
"rewrites": 1
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 3,
"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": 8,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "A (G (((NOT FIREABLE(t1_19_8_20_7) AND (NOT FIREABLE(t1_19_10_19_11) OR NOT FIREABLE(t1_4_8_5_9))) OR (((FIREABLE(t1_8_20_7_19) AND FIREABLE(t1_16_9_16_10)) OR (FIREABLE(t1_4_3_4_2) AND FIREABLE(t1_5_17_5_18))) AND FIREABLE(t1_9_6_10_5)))))",
"processed_size": 243,
"rewrites": 2
},
"result":
{
"edges": 8,
"markings": 9,
"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": 33,
"problems": 10
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"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": 8,
"unfir": 8,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "A (G (((NOT FIREABLE(t1_8_6_9_7) AND NOT FIREABLE(t1_11_16_10_15)) OR (NOT FIREABLE(t1_9_6_9_7) AND NOT FIREABLE(t1_9_4_8_3)) OR (NOT FIREABLE(t1_13_15_12_14) AND NOT FIREABLE(t1_17_15_16_15) AND (NOT FIREABLE(t1_4_17_3_16) OR NOT FIREABLE(t1_20_16_19_15))))))",
"processed_size": 263,
"rewrites": 2
},
"result":
{
"edges": 390,
"markings": 152,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 40,
"problems": 12
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"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(t1_9_8_8_9) AND FIREABLE(t1_7_2_6_3)) OR (FIREABLE(t1_19_18_20_19) AND FIREABLE(t1_2_14_1_14)) OR (FIREABLE(t1_8_12_9_12) AND FIREABLE(t1_7_17_7_16) AND (FIREABLE(t1_16_3_15_3) OR FIREABLE(t1_9_1_8_2))) OR FIREABLE(t1_16_3_15_4))))",
"processed_size": 252,
"rewrites": 1
},
"result":
{
"edges": 59,
"markings": 39,
"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": 11,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3563
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 8,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 9,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 9
},
"processed": "E (F ((((NOT FIREABLE(t1_17_10_18_11) AND (FIREABLE(t1_4_17_3_17) OR FIREABLE(t1_16_17_17_16))) OR FIREABLE(t1_16_18_16_17)) AND (FIREABLE(t1_15_20_16_19) OR FIREABLE(t1_18_4_17_5) OR (FIREABLE(t1_16_13_16_12) AND FIREABLE(t1_17_11_18_11)) OR FIREABLE(t1_2_15_1_16)))))",
"processed_size": 274,
"rewrites": 1
},
"result":
{
"edges": 161,
"markings": 63,
"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": 35,
"problems": 12
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 28084,
"runtime": 7.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 5928,
"conflict_clusters": 400,
"places": 400,
"places_significant": 399,
"singleton_clusters": 0,
"transitions": 2964
},
"result":
{
"preliminary_value": "no yes no yes yes yes yes no yes yes yes yes yes no no no ",
"value": "no yes no yes yes yes yes no yes yes yes yes yes no 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: 3364/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 12800
lola: finding significant places
lola: 400 places, 2964 transitions, 399 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(t1_19_8_20_7) AND (NOT FIREABLE(t1_19_10_19_11) OR NOT FIREABLE(t1_4_8_5_9))) OR (((FIREABLE(t1_8_20_7_19) AND FIREABLE(t1_16_9_16_10)) OR (FIREABLE(t1_4_3_4_2) AND FIREABLE(t1_5_17_5_18))) AND FIREABLE(t1_9_6_10_5))))) : E (F ((FIREABLE(t1_4_11_3_11) OR (((FIREABLE(t1_9_19_8_18) AND FIREABLE(t1_13_11_14_11)) OR (FIREABLE(t1_10_19_9_18) AND FIREABLE(t1_10_8_11_8))) AND (FIREABLE(t1_10_5_11_6) OR NOT FIREABLE(t1_20_10_20_9)))))) : A (G ((FIREABLE(t1_2_12_3_13) OR NOT FIREABLE(t1_19_5_20_6) OR NOT FIREABLE(t1_2_4_1_5) OR NOT FIREABLE(t1_4_16_4_17) OR FIREABLE(t1_6_18_7_19)))) : E (F (FIREABLE(t1_7_18_6_19))) : E (F ((((NOT FIREABLE(t1_17_10_18_11) AND (FIREABLE(t1_4_17_3_17) OR FIREABLE(t1_16_17_17_16))) OR FIREABLE(t1_16_18_16_17)) AND (FIREABLE(t1_15_20_16_19) OR FIREABLE(t1_18_4_17_5) OR (FIREABLE(t1_16_13_16_12) AND FIREABLE(t1_17_11_18_11)) OR FIREABLE(t1_2_15_1_16))))) : E (F ((NOT FIREABLE(t1_11_2_10_2) AND FIREABLE(t1_5_2_5_1) AND FIREABLE(t1_10_10_10_11) AND FIREABLE(t1_8_7_8_6) AND (FIREABLE(t1_7_2_8_2) OR FIREABLE(t1_9_7_10_7)) AND NOT FIREABLE(t1_3_2_3_3)))) : E (F ((FIREABLE(t1_5_17_6_18) OR FIREABLE(t1_16_15_15_14)))) : A (G (((NOT FIREABLE(t1_9_20_8_20) AND NOT FIREABLE(t1_6_4_6_5)) OR FIREABLE(t1_7_17_7_18) OR FIREABLE(t1_18_12_17_12)))) : E (F (FIREABLE(t1_18_18_18_19))) : E (F (FIREABLE(t1_2_4_2_3))) : E (F (((FIREABLE(t1_9_8_8_9) AND FIREABLE(t1_7_2_6_3)) OR (FIREABLE(t1_19_18_20_19) AND FIREABLE(t1_2_14_1_14)) OR (FIREABLE(t1_8_12_9_12) AND FIREABLE(t1_7_17_7_16) AND (FIREABLE(t1_16_3_15_3) OR FIREABLE(t1_9_1_8_2))) OR FIREABLE(t1_16_3_15_4)))) : E (F ((FIREABLE(t1_19_3_18_3) OR (FIREABLE(t1_16_4_17_5) AND FIREABLE(t1_4_18_5_19)) OR FIREABLE(t1_6_16_7_16) OR (FIREABLE(t1_9_6_10_6) AND (NOT FIREABLE(t1_10_12_11_13) OR NOT FIREABLE(t1_19_12_20_11)))))) : E (F (FIREABLE(t1_15_19_14_20))) : A (G ((FIREABLE(t1_4_12_3_11) OR FIREABLE(t1_5_8_4_7) OR NOT FIREABLE(t1_19_7_20_6) OR FIREABLE(t1_17_13_17_14) OR (NOT FIREABLE(t1_16_7_17_8) AND FIREABLE(t1_4_9_3_9))))) : A (G ((NOT FIREABLE(t1_6_5_7_6) OR NOT FIREABLE(t1_10_16_10_17) OR NOT FIREABLE(t1_14_12_13_12) OR NOT FIREABLE(t1_7_10_8_11) OR FIREABLE(t1_10_18_11_18) OR NOT FIREABLE(t1_10_9_11_9)))) : A (G (((NOT FIREABLE(t1_8_6_9_7) AND NOT FIREABLE(t1_11_16_10_15)) OR (NOT FIREABLE(t1_9_6_9_7) AND NOT FIREABLE(t1_9_4_8_3)) OR (NOT FIREABLE(t1_13_15_12_14) AND NOT FIREABLE(t1_17_15_16_15) AND (NOT FIREABLE(t1_4_17_3_16) OR NOT FIREABLE(t1_20_16_19_15))))))
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(t1_7_18_6_19)))
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(t1_7_18_6_19)))
lola: processed formula length: 30
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(t1_7_18_6_19)
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: 8 markings, 7 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1_18_18_18_19)))
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(t1_18_18_18_19)))
lola: processed formula length: 32
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(t1_18_18_18_19)
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: 8 markings, 7 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1_2_4_2_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(t1_2_4_2_3)))
lola: processed formula length: 28
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(t1_2_4_2_3)
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: 10 markings, 9 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1_15_19_14_20)))
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(t1_15_19_14_20)))
lola: processed formula length: 32
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(t1_15_19_14_20)
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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_5_17_6_18) OR FIREABLE(t1_16_15_15_14))))
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(t1_5_17_6_18) OR FIREABLE(t1_16_15_15_14))))
lola: processed formula length: 61
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(t1_5_17_6_18) OR FIREABLE(t1_16_15_15_14))
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t1_9_20_8_20) AND NOT FIREABLE(t1_6_4_6_5)) OR FIREABLE(t1_7_17_7_18) OR FIREABLE(t1_18_12_17_12))))
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(t1_9_20_8_20) AND NOT FIREABLE(t1_6_4_6_5)) OR FIREABLE(t1_7_17_7_18) OR FIREABLE(t1_18_12_17_12))))
lola: processed formula length: 123
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(t1_9_20_8_20) OR FIREABLE(t1_6_4_6_5)) AND NOT FIREABLE(t1_7_17_7_18) AND NOT FIREABLE(t1_18_12_17_12))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1_2_12_3_13) OR NOT FIREABLE(t1_19_5_20_6) OR NOT FIREABLE(t1_2_4_1_5) OR NOT FIREABLE(t1_4_16_4_17) OR FIREABLE(t1_6_18_7_19))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((FIREABLE(t1_2_12_3_13) OR NOT FIREABLE(t1_19_5_20_6) OR NOT FIREABLE(t1_2_4_1_5) OR NOT FIREABLE(t1_4_16_4_17) OR FIREABLE(t1_6_18_7_19))))
lola: processed formula length: 150
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(t1_2_12_3_13) AND FIREABLE(t1_19_5_20_6) AND FIREABLE(t1_2_4_1_5) AND FIREABLE(t1_4_16_4_17) AND NOT FIREABLE(t1_6_18_7_19))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 25 markings, 24 edges
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1_4_12_3_11) OR FIREABLE(t1_5_8_4_7) OR NOT FIREABLE(t1_19_7_20_6) OR FIREABLE(t1_17_13_17_14) OR (NOT FIREABLE(t1_16_7_17_8) AND FIREABLE(t1_4_9_3_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 ((FIREABLE(t1_4_12_3_11) OR FIREABLE(t1_5_8_4_7) OR NOT FIREABLE(t1_19_7_20_6) OR FIREABLE(t1_17_13_17_14) OR (NOT FIREABLE(t1_16_7_17_8) AND FIREABLE(t1_4_9_3_9)))))
lola: processed formula length: 175
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(t1_4_12_3_11) AND NOT FIREABLE(t1_5_8_4_7) AND FIREABLE(t1_19_7_20_6) AND NOT FIREABLE(t1_17_13_17_14) AND (FIREABLE(t1_16_7_17_8) OR NOT FIREABLE(t1_4_9_3_9)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1_6_5_7_6) OR NOT FIREABLE(t1_10_16_10_17) OR NOT FIREABLE(t1_14_12_13_12) OR NOT FIREABLE(t1_7_10_8_11) OR FIREABLE(t1_10_18_11_18) OR NOT FIREABLE(t1_10_9_11_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(t1_6_5_7_6) OR NOT FIREABLE(t1_10_16_10_17) OR NOT FIREABLE(t1_14_12_13_12) OR NOT FIREABLE(t1_7_10_8_11) OR FIREABLE(t1_10_18_11_18) OR NOT FIREABLE(t1_10_9_11_9))))
lola: processed formula length: 191
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(t1_6_5_7_6) AND FIREABLE(t1_10_16_10_17) AND FIREABLE(t1_14_12_13_12) AND FIREABLE(t1_7_10_8_11) AND NOT FIREABLE(t1_10_18_11_18) AND FIREABLE(t1_10_9_11_9))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 41 markings, 83 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_4_11_3_11) OR (((FIREABLE(t1_9_19_8_18) AND FIREABLE(t1_13_11_14_11)) OR (FIREABLE(t1_10_19_9_18) AND FIREABLE(t1_10_8_11_8))) AND (FIREABLE(t1_10_5_11_6) OR NOT FIREABLE(t1_20_10_20_9))))))
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(t1_4_11_3_11) OR (((FIREABLE(t1_9_19_8_18) AND FIREABLE(t1_13_11_14_11)) OR (FIREABLE(t1_10_19_9_18) AND FIREABLE(t1_10_8_11_8))) AND (FIREABLE(t1_10_5_11_6) OR NOT FIREABLE(t1_20_10_20_9))))))
lola: processed formula length: 212
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(t1_4_11_3_11) OR (((FIREABLE(t1_9_19_8_18) AND FIREABLE(t1_13_11_14_11)) OR (FIREABLE(t1_10_19_9_18) AND FIREABLE(t1_10_8_11_8))) AND (FIREABLE(t1_10_5_11_6) OR NOT FIREABLE(t1_20_10_20_9))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 13 literals and 5 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 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t1_11_2_10_2) AND FIREABLE(t1_5_2_5_1) AND FIREABLE(t1_10_10_10_11) AND FIREABLE(t1_8_7_8_6) AND (FIREABLE(t1_7_2_8_2) OR FIREABLE(t1_9_7_10_7)) AND NOT FIREABLE(t1_3_2_3_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 ((NOT FIREABLE(t1_11_2_10_2) AND FIREABLE(t1_5_2_5_1) AND FIREABLE(t1_10_10_10_11) AND FIREABLE(t1_8_7_8_6) AND (FIREABLE(t1_7_2_8_2) OR FIREABLE(t1_9_7_10_7)) AND NOT FIREABLE(t1_3_2_3_3))))
lola: processed formula length: 197
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(t1_11_2_10_2) AND FIREABLE(t1_5_2_5_1) AND FIREABLE(t1_10_10_10_11) AND FIREABLE(t1_8_7_8_6) AND (FIREABLE(t1_7_2_8_2) OR FIREABLE(t1_9_7_10_7)) AND NOT FIREABLE(t1_3_2_3_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
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.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1888 markings, 3817 edges
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_19_3_18_3) OR (FIREABLE(t1_16_4_17_5) AND FIREABLE(t1_4_18_5_19)) OR FIREABLE(t1_6_16_7_16) OR (FIREABLE(t1_9_6_10_6) AND (NOT FIREABLE(t1_10_12_11_13) OR NOT FIREABLE(t1_19_12_20_11))))))
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(t1_19_3_18_3) OR (FIREABLE(t1_16_4_17_5) AND FIREABLE(t1_4_18_5_19)) OR FIREABLE(t1_6_16_7_16) OR (FIREABLE(t1_9_6_10_6) AND (NOT FIREABLE(t1_10_12_11_13) OR NOT FIREABLE(t1_19_12_20_11))))))
lola: processed formula length: 211
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(t1_19_3_18_3) OR (FIREABLE(t1_16_4_17_5) AND FIREABLE(t1_4_18_5_19)) OR FIREABLE(t1_6_16_7_16) OR (FIREABLE(t1_9_6_10_6) AND (NOT FIREABLE(t1_10_12_11_13) OR NOT FIREABLE(t1_19_12_20_11))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 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: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t1_19_8_20_7) AND (NOT FIREABLE(t1_19_10_19_11) OR NOT FIREABLE(t1_4_8_5_9))) OR (((FIREABLE(t1_8_20_7_19) AND FIREABLE(t1_16_9_16_10)) OR (FIREABLE(t1_4_3_4_2) AND FIREABLE(t1_5_17_5_18))) AND FIREABLE(t1_9_6_10_5)))))
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(t1_19_8_20_7) AND (NOT FIREABLE(t1_19_10_19_11) OR NOT FIREABLE(t1_4_8_5_9))) OR (((FIREABLE(t1_8_20_7_19) AND FIREABLE(t1_16_9_16_10)) OR (FIREABLE(t1_4_3_4_2) AND FIREABLE(t1_5_17_5_18))) AND FIREABLE(t1_9_6_10_5)))))
lola: processed formula length: 243
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(t1_19_8_20_7) OR (FIREABLE(t1_19_10_19_11) AND FIREABLE(t1_4_8_5_9))) AND (((NOT FIREABLE(t1_8_20_7_19) OR NOT FIREABLE(t1_16_9_16_10)) AND (NOT FIREABLE(t1_4_3_4_2) OR NOT FIREABLE(t1_5_17_5_18))) OR NOT FIREABLE(t1_9_6_10_5)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 33 literals and 10 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 13 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t1_8_6_9_7) AND NOT FIREABLE(t1_11_16_10_15)) OR (NOT FIREABLE(t1_9_6_9_7) AND NOT FIREABLE(t1_9_4_8_3)) OR (NOT FIREABLE(t1_13_15_12_14) AND NOT FIREABLE(t1_17_15_16_15) AND (NOT FIREABLE(t1_4_17_3_16) OR NOT FIREABLE(t1_20_16_19_15))))))
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(t1_8_6_9_7) AND NOT FIREABLE(t1_11_16_10_15)) OR (NOT FIREABLE(t1_9_6_9_7) AND NOT FIREABLE(t1_9_4_8_3)) OR (NOT FIREABLE(t1_13_15_12_14) AND NOT FIREABLE(t1_17_15_16_15) AND (NOT FIREABLE(t1_4_17_3_16) OR NOT FIREABLE(t1_20_16_19_15))))))
lola: processed formula length: 263
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(t1_8_6_9_7) OR FIREABLE(t1_11_16_10_15)) AND (FIREABLE(t1_9_6_9_7) OR FIREABLE(t1_9_4_8_3)) AND (FIREABLE(t1_13_15_12_14) OR FIREABLE(t1_17_15_16_15) OR (FIREABLE(t1_4_17_3_16) AND FIREABLE(t1_20_16_19_15))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 40 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 152 markings, 390 edges
lola: ========================================
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t1_9_8_8_9) AND FIREABLE(t1_7_2_6_3)) OR (FIREABLE(t1_19_18_20_19) AND FIREABLE(t1_2_14_1_14)) OR (FIREABLE(t1_8_12_9_12) AND FIREABLE(t1_7_17_7_16) AND (FIREABLE(t1_16_3_15_3) OR FIREABLE(t1_9_1_8_2))) OR FIREABLE(t1_16_3_15_4))))
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(t1_9_8_8_9) AND FIREABLE(t1_7_2_6_3)) OR (FIREABLE(t1_19_18_20_19) AND FIREABLE(t1_2_14_1_14)) OR (FIREABLE(t1_8_12_9_12) AND FIREABLE(t1_7_17_7_16) AND (FIREABLE(t1_16_3_15_3) OR FIREABLE(t1_9_1_8_2))) OR FIREABLE(t1_16_3_15_4))))
lola: processed formula length: 252
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((FIREABLE(t1_9_8_8_9) AND FIREABLE(t1_7_2_6_3)) OR (FIREABLE(t1_19_18_20_19) AND FIREABLE(t1_2_14_1_14)) OR (FIREABLE(t1_8_12_9_12) AND FIREABLE(t1_7_17_7_16) AND (FIREABLE(t1_16_3_15_3) OR FIREABLE(t1_9_1_8_2))) OR FIREABLE(t1_16_3_15_4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 11 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 39 markings, 59 edges
lola: ========================================
lola: subprocess 15 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((NOT FIREABLE(t1_17_10_18_11) AND (FIREABLE(t1_4_17_3_17) OR FIREABLE(t1_16_17_17_16))) OR FIREABLE(t1_16_18_16_17)) AND (FIREABLE(t1_15_20_16_19) OR FIREABLE(t1_18_4_17_5) OR (FIREABLE(t1_16_13_16_12) AND FIREABLE(t1_17_11_18_11)) OR FIREABLE(t1_2_15_1_16)))))
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(t1_17_10_18_11) AND (FIREABLE(t1_4_17_3_17) OR FIREABLE(t1_16_17_17_16))) OR FIREABLE(t1_16_18_16_17)) AND (FIREABLE(t1_15_20_16_19) OR FIREABLE(t1_18_4_17_5) OR (FIREABLE(t1_16_13_16_12) AND FIREABLE(t1_17_11_18_11)) OR FIREABLE(t1_2_15_1_16)))))
lola: processed formula length: 274
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(t1_17_10_18_11) AND (FIREABLE(t1_4_17_3_17) OR FIREABLE(t1_16_17_17_16))) OR FIREABLE(t1_16_18_16_17)) AND (FIREABLE(t1_15_20_16_19) OR FIREABLE(t1_18_4_17_5) OR (FIREABLE(t1_16_13_16_12) AND FIREABLE(t1_17_11_18_11)) OR FIREABLE(t1_2_15_1_16)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 35 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 63 markings, 161 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes yes yes yes no yes yes yes yes yes no no no
lola:
preliminary result: no yes no yes yes yes yes no yes yes yes yes yes no no no
lola: memory consumption: 28084 KB
lola: time consumption: 7 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
BK_STOP 1552571396632
--------------------
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="Diffusion2D-PT-D20N100"
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 Diffusion2D-PT-D20N100, 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 r060-ebro-155234654700144"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D20N100.tgz
mv Diffusion2D-PT-D20N100 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 ;