About the Execution of LoLA for NQueens-PT-30
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4269.990 | 28516.00 | 6360.00 | 22.20 | FTTFFTTFTTFFTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2019-input.r104-oct2-155272225300072.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is NQueens-PT-30, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r104-oct2-155272225300072
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 3.1K Feb 11 23:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 11 23:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 7 23:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 7 23:57 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 100 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 338 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.2K Feb 5 00:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.9K Feb 5 00:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 4 06:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 4 06:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Feb 1 00:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Feb 1 00:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 735K 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 NQueens-PT-30-ReachabilityFireability-00
FORMULA_NAME NQueens-PT-30-ReachabilityFireability-01
FORMULA_NAME NQueens-PT-30-ReachabilityFireability-02
FORMULA_NAME NQueens-PT-30-ReachabilityFireability-03
FORMULA_NAME NQueens-PT-30-ReachabilityFireability-04
FORMULA_NAME NQueens-PT-30-ReachabilityFireability-05
FORMULA_NAME NQueens-PT-30-ReachabilityFireability-06
FORMULA_NAME NQueens-PT-30-ReachabilityFireability-07
FORMULA_NAME NQueens-PT-30-ReachabilityFireability-08
FORMULA_NAME NQueens-PT-30-ReachabilityFireability-09
FORMULA_NAME NQueens-PT-30-ReachabilityFireability-10
FORMULA_NAME NQueens-PT-30-ReachabilityFireability-11
FORMULA_NAME NQueens-PT-30-ReachabilityFireability-12
FORMULA_NAME NQueens-PT-30-ReachabilityFireability-13
FORMULA_NAME NQueens-PT-30-ReachabilityFireability-14
FORMULA_NAME NQueens-PT-30-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1552772811569
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ NQueens-PT-30 @ 3570 seconds
FORMULA NQueens-PT-30-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-30-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-30-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-30-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-30-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-30-ReachabilityFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-30-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-30-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-30-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-30-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-30-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-30-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-30-ReachabilityFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-30-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-30-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-30-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3541
rslt: Output for ReachabilityFireability @ NQueens-PT-30
{
"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": "Sat Mar 16 21:46:51 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": 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": "E (F (NOT FIREABLE(T_24_38_16_21)))",
"processed_size": 35,
"rewrites": 1
},
"result":
{
"edges": 1,
"markings": 2,
"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": 4,
"problems": 4
},
"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": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "E (F ((FIREABLE(T_52_26_24_1) AND FIREABLE(T_45_37_26_10))))",
"processed_size": 60,
"rewrites": 1
},
"result":
{
"edges": 0,
"markings": 0,
"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": 8,
"problems": 8
},
"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": 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": "A (G ((FIREABLE(T_49_23_21_1) OR FIREABLE(T_40_22_16_5) OR FIREABLE(T_44_28_21_6))))",
"processed_size": 86,
"rewrites": 2
},
"result":
{
"edges": 3,
"markings": 4,
"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": 192,
"problems": 64
},
"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": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "E (F ((NOT FIREABLE(T_17_15_1_13) OR (NOT FIREABLE(T_32_24_13_10) AND FIREABLE(T_13_21_2_18)))))",
"processed_size": 97,
"rewrites": 1
},
"result":
{
"edges": 1,
"markings": 2,
"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": 24,
"problems": 8
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "A (G ((NOT FIREABLE(T_19_29_9_19) OR NOT FIREABLE(T_34_12_8_3) OR FIREABLE(T_56_32_29_2) OR NOT FIREABLE(T_23_41_17_23))))",
"processed_size": 125,
"rewrites": 2
},
"result":
{
"edges": 1,
"markings": 2,
"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": 52,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "A (G ((FIREABLE(T_28_26_12_13) OR FIREABLE(T_37_13_10_2) OR NOT FIREABLE(T_32_54_28_25) OR NOT FIREABLE(T_30_2_1_0) OR FIREABLE(T_21_31_11_19))))",
"processed_size": 149,
"rewrites": 2
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 704,
"problems": 64
},
"type": "invariance",
"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": 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": 5,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "E (F ((NOT FIREABLE(T_30_48_24_23) AND FIREABLE(T_35_31_18_12) AND NOT FIREABLE(T_7_31_4_26) AND NOT FIREABLE(T_38_20_14_5) AND NOT FIREABLE(T_33_19_11_7))))",
"processed_size": 157,
"rewrites": 1
},
"result":
{
"edges": 3,
"markings": 4,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 5,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "E (F ((NOT FIREABLE(T_33_41_22_18) AND NOT FIREABLE(T_40_14_12_1) AND (NOT FIREABLE(T_15_23_4_18) OR NOT FIREABLE(T_38_40_24_15)) AND NOT FIREABLE(T_48_26_22_3))))",
"processed_size": 164,
"rewrites": 1
},
"result":
{
"edges": 3,
"markings": 4,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 5,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "E (F ((NOT FIREABLE(T_7_23_0_22) AND NOT FIREABLE(T_31_27_14_12) AND (NOT FIREABLE(T_20_10_0_9) OR NOT FIREABLE(T_16_40_13_26)) AND NOT FIREABLE(T_30_28_14_13))))",
"processed_size": 163,
"rewrites": 1
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 5,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "A (G ((FIREABLE(T_29_49_24_24) OR (FIREABLE(T_29_41_20_20) AND FIREABLE(T_17_17_2_14)) OR FIREABLE(T_8_38_8_29) OR FIREABLE(T_16_32_9_22))))",
"processed_size": 143,
"rewrites": 2
},
"result":
{
"edges": 4,
"markings": 5,
"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": 2048,
"problems": 512
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F ((FIREABLE(T_24_40_17_22) AND FIREABLE(T_21_35_13_21) AND NOT FIREABLE(T_35_45_25_19) AND (NOT FIREABLE(T_41_47_29_17) OR NOT FIREABLE(T_19_35_12_22) OR NOT FIREABLE(T_23_21_7_13)))))",
"processed_size": 190,
"rewrites": 1
},
"result":
{
"edges": 1,
"markings": 2,
"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": 400,
"problems": 40
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"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": 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(T_33_31_17_13) OR FIREABLE(T_21_21_6_14) OR FIREABLE(T_29_43_21_21)) AND FIREABLE(T_34_34_19_14) AND (NOT FIREABLE(T_31_15_8_6) OR FIREABLE(T_35_39_22_16)))))",
"processed_size": 178,
"rewrites": 1
},
"result":
{
"edges": 0,
"markings": 0,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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": 7,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "A (G ((FIREABLE(T_26_6_1_4) OR FIREABLE(T_22_18_5_12) OR FIREABLE(T_24_10_2_7) OR FIREABLE(T_18_38_13_24) OR FIREABLE(T_19_15_2_12) OR FIREABLE(T_35_15_10_4) OR NOT FIREABLE(T_24_50_22_27))))",
"processed_size": 197,
"rewrites": 2
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 9,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 10,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 9
},
"processed": "A (G ((FIREABLE(T_23_49_21_27) OR FIREABLE(T_32_10_6_3) OR FIREABLE(T_45_25_20_4) OR FIREABLE(T_38_44_26_17) OR FIREABLE(T_45_43_29_13) OR FIREABLE(T_24_34_14_19) OR NOT FIREABLE(T_38_50_29_20) OR FIREABLE(T_42_34_23_10) OR (FIREABLE(T_24_34_14_19) AND FIREABLE(T_2_32_2_29)))))",
"processed_size": 286,
"rewrites": 2
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"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": 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(T_3_31_2_28) OR FIREABLE(T_37_21_14_6) OR NOT FIREABLE(T_27_15_6_8) OR (FIREABLE(T_42_20_16_3) AND FIREABLE(T_18_18_3_14) AND (FIREABLE(T_2_30_1_28) OR FIREABLE(T_41_47_29_17))) OR (NOT FIREABLE(T_35_25_15_9) AND NOT FIREABLE(T_49_23_21_1) AND NOT FIREABLE(T_38_50_29_20)))))",
"processed_size": 296,
"rewrites": 1
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 228,
"problems": 72
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"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": 6,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 11,
"unfir": 5,
"visible_places": 0,
"visible_transitions": 11
},
"processed": "E (F ((NOT FIREABLE(T_27_13_5_7) AND NOT FIREABLE(T_41_25_18_6) AND (NOT FIREABLE(T_47_25_21_3) OR NOT FIREABLE(T_20_22_6_15)) AND (FIREABLE(T_37_17_12_4) OR FIREABLE(T_44_30_22_7)) AND NOT FIREABLE(T_53_33_28_4) AND (FIREABLE(T_19_33_11_21) OR FIREABLE(T_32_42_22_19) OR (FIREABLE(T_21_15_3_11) AND FIREABLE(T_19_11_0_10))))))",
"processed_size": 331,
"rewrites": 1
},
"result":
{
"edges": 4,
"markings": 5,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 31568,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 4500,
"conflict_clusters": 903,
"places": 1080,
"places_significant": 900,
"singleton_clusters": 0,
"transitions": 900
},
"result":
{
"preliminary_value": "no yes yes no no yes yes no yes yes no no yes yes yes yes ",
"value": "no yes yes no no yes yes no yes yes no no yes 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: 1980/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1080
lola: finding significant places
lola: 1080 places, 900 transitions, 900 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 ((FIREABLE(T_28_26_12_13) OR FIREABLE(T_37_13_10_2) OR NOT FIREABLE(T_32_54_28_25) OR NOT FIREABLE(T_30_2_1_0) OR FIREABLE(T_21_31_11_19)))) : E (F ((NOT FIREABLE(T_30_48_24_23) AND FIREABLE(T_35_31_18_12) AND NOT FIREABLE(T_7_31_4_26) AND NOT FIREABLE(T_38_20_14_5) AND NOT FIREABLE(T_33_19_11_7)))) : E (F ((NOT FIREABLE(T_33_41_22_18) AND NOT FIREABLE(T_40_14_12_1) AND (NOT FIREABLE(T_15_23_4_18) OR NOT FIREABLE(T_38_40_24_15)) AND NOT FIREABLE(T_48_26_22_3)))) : A (G ((FIREABLE(T_26_6_1_4) OR FIREABLE(T_22_18_5_12) OR FIREABLE(T_24_10_2_7) OR FIREABLE(T_18_38_13_24) OR FIREABLE(T_19_15_2_12) OR FIREABLE(T_35_15_10_4) OR NOT FIREABLE(T_24_50_22_27)))) : A (G ((FIREABLE(T_23_49_21_27) OR FIREABLE(T_32_10_6_3) OR FIREABLE(T_45_25_20_4) OR FIREABLE(T_38_44_26_17) OR FIREABLE(T_45_43_29_13) OR FIREABLE(T_24_34_14_19) OR NOT FIREABLE(T_38_50_29_20) OR FIREABLE(T_42_34_23_10) OR (FIREABLE(T_24_34_14_19) AND FIREABLE(T_2_32_2_29))))) : E (F ((NOT FIREABLE(T_7_23_0_22) AND NOT FIREABLE(T_31_27_14_12) AND (NOT FIREABLE(T_20_10_0_9) OR NOT FIREABLE(T_16_40_13_26)) AND NOT FIREABLE(T_30_28_14_13)))) : E (F ((NOT FIREABLE(T_27_13_5_7) AND NOT FIREABLE(T_41_25_18_6) AND (NOT FIREABLE(T_47_25_21_3) OR NOT FIREABLE(T_20_22_6_15)) AND (FIREABLE(T_37_17_12_4) OR FIREABLE(T_44_30_22_7)) AND NOT FIREABLE(T_53_33_28_4) AND (FIREABLE(T_19_33_11_21) OR FIREABLE(T_32_42_22_19) OR (FIREABLE(T_21_15_3_11) AND FIREABLE(T_19_11_0_10)))))) : A (G ((FIREABLE(T_29_49_24_24) OR (FIREABLE(T_29_41_20_20) AND FIREABLE(T_17_17_2_14)) OR FIREABLE(T_8_38_8_29) OR FIREABLE(T_16_32_9_22)))) : E (F ((NOT FIREABLE(T_17_15_1_13) OR (NOT FIREABLE(T_32_24_13_10) AND FIREABLE(T_13_21_2_18))))) : E (F (NOT FIREABLE(T_24_38_16_21))) : A (G ((NOT FIREABLE(T_19_29_9_19) OR NOT FIREABLE(T_34_12_8_3) OR FIREABLE(T_56_32_29_2) OR NOT FIREABLE(T_23_41_17_23)))) : A (G ((FIREABLE(T_49_23_21_1) OR FIREABLE(T_40_22_16_5) OR FIREABLE(T_44_28_21_6)))) : E (F ((FIREABLE(T_3_31_2_28) OR FIREABLE(T_37_21_14_6) OR NOT FIREABLE(T_27_15_6_8) OR (FIREABLE(T_42_20_16_3) AND FIREABLE(T_18_18_3_14) AND (FIREABLE(T_2_30_1_28) OR FIREABLE(T_41_47_29_17))) OR (NOT FIREABLE(T_35_25_15_9) AND NOT FIREABLE(T_49_23_21_1) AND NOT FIREABLE(T_38_50_29_20))))) : E (F ((FIREABLE(T_52_26_24_1) AND FIREABLE(T_45_37_26_10)))) : E (F ((FIREABLE(T_24_40_17_22) AND FIREABLE(T_21_35_13_21) AND NOT FIREABLE(T_35_45_25_19) AND (NOT FIREABLE(T_41_47_29_17) OR NOT FIREABLE(T_19_35_12_22) OR NOT FIREABLE(T_23_21_7_13))))) : E (F (((FIREABLE(T_33_31_17_13) OR FIREABLE(T_21_21_6_14) OR FIREABLE(T_29_43_21_21)) AND FIREABLE(T_34_34_19_14) AND (NOT FIREABLE(T_31_15_8_6) OR FIREABLE(T_35_39_22_16)))))
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 (NOT FIREABLE(T_24_38_16_21)))
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(T_24_38_16_21)))
lola: processed formula length: 35
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(T_24_38_16_21)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T_52_26_24_1) AND FIREABLE(T_45_37_26_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(T_52_26_24_1) AND FIREABLE(T_45_37_26_10))))
lola: processed formula length: 60
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(T_52_26_24_1) AND FIREABLE(T_45_37_26_10))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(T_49_23_21_1) OR FIREABLE(T_40_22_16_5) OR FIREABLE(T_44_28_21_6))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((FIREABLE(T_49_23_21_1) OR FIREABLE(T_40_22_16_5) OR FIREABLE(T_44_28_21_6))))
lola: processed formula length: 86
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(T_49_23_21_1) AND NOT FIREABLE(T_40_22_16_5) AND NOT FIREABLE(T_44_28_21_6))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 192 literals and 64 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(T_17_15_1_13) OR (NOT FIREABLE(T_32_24_13_10) AND FIREABLE(T_13_21_2_18)))))
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(T_17_15_1_13) OR (NOT FIREABLE(T_32_24_13_10) AND FIREABLE(T_13_21_2_18)))))
lola: processed formula length: 97
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(T_17_15_1_13) OR (NOT FIREABLE(T_32_24_13_10) AND FIREABLE(T_13_21_2_18)))
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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(T_19_29_9_19) OR NOT FIREABLE(T_34_12_8_3) OR FIREABLE(T_56_32_29_2) OR NOT FIREABLE(T_23_41_17_23))))
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(T_19_29_9_19) OR NOT FIREABLE(T_34_12_8_3) OR FIREABLE(T_56_32_29_2) OR NOT FIREABLE(T_23_41_17_23))))
lola: processed formula length: 125
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(T_19_29_9_19) AND FIREABLE(T_34_12_8_3) AND NOT FIREABLE(T_56_32_29_2) AND FIREABLE(T_23_41_17_23))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 52 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(T_28_26_12_13) OR FIREABLE(T_37_13_10_2) OR NOT FIREABLE(T_32_54_28_25) OR NOT FIREABLE(T_30_2_1_0) OR FIREABLE(T_21_31_11_19))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((FIREABLE(T_28_26_12_13) OR FIREABLE(T_37_13_10_2) OR NOT FIREABLE(T_32_54_28_25) OR NOT FIREABLE(T_30_2_1_0) OR FIREABLE(T_21_31_11_19))))
lola: processed formula length: 149
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(T_28_26_12_13) AND NOT FIREABLE(T_37_13_10_2) AND FIREABLE(T_32_54_28_25) AND FIREABLE(T_30_2_1_0) AND NOT FIREABLE(T_21_31_11_19))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 704 literals and 64 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(T_30_48_24_23) AND FIREABLE(T_35_31_18_12) AND NOT FIREABLE(T_7_31_4_26) AND NOT FIREABLE(T_38_20_14_5) AND NOT FIREABLE(T_33_19_11_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 ((NOT FIREABLE(T_30_48_24_23) AND FIREABLE(T_35_31_18_12) AND NOT FIREABLE(T_7_31_4_26) AND NOT FIREABLE(T_38_20_14_5) AND NOT FIREABLE(T_33_19_11_7))))
lola: processed formula length: 157
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(T_30_48_24_23) AND FIREABLE(T_35_31_18_12) AND NOT FIREABLE(T_7_31_4_26) AND NOT FIREABLE(T_38_20_14_5) AND NOT FIREABLE(T_33_19_11_7))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(T_33_41_22_18) AND NOT FIREABLE(T_40_14_12_1) AND (NOT FIREABLE(T_15_23_4_18) OR NOT FIREABLE(T_38_40_24_15)) AND NOT FIREABLE(T_48_26_22_3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((NOT FIREABLE(T_33_41_22_18) AND NOT FIREABLE(T_40_14_12_1) AND (NOT FIREABLE(T_15_23_4_18) OR NOT FIREABLE(T_38_40_24_15)) AND NOT FIREABLE(T_48_26_22_3))))
lola: processed formula length: 164
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(T_33_41_22_18) AND NOT FIREABLE(T_40_14_12_1) AND (NOT FIREABLE(T_15_23_4_18) OR NOT FIREABLE(T_38_40_24_15)) AND NOT FIREABLE(T_48_26_22_3))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(T_7_23_0_22) AND NOT FIREABLE(T_31_27_14_12) AND (NOT FIREABLE(T_20_10_0_9) OR NOT FIREABLE(T_16_40_13_26)) AND NOT FIREABLE(T_30_28_14_13))))
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(T_7_23_0_22) AND NOT FIREABLE(T_31_27_14_12) AND (NOT FIREABLE(T_20_10_0_9) OR NOT FIREABLE(T_16_40_13_26)) AND NOT FIREABLE(T_30_28_14_13))))
lola: processed formula length: 163
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(T_7_23_0_22) AND NOT FIREABLE(T_31_27_14_12) AND (NOT FIREABLE(T_20_10_0_9) OR NOT FIREABLE(T_16_40_13_26)) AND NOT FIREABLE(T_30_28_14_13))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(T_29_49_24_24) OR (FIREABLE(T_29_41_20_20) AND FIREABLE(T_17_17_2_14)) OR FIREABLE(T_8_38_8_29) OR FIREABLE(T_16_32_9_22))))
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(T_29_49_24_24) OR (FIREABLE(T_29_41_20_20) AND FIREABLE(T_17_17_2_14)) OR FIREABLE(T_8_38_8_29) OR FIREABLE(T_16_32_9_22))))
lola: processed formula length: 143
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(T_29_49_24_24) AND (NOT FIREABLE(T_29_41_20_20) OR NOT FIREABLE(T_17_17_2_14)) AND NOT FIREABLE(T_8_38_8_29) AND NOT FIREABLE(T_16_32_9_22))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2048 literals and 512 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T_24_40_17_22) AND FIREABLE(T_21_35_13_21) AND NOT FIREABLE(T_35_45_25_19) AND (NOT FIREABLE(T_41_47_29_17) OR NOT FIREABLE(T_19_35_12_22) OR NOT FIREABLE(T_23_21_7_13)))))
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(T_24_40_17_22) AND FIREABLE(T_21_35_13_21) AND NOT FIREABLE(T_35_45_25_19) AND (NOT FIREABLE(T_41_47_29_17) OR NOT FIREABLE(T_19_35_12_22) OR NOT FIREABLE(T_23_21_7_13)))))
lola: processed formula length: 190
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(T_24_40_17_22) AND FIREABLE(T_21_35_13_21) AND NOT FIREABLE(T_35_45_25_19) AND (NOT FIREABLE(T_41_47_29_17) OR NOT FIREABLE(T_19_35_12_22) OR NOT FIREABLE(T_23_21_7_13)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 400 literals and 40 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(T_33_31_17_13) OR FIREABLE(T_21_21_6_14) OR FIREABLE(T_29_43_21_21)) AND FIREABLE(T_34_34_19_14) AND (NOT FIREABLE(T_31_15_8_6) OR FIREABLE(T_35_39_22_16)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((FIREABLE(T_33_31_17_13) OR FIREABLE(T_21_21_6_14) OR FIREABLE(T_29_43_21_21)) AND FIREABLE(T_34_34_19_14) AND (NOT FIREABLE(T_31_15_8_6) OR FIREABLE(T_35_39_22_16)))))
lola: processed formula length: 178
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((FIREABLE(T_33_31_17_13) OR FIREABLE(T_21_21_6_14) OR FIREABLE(T_29_43_21_21)) AND FIREABLE(T_34_34_19_14) AND (NOT FIREABLE(T_31_15_8_6) OR FIREABLE(T_35_39_22_16)))
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(T_26_6_1_4) OR FIREABLE(T_22_18_5_12) OR FIREABLE(T_24_10_2_7) OR FIREABLE(T_18_38_13_24) OR FIREABLE(T_19_15_2_12) OR FIREABLE(T_35_15_10_4) OR NOT FIREABLE(T_24_50_22_27))))
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(T_26_6_1_4) OR FIREABLE(T_22_18_5_12) OR FIREABLE(T_24_10_2_7) OR FIREABLE(T_18_38_13_24) OR FIREABLE(T_19_15_2_12) OR FIREABLE(T_35_15_10_4) OR NOT FIREABLE(T_24_50_22_27))))
lola: processed formula length: 197
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(T_26_6_1_4) AND NOT FIREABLE(T_22_18_5_12) AND NOT FIREABLE(T_24_10_2_7) AND NOT FIREABLE(T_18_38_13_24) AND NOT FIREABLE(T_19_15_2_12) AND NOT FIREABLE(T_35_15_10_4) AND FIREABLE(T_24_50_22_27))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(T_23_49_21_27) OR FIREABLE(T_32_10_6_3) OR FIREABLE(T_45_25_20_4) OR FIREABLE(T_38_44_26_17) OR FIREABLE(T_45_43_29_13) OR FIREABLE(T_24_34_14_19) OR NOT FIREABLE(T_38_50_29_20) OR FIREABLE(T_42_34_23_10) OR (FIREABLE(T_24_34_14_19) AND FIREABLE(T_2_32_2_29)))))
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(T_23_49_21_27) OR FIREABLE(T_32_10_6_3) OR FIREABLE(T_45_25_20_4) OR FIREABLE(T_38_44_26_17) OR FIREABLE(T_45_43_29_13) OR FIREABLE(T_24_34_14_19) OR NOT FIREABLE(T_38_50_29_20) OR FIREABLE(T_42_34_23_10) OR (FIREABLE(T_24_34_14_19) AND FIREABLE(T_2_32_2_29)))))
lola: processed formula length: 286
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(T_23_49_21_27) AND NOT FIREABLE(T_32_10_6_3) AND NOT FIREABLE(T_45_25_20_4) AND NOT FIREABLE(T_38_44_26_17) AND NOT FIREABLE(T_45_43_29_13) AND NOT FIREABLE(T_24_34_14_19) AND FIREABLE(T_38_50_29_20) AND NOT FIREABLE(T_42_34_23_10) AND (NOT FIREABLE(T_24_34_14_19) OR NOT FIREABLE(T_2_32_2_29)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T_3_31_2_28) OR FIREABLE(T_37_21_14_6) OR NOT FIREABLE(T_27_15_6_8) OR (FIREABLE(T_42_20_16_3) AND FIREABLE(T_18_18_3_14) AND (FIREABLE(T_2_30_1_28) OR FIREABLE(T_41_47_29_17))) OR (NOT FIREABLE(T_35_25_15_9) AND NOT FIREABLE(T_49_23_21_1) AND NOT FIREABLE(T_38_50_29_20)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((FIREABLE(T_3_31_2_28) OR FIREABLE(T_37_21_14_6) OR NOT FIREABLE(T_27_15_6_8) OR (FIREABLE(T_42_20_16_3) AND FIREABLE(T_18_18_3_14) AND (FIREABLE(T_2_30_1_28) OR FIREABLE(T_41_47_29_17))) OR (NOT FIREABLE(T_35_25_15_9) AND NOT FIREABLE(T_49_23_21_1) AND NOT FIREABLE(T_38_50_29_20)))))
lola: processed formula length: 296
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(T_3_31_2_28) OR FIREABLE(T_37_21_14_6) OR NOT FIREABLE(T_27_15_6_8) OR (FIREABLE(T_42_20_16_3) AND FIREABLE(T_18_18_3_14) AND (FIREABLE(T_2_30_1_28) OR FIREABLE(T_41_47_29_17))) OR (NOT FIREABLE(T_35_25_15_9) AND NOT FIREABLE(T_49_23_21_1) AND NOT FIREABLE(T_38_50_29_20)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 228 literals and 72 conjunctive subformulas
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(T_27_13_5_7) AND NOT FIREABLE(T_41_25_18_6) AND (NOT FIREABLE(T_47_25_21_3) OR NOT FIREABLE(T_20_22_6_15)) AND (FIREABLE(T_37_17_12_4) OR FIREABLE(T_44_30_22_7)) AND NOT FIREABLE(T_53_33_28_4) AND (FIREABLE(T_19_33_11_21) OR FIREABLE(T_32_42_22_19) OR (FIREABLE(T_21_15_3_11) AND FIREABLE(T_19_11_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 ((NOT FIREABLE(T_27_13_5_7) AND NOT FIREABLE(T_41_25_18_6) AND (NOT FIREABLE(T_47_25_21_3) OR NOT FIREABLE(T_20_22_6_15)) AND (FIREABLE(T_37_17_12_4) OR FIREABLE(T_44_30_22_7)) AND NOT FIREABLE(T_53_33_28_4) AND (FIREABLE(T_19_33_11_21) OR FIREABLE(T_32_42_22_19) OR (FIREABLE(T_21_15_3_11) AND FIREABLE(T_19_11_0_10))))))
lola: processed formula length: 331
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(T_27_13_5_7) AND NOT FIREABLE(T_41_25_18_6) AND (NOT FIREABLE(T_47_25_21_3) OR NOT FIREABLE(T_20_22_6_15)) AND (FIREABLE(T_37_17_12_4) OR FIREABLE(T_44_30_22_7)) AND NOT FIREABLE(T_53_33_28_4) AND (FIREABLE(T_19_33_11_21) OR FIREABLE(T_32_42_22_19) OR (FIREABLE(T_21_15_3_11) AND FIREABLE(T_19_11_0_10))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no yes yes no yes yes no no yes yes yes yes
lola:
preliminary result: no yes yes no no yes yes no yes yes no no yes yes yes yes
lola: memory consumption: 31568 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
BK_STOP 1552772840085
--------------------
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="NQueens-PT-30"
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 NQueens-PT-30, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r104-oct2-155272225300072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-30.tgz
mv NQueens-PT-30 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 ;