About the Execution of LoLA for FamilyReunion-PT-L00050M0005C002P002G001
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4672.270 | 74057.00 | 141144.00 | 25.10 | FTFTFTTTTTTFFTTT | 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.r181-csrt-155344534900207.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 FamilyReunion-PT-L00050M0005C002P002G001, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r181-csrt-155344534900207
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.5M
-rw-r--r-- 1 mcc users 5.1K Mar 24 07:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 24 07:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Mar 24 06:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 24 06:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 24 06:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Mar 24 06:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 24 06:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 24 06:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 24 00:18 NewModel
-rw-r--r-- 1 mcc users 4.5K Mar 24 06:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 24 06:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 131 Mar 24 06:28 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 369 Mar 24 06:28 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.7K Mar 24 06:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 24 06:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 24 06:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 24 06:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 00:18 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 24 00:18 instance
-rw-r--r-- 1 mcc users 6 Mar 24 00:18 iscolored
-rw-r--r-- 1 mcc users 9.3M Mar 24 00:18 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 FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-00
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-01
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-02
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-03
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-04
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-05
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-06
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-07
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-08
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-09
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-10
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-11
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-12
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-13
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-14
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1553474343115
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ FamilyReunion-PT-L00050M0005C002P002G001 @ 3570 seconds
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3496
rslt: Output for ReachabilityFireability @ FamilyReunion-PT-L00050M0005C002P002G001
{
"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 25 00:39:03 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(Gate1ANDSplit_0_30)))",
"processed_size": 36,
"rewrites": 1
},
"result":
{
"edges": 53,
"markings": 54,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "E (F (FIREABLE(SendSuitabilityCertif_2_28)))",
"processed_size": 44,
"rewrites": 1
},
"result":
{
"edges": 36,
"markings": 37,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "E (F (FIREABLE(GiveAppoint_0_10)))",
"processed_size": 34,
"rewrites": 1
},
"result":
{
"edges": 43,
"markings": 44,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"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(ReceiveDocsObtained_2_49)))",
"processed_size": 42,
"rewrites": 1
},
"result":
{
"edges": 13,
"markings": 14,
"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": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (G (NOT FIREABLE(ChoseFamilyReunion_5_35)))",
"processed_size": 45,
"rewrites": 2
},
"result":
{
"edges": 8,
"markings": 9,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"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(ProvidePersonalnfo_24)))",
"processed_size": 39,
"rewrites": 1
},
"result":
{
"edges": 75,
"markings": 76,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"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(ReceiveLangChoice_5_36)))",
"processed_size": 40,
"rewrites": 1
},
"result":
{
"edges": 5,
"markings": 6,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "E (F ((FIREABLE(ReceiveLangChoice_3_20) OR (FIREABLE(GoToAppoint_33) AND FIREABLE(AccessMicTerminal_23)))))",
"processed_size": 108,
"rewrites": 1
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 444
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "A (G ((NOT FIREABLE(ExplainHowToObtainMissingDocs_2_27) OR (NOT FIREABLE(ClearanceReqReceived_20_0) AND (NOT FIREABLE(CheckHousingSuitReq_2_0) OR FIREABLE(ReceiveLangReq_5_31))))))",
"processed_size": 182,
"rewrites": 2
},
"result":
{
"edges": 46,
"markings": 47,
"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": 9,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "A (G (((NOT FIREABLE(CheckRequiredDoc_1_43) AND (NOT FIREABLE(TickDocsObtained_4_40) OR NOT FIREABLE(ReceiveLangChoice_1_48))) OR FIREABLE(RegisterRelativePubHealth_42))))",
"processed_size": 173,
"rewrites": 2
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 7,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"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": 4,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "A (G (((NOT FIREABLE(ChoseFamilyReunion_3_37) AND NOT FIREABLE(Gate2XORSplit_1_48)) OR FIREABLE(ReceiveLangReq_3_9) OR NOT FIREABLE(ReceiveLangChoice_5_5))))",
"processed_size": 159,
"rewrites": 2
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 16,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 711
},
"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": 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": "E (F ((FIREABLE(SendLangChoice_3_33) AND NOT FIREABLE(DisplayLangChoice_4_31) AND ((NOT FIREABLE(DisplayNeedChoice_1_32) AND NOT FIREABLE(ExplainHowToObtainMissingDocs_4_13)) OR FIREABLE(DisplayLangChoice_0_8)))))",
"processed_size": 214,
"rewrites": 1
},
"result":
{
"edges": 4,
"markings": 5,
"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": 7,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 889
},
"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": 6,
"unfir": 6,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "A (G ((NOT FIREABLE(ReceiveAppoint_0_45) OR NOT FIREABLE(ReceiveAppointReq_2_7) OR NOT FIREABLE(DisplayNeedChoice_3_28) OR NOT FIREABLE(GiveAppoint_5_35) OR NOT FIREABLE(ReceiveNeedReq_1_35) OR NOT FIREABLE(EvaluateReq_14_1))))",
"processed_size": 232,
"rewrites": 2
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 10
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1165
},
"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": 6
},
"processed": "E (F ((((FIREABLE(ReserveAppoint_0_44) AND FIREABLE(ExplainProcedure_2_42) AND NOT FIREABLE(AppReqReceived_1_8)) OR FIREABLE(TransmitReq_0_23)) AND (FIREABLE(ReceiveInstructions_3_14) OR FIREABLE(RegisterRelativePubHealth_7)))))",
"processed_size": 230,
"rewrites": 1
},
"result":
{
"edges": 95,
"markings": 96,
"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": 23,
"problems": 6
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1748
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 7,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "A (G ((NOT FIREABLE(PrepFamReuClearReq_2_37) AND NOT FIREABLE(SendSuitabilityCertif_1_46) AND NOT FIREABLE(ExplainHowToObtainMissingDocs_5_6) AND (NOT FIREABLE(ReceiveAppointReq_1_22) OR NOT FIREABLE(DisplayLangChoice_1_16) OR (NOT FIREABLE(ReqAppointCINFORMI_47) AND NOT FIREABLE(ReceiveNeedReq_0_2))))))",
"processed_size": 307,
"rewrites": 2
},
"result":
{
"edges": 37,
"markings": 38,
"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": 13,
"problems": 5
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3496
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 8,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 8,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "E (F (((FIREABLE(DisplayNeedChoice_5_34) OR FIREABLE(ReceiveLangReq_5_30) OR FIREABLE(PrepIncomeCertif_3)) AND ((FIREABLE(CheckSanityReq_0_9) AND FIREABLE(ReceiveReqDocsReq_5_46)) OR FIREABLE(CheckRequiredDoc_0_5)) AND (FIREABLE(AppointReceived_2_48) OR FIREABLE(HousingSuitCertifObtained_2_2)))))",
"processed_size": 301,
"rewrites": 1
},
"result":
{
"edges": 83,
"markings": 84,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 70,
"problems": 12
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 426352,
"runtime": 74.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 32238,
"conflict_clusters": 7836,
"places": 12194,
"places_significant": 9409,
"singleton_clusters": 0,
"transitions": 10560
},
"result":
{
"preliminary_value": "no yes no yes no yes yes yes yes yes yes no no yes yes yes ",
"value": "no yes no yes no yes yes yes yes yes yes no no yes yes 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: 22754/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 390208
lola: finding significant places
lola: 12194 places, 10560 transitions, 9409 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(PrepFamReuClearReq_2_37) AND NOT FIREABLE(SendSuitabilityCertif_1_46) AND NOT FIREABLE(ExplainHowToObtainMissingDocs_5_6) AND (NOT FIREABLE(ReceiveAppointReq_1_22) OR NOT FIREABLE(DisplayLangChoice_1_16) OR (NOT FIREABLE(ReqAppointCINFORMI_47) AND NOT FIREABLE(ReceiveNeedReq_0_2)))))) : E (F (FIREABLE(Gate1ANDSplit_0_30))) : A (G (((NOT FIREABLE(CheckRequiredDoc_1_43) AND (NOT FIREABLE(TickDocsObtained_4_40) OR NOT FIREABLE(ReceiveLangChoice_1_48))) OR FIREABLE(RegisterRelativePubHealth_42)))) : E (F (FIREABLE(SendSuitabilityCertif_2_28))) : A (G (((NOT FIREABLE(ChoseFamilyReunion_3_37) AND NOT FIREABLE(Gate2XORSplit_1_48)) OR FIREABLE(ReceiveLangReq_3_9) OR NOT FIREABLE(ReceiveLangChoice_5_5)))) : E (F ((FIREABLE(SendLangChoice_3_33) AND NOT FIREABLE(DisplayLangChoice_4_31) AND ((NOT FIREABLE(DisplayNeedChoice_1_32) AND NOT FIREABLE(ExplainHowToObtainMissingDocs_4_13)) OR FIREABLE(DisplayLangChoice_0_8))))) : E (F (FIREABLE(GiveAppoint_0_10))) : A (G ((NOT FIREABLE(ReceiveAppoint_0_45) OR NOT FIREABLE(ReceiveAppointReq_2_7) OR NOT FIREABLE(DisplayNeedChoice_3_28) OR NOT FIREABLE(GiveAppoint_5_35) OR NOT FIREABLE(ReceiveNeedReq_1_35) OR NOT FIREABLE(EvaluateReq_14_1)))) : E (F (FIREABLE(ReceiveDocsObtained_2_49))) : E (F ((FIREABLE(ReceiveLangChoice_3_20) OR (FIREABLE(GoToAppoint_33) AND FIREABLE(AccessMicTerminal_23))))) : E (F (((FIREABLE(DisplayNeedChoice_5_34) OR FIREABLE(ReceiveLangReq_5_30) OR FIREABLE(PrepIncomeCertif_3)) AND ((FIREABLE(CheckSanityReq_0_9) AND FIREABLE(ReceiveReqDocsReq_5_46)) OR FIREABLE(CheckRequiredDoc_0_5)) AND (FIREABLE(AppointReceived_2_48) OR FIREABLE(HousingSuitCertifObtained_2_2))))) : A (G (NOT FIREABLE(ChoseFamilyReunion_5_35))) : A (G ((NOT FIREABLE(ExplainHowToObtainMissingDocs_2_27) OR (NOT FIREABLE(ClearanceReqReceived_20_0) AND (NOT FIREABLE(CheckHousingSuitReq_2_0) OR FIREABLE(ReceiveLangReq_5_31)))))) : E (F (FIREABLE(ProvidePersonalnfo_24))) : E (F (FIREABLE(ReceiveLangChoice_5_36))) : E (F ((((FIREABLE(ReserveAppoint_0_44) AND FIREABLE(ExplainProcedure_2_42) AND NOT FIREABLE(AppReqReceived_1_8)) OR FIREABLE(TransmitReq_0_23)) AND (FIREABLE(ReceiveInstructions_3_14) OR FIREABLE(RegisterRelativePubHealth_7)))))
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(Gate1ANDSplit_0_30)))
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(Gate1ANDSplit_0_30)))
lola: processed formula length: 36
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(Gate1ANDSplit_0_30)
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: 54 markings, 53 edges
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(SendSuitabilityCertif_2_28)))
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(SendSuitabilityCertif_2_28)))
lola: processed formula length: 44
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: ========================================
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(SendSuitabilityCertif_2_28)
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: 37 markings, 36 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(GiveAppoint_0_10)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (FIREABLE(GiveAppoint_0_10)))
lola: processed formula length: 34
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(GiveAppoint_0_10)
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: 44 markings, 43 edges
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(ReceiveDocsObtained_2_49)))
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(ReceiveDocsObtained_2_49)))
lola: processed formula length: 42
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: ========================================
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(ReceiveDocsObtained_2_49)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(ChoseFamilyReunion_5_35)))
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(ChoseFamilyReunion_5_35)))
lola: processed formula length: 45
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(ChoseFamilyReunion_5_35)
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(ProvidePersonalnfo_24)))
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(ProvidePersonalnfo_24)))
lola: processed formula length: 39
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(ProvidePersonalnfo_24)
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: 76 markings, 75 edges
lola: ========================================
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(ReceiveLangChoice_5_36)))
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(ReceiveLangChoice_5_36)))
lola: processed formula length: 40
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(ReceiveLangChoice_5_36)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(ReceiveLangChoice_3_20) OR (FIREABLE(GoToAppoint_33) AND FIREABLE(AccessMicTerminal_23)))))
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(ReceiveLangChoice_3_20) OR (FIREABLE(GoToAppoint_33) AND FIREABLE(AccessMicTerminal_23)))))
lola: processed formula length: 108
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(ReceiveLangChoice_3_20) OR (FIREABLE(GoToAppoint_33) AND FIREABLE(AccessMicTerminal_23)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(ExplainHowToObtainMissingDocs_2_27) OR (NOT FIREABLE(ClearanceReqReceived_20_0) AND (NOT FIREABLE(CheckHousingSuitReq_2_0) OR FIREABLE(ReceiveLangReq_5_31))))))
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(ExplainHowToObtainMissingDocs_2_27) OR (NOT FIREABLE(ClearanceReqReceived_20_0) AND (NOT FIREABLE(CheckHousingSuitReq_2_0) OR FIREABLE(ReceiveLangReq_5_31))))))
lola: processed formula length: 182
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(ExplainHowToObtainMissingDocs_2_27) AND (FIREABLE(ClearanceReqReceived_20_0) OR (FIREABLE(CheckHousingSuitReq_2_0) AND NOT FIREABLE(ReceiveLangReq_5_31))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 47 markings, 46 edges
lola: ========================================
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(CheckRequiredDoc_1_43) AND (NOT FIREABLE(TickDocsObtained_4_40) OR NOT FIREABLE(ReceiveLangChoice_1_48))) OR FIREABLE(RegisterRelativePubHealth_42))))
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(CheckRequiredDoc_1_43) AND (NOT FIREABLE(TickDocsObtained_4_40) OR NOT FIREABLE(ReceiveLangChoice_1_48))) OR FIREABLE(RegisterRelativePubHealth_42))))
lola: processed formula length: 173
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(CheckRequiredDoc_1_43) OR (FIREABLE(TickDocsObtained_4_40) AND FIREABLE(ReceiveLangChoice_1_48))) AND NOT FIREABLE(RegisterRelativePubHealth_42))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(ChoseFamilyReunion_3_37) AND NOT FIREABLE(Gate2XORSplit_1_48)) OR FIREABLE(ReceiveLangReq_3_9) OR NOT FIREABLE(ReceiveLangChoice_5_5))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((NOT FIREABLE(ChoseFamilyReunion_3_37) AND NOT FIREABLE(Gate2XORSplit_1_48)) OR FIREABLE(ReceiveLangReq_3_9) OR NOT FIREABLE(ReceiveLangChoice_5_5))))
lola: processed formula length: 159
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(ChoseFamilyReunion_3_37) OR FIREABLE(Gate2XORSplit_1_48)) AND NOT FIREABLE(ReceiveLangReq_3_9) AND FIREABLE(ReceiveLangChoice_5_5))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(SendLangChoice_3_33) AND NOT FIREABLE(DisplayLangChoice_4_31) AND ((NOT FIREABLE(DisplayNeedChoice_1_32) AND NOT FIREABLE(ExplainHowToObtainMissingDocs_4_13)) OR FIREABLE(DisplayLangChoice_0_8)))))
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(SendLangChoice_3_33) AND NOT FIREABLE(DisplayLangChoice_4_31) AND ((NOT FIREABLE(DisplayNeedChoice_1_32) AND NOT FIREABLE(ExplainHowToObtainMissingDocs_4_13)) OR FIREABLE(DisplayLangChoice_0_8)))))
lola: processed formula length: 214
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(SendLangChoice_3_33) AND NOT FIREABLE(DisplayLangChoice_4_31) AND ((NOT FIREABLE(DisplayNeedChoice_1_32) AND NOT FIREABLE(ExplainHowToObtainMissingDocs_4_13)) OR FIREABLE(DisplayLangChoice_0_8)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 12 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(ReceiveAppoint_0_45) OR NOT FIREABLE(ReceiveAppointReq_2_7) OR NOT FIREABLE(DisplayNeedChoice_3_28) OR NOT FIREABLE(GiveAppoint_5_35) OR NOT FIREABLE(ReceiveNeedReq_1_35) OR NOT FIREABLE(EvaluateReq_14_1))))
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(ReceiveAppoint_0_45) OR NOT FIREABLE(ReceiveAppointReq_2_7) OR NOT FIREABLE(DisplayNeedChoice_3_28) OR NOT FIREABLE(GiveAppoint_5_35) OR NOT FIREABLE(ReceiveNeedReq_1_35) OR NOT FIREABLE(EvaluateReq_14_1))))
lola: processed formula length: 232
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(ReceiveAppoint_0_45) AND FIREABLE(ReceiveAppointReq_2_7) AND FIREABLE(DisplayNeedChoice_3_28) AND FIREABLE(GiveAppoint_5_35) AND FIREABLE(ReceiveNeedReq_1_35) AND FIREABLE(EvaluateReq_14_1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-12-0.sara.
lola: sara is running 0 secs || 54691 markings, 64279 edges, 10938 markings/sec, 0 secs
lola: sara is running 5 secs || 105574 markings, 127487 edges, 10177 markings/sec, 5 secs
lola: sara is running 10 secs || 157113 markings, 192318 edges, 10308 markings/sec, 10 secs
lola: sara is running 15 secs || 208124 markings, 257185 edges, 10202 markings/sec, 15 secs
lola: sara is running 20 secs || 257730 markings, 322068 edges, 9921 markings/sec, 20 secs
lola: sara is running 25 secs || 309420 markings, 386988 edges, 10338 markings/sec, 25 secs
lola: sara is running 30 secs || 360912 markings, 452371 edges, 10298 markings/sec, 30 secs
lola: sara is running 35 secs || 413971 markings, 519121 edges, 10612 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 467919 markings, 587572 edges, 10790 markings/sec, 40 secs
lola: sara is running 45 secs || 519561 markings, 652508 edges, 10328 markings/sec, 45 secs
lola: sara is running 50 secs || 568019 markings, 717423 edges, 9692 markings/sec, 50 secs
lola: sara is running 55 secs || 616368 markings, 783178 edges, 9670 markings/sec, 55 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 1165 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(ReserveAppoint_0_44) AND FIREABLE(ExplainProcedure_2_42) AND NOT FIREABLE(AppReqReceived_1_8)) OR FIREABLE(TransmitReq_0_23)) AND (FIREABLE(ReceiveInstructions_3_14) OR FIREABLE(RegisterRelativePubHealth_7)))))
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(ReserveAppoint_0_44) AND FIREABLE(ExplainProcedure_2_42) AND NOT FIREABLE(AppReqReceived_1_8)) OR FIREABLE(TransmitReq_0_23)) AND (FIREABLE(ReceiveInstructions_3_14) OR FIREABLE(RegisterRelativePubHealth_7)))))
lola: processed formula length: 230
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(ReserveAppoint_0_44) AND FIREABLE(ExplainProcedure_2_42) AND NOT FIREABLE(AppReqReceived_1_8)) OR FIREABLE(TransmitReq_0_23)) AND (FIREABLE(ReceiveInstructions_3_14) OR FIREABLE(RegisterRelativePubHealth_7)))
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 96 markings, 95 edges
lola: ========================================
lola: subprocess 14 will run for 1748 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(PrepFamReuClearReq_2_37) AND NOT FIREABLE(SendSuitabilityCertif_1_46) AND NOT FIREABLE(ExplainHowToObtainMissingDocs_5_6) AND (NOT FIREABLE(ReceiveAppointReq_1_22) OR NOT FIREABLE(DisplayLangChoice_1_16) OR (NOT FIREABLE(ReqAppointCINFORMI_47) AND NOT FIREABLE(ReceiveNeedReq_0_2))))))
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(PrepFamReuClearReq_2_37) AND NOT FIREABLE(SendSuitabilityCertif_1_46) AND NOT FIREABLE(ExplainHowToObtainMissingDocs_5_6) AND (NOT FIREABLE(ReceiveAppointReq_1_22) OR NOT FIREABLE(DisplayLangChoice_1_16) OR (NOT FIREABLE(ReqAppointCINFORMI_47) AND NOT FIREABLE(ReceiveNeedReq_0_2))))))
lola: processed formula length: 307
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(PrepFamReuClearReq_2_37) OR FIREABLE(SendSuitabilityCertif_1_46) OR FIREABLE(ExplainHowToObtainMissingDocs_5_6) OR (FIREABLE(ReceiveAppointReq_1_22) AND FIREABLE(DisplayLangChoice_1_16) AND (FIREABLE(ReqAppointCINFORMI_47) OR FIREABLE(ReceiveNeedReq_0_2))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 13 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 38 markings, 37 edges
lola: ========================================
lola: subprocess 15 will run for 3496 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(DisplayNeedChoice_5_34) OR FIREABLE(ReceiveLangReq_5_30) OR FIREABLE(PrepIncomeCertif_3)) AND ((FIREABLE(CheckSanityReq_0_9) AND FIREABLE(ReceiveReqDocsReq_5_46)) OR FIREABLE(CheckRequiredDoc_0_5)) AND (FIREABLE(AppointReceived_2_48) OR FIREABLE(HousingSuitCertifObtained_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((FIREABLE(DisplayNeedChoice_5_34) OR FIREABLE(ReceiveLangReq_5_30) OR FIREABLE(PrepIncomeCertif_3)) AND ((FIREABLE(CheckSanityReq_0_9) AND FIREABLE(ReceiveReqDocsReq_5_46)) OR FIREABLE(CheckRequiredDoc_0_5)) AND (FIREABLE(AppointReceived_2_48) OR FIREABLE(HousingSuitCertifObtained_2_2)))))
lola: processed formula length: 301
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(DisplayNeedChoice_5_34) OR FIREABLE(ReceiveLangReq_5_30) OR FIREABLE(PrepIncomeCertif_3)) AND ((FIREABLE(CheckSanityReq_0_9) AND FIREABLE(ReceiveReqDocsReq_5_46)) OR FIREABLE(CheckRequiredDoc_0_5)) AND (FIREABLE(AppointReceived_2_48) OR FIREABLE(HousingSuitCertifObtained_2_2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 70 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 84 markings, 83 edges
lola: RESULT
lola:
SUMMARY: no yes no yes no yes yes yes yes yes yes no no yes yes yes
lola:
preliminary result: no yes no yes no yes yes yes yes yes yes no no yes yes yes
lola: ========================================
lola: memory consumption: 426352 KB
lola: time consumption: 74 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
BK_STOP 1553474417172
--------------------
content from stderr:
grep: GenericPropertiesVerdict.xml: No such file or directory
grep: GenericPropertiesVerdict.xml: No such file or directory
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="FamilyReunion-PT-L00050M0005C002P002G001"
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 FamilyReunion-PT-L00050M0005C002P002G001, 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 r181-csrt-155344534900207"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00050M0005C002P002G001.tgz
mv FamilyReunion-PT-L00050M0005C002P002G001 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 ;