About the Execution of LoLA for FlexibleBarrier-PT-12b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5694.480 | 639106.00 | 1310244.00 | 104.70 | FTFTTTTFTTTTTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2019-input.r082-csrt-155246549100216.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is FlexibleBarrier-PT-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-csrt-155246549100216
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 3.4K Feb 11 00:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 11 00:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 6 22:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 6 22:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.3K Feb 4 23:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.1K Feb 4 23:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.2K Feb 4 22:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 3 08:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 3 08:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Jan 31 01:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Jan 31 01:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 0 Jan 29 09:34 model-fix.log
-rw-r--r-- 1 mcc users 536K Mar 10 17:31 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1552659635643
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ FlexibleBarrier-PT-12b @ 3570 seconds
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2931
rslt: Output for ReachabilityFireability @ FlexibleBarrier-PT-12b
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Mar 15 14:20:35 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(t1159)))",
"processed_size": 23,
"rewrites": 1
},
"result":
{
"edges": 31,
"markings": 32,
"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": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "E (F ((NOT FIREABLE(t1309) AND FIREABLE(t1851))))",
"processed_size": 49,
"rewrites": 1
},
"result":
{
"edges": 176,
"markings": 177,
"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": 2,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (G ((NOT FIREABLE(t2164) OR NOT FIREABLE(t1376))))",
"processed_size": 53,
"rewrites": 2
},
"result":
{
"edges": 30,
"markings": 31,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"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": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "E (F ((NOT FIREABLE(t829) AND FIREABLE(t601))))",
"processed_size": 47,
"rewrites": 1
},
"result":
{
"edges": 33,
"markings": 34,
"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": 2,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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 ((NOT FIREABLE(t1913) OR (FIREABLE(t325) AND NOT FIREABLE(t557)))))",
"processed_size": 73,
"rewrites": 2
},
"result":
{
"edges": 31,
"markings": 32,
"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": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "E (F ((NOT FIREABLE(t1398) AND ((FIREABLE(t158) AND FIREABLE(t1458)) OR FIREABLE(t348)))))",
"processed_size": 91,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "E (F ((((NOT FIREABLE(t2247) AND NOT FIREABLE(t358)) OR (NOT FIREABLE(t1359) AND NOT FIREABLE(t1684))) AND FIREABLE(t1538))))",
"processed_size": 126,
"rewrites": 1
},
"result":
{
"edges": 27,
"markings": 28,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 4
},
"type": "reachability",
"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": 5,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "A (G (((FIREABLE(t978) AND FIREABLE(t735) AND FIREABLE(t1228) AND FIREABLE(t2072)) OR NOT FIREABLE(t1643))))",
"processed_size": 109,
"rewrites": 2
},
"result":
{
"edges": 29,
"markings": 30,
"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": 12,
"problems": 6
},
"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": 2,
"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 ((NOT FIREABLE(t1444) AND (FIREABLE(t2139) OR FIREABLE(t913) OR NOT FIREABLE(t1371) OR (FIREABLE(t856) AND FIREABLE(t2078))))))",
"processed_size": 135,
"rewrites": 2
},
"result":
{
"edges": 28,
"markings": 29,
"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": 49,
"problems": 13
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 6,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F ((FIREABLE(t245) AND ((FIREABLE(t1659) AND FIREABLE(t1242)) OR (FIREABLE(t2225) AND FIREABLE(t1316)) OR FIREABLE(t924)))))",
"processed_size": 129,
"rewrites": 1
},
"result":
{
"edges": 24,
"markings": 25,
"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": 10,
"problems": 3
},
"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": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "E (F ((NOT FIREABLE(t1625) AND (NOT FIREABLE(t915) OR NOT FIREABLE(t878)) AND (FIREABLE(t1568) OR FIREABLE(t877) OR FIREABLE(t56) OR FIREABLE(t2266)))))",
"processed_size": 156,
"rewrites": 1
},
"result":
{
"edges": 32,
"markings": 33,
"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": 24,
"problems": 8
},
"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": 1,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 6,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "E (F ((FIREABLE(t1009) OR (FIREABLE(t835) AND FIREABLE(t1475) AND FIREABLE(t267) AND (FIREABLE(t2139) OR FIREABLE(t522)) AND NOT FIREABLE(t1309)))))",
"processed_size": 150,
"rewrites": 1
},
"result":
{
"edges": 24,
"markings": 25,
"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": 13,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"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": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "E (F (((NOT FIREABLE(t1449) OR FIREABLE(t2109) OR (NOT FIREABLE(t2261) AND NOT FIREABLE(t802))) AND (FIREABLE(t543) OR (FIREABLE(t605) AND FIREABLE(t488))))))",
"processed_size": 161,
"rewrites": 1
},
"result":
{
"edges": 31,
"markings": 32,
"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": 35,
"problems": 10
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"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": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 8,
"unfir": 5,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "E (F (((NOT FIREABLE(t350) OR NOT FIREABLE(t1656)) AND ((FIREABLE(t1048) AND FIREABLE(t52)) OR FIREABLE(t1312)) AND NOT FIREABLE(t1220) AND NOT FIREABLE(t188) AND NOT FIREABLE(t1168))))",
"processed_size": 187,
"rewrites": 1
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 22,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 4,
"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": 8,
"unfir": 6,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "A (G (((NOT FIREABLE(t683) AND (NOT FIREABLE(t1497) OR NOT FIREABLE(t567))) OR (NOT FIREABLE(t1069) AND (FIREABLE(t173) OR FIREABLE(t118)) AND (NOT FIREABLE(t2203) OR NOT FIREABLE(t761))))))",
"processed_size": 194,
"rewrites": 2
},
"result":
{
"edges": 31,
"markings": 32,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 23,
"problems": 6
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3562
},
"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": 10,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "E (F (((FIREABLE(t437) OR FIREABLE(t941)) AND (FIREABLE(t2236) OR FIREABLE(t1934)) AND NOT FIREABLE(t258) AND FIREABLE(t466) AND ((NOT FIREABLE(t358) AND NOT FIREABLE(t655)) OR (NOT FIREABLE(t1849) AND FIREABLE(t2062))))))",
"processed_size": 225,
"rewrites": 1
},
"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": 64,
"problems": 8
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 40760,
"runtime": 639.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(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 5727,
"conflict_clusters": 1541,
"places": 1988,
"places_significant": 1974,
"singleton_clusters": 0,
"transitions": 2289
},
"result":
{
"preliminary_value": "no yes no yes yes yes yes no yes yes yes yes yes no yes no ",
"value": "no yes no yes yes yes yes no yes yes yes yes yes no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 4277/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1988
lola: finding significant places
lola: 1988 places, 2289 transitions, 1974 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(t1913) OR (FIREABLE(t325) AND NOT FIREABLE(t557))))) : E (F ((NOT FIREABLE(t1309) AND FIREABLE(t1851)))) : A (G ((NOT FIREABLE(t1444) AND (FIREABLE(t2139) OR FIREABLE(t913) OR NOT FIREABLE(t1371) OR (FIREABLE(t856) AND FIREABLE(t2078)))))) : E (F ((FIREABLE(t245) AND ((FIREABLE(t1659) AND FIREABLE(t1242)) OR (FIREABLE(t2225) AND FIREABLE(t1316)) OR FIREABLE(t924))))) : E (F (((FIREABLE(t437) OR FIREABLE(t941)) AND (FIREABLE(t2236) OR FIREABLE(t1934)) AND NOT FIREABLE(t258) AND FIREABLE(t466) AND ((NOT FIREABLE(t358) AND NOT FIREABLE(t655)) OR (NOT FIREABLE(t1849) AND FIREABLE(t2062)))))) : E (F ((NOT FIREABLE(t1625) AND (NOT FIREABLE(t915) OR NOT FIREABLE(t878)) AND (FIREABLE(t1568) OR FIREABLE(t877) OR FIREABLE(t56) OR FIREABLE(t2266))))) : E (F (((NOT FIREABLE(t350) OR NOT FIREABLE(t1656)) AND ((FIREABLE(t1048) AND FIREABLE(t52)) OR FIREABLE(t1312)) AND NOT FIREABLE(t1220) AND NOT FIREABLE(t188) AND NOT FIREABLE(t1168)))) : A (G (((NOT FIREABLE(t683) AND (NOT FIREABLE(t1497) OR NOT FIREABLE(t567))) OR (NOT FIREABLE(t1069) AND (FIREABLE(t173) OR FIREABLE(t118)) AND (NOT FIREABLE(t2203) OR NOT FIREABLE(t761)))))) : E (F ((FIREABLE(t1009) OR (FIREABLE(t835) AND FIREABLE(t1475) AND FIREABLE(t267) AND (FIREABLE(t2139) OR FIREABLE(t522)) AND NOT FIREABLE(t1309))))) : E (F (((NOT FIREABLE(t1449) OR FIREABLE(t2109) OR (NOT FIREABLE(t2261) AND NOT FIREABLE(t802))) AND (FIREABLE(t543) OR (FIREABLE(t605) AND FIREABLE(t488)))))) : E (F ((NOT FIREABLE(t1398) AND ((FIREABLE(t158) AND FIREABLE(t1458)) OR FIREABLE(t348))))) : E (F ((((NOT FIREABLE(t2247) AND NOT FIREABLE(t358)) OR (NOT FIREABLE(t1359) AND NOT FIREABLE(t1684))) AND FIREABLE(t1538)))) : E (F (FIREABLE(t1159))) : A (G ((NOT FIREABLE(t2164) OR NOT FIREABLE(t1376)))) : E (F ((NOT FIREABLE(t829) AND FIREABLE(t601)))) : A (G (((FIREABLE(t978) AND FIREABLE(t735) AND FIREABLE(t1228) AND FIREABLE(t2072)) OR NOT FIREABLE(t1643))))
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(t1159)))
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(t1159)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(t1159)
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: 32 markings, 31 edges
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t1309) AND FIREABLE(t1851))))
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(t1309) AND FIREABLE(t1851))))
lola: processed formula length: 49
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: write sara problem file to ReachabilityFireability-0.sara
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(t1309) AND FIREABLE(t1851))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 177 markings, 176 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t2164) OR NOT FIREABLE(t1376))))
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(t2164) OR NOT FIREABLE(t1376))))
lola: processed formula length: 53
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(t2164) AND FIREABLE(t1376))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 31 markings, 30 edges
sara: try reading problem file ReachabilityFireability-0.sara.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t829) AND FIREABLE(t601))))
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(t829) AND FIREABLE(t601))))
lola: processed formula length: 47
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(t829) AND FIREABLE(t601))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
sara: could not read problem information -- aborting [#01]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 34 markings, 33 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1913) OR (FIREABLE(t325) AND NOT FIREABLE(t557)))))
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(t1913) OR (FIREABLE(t325) AND NOT FIREABLE(t557)))))
lola: processed formula length: 73
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(t1913) AND (NOT FIREABLE(t325) OR FIREABLE(t557)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t1398) AND ((FIREABLE(t158) AND FIREABLE(t1458)) OR FIREABLE(t348)))))
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(t1398) AND ((FIREABLE(t158) AND FIREABLE(t1458)) OR FIREABLE(t348)))))
lola: processed formula length: 91
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(t1398) AND ((FIREABLE(t158) AND FIREABLE(t1458)) OR FIREABLE(t348)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((NOT FIREABLE(t2247) AND NOT FIREABLE(t358)) OR (NOT FIREABLE(t1359) AND NOT FIREABLE(t1684))) AND FIREABLE(t1538))))
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(t2247) AND NOT FIREABLE(t358)) OR (NOT FIREABLE(t1359) AND NOT FIREABLE(t1684))) AND FIREABLE(t1538))))
lola: processed formula length: 126
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(t2247) AND NOT FIREABLE(t358)) OR (NOT FIREABLE(t1359) AND NOT FIREABLE(t1684))) AND FIREABLE(t1538))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 28 markings, 27 edges
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t978) AND FIREABLE(t735) AND FIREABLE(t1228) AND FIREABLE(t2072)) OR NOT FIREABLE(t1643))))
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(t978) AND FIREABLE(t735) AND FIREABLE(t1228) AND FIREABLE(t2072)) OR NOT FIREABLE(t1643))))
lola: processed formula length: 109
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(t978) OR NOT FIREABLE(t735) OR NOT FIREABLE(t1228) OR NOT FIREABLE(t2072)) AND FIREABLE(t1643))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1444) AND (FIREABLE(t2139) OR FIREABLE(t913) OR NOT FIREABLE(t1371) OR (FIREABLE(t856) AND FIREABLE(t2078))))))
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(t1444) AND (FIREABLE(t2139) OR FIREABLE(t913) OR NOT FIREABLE(t1371) OR (FIREABLE(t856) AND FIREABLE(t2078))))))
lola: processed formula length: 135
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(t1444) OR (NOT FIREABLE(t2139) AND NOT FIREABLE(t913) AND FIREABLE(t1371) AND (NOT FIREABLE(t856) OR NOT FIREABLE(t2078))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 49 literals and 13 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 29 markings, 28 edges
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: ========================================
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t245) AND ((FIREABLE(t1659) AND FIREABLE(t1242)) OR (FIREABLE(t2225) AND FIREABLE(t1316)) OR FIREABLE(t924)))))
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(t245) AND ((FIREABLE(t1659) AND FIREABLE(t1242)) OR (FIREABLE(t2225) AND FIREABLE(t1316)) OR FIREABLE(t924)))))
lola: processed formula length: 129
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(t245) AND ((FIREABLE(t1659) AND FIREABLE(t1242)) OR (FIREABLE(t2225) AND FIREABLE(t1316)) OR FIREABLE(t924)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25 markings, 24 edges
lola: state equation: write sara problem file to ReachabilityFireability-9-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t1625) AND (NOT FIREABLE(t915) OR NOT FIREABLE(t878)) AND (FIREABLE(t1568) OR FIREABLE(t877) OR FIREABLE(t56) OR FIREABLE(t2266)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file ReachabilityFireability-9-0.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((NOT FIREABLE(t1625) AND (NOT FIREABLE(t915) OR NOT FIREABLE(t878)) AND (FIREABLE(t1568) OR FIREABLE(t877) OR FIREABLE(t56) OR FIREABLE(t2266)))))
lola: processed formula length: 156
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(t1625) AND (NOT FIREABLE(t915) OR NOT FIREABLE(t878)) AND (FIREABLE(t1568) OR FIREABLE(t877) OR FIREABLE(t56) OR FIREABLE(t2266)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 33 markings, 32 edges
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1009) OR (FIREABLE(t835) AND FIREABLE(t1475) AND FIREABLE(t267) AND (FIREABLE(t2139) OR FIREABLE(t522)) AND NOT FIREABLE(t1309)))))
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(t1009) OR (FIREABLE(t835) AND FIREABLE(t1475) AND FIREABLE(t267) AND (FIREABLE(t2139) OR FIREABLE(t522)) AND NOT FIREABLE(t1309)))))
lola: processed formula length: 150
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(t1009) OR (FIREABLE(t835) AND FIREABLE(t1475) AND FIREABLE(t267) AND (FIREABLE(t2139) OR FIREABLE(t522)) AND NOT FIREABLE(t1309)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 13 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25 markings, 24 edges
lola: ========================================
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t1449) OR FIREABLE(t2109) OR (NOT FIREABLE(t2261) AND NOT FIREABLE(t802))) AND (FIREABLE(t543) OR (FIREABLE(t605) AND FIREABLE(t488))))))
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(t1449) OR FIREABLE(t2109) OR (NOT FIREABLE(t2261) AND NOT FIREABLE(t802))) AND (FIREABLE(t543) OR (FIREABLE(t605) AND FIREABLE(t488))))))
lola: processed formula length: 161
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(t1449) OR FIREABLE(t2109) OR (NOT FIREABLE(t2261) AND NOT FIREABLE(t802))) AND (FIREABLE(t543) OR (FIREABLE(t605) AND FIREABLE(t488))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 35 literals and 10 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 13 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t350) OR NOT FIREABLE(t1656)) AND ((FIREABLE(t1048) AND FIREABLE(t52)) OR FIREABLE(t1312)) AND NOT FIREABLE(t1220) AND NOT FIREABLE(t188) AND NOT FIREABLE(t1168))))
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(t350) OR NOT FIREABLE(t1656)) AND ((FIREABLE(t1048) AND FIREABLE(t52)) OR FIREABLE(t1312)) AND NOT FIREABLE(t1220) AND NOT FIREABLE(t188) AND NOT FIREABLE(t1168))))
lola: processed formula length: 187
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(t350) OR NOT FIREABLE(t1656)) AND ((FIREABLE(t1048) AND FIREABLE(t52)) OR FIREABLE(t1312)) AND NOT FIREABLE(t1220) AND NOT FIREABLE(t188) AND NOT FIREABLE(t1168))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 22 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26 markings, 25 edges
lola: ========================================
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t683) AND (NOT FIREABLE(t1497) OR NOT FIREABLE(t567))) OR (NOT FIREABLE(t1069) AND (FIREABLE(t173) OR FIREABLE(t118)) AND (NOT FIREABLE(t2203) OR NOT FIREABLE(t761))))))
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(t683) AND (NOT FIREABLE(t1497) OR NOT FIREABLE(t567))) OR (NOT FIREABLE(t1069) AND (FIREABLE(t173) OR FIREABLE(t118)) AND (NOT FIREABLE(t2203) OR NOT FIREABLE(t761))))))
lola: processed formula length: 194
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(t683) OR (FIREABLE(t1497) AND FIREABLE(t567))) AND (FIREABLE(t1069) OR (NOT FIREABLE(t173) AND NOT FIREABLE(t118)) OR (FIREABLE(t2203) AND FIREABLE(t761))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 23 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 15 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t437) OR FIREABLE(t941)) AND (FIREABLE(t2236) OR FIREABLE(t1934)) AND NOT FIREABLE(t258) AND FIREABLE(t466) AND ((NOT FIREABLE(t358) AND NOT FIREABLE(t655)) OR (NOT FIREABLE(t1849) AND FIREABLE(t2062))))))
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(t437) OR FIREABLE(t941)) AND (FIREABLE(t2236) OR FIREABLE(t1934)) AND NOT FIREABLE(t258) AND FIREABLE(t466) AND ((NOT FIREABLE(t358) AND NOT FIREABLE(t655)) OR (NOT FIREABLE(t1849) AND FIREABLE(t2062))))))
lola: processed formula length: 225
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(t437) OR FIREABLE(t941)) AND (FIREABLE(t2236) OR FIREABLE(t1934)) AND NOT FIREABLE(t258) AND FIREABLE(t466) AND ((NOT FIREABLE(t358) AND NOT FIREABLE(t655)) OR (NOT FIREABLE(t1849) AND FIREABLE(t2062))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 64 literals and 8 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.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 76825 markings, 141756 edges, 15365 markings/sec, 0 secs
lola: sara is running 5 secs || 141126 markings, 314164 edges, 12860 markings/sec, 5 secs
lola: sara is running 10 secs || 222289 markings, 470292 edges, 16233 markings/sec, 10 secs
lola: sara is running 15 secs || 286215 markings, 642660 edges, 12785 markings/sec, 15 secs
lola: sara is running 20 secs || 354343 markings, 785551 edges, 13626 markings/sec, 20 secs
lola: sara is running 25 secs || 413368 markings, 966176 edges, 11805 markings/sec, 25 secs
lola: sara is running 30 secs || 491686 markings, 1124082 edges, 15664 markings/sec, 30 secs
lola: sara is running 35 secs || 560896 markings, 1293789 edges, 13842 markings/sec, 35 secs
lola: sara is running 40 secs || 635231 markings, 1457442 edges, 14867 markings/sec, 40 secs
lola: sara is running 45 secs || 699753 markings, 1618744 edges, 12904 markings/sec, 45 secs
lola: sara is running 50 secs || 760263 markings, 1777498 edges, 12102 markings/sec, 50 secs
lola: sara is running 55 secs || 831723 markings, 1943801 edges, 14292 markings/sec, 55 secs
lola: sara is running 60 secs || 892486 markings, 2105396 edges, 12153 markings/sec, 60 secs
lola: sara is running 65 secs || 971875 markings, 2275819 edges, 15878 markings/sec, 65 secs
lola: sara is running 70 secs || 1038152 markings, 2442452 edges, 13255 markings/sec, 70 secs
lola: sara is running 75 secs || 1096354 markings, 2621582 edges, 11640 markings/sec, 75 secs
lola: sara is running 80 secs || 1167888 markings, 2773722 edges, 14307 markings/sec, 80 secs
lola: sara is running 85 secs || 1234232 markings, 2934563 edges, 13269 markings/sec, 85 secs
lola: sara is running 90 secs || 1296696 markings, 3095990 edges, 12493 markings/sec, 90 secs
lola: sara is running 95 secs || 1359702 markings, 3247794 edges, 12601 markings/sec, 95 secs
lola: sara is running 100 secs || 1423212 markings, 3414294 edges, 12702 markings/sec, 100 secs
lola: sara is running 105 secs || 1489424 markings, 3572051 edges, 13242 markings/sec, 105 secs
lola: sara is running 110 secs || 1560073 markings, 3724247 edges, 14130 markings/sec, 110 secs
lola: sara is running 115 secs || 1624669 markings, 3887734 edges, 12919 markings/sec, 115 secs
lola: sara is running 120 secs || 1691326 markings, 4047373 edges, 13331 markings/sec, 120 secs
lola: sara is running 125 secs || 1763245 markings, 4207440 edges, 14384 markings/sec, 125 secs
lola: sara is running 130 secs || 1832499 markings, 4374470 edges, 13851 markings/sec, 130 secs
lola: sara is running 135 secs || 1895965 markings, 4542474 edges, 12693 markings/sec, 135 secs
lola: sara is running 140 secs || 1970616 markings, 4705112 edges, 14930 markings/sec, 140 secs
lola: sara is running 145 secs || 2038889 markings, 4860657 edges, 13655 markings/sec, 145 secs
lola: sara is running 150 secs || 2108067 markings, 5036437 edges, 13836 markings/sec, 150 secs
lola: sara is running 155 secs || 2179078 markings, 5210110 edges, 14202 markings/sec, 155 secs
lola: sara is running 160 secs || 2255186 markings, 5376661 edges, 15222 markings/sec, 160 secs
lola: sara is running 165 secs || 2326452 markings, 5543534 edges, 14253 markings/sec, 165 secs
lola: sara is running 170 secs || 2389188 markings, 5709943 edges, 12547 markings/sec, 170 secs
lola: sara is running 175 secs || 2458279 markings, 5863683 edges, 13818 markings/sec, 175 secs
lola: sara is running 180 secs || 2528014 markings, 6022098 edges, 13947 markings/sec, 180 secs
lola: sara is running 185 secs || 2595988 markings, 6194129 edges, 13595 markings/sec, 185 secs
lola: sara is running 190 secs || 2664281 markings, 6357735 edges, 13659 markings/sec, 190 secs
lola: sara is running 195 secs || 2738361 markings, 6522830 edges, 14816 markings/sec, 195 secs
lola: sara is running 200 secs || 2808294 markings, 6689306 edges, 13987 markings/sec, 200 secs
lola: sara is running 205 secs || 2874691 markings, 6862551 edges, 13279 markings/sec, 205 secs
lola: sara is running 210 secs || 2947714 markings, 7027567 edges, 14605 markings/sec, 210 secs
lola: sara is running 215 secs || 3022117 markings, 7196422 edges, 14881 markings/sec, 215 secs
lola: sara is running 220 secs || 3091978 markings, 7366610 edges, 13972 markings/sec, 220 secs
lola: sara is running 225 secs || 3157430 markings, 7538572 edges, 13090 markings/sec, 225 secs
lola: sara is running 230 secs || 3232208 markings, 7698539 edges, 14956 markings/sec, 230 secs
lola: sara is running 235 secs || 3303239 markings, 7862644 edges, 14206 markings/sec, 235 secs
lola: sara is running 240 secs || 3369018 markings, 8032482 edges, 13156 markings/sec, 240 secs
lola: sara is running 245 secs || 3439224 markings, 8197048 edges, 14041 markings/sec, 245 secs
lola: sara is running 250 secs || 3513151 markings, 8362039 edges, 14785 markings/sec, 250 secs
lola: sara is running 255 secs || 3575759 markings, 8533939 edges, 12522 markings/sec, 255 secs
lola: sara is running 260 secs || 3644079 markings, 8693012 edges, 13664 markings/sec, 260 secs
lola: sara is running 265 secs || 3703343 markings, 8856405 edges, 11853 markings/sec, 265 secs
lola: sara is running 270 secs || 3757808 markings, 9010532 edges, 10893 markings/sec, 270 secs
lola: sara is running 275 secs || 3814148 markings, 9168848 edges, 11268 markings/sec, 275 secs
lola: sara is running 280 secs || 3873492 markings, 9334421 edges, 11869 markings/sec, 280 secs
lola: sara is running 285 secs || 3929780 markings, 9495210 edges, 11258 markings/sec, 285 secs
lola: sara is running 290 secs || 3987416 markings, 9661836 edges, 11527 markings/sec, 290 secs
lola: sara is running 295 secs || 4044195 markings, 9826992 edges, 11356 markings/sec, 295 secs
lola: sara is running 300 secs || 4101684 markings, 9995216 edges, 11498 markings/sec, 300 secs
lola: sara is running 305 secs || 4161677 markings, 10162495 edges, 11999 markings/sec, 305 secs
lola: sara is running 310 secs || 4221853 markings, 10330193 edges, 12035 markings/sec, 310 secs
lola: sara is running 315 secs || 4281379 markings, 10500055 edges, 11905 markings/sec, 315 secs
lola: sara is running 320 secs || 4338275 markings, 10663991 edges, 11379 markings/sec, 320 secs
lola: sara is running 325 secs || 4395539 markings, 10839045 edges, 11453 markings/sec, 325 secs
lola: sara is running 330 secs || 4454187 markings, 11001187 edges, 11730 markings/sec, 330 secs
lola: sara is running 335 secs || 4514262 markings, 11169036 edges, 12015 markings/sec, 335 secs
lola: sara is running 340 secs || 4574570 markings, 11337130 edges, 12062 markings/sec, 340 secs
lola: sara is running 345 secs || 4634136 markings, 11507689 edges, 11913 markings/sec, 345 secs
lola: sara is running 350 secs || 4693792 markings, 11678233 edges, 11931 markings/sec, 350 secs
lola: sara is running 355 secs || 4746757 markings, 11864372 edges, 10593 markings/sec, 355 secs
lola: sara is running 360 secs || 4802711 markings, 12042034 edges, 11191 markings/sec, 360 secs
lola: sara is running 365 secs || 4858104 markings, 12222063 edges, 11079 markings/sec, 365 secs
lola: sara is running 370 secs || 4911947 markings, 12397211 edges, 10769 markings/sec, 370 secs
lola: sara is running 375 secs || 4965969 markings, 12573643 edges, 10804 markings/sec, 375 secs
lola: sara is running 380 secs || 5015764 markings, 12736560 edges, 9959 markings/sec, 380 secs
lola: sara is running 385 secs || 5065839 markings, 12901185 edges, 10015 markings/sec, 385 secs
lola: sara is running 390 secs || 5118247 markings, 13073184 edges, 10482 markings/sec, 390 secs
lola: sara is running 395 secs || 5174055 markings, 13251864 edges, 11162 markings/sec, 395 secs
lola: sara is running 400 secs || 5226148 markings, 13437096 edges, 10419 markings/sec, 400 secs
lola: sara is running 405 secs || 5276957 markings, 13629283 edges, 10162 markings/sec, 405 secs
lola: sara is running 410 secs || 5330412 markings, 13822129 edges, 10691 markings/sec, 410 secs
lola: sara is running 415 secs || 5385574 markings, 14017992 edges, 11032 markings/sec, 415 secs
lola: sara is running 420 secs || 5437471 markings, 14220204 edges, 10379 markings/sec, 420 secs
lola: sara is running 425 secs || 5495720 markings, 14384279 edges, 11650 markings/sec, 425 secs
lola: sara is running 430 secs || 5555067 markings, 14543706 edges, 11869 markings/sec, 430 secs
lola: sara is running 435 secs || 5603004 markings, 14728514 edges, 9587 markings/sec, 435 secs
lola: sara is running 440 secs || 5654789 markings, 14906166 edges, 10357 markings/sec, 440 secs
lola: sara is running 445 secs || 5664100 markings, 15169666 edges, 1862 markings/sec, 445 secs
lola: sara is running 450 secs || 5724014 markings, 15365599 edges, 11983 markings/sec, 450 secs
lola: sara is running 455 secs || 5787973 markings, 15541076 edges, 12792 markings/sec, 455 secs
lola: sara is running 460 secs || 5859715 markings, 15699065 edges, 14348 markings/sec, 460 secs
lola: sara is running 465 secs || 5931473 markings, 15851297 edges, 14352 markings/sec, 465 secs
lola: sara is running 470 secs || 5991751 markings, 16011578 edges, 12056 markings/sec, 470 secs
lola: sara is running 475 secs || 6057626 markings, 16149419 edges, 13175 markings/sec, 475 secs
lola: sara is running 480 secs || 6120907 markings, 16315396 edges, 12656 markings/sec, 480 secs
lola: sara is running 485 secs || 6188926 markings, 16482612 edges, 13604 markings/sec, 485 secs
lola: sara is running 490 secs || 6246169 markings, 16657647 edges, 11449 markings/sec, 490 secs
lola: sara is running 495 secs || 6326280 markings, 16815474 edges, 16022 markings/sec, 495 secs
lola: sara is running 500 secs || 6395539 markings, 16977488 edges, 13852 markings/sec, 500 secs
lola: sara is running 505 secs || 6460934 markings, 17135863 edges, 13079 markings/sec, 505 secs
lola: sara is running 510 secs || 6526582 markings, 17293304 edges, 13130 markings/sec, 510 secs
lola: sara is running 515 secs || 6590744 markings, 17464245 edges, 12832 markings/sec, 515 secs
lola: sara is running 520 secs || 6653218 markings, 17637853 edges, 12495 markings/sec, 520 secs
lola: sara is running 525 secs || 6730147 markings, 17800867 edges, 15386 markings/sec, 525 secs
lola: sara is running 530 secs || 6796935 markings, 17966047 edges, 13358 markings/sec, 530 secs
lola: sara is running 535 secs || 6860887 markings, 18114164 edges, 12790 markings/sec, 535 secs
lola: sara is running 540 secs || 6922744 markings, 18281455 edges, 12371 markings/sec, 540 secs
lola: sara is running 545 secs || 6991454 markings, 18453626 edges, 13742 markings/sec, 545 secs
lola: sara is running 550 secs || 7053823 markings, 18624075 edges, 12474 markings/sec, 550 secs
lola: sara is running 555 secs || 7123410 markings, 18774629 edges, 13917 markings/sec, 555 secs
lola: sara is running 560 secs || 7184792 markings, 18931860 edges, 12276 markings/sec, 560 secs
lola: sara is running 565 secs || 7244667 markings, 19078777 edges, 11975 markings/sec, 565 secs
lola: sara is running 570 secs || 7308602 markings, 19234967 edges, 12787 markings/sec, 570 secs
lola: sara is running 575 secs || 7377347 markings, 19386745 edges, 13749 markings/sec, 575 secs
lola: sara is running 580 secs || 7445158 markings, 19544596 edges, 13562 markings/sec, 580 secs
lola: sara is running 585 secs || 7514740 markings, 19703329 edges, 13916 markings/sec, 585 secs
lola: sara is running 590 secs || 7589298 markings, 19870365 edges, 14912 markings/sec, 590 secs
lola: sara is running 595 secs || 7655861 markings, 20048002 edges, 13313 markings/sec, 595 secs
lola: sara is running 600 secs || 7734125 markings, 20205285 edges, 15653 markings/sec, 600 secs
lola: sara is running 605 secs || 7799547 markings, 20372848 edges, 13084 markings/sec, 605 secs
lola: sara is running 610 secs || 7871260 markings, 20523696 edges, 14343 markings/sec, 610 secs
lola: sara is running 615 secs || 7938738 markings, 20688873 edges, 13496 markings/sec, 615 secs
lola: sara is running 620 secs || 8009785 markings, 20849475 edges, 14209 markings/sec, 620 secs
lola: sara is running 625 secs || 8082190 markings, 21013716 edges, 14481 markings/sec, 625 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes yes yes yes no yes yes yes yes yes no yes no
lola:
preliminary result: no yes no yes yes yes yes no yes yes yes yes yes no yes no
lola: memory consumption: 40760 KB
lola: time consumption: 639 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
BK_STOP 1552660274749
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-12b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool lola"
echo " Input is FlexibleBarrier-PT-12b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r082-csrt-155246549100216"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-12b.tgz
mv FlexibleBarrier-PT-12b 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 ;