About the Execution of LoLA for MAPK-PT-10240
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15918.980 | 765461.00 | 728768.00 | 6011.30 | TTFTFT?FTFTTFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2019-input.r093-smll-155246584400342.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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-3957
Executing tool lola
Input is MAPK-PT-10240, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r093-smll-155246584400342
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.8K Feb 11 22:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 11 22:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 7 23:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 7 23:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 100 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 338 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 00:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 00:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.0K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Feb 4 06:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 4 06:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Jan 31 23:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Jan 31 23:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 0 Jan 29 09:34 model-fix.log
-rw-r--r-- 1 mcc users 25K 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 MAPK-PT-10240-ReachabilityFireability-00
FORMULA_NAME MAPK-PT-10240-ReachabilityFireability-01
FORMULA_NAME MAPK-PT-10240-ReachabilityFireability-02
FORMULA_NAME MAPK-PT-10240-ReachabilityFireability-03
FORMULA_NAME MAPK-PT-10240-ReachabilityFireability-04
FORMULA_NAME MAPK-PT-10240-ReachabilityFireability-05
FORMULA_NAME MAPK-PT-10240-ReachabilityFireability-06
FORMULA_NAME MAPK-PT-10240-ReachabilityFireability-07
FORMULA_NAME MAPK-PT-10240-ReachabilityFireability-08
FORMULA_NAME MAPK-PT-10240-ReachabilityFireability-09
FORMULA_NAME MAPK-PT-10240-ReachabilityFireability-10
FORMULA_NAME MAPK-PT-10240-ReachabilityFireability-11
FORMULA_NAME MAPK-PT-10240-ReachabilityFireability-12
FORMULA_NAME MAPK-PT-10240-ReachabilityFireability-13
FORMULA_NAME MAPK-PT-10240-ReachabilityFireability-14
FORMULA_NAME MAPK-PT-10240-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1552900832098
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ MAPK-PT-10240 @ 3570 seconds
FORMULA MAPK-PT-10240-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-10240-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-10240-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-10240-ReachabilityFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-10240-ReachabilityFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-10240-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-10240-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-10240-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-10240-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-10240-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-10240-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-10240-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-10240-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-10240-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-10240-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-10240-ReachabilityFireability-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2805
rslt: Output for ReachabilityFireability @ MAPK-PT-10240
{
"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": "Mon Mar 18 09:20:32 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 6
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 6
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 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": "E (F ((NOT FIREABLE(k1) AND NOT FIREABLE(k6))))",
"processed_size": 47,
"rewrites": 7
},
"result":
{
"edges": 2560,
"markings": 2561,
"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": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 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": "A (G ((FIREABLE(k1) OR FIREABLE(k27))))",
"processed_size": 40,
"rewrites": 8
},
"result":
{
"edges": 2560,
"markings": 2561,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 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": 2,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (G ((FIREABLE(k1) OR NOT FIREABLE(k30))))",
"processed_size": 44,
"rewrites": 8
},
"result":
{
"edges": 2571,
"markings": 2572,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 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": 3,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "E (F (((FIREABLE(k6) OR NOT FIREABLE(k5)) AND NOT FIREABLE(k1))))",
"processed_size": 66,
"rewrites": 7
},
"result":
{
"edges": 2560,
"markings": 2561,
"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": 8,
"problems": 4
},
"type": "reachability",
"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": 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": 3,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A (G (((FIREABLE(k15) AND NOT FIREABLE(k13)) OR NOT FIREABLE(k7))))",
"processed_size": 68,
"rewrites": 8
},
"result":
{
"edges": 2,
"markings": 3,
"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": 7,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "A (G ((FIREABLE(k25) OR (NOT FIREABLE(k26) AND NOT FIREABLE(k6)) OR (NOT FIREABLE(k16) AND NOT FIREABLE(k27) AND FIREABLE(k6)))))",
"processed_size": 131,
"rewrites": 8
},
"result":
{
"edges": 16,
"markings": 12,
"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": 34,
"problems": 10
},
"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": 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": 5,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "A (G ((NOT FIREABLE(k26) OR NOT FIREABLE(k15) OR NOT FIREABLE(k13) OR (FIREABLE(k5) AND FIREABLE(k25)))))",
"processed_size": 108,
"rewrites": 8
},
"result":
{
"edges": 249619,
"markings": 161295,
"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": 15,
"problems": 3
},
"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": 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": 6,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "E (F ((((FIREABLE(k5) OR FIREABLE(k27)) AND FIREABLE(k13)) OR FIREABLE(k6) OR (NOT FIREABLE(k8) AND FIREABLE(k6)))))",
"processed_size": 119,
"rewrites": 7
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 9,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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": 7,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F (((FIREABLE(k12) OR FIREABLE(k5)) AND FIREABLE(k17) AND ((FIREABLE(k17) AND FIREABLE(k23)) OR FIREABLE(k16)) AND FIREABLE(k30))))",
"processed_size": 136,
"rewrites": 7
},
"result":
{
"edges": 42,
"markings": 32,
"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": 20,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"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": 7,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "E (F ((FIREABLE(k9) AND FIREABLE(k26) AND ((FIREABLE(k24) AND FIREABLE(k15) AND (FIREABLE(k19) OR FIREABLE(k7))) OR FIREABLE(k18)))))",
"processed_size": 135,
"rewrites": 7
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 15,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 7,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 8,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "E (F ((FIREABLE(k26) AND FIREABLE(k4) AND FIREABLE(k1) AND FIREABLE(k2) AND FIREABLE(k14) AND NOT FIREABLE(k30) AND FIREABLE(k1) AND FIREABLE(k28))))",
"processed_size": 149,
"rewrites": 7
},
"result":
{
"edges": 25,
"markings": 21,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 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": 7,
"unfir": 5,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "A (G ((NOT FIREABLE(k26) OR NOT FIREABLE(k12) OR FIREABLE(k20) OR NOT FIREABLE(k24) OR FIREABLE(k25) OR (NOT FIREABLE(k29) AND NOT FIREABLE(k5)))))",
"processed_size": 152,
"rewrites": 8
},
"result":
{
"edges": 33,
"markings": 25,
"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": 24,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3178
},
"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": 8,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 11,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 11
},
"processed": "E (F ((FIREABLE(k3) AND FIREABLE(k6) AND NOT FIREABLE(k10) AND FIREABLE(k15) AND FIREABLE(k13) AND FIREABLE(k2) AND FIREABLE(k21) AND ((NOT FIREABLE(k20) AND NOT FIREABLE(k29)) OR (FIREABLE(k25) AND (FIREABLE(k7)))))))",
"processed_size": 219,
"rewrites": 7
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 13172,
"runtime": 765.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : TRUE : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : FALSE : A(G(**)) : A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"preliminary_value": "yes yes no yes no yes unknown no yes no yes yes no no no yes ",
"value": "yes yes no yes no yes unknown no yes no yes yes no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 52/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 30 transitions, 15 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(k9) AND FIREABLE(k26) AND ((FIREABLE(k24) AND FIREABLE(k15) AND (FIREABLE(k19) OR FIREABLE(k7))) OR FIREABLE(k18))))) : E (F ((NOT FIREABLE(k1) AND NOT FIREABLE(k6)))) : A (G ((FIREABLE(k1) OR NOT FIREABLE(k30)))) : E (F ((FIREABLE(k26) AND FIREABLE(k4) AND FIREABLE(k1) AND FIREABLE(k2) AND FIREABLE(k14) AND NOT FIREABLE(k30) AND FIREABLE(k1) AND FIREABLE(k28)))) : A (G ((NOT FIREABLE(k26) OR NOT FIREABLE(k12) OR FIREABLE(k20) OR NOT FIREABLE(k24) OR FIREABLE(k25) OR (NOT FIREABLE(k29) AND NOT FIREABLE(k5))))) : A (G (())) : A (G ((NOT FIREABLE(k2) OR FIREABLE(k16) OR FIREABLE(k25) OR NOT FIREABLE(k22) OR FIREABLE(k4) OR FIREABLE(k17) OR FIREABLE(k19) OR (NOT FIREABLE(k17) AND (FIREABLE(k15) OR FIREABLE(k7)))))) : A (G ((NOT FIREABLE(k26) OR NOT FIREABLE(k15) OR NOT FIREABLE(k13) OR (FIREABLE(k5) AND FIREABLE(k25))))) : E (F (((FIREABLE(k12) OR FIREABLE(k5)) AND FIREABLE(k17) AND ((FIREABLE(k17) AND FIREABLE(k23)) OR FIREABLE(k16)) AND FIREABLE(k30)))) : A (G ((FIREABLE(k1) OR FIREABLE(k27)))) : E (F (((FIREABLE(k6) OR NOT FIREABLE(k5)) AND NOT FIREABLE(k1)))) : E (F ((FIREABLE(k3) AND FIREABLE(k6) AND NOT FIREABLE(k10) AND FIREABLE(k15) AND FIREABLE(k13) AND FIREABLE(k2) AND FIREABLE(k21) AND ((NOT FIREABLE(k20) AND NOT FIREABLE(k29)) OR (FIREABLE(k25) AND (FIREABLE(k7))))))) : E (F (())) : A (G ((FIREABLE(k25) OR (NOT FIREABLE(k26) AND NOT FIREABLE(k6)) OR (NOT FIREABLE(k16) AND NOT FIREABLE(k27) AND FIREABLE(k6))))) : A (G (((FIREABLE(k15) AND NOT FIREABLE(k13)) OR NOT FIREABLE(k7)))) : E (F ((((FIREABLE(k5) OR FIREABLE(k27)) AND FIREABLE(k13)) OR FIREABLE(k6) OR (NOT FIREABLE(k8) AND FIREABLE(k6)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 6 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 6 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(k1) AND NOT FIREABLE(k6))))
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(k1) AND NOT FIREABLE(k6))))
lola: processed formula length: 47
lola: 7 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(k1) AND NOT FIREABLE(k6))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2561 markings, 2560 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(k1) OR FIREABLE(k27))))
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(k1) OR FIREABLE(k27))))
lola: processed formula length: 40
lola: 8 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(k1) AND NOT FIREABLE(k27))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2561 markings, 2560 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(k1) OR NOT FIREABLE(k30))))
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(k1) OR NOT FIREABLE(k30))))
lola: processed formula length: 44
lola: 8 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(k1) AND FIREABLE(k30))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-4-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2572 markings, 2571 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(k6) OR NOT FIREABLE(k5)) AND NOT FIREABLE(k1))))
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(k6) OR NOT FIREABLE(k5)) AND NOT FIREABLE(k1))))
lola: processed formula length: 66
lola: 7 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((FIREABLE(k6) OR NOT FIREABLE(k5)) AND NOT FIREABLE(k1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2561 markings, 2560 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(k15) AND NOT FIREABLE(k13)) OR NOT FIREABLE(k7))))
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(k15) AND NOT FIREABLE(k13)) OR NOT FIREABLE(k7))))
lola: processed formula length: 68
lola: 8 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((NOT FIREABLE(k15) OR FIREABLE(k13)) AND FIREABLE(k7))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(k25) OR (NOT FIREABLE(k26) AND NOT FIREABLE(k6)) OR (NOT FIREABLE(k16) AND NOT FIREABLE(k27) AND FIREABLE(k6)))))
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(k25) OR (NOT FIREABLE(k26) AND NOT FIREABLE(k6)) OR (NOT FIREABLE(k16) AND NOT FIREABLE(k27) AND FIREABLE(k6)))))
lola: processed formula length: 131
lola: 8 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(k25) AND (FIREABLE(k26) OR FIREABLE(k6)) AND (FIREABLE(k16) OR FIREABLE(k27) OR NOT FIREABLE(k6)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 16 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 34 literals and 10 conjunctive subformulas
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(k26) OR NOT FIREABLE(k15) OR NOT FIREABLE(k13) OR (FIREABLE(k5) AND FIREABLE(k25)))))
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(k26) OR NOT FIREABLE(k15) OR NOT FIREABLE(k13) OR (FIREABLE(k5) AND FIREABLE(k25)))))
lola: processed formula length: 108
lola: 8 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(k26) AND FIREABLE(k15) AND FIREABLE(k13) AND (NOT FIREABLE(k5) OR NOT FIREABLE(k25)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 15 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 161295 markings, 249619 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(k5) OR FIREABLE(k27)) AND FIREABLE(k13)) OR FIREABLE(k6) OR (NOT FIREABLE(k8) AND FIREABLE(k6)))))
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(k5) OR FIREABLE(k27)) AND FIREABLE(k13)) OR FIREABLE(k6) OR (NOT FIREABLE(k8) AND FIREABLE(k6)))))
lola: processed formula length: 119
lola: 7 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((FIREABLE(k5) OR FIREABLE(k27)) AND FIREABLE(k13)) OR FIREABLE(k6) OR (NOT FIREABLE(k8) AND FIREABLE(k6)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(k12) OR FIREABLE(k5)) AND FIREABLE(k17) AND ((FIREABLE(k17) AND FIREABLE(k23)) OR FIREABLE(k16)) AND FIREABLE(k30))))
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(k12) OR FIREABLE(k5)) AND FIREABLE(k17) AND ((FIREABLE(k17) AND FIREABLE(k23)) OR FIREABLE(k16)) AND FIREABLE(k30))))
lola: processed formula length: 136
lola: 7 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((FIREABLE(k12) OR FIREABLE(k5)) AND FIREABLE(k17) AND ((FIREABLE(k17) AND FIREABLE(k23)) OR FIREABLE(k16)) AND FIREABLE(k30))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 32 markings, 42 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(k9) AND FIREABLE(k26) AND ((FIREABLE(k24) AND FIREABLE(k15) AND (FIREABLE(k19) OR FIREABLE(k7))) OR FIREABLE(k18)))))
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(k9) AND FIREABLE(k26) AND ((FIREABLE(k24) AND FIREABLE(k15) AND (FIREABLE(k19) OR FIREABLE(k7))) OR FIREABLE(k18)))))
lola: processed formula length: 135
lola: 7 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(k9) AND FIREABLE(k26) AND ((FIREABLE(k24) AND FIREABLE(k15) AND (FIREABLE(k19) OR FIREABLE(k7))) OR FIREABLE(k18)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 15 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-11-0.sara.
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(k26) AND FIREABLE(k4) AND FIREABLE(k1) AND FIREABLE(k2) AND FIREABLE(k14) AND NOT FIREABLE(k30) AND FIREABLE(k1) AND FIREABLE(k28))))
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(k26) AND FIREABLE(k4) AND FIREABLE(k1) AND FIREABLE(k2) AND FIREABLE(k14) AND NOT FIREABLE(k30) AND FIREABLE(k1) AND FIREABLE(k28))))
lola: processed formula length: 149
lola: 7 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(k26) AND FIREABLE(k4) AND FIREABLE(k1) AND FIREABLE(k2) AND FIREABLE(k14) AND NOT FIREABLE(k30) AND FIREABLE(k1) AND FIREABLE(k28))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 12 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 21 markings, 25 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(k26) OR NOT FIREABLE(k12) OR FIREABLE(k20) OR NOT FIREABLE(k24) OR FIREABLE(k25) OR (NOT FIREABLE(k29) AND NOT FIREABLE(k5)))))
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(k26) OR NOT FIREABLE(k12) OR FIREABLE(k20) OR NOT FIREABLE(k24) OR FIREABLE(k25) OR (NOT FIREABLE(k29) AND NOT FIREABLE(k5)))))
lola: processed formula length: 152
lola: 8 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(k26) AND FIREABLE(k12) AND NOT FIREABLE(k20) AND FIREABLE(k24) AND NOT FIREABLE(k25) AND (FIREABLE(k29) OR FIREABLE(k5)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 25 markings, 33 edges
lola: ========================================
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(k2) OR FIREABLE(k16) OR FIREABLE(k25) OR NOT FIREABLE(k22) OR FIREABLE(k4) OR FIREABLE(k17) OR FIREABLE(k19) OR (NOT FIREABLE(k17) AND (FIREABLE(k15) OR FIREABLE(k7))))))
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(k2) OR FIREABLE(k16) OR FIREABLE(k25) OR NOT FIREABLE(k22) OR FIREABLE(k4) OR FIREABLE(k17) OR FIREABLE(k19) OR (NOT FIREABLE(k17) AND (FIREABLE(k15) OR FIREABLE(k7))))))
lola: processed formula length: 198
lola: 8 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(k2) AND NOT FIREABLE(k16) AND NOT FIREABLE(k25) AND FIREABLE(k22) AND NOT FIREABLE(k4) AND NOT FIREABLE(k17) AND NOT FIREABLE(k19) AND (FIREABLE(k17) OR (NOT FIREABLE(k15) AND NOT FIREABLE(k7))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 160 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-14-0.sara.
lola: sara is running 0 secs || 3244062 markings, 4603644 edges, 648812 markings/sec, 0 secs
lola: sara is running 5 secs || 6350114 markings, 9018971 edges, 621210 markings/sec, 5 secs
lola: sara is running 10 secs || 9455887 markings, 13434483 edges, 621155 markings/sec, 10 secs
lola: sara is running 15 secs || 12465671 markings, 17714710 edges, 601957 markings/sec, 15 secs
lola: sara is running 20 secs || 15580290 markings, 22142990 edges, 622924 markings/sec, 20 secs
lola: sara is running 25 secs || 18590434 markings, 26421087 edges, 602029 markings/sec, 25 secs
lola: sara is running 30 secs || 21611284 markings, 30716332 edges, 604170 markings/sec, 30 secs
lola: sara is running 35 secs || 24555732 markings, 34902933 edges, 588890 markings/sec, 35 secs
lola: sara is running 40 secs || 27702615 markings, 39377335 edges, 629377 markings/sec, 40 secs
lola: sara is running 45 secs || 30817665 markings, 43806733 edges, 623010 markings/sec, 45 secs
lola: sara is running 50 secs || 33895954 markings, 48183084 edges, 615658 markings/sec, 50 secs
lola: sara is running 55 secs || 36887154 markings, 52434938 edges, 598240 markings/sec, 55 secs
lola: sara is running 60 secs || 39944161 markings, 56782409 edges, 611401 markings/sec, 60 secs
lola: sara is running 65 secs || 42941643 markings, 61042788 edges, 599496 markings/sec, 65 secs
lola: sara is running 70 secs || 45907557 markings, 65260325 edges, 593183 markings/sec, 70 secs
lola: sara is running 75 secs || 48812808 markings, 69390454 edges, 581050 markings/sec, 75 secs
lola: sara is running 80 secs || 51798901 markings, 73637301 edges, 597219 markings/sec, 80 secs
lola: sara is running 85 secs || 54801167 markings, 77904175 edges, 600453 markings/sec, 85 secs
lola: sara is running 90 secs || 57747154 markings, 82093345 edges, 589197 markings/sec, 90 secs
lola: sara is running 95 secs || 60633752 markings, 86198255 edges, 577320 markings/sec, 95 secs
lola: sara is running 100 secs || 63503766 markings, 90277347 edges, 574003 markings/sec, 100 secs
lola: sara is running 105 secs || 66424938 markings, 94429840 edges, 584234 markings/sec, 105 secs
lola: sara is running 110 secs || 69255146 markings, 98453745 edges, 566042 markings/sec, 110 secs
lola: sara is running 115 secs || 72089759 markings, 102483771 edges, 566923 markings/sec, 115 secs
lola: sara is running 120 secs || 74884097 markings, 106458833 edges, 558868 markings/sec, 120 secs
lola: sara is running 125 secs || 78014861 markings, 110909574 edges, 626153 markings/sec, 125 secs
lola: sara is running 130 secs || 81081700 markings, 115270113 edges, 613368 markings/sec, 130 secs
lola: sara is running 135 secs || 84142664 markings, 119620073 edges, 612193 markings/sec, 135 secs
lola: sara is running 140 secs || 87109987 markings, 123839522 edges, 593465 markings/sec, 140 secs
lola: sara is running 145 secs || 90147007 markings, 128156715 edges, 607404 markings/sec, 145 secs
lola: sara is running 150 secs || 93091446 markings, 132345106 edges, 588888 markings/sec, 150 secs
lola: sara is running 155 secs || 96029447 markings, 136521606 edges, 587600 markings/sec, 155 secs
lola: sara is running 160 secs || 98889505 markings, 140587173 edges, 572012 markings/sec, 160 secs
lola: sara is running 165 secs || 101837447 markings, 144779170 edges, 589588 markings/sec, 165 secs
lola: sara is running 170 secs || 104802494 markings, 148995279 edges, 593009 markings/sec, 170 secs
lola: sara is running 175 secs || 107723175 markings, 153146383 edges, 584136 markings/sec, 175 secs
lola: sara is running 180 secs || 110588639 markings, 157220274 edges, 573093 markings/sec, 180 secs
lola: sara is running 185 secs || 113426209 markings, 161254170 edges, 567514 markings/sec, 185 secs
lola: sara is running 190 secs || 116323387 markings, 165375269 edges, 579436 markings/sec, 190 secs
lola: sara is running 195 secs || 119123850 markings, 169355650 edges, 560093 markings/sec, 195 secs
lola: sara is running 200 secs || 121926912 markings, 173340721 edges, 560612 markings/sec, 200 secs
lola: sara is running 205 secs || 124680771 markings, 177256694 edges, 550772 markings/sec, 205 secs
lola: sara is running 210 secs || 127685746 markings, 181528276 edges, 600995 markings/sec, 210 secs
lola: sara is running 215 secs || 130636243 markings, 185723856 edges, 590099 markings/sec, 215 secs
lola: sara is running 220 secs || 133570850 markings, 189895749 edges, 586921 markings/sec, 220 secs
lola: sara is running 225 secs || 136422999 markings, 193950619 edges, 570430 markings/sec, 225 secs
lola: sara is running 230 secs || 139309910 markings, 198056388 edges, 577382 markings/sec, 230 secs
lola: sara is running 235 secs || 142170119 markings, 202121217 edges, 572042 markings/sec, 235 secs
lola: sara is running 240 secs || 144983930 markings, 206122868 edges, 562762 markings/sec, 240 secs
lola: sara is running 245 secs || 147768515 markings, 210081698 edges, 556917 markings/sec, 245 secs
lola: sara is running 250 secs || 150531955 markings, 214010707 edges, 552688 markings/sec, 250 secs
lola: sara is running 255 secs || 153461434 markings, 218175884 edges, 585896 markings/sec, 255 secs
lola: sara is running 260 secs || 156281215 markings, 222183373 edges, 563956 markings/sec, 260 secs
lola: sara is running 265 secs || 159118083 markings, 226217347 edges, 567374 markings/sec, 265 secs
lola: sara is running 270 secs || 161868138 markings, 230128286 edges, 550011 markings/sec, 270 secs
lola: sara is running 275 secs || 164703710 markings, 234159468 edges, 567114 markings/sec, 275 secs
lola: sara is running 280 secs || 167475327 markings, 238100702 edges, 554323 markings/sec, 280 secs
lola: sara is running 285 secs || 170231975 markings, 242018468 edges, 551330 markings/sec, 285 secs
lola: sara is running 290 secs || 172963569 markings, 245902231 edges, 546319 markings/sec, 290 secs
lola: sara is running 295 secs || 175751761 markings, 249865959 edges, 557638 markings/sec, 295 secs
lola: sara is running 300 secs || 178939752 markings, 254399898 edges, 637598 markings/sec, 300 secs
lola: sara is running 305 secs || 182033786 markings, 258798374 edges, 618807 markings/sec, 305 secs
lola: sara is running 310 secs || 185102073 markings, 263161152 edges, 613657 markings/sec, 310 secs
lola: sara is running 315 secs || 188099383 markings, 267421299 edges, 599462 markings/sec, 315 secs
lola: sara is running 320 secs || 191164322 markings, 271779535 edges, 612988 markings/sec, 320 secs
lola: sara is running 325 secs || 194116403 markings, 275976900 edges, 590416 markings/sec, 325 secs
lola: sara is running 330 secs || 197071691 markings, 280178259 edges, 591058 markings/sec, 330 secs
lola: sara is running 335 secs || 199951309 markings, 284272374 edges, 575924 markings/sec, 335 secs
lola: sara is running 340 secs || 202992865 markings, 288595875 edges, 608311 markings/sec, 340 secs
lola: sara is running 345 secs || 203010751 markings, 288623148 edges, 3577 markings/sec, 345 secs
lola: sara is running 350 secs || 203185043 markings, 288869148 edges, 34858 markings/sec, 350 secs
lola: sara is running 355 secs || 203185097 markings, 288869221 edges, 11 markings/sec, 355 secs
lola: sara is running 360 secs || 203207178 markings, 288902342 edges, 4416 markings/sec, 360 secs
lola: sara is running 365 secs || 203250327 markings, 288964054 edges, 8630 markings/sec, 365 secs
lola: sara is running 370 secs || 203265111 markings, 288984118 edges, 2957 markings/sec, 370 secs
lola: sara is running 375 secs || 203265225 markings, 288984272 edges, 23 markings/sec, 375 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3178 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(k3) AND FIREABLE(k6) AND NOT FIREABLE(k10) AND FIREABLE(k15) AND FIREABLE(k13) AND FIREABLE(k2) AND FIREABLE(k21) AND ((NOT FIREABLE(k20) AND NOT FIREABLE(k29)) OR (FIREABLE(k25) AND (FIREABLE(k7)))))))
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(k3) AND FIREABLE(k6) AND NOT FIREABLE(k10) AND FIREABLE(k15) AND FIREABLE(k13) AND FIREABLE(k2) AND FIREABLE(k21) AND ((NOT FIREABLE(k20) AND NOT FIREABLE(k29)) OR (FIREABLE(k25) AND (FIREABLE(k7)))))))
lola: processed formula length: 219
lola: 7 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(k3) AND FIREABLE(k6) AND NOT FIREABLE(k10) AND FIREABLE(k15) AND FIREABLE(k13) AND FIREABLE(k2) AND FIREABLE(k21) AND ((NOT FIREABLE(k20) AND NOT FIREABLE(k29)) OR (FIREABLE(k25) AND (FIREABLE(k7)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-15-0.sara.
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(k2) OR FIREABLE(k16) OR FIREABLE(k25) OR NOT FIREABLE(k22) OR FIREABLE(k4) OR FIREABLE(k17) OR FIREABLE(k19) OR (NOT FIREABLE(k17) AND (FIREABLE(k15) OR FIREABLE(k7))))))
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(k2) OR FIREABLE(k16) OR FIREABLE(k25) OR NOT FIREABLE(k22) OR FIREABLE(k4) OR FIREABLE(k17) OR FIREABLE(k19) OR (NOT FIREABLE(k17) AND (FIREABLE(k15) OR FIREABLE(k7))))))
lola: processed formula length: 198
lola: 8 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(k2) AND NOT FIREABLE(k16) AND NOT FIREABLE(k25) AND FIREABLE(k22) AND NOT FIREABLE(k4) AND NOT FIREABLE(k17) AND NOT FIREABLE(k19) AND (FIREABLE(k17) OR (NOT FIREABLE(k15) AND NOT FIREABLE(k7))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 160 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-16-0.sara.
lola: sara is running 0 secs || 3098298 markings, 4396362 edges, 619660 markings/sec, 0 secs
lola: sara is running 5 secs || 6023759 markings, 8555847 edges, 585092 markings/sec, 5 secs
lola: sara is running 10 secs || 8950548 markings, 12717131 edges, 585358 markings/sec, 10 secs
lola: sara is running 15 secs || 11774686 markings, 16732608 edges, 564828 markings/sec, 15 secs
lola: sara is running 20 secs || 14678177 markings, 20859310 edges, 580698 markings/sec, 20 secs
lola: sara is running 25 secs || 17526837 markings, 24909473 edges, 569732 markings/sec, 25 secs
lola: sara is running 30 secs || 20330690 markings, 28896390 edges, 560771 markings/sec, 30 secs
lola: sara is running 35 secs || 23097951 markings, 32831476 edges, 553452 markings/sec, 35 secs
lola: sara is running 40 secs || 25877939 markings, 36783571 edges, 555998 markings/sec, 40 secs
lola: sara is running 45 secs || 28895180 markings, 41071769 edges, 603448 markings/sec, 45 secs
lola: sara is running 50 secs || 31791622 markings, 45191602 edges, 579288 markings/sec, 50 secs
lola: sara is running 55 secs || 34665542 markings, 49277770 edges, 574784 markings/sec, 55 secs
lola: sara is running 60 secs || 37447821 markings, 53233529 edges, 556456 markings/sec, 60 secs
lola: sara is running 65 secs || 40349988 markings, 57358402 edges, 580433 markings/sec, 65 secs
lola: sara is running 70 secs || 43138002 markings, 61321889 edges, 557603 markings/sec, 70 secs
lola: sara is running 75 secs || 45918082 markings, 65274610 edges, 556016 markings/sec, 75 secs
lola: sara is running 80 secs || 48612692 markings, 69105069 edges, 538922 markings/sec, 80 secs
lola: sara is running 85 secs || 51393573 markings, 73058832 edges, 556176 markings/sec, 85 secs
lola: sara is running 90 secs || 54247575 markings, 77118182 edges, 570800 markings/sec, 90 secs
lola: sara is running 95 secs || 57004802 markings, 81036731 edges, 551445 markings/sec, 95 secs
lola: sara is running 100 secs || 59726406 markings, 84906938 edges, 544321 markings/sec, 100 secs
lola: sara is running 105 secs || 62384147 markings, 88686051 edges, 531548 markings/sec, 105 secs
lola: sara is running 110 secs || 65162199 markings, 92635046 edges, 555610 markings/sec, 110 secs
lola: sara is running 115 secs || 67844749 markings, 96448639 edges, 536510 markings/sec, 115 secs
lola: sara is running 120 secs || 70473433 markings, 100185976 edges, 525737 markings/sec, 120 secs
lola: sara is running 125 secs || 73321099 markings, 104236420 edges, 569533 markings/sec, 125 secs
lola: sara is running 130 secs || 76270195 markings, 108428282 edges, 589819 markings/sec, 130 secs
lola: sara is running 135 secs || 79430361 markings, 112922061 edges, 632033 markings/sec, 135 secs
lola: sara is running 140 secs || 82521655 markings, 117316063 edges, 618259 markings/sec, 140 secs
lola: sara is running 145 secs || 85574431 markings, 121657794 edges, 610555 markings/sec, 145 secs
lola: sara is running 150 secs || 88589464 markings, 125942766 edges, 603007 markings/sec, 150 secs
lola: sara is running 155 secs || 91626644 markings, 130262552 edges, 607436 markings/sec, 155 secs
lola: sara is running 160 secs || 94584193 markings, 134465585 edges, 591510 markings/sec, 160 secs
lola: sara is running 165 secs || 97524779 markings, 138647208 edges, 588117 markings/sec, 165 secs
lola: sara is running 170 secs || 100403390 markings, 142739697 edges, 575722 markings/sec, 170 secs
lola: sara is running 175 secs || 103461891 markings, 147087839 edges, 611700 markings/sec, 175 secs
lola: sara is running 180 secs || 106394124 markings, 151256512 edges, 586447 markings/sec, 180 secs
lola: sara is running 185 secs || 109345882 markings, 155454837 edges, 590352 markings/sec, 185 secs
lola: sara is running 190 secs || 112202533 markings, 159514627 edges, 571330 markings/sec, 190 secs
lola: sara is running 195 secs || 115149406 markings, 163705982 edges, 589375 markings/sec, 195 secs
lola: sara is running 200 secs || 118019752 markings, 167785247 edges, 574069 markings/sec, 200 secs
lola: sara is running 205 secs || 120866185 markings, 171833777 edges, 569287 markings/sec, 205 secs
lola: sara is running 210 secs || 123653676 markings, 175796553 edges, 557498 markings/sec, 210 secs
lola: sara is running 215 secs || 126577526 markings, 179953849 edges, 584770 markings/sec, 215 secs
lola: sara is running 220 secs || 129605959 markings, 184259388 edges, 605687 markings/sec, 220 secs
lola: sara is running 225 secs || 132569851 markings, 188472866 edges, 592778 markings/sec, 225 secs
lola: sara is running 230 secs || 135485994 markings, 192617864 edges, 583229 markings/sec, 230 secs
lola: sara is running 235 secs || 138366382 markings, 196713022 edges, 576078 markings/sec, 235 secs
lola: sara is running 240 secs || 141297141 markings, 200879695 edges, 586152 markings/sec, 240 secs
lola: sara is running 245 secs || 144121281 markings, 204895364 edges, 564828 markings/sec, 245 secs
lola: sara is running 250 secs || 146963201 markings, 208935786 edges, 568384 markings/sec, 250 secs
lola: sara is running 255 secs || 149740892 markings, 212884640 edges, 555538 markings/sec, 255 secs
lola: sara is running 260 secs || 152699110 markings, 217091732 edges, 591644 markings/sec, 260 secs
lola: sara is running 265 secs || 155578814 markings, 221185962 edges, 575941 markings/sec, 265 secs
lola: sara is running 270 secs || 158442215 markings, 225257754 edges, 572680 markings/sec, 270 secs
lola: sara is running 275 secs || 161230813 markings, 229222345 edges, 557720 markings/sec, 275 secs
lola: sara is running 280 secs || 164059686 markings, 233244439 edges, 565775 markings/sec, 280 secs
lola: sara is running 285 secs || 166892143 markings, 237271395 edges, 566491 markings/sec, 285 secs
lola: sara is running 290 secs || 169666491 markings, 241215642 edges, 554870 markings/sec, 290 secs
lola: sara is running 295 secs || 172437750 markings, 245153928 edges, 554252 markings/sec, 295 secs
lola: sara is running 300 secs || 175143410 markings, 249002497 edges, 541132 markings/sec, 300 secs
lola: sara is running 305 secs || 178382482 markings, 253606515 edges, 647814 markings/sec, 305 secs
lola: sara is running 310 secs || 181505216 markings, 258046340 edges, 624547 markings/sec, 310 secs
lola: sara is running 315 secs || 184621008 markings, 262476743 edges, 623158 markings/sec, 315 secs
lola: sara is running 320 secs || 187627977 markings, 266752494 edges, 601394 markings/sec, 320 secs
lola: sara is running 325 secs || 190737677 markings, 271172135 edges, 621940 markings/sec, 325 secs
lola: sara is running 330 secs || 193727810 markings, 275424750 edges, 598027 markings/sec, 330 secs
lola: sara is running 335 secs || 196728415 markings, 279690310 edges, 600121 markings/sec, 335 secs
lola: sara is running 340 secs || 199634910 markings, 283823436 edges, 581299 markings/sec, 340 secs
lola: sara is running 345 secs || 202707708 markings, 288191825 edges, 614560 markings/sec, 345 secs
lola: sara is running 350 secs || 203086411 markings, 288728983 edges, 75741 markings/sec, 350 secs
lola: sara is running 355 secs || 203127608 markings, 288788047 edges, 8239 markings/sec, 355 secs
lola: sara is running 360 secs || 203134281 markings, 288797103 edges, 1335 markings/sec, 360 secs
lola: sara is running 365 secs || 203166843 markings, 288844448 edges, 6512 markings/sec, 365 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes yes no yes no yes unknown no yes no yes yes no no no yes
lola:
preliminary result: yes yes no yes no yes unknown no yes no yes yes no no no yes
lola: memory consumption: 13172 KB
lola: time consumption: 765 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
BK_STOP 1552901597559
--------------------
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="MAPK-PT-10240"
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-3957"
echo " Executing tool lola"
echo " Input is MAPK-PT-10240, 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 r093-smll-155246584400342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-10240.tgz
mv MAPK-PT-10240 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 ;