About the Execution of LoLA for NQueens-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4264.900 | 28210.00 | 5926.00 | 19.70 | TTTTFTTTFFTTTTFF | 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-155272225300027.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-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r104-oct2-155272225300027
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 3.5K Feb 11 23:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 11 23:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 7 23:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 7 23:55 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.5K Feb 5 00:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Feb 4 06:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 4 06:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 1 00:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 1 00:06 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 90K 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-10-ReachabilityFireability-00
FORMULA_NAME NQueens-PT-10-ReachabilityFireability-01
FORMULA_NAME NQueens-PT-10-ReachabilityFireability-02
FORMULA_NAME NQueens-PT-10-ReachabilityFireability-03
FORMULA_NAME NQueens-PT-10-ReachabilityFireability-04
FORMULA_NAME NQueens-PT-10-ReachabilityFireability-05
FORMULA_NAME NQueens-PT-10-ReachabilityFireability-06
FORMULA_NAME NQueens-PT-10-ReachabilityFireability-07
FORMULA_NAME NQueens-PT-10-ReachabilityFireability-08
FORMULA_NAME NQueens-PT-10-ReachabilityFireability-09
FORMULA_NAME NQueens-PT-10-ReachabilityFireability-10
FORMULA_NAME NQueens-PT-10-ReachabilityFireability-11
FORMULA_NAME NQueens-PT-10-ReachabilityFireability-12
FORMULA_NAME NQueens-PT-10-ReachabilityFireability-13
FORMULA_NAME NQueens-PT-10-ReachabilityFireability-14
FORMULA_NAME NQueens-PT-10-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1552772685961
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ NQueens-PT-10 @ 3570 seconds
FORMULA NQueens-PT-10-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-10-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-10-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-10-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-10-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-10-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-10-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-10-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-10-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-10-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-10-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-10-ReachabilityFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-10-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-10-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-10-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-10-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-10
{
"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:44:46 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(T_4_10_2_7)))",
"processed_size": 28,
"rewrites": 1
},
"result":
{
"edges": 0,
"markings": 0,
"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
},
"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(T_11_13_7_5)))",
"processed_size": 29,
"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": 4,
"problems": 4
},
"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": 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": "A (G (FIREABLE(T_5_11_3_7)))",
"processed_size": 28,
"rewrites": 2
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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(T_7_13_5_7)))",
"processed_size": 28,
"rewrites": 1
},
"result":
{
"edges": 0,
"markings": 0,
"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": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 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_12_8_5_2)))",
"processed_size": 32,
"rewrites": 1
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": 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": "A (G (FIREABLE(T_4_10_2_7)))",
"processed_size": 28,
"rewrites": 2
},
"result":
{
"edges": 1,
"markings": 2,
"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": 4,
"problems": 4
},
"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": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "E (F ((NOT FIREABLE(T_6_8_2_5) AND FIREABLE(T_3_7_0_6) AND (NOT FIREABLE(T_10_2_1_0) OR NOT FIREABLE(T_3_13_3_9) OR NOT FIREABLE(T_3_7_0_6)))))",
"processed_size": 145,
"rewrites": 1
},
"result":
{
"edges": 1,
"markings": 2,
"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": 168,
"problems": 28
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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": 4,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "E (F (((NOT FIREABLE(T_4_12_3_8) AND NOT FIREABLE(T_16_12_9_2)) OR NOT FIREABLE(T_9_19_9_9) OR NOT FIREABLE(T_8_12_5_6))))",
"processed_size": 124,
"rewrites": 1
},
"result":
{
"edges": 1,
"markings": 2,
"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": 40,
"problems": 24
},
"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": 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 ((NOT FIREABLE(T_6_12_4_7) OR NOT FIREABLE(T_15_7_6_0) OR NOT FIREABLE(T_14_10_7_2) OR (FIREABLE(T_2_10_1_8) AND FIREABLE(T_2_12_2_9)))))",
"processed_size": 145,
"rewrites": 1
},
"result":
{
"edges": 0,
"markings": 0,
"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"
},
"stateequation":
{
"literals": 20,
"problems": 13
},
"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": 3,
"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": "A (G ((((NOT FIREABLE(T_2_8_0_7) OR NOT FIREABLE(T_9_15_7_7)) AND (NOT FIREABLE(T_9_13_6_6) OR NOT FIREABLE(T_9_17_8_8))) OR NOT FIREABLE(T_4_8_1_6))))",
"processed_size": 154,
"rewrites": 2
},
"result":
{
"edges": 0,
"markings": 0,
"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": 24,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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": 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": "E (F ((FIREABLE(T_10_10_5_4) AND FIREABLE(T_11_5_3_1) AND FIREABLE(T_17_9_8_0) AND FIREABLE(T_16_12_9_2) AND FIREABLE(T_14_12_8_3))))",
"processed_size": 133,
"rewrites": 1
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 20,
"problems": 20
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"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": 6,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "A (G (((FIREABLE(T_4_6_0_5) OR FIREABLE(T_7_13_5_7) OR (FIREABLE(T_6_8_2_5) AND FIREABLE(T_12_10_6_3)) OR FIREABLE(T_4_12_3_8)) AND FIREABLE(T_6_4_0_3))))",
"processed_size": 157,
"rewrites": 2
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"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": 891
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 5,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "E (F ((NOT FIREABLE(T_11_9_5_3) AND NOT FIREABLE(T_4_14_4_9) AND FIREABLE(T_15_7_6_0) AND (FIREABLE(T_2_8_0_7) OR (FIREABLE(T_14_8_6_1) AND (FIREABLE(T_8_12_5_6) OR FIREABLE(T_10_2_1_0)))))))",
"processed_size": 193,
"rewrites": 1
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"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": 6,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 8,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "E (F ((FIREABLE(T_10_4_2_1) AND FIREABLE(T_1_11_1_9) AND (FIREABLE(T_8_6_2_3) OR FIREABLE(T_8_4_1_2)) AND FIREABLE(T_9_7_3_3) AND NOT FIREABLE(T_12_14_8_5) AND NOT FIREABLE(T_13_7_5_1) AND FIREABLE(T_13_11_7_3))))",
"processed_size": 214,
"rewrites": 1
},
"result":
{
"edges": 11,
"markings": 12,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 4,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 7,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 10,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "A (G (((FIREABLE(T_2_8_0_7) OR FIREABLE(T_6_6_1_4)) AND (FIREABLE(T_15_11_8_2) OR FIREABLE(T_4_12_3_8)) AND ((FIREABLE(T_8_14_6_7) AND FIREABLE(T_17_9_8_0)) OR NOT FIREABLE(T_10_18_9_8)) AND FIREABLE(T_9_5_2_2) AND (NOT FIREABLE(T_16_12_9_2) OR NOT FIREABLE(T_5_9_2_6)))))",
"processed_size": 276,
"rewrites": 2
},
"result":
{
"edges": 0,
"markings": 0,
"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": 116,
"problems": 45
},
"type": "invariance",
"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": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 8,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 12,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 11
},
"processed": "E (F ((NOT FIREABLE(T_6_4_0_3) AND NOT FIREABLE(T_4_14_4_9) AND (NOT FIREABLE(T_12_6_4_1) OR NOT FIREABLE(T_13_15_9_5)) AND (FIREABLE(T_16_12_9_2) OR FIREABLE(T_9_3_1_1) OR FIREABLE(T_0_10_0_9) OR FIREABLE(T_9_9_4_4) OR (FIREABLE(T_2_10_1_8) AND FIREABLE(T_6_8_2_5) AND FIREABLE(T_9_13_6_6) AND FIREABLE(T_0_10_0_9))))))",
"processed_size": 325,
"rewrites": 1
},
"result":
{
"edges": 2,
"markings": 3,
"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": 15620,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 500,
"conflict_clusters": 103,
"places": 160,
"places_significant": 100,
"singleton_clusters": 0,
"transitions": 100
},
"result":
{
"preliminary_value": "yes yes yes yes no yes yes yes no no yes yes yes yes no no ",
"value": "yes yes yes yes no yes yes yes no no yes yes yes yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 260/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 160
lola: finding significant places
lola: 160 places, 100 transitions, 100 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: E (F (((NOT FIREABLE(T_4_12_3_8) AND NOT FIREABLE(T_16_12_9_2)) OR NOT FIREABLE(T_9_19_9_9) OR NOT FIREABLE(T_8_12_5_6)))) : E (F (FIREABLE(T_4_10_2_7))) : E (F (FIREABLE(T_11_13_7_5))) : E (F ((NOT FIREABLE(T_6_12_4_7) OR NOT FIREABLE(T_15_7_6_0) OR NOT FIREABLE(T_14_10_7_2) OR (FIREABLE(T_2_10_1_8) AND FIREABLE(T_2_12_2_9))))) : A (G (FIREABLE(T_5_11_3_7))) : E (F ((FIREABLE(T_10_4_2_1) AND FIREABLE(T_1_11_1_9) AND (FIREABLE(T_8_6_2_3) OR FIREABLE(T_8_4_1_2)) AND FIREABLE(T_9_7_3_3) AND NOT FIREABLE(T_12_14_8_5) AND NOT FIREABLE(T_13_7_5_1) AND FIREABLE(T_13_11_7_3)))) : E (F ((NOT FIREABLE(T_6_4_0_3) AND NOT FIREABLE(T_4_14_4_9) AND (NOT FIREABLE(T_12_6_4_1) OR NOT FIREABLE(T_13_15_9_5)) AND (FIREABLE(T_16_12_9_2) OR FIREABLE(T_9_3_1_1) OR FIREABLE(T_0_10_0_9) OR FIREABLE(T_9_9_4_4) OR (FIREABLE(T_2_10_1_8) AND FIREABLE(T_6_8_2_5) AND FIREABLE(T_9_13_6_6) AND FIREABLE(T_0_10_0_9)))))) : E (F (FIREABLE(T_7_13_5_7))) : A (G ((((NOT FIREABLE(T_2_8_0_7) OR NOT FIREABLE(T_9_15_7_7)) AND (NOT FIREABLE(T_9_13_6_6) OR NOT FIREABLE(T_9_17_8_8))) OR NOT FIREABLE(T_4_8_1_6)))) : A (G (((FIREABLE(T_4_6_0_5) OR FIREABLE(T_7_13_5_7) OR (FIREABLE(T_6_8_2_5) AND FIREABLE(T_12_10_6_3)) OR FIREABLE(T_4_12_3_8)) AND FIREABLE(T_6_4_0_3)))) : E (F ((FIREABLE(T_10_10_5_4) AND FIREABLE(T_11_5_3_1) AND FIREABLE(T_17_9_8_0) AND FIREABLE(T_16_12_9_2) AND FIREABLE(T_14_12_8_3)))) : E (F ((NOT FIREABLE(T_11_9_5_3) AND NOT FIREABLE(T_4_14_4_9) AND FIREABLE(T_15_7_6_0) AND (FIREABLE(T_2_8_0_7) OR (FIREABLE(T_14_8_6_1) AND (FIREABLE(T_8_12_5_6) OR FIREABLE(T_10_2_1_0))))))) : E (F (NOT FIREABLE(T_12_8_5_2))) : E (F ((NOT FIREABLE(T_6_8_2_5) AND FIREABLE(T_3_7_0_6) AND (NOT FIREABLE(T_10_2_1_0) OR NOT FIREABLE(T_3_13_3_9) OR NOT FIREABLE(T_3_7_0_6))))) : A (G (FIREABLE(T_4_10_2_7))) : A (G (((FIREABLE(T_2_8_0_7) OR FIREABLE(T_6_6_1_4)) AND (FIREABLE(T_15_11_8_2) OR FIREABLE(T_4_12_3_8)) AND ((FIREABLE(T_8_14_6_7) AND FIREABLE(T_17_9_8_0)) OR NOT FIREABLE(T_10_18_9_8)) AND FIREABLE(T_9_5_2_2) AND (NOT FIREABLE(T_16_12_9_2) OR NOT FIREABLE(T_5_9_2_6)))))
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(T_4_10_2_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(T_4_10_2_7)))
lola: processed formula length: 28
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(T_4_10_2_7)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(T_11_13_7_5)))
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_11_13_7_5)))
lola: processed formula length: 29
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_11_13_7_5)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 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_5_11_3_7)))
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_5_11_3_7)))
lola: processed formula length: 28
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_5_11_3_7)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(T_7_13_5_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: lola: processed formula: E (F (FIREABLE(T_7_13_5_7)))
========================================lola:
processed formula length: 28
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(T_7_13_5_7)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(T_12_8_5_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 (NOT FIREABLE(T_12_8_5_2)))
lola: processed formula length: 32
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: NOT FIREABLE(T_12_8_5_2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(T_4_10_2_7)))
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_4_10_2_7)))
lola: processed formula length: 28
lola: 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_4_10_2_7)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-5-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(T_6_8_2_5) AND FIREABLE(T_3_7_0_6) AND (NOT FIREABLE(T_10_2_1_0) OR NOT FIREABLE(T_3_13_3_9) OR NOT FIREABLE(T_3_7_0_6)))))
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_6_8_2_5) AND FIREABLE(T_3_7_0_6) AND (NOT FIREABLE(T_10_2_1_0) OR NOT FIREABLE(T_3_13_3_9) OR NOT FIREABLE(T_3_7_0_6)))))
lola: processed formula length: 145
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_6_8_2_5) AND FIREABLE(T_3_7_0_6) AND (NOT FIREABLE(T_10_2_1_0) OR NOT FIREABLE(T_3_13_3_9) OR NOT FIREABLE(T_3_7_0_6)))
lola: SUBRESULT
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 168 literals and 28 conjunctive subformulas
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(T_4_12_3_8) AND NOT FIREABLE(T_16_12_9_2)) OR NOT FIREABLE(T_9_19_9_9) OR NOT FIREABLE(T_8_12_5_6))))
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_4_12_3_8) AND NOT FIREABLE(T_16_12_9_2)) OR NOT FIREABLE(T_9_19_9_9) OR NOT FIREABLE(T_8_12_5_6))))
lola: processed formula length: 124
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_4_12_3_8) AND NOT FIREABLE(T_16_12_9_2)) OR NOT FIREABLE(T_9_19_9_9) OR NOT FIREABLE(T_8_12_5_6))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 40 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(T_6_12_4_7) OR NOT FIREABLE(T_15_7_6_0) OR NOT FIREABLE(T_14_10_7_2) OR (FIREABLE(T_2_10_1_8) AND FIREABLE(T_2_12_2_9)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((NOT FIREABLE(T_6_12_4_7) OR NOT FIREABLE(T_15_7_6_0) OR NOT FIREABLE(T_14_10_7_2) OR (FIREABLE(T_2_10_1_8) AND FIREABLE(T_2_12_2_9)))))
lola: processed formula length: 145
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_6_12_4_7) OR NOT FIREABLE(T_15_7_6_0) OR NOT FIREABLE(T_14_10_7_2) OR (FIREABLE(T_2_10_1_8) AND FIREABLE(T_2_12_2_9)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 20 literals and 13 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-8-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(T_2_8_0_7) OR NOT FIREABLE(T_9_15_7_7)) AND (NOT FIREABLE(T_9_13_6_6) OR NOT FIREABLE(T_9_17_8_8))) OR NOT FIREABLE(T_4_8_1_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 ((((NOT FIREABLE(T_2_8_0_7) OR NOT FIREABLE(T_9_15_7_7)) AND (NOT FIREABLE(T_9_13_6_6) OR NOT FIREABLE(T_9_17_8_8))) OR NOT FIREABLE(T_4_8_1_6))))
lola: processed formula length: 154
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_2_8_0_7) AND FIREABLE(T_9_15_7_7)) OR (FIREABLE(T_9_13_6_6) AND FIREABLE(T_9_17_8_8))) AND FIREABLE(T_4_8_1_6))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T_10_10_5_4) AND FIREABLE(T_11_5_3_1) AND FIREABLE(T_17_9_8_0) AND FIREABLE(T_16_12_9_2) AND FIREABLE(T_14_12_8_3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((FIREABLE(T_10_10_5_4) AND FIREABLE(T_11_5_3_1) AND FIREABLE(T_17_9_8_0) AND FIREABLE(T_16_12_9_2) AND FIREABLE(T_14_12_8_3))))
lola: processed formula length: 133
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_10_10_5_4) AND FIREABLE(T_11_5_3_1) AND FIREABLE(T_17_9_8_0) AND FIREABLE(T_16_12_9_2) AND FIREABLE(T_14_12_8_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 20 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-8-0.sara.
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(T_4_6_0_5) OR FIREABLE(T_7_13_5_7) OR (FIREABLE(T_6_8_2_5) AND FIREABLE(T_12_10_6_3)) OR FIREABLE(T_4_12_3_8)) AND FIREABLE(T_6_4_0_3))))
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_4_6_0_5) OR FIREABLE(T_7_13_5_7) OR (FIREABLE(T_6_8_2_5) AND FIREABLE(T_12_10_6_3)) OR FIREABLE(T_4_12_3_8)) AND FIREABLE(T_6_4_0_3))))
lola: processed formula length: 157
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(T_11_9_5_3) AND NOT FIREABLE(T_4_14_4_9) AND FIREABLE(T_15_7_6_0) AND (FIREABLE(T_2_8_0_7) OR (FIREABLE(T_14_8_6_1) AND (FIREABLE(T_8_12_5_6) OR FIREABLE(T_10_2_1_0)))))))
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_11_9_5_3) AND NOT FIREABLE(T_4_14_4_9) AND FIREABLE(T_15_7_6_0) AND (FIREABLE(T_2_8_0_7) OR (FIREABLE(T_14_8_6_1) AND (FIREABLE(T_8_12_5_6) OR FIREABLE(T_10_2_1_0)))))))
lola: processed formula length: 193
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T_10_4_2_1) AND FIREABLE(T_1_11_1_9) AND (FIREABLE(T_8_6_2_3) OR FIREABLE(T_8_4_1_2)) AND FIREABLE(T_9_7_3_3) AND NOT FIREABLE(T_12_14_8_5) AND NOT FIREABLE(T_13_7_5_1) AND FIREABLE(T_13_11_7_3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((FIREABLE(T_10_4_2_1) AND FIREABLE(T_1_11_1_9) AND (FIREABLE(T_8_6_2_3) OR FIREABLE(T_8_4_1_2)) AND FIREABLE(T_9_7_3_3) AND NOT FIREABLE(T_12_14_8_5) AND NOT FIREABLE(T_13_7_5_1) AND FIREABLE(T_13_11_7_3))))
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(T_2_8_0_7) OR FIREABLE(T_6_6_1_4)) AND (FIREABLE(T_15_11_8_2) OR FIREABLE(T_4_12_3_8)) AND ((FIREABLE(T_8_14_6_7) AND FIREABLE(T_17_9_8_0)) OR NOT FIREABLE(T_10_18_9_8)) AND FIREABLE(T_9_5_2_2) AND (NOT FIREABLE(T_16_12_9_2) OR NOT FIREABLE(T_5_9_2_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_2_8_0_7) OR FIREABLE(T_6_6_1_4)) AND (FIREABLE(T_15_11_8_2) OR FIREABLE(T_4_12_3_8)) AND ((FIREABLE(T_8_14_6_7) AND FIREABLE(T_17_9_8_0)) OR NOT FIREABLE(T_10_18_9_8)) AND FIREABLE(T_9_5_2_2) AND (NOT FIREABLE(T_16_12_9_2) OR NOT FIREABLE(T_5_9_2_6)))))
lola: processed formula length: 276
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_2_8_0_7) AND NOT FIREABLE(T_6_6_1_4)) OR (NOT FIREABLE(T_15_11_8_2) AND NOT FIREABLE(T_4_12_3_8)) OR ((NOT FIREABLE(T_8_14_6_7) OR NOT FIREABLE(T_17_9_8_0)) AND FIREABLE(T_10_18_9_8)) OR NOT FIREABLE(T_9_5_2_2) OR (FIREABLE(T_16_12_9_2) AND FIREABLE(T_5_9_2_6)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 116 literals and 45 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
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_6_4_0_3) AND NOT FIREABLE(T_4_14_4_9) AND (NOT FIREABLE(T_12_6_4_1) OR NOT FIREABLE(T_13_15_9_5)) AND (FIREABLE(T_16_12_9_2) OR FIREABLE(T_9_3_1_1) OR FIREABLE(T_0_10_0_9) OR FIREABLE(T_9_9_4_4) OR (FIREABLE(T_2_10_1_8) AND FIREABLE(T_6_8_2_5) AND FIREABLE(T_9_13_6_6) AND FIREABLE(T_0_10_0_9))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((NOT FIREABLE(T_6_4_0_3) AND NOT FIREABLE(T_4_14_4_9) AND (NOT FIREABLE(T_12_6_4_1) OR NOT FIREABLE(T_13_15_9_5)) AND (FIREABLE(T_16_12_9_2) OR FIREABLE(T_9_3_1_1) OR FIREABLE(T_0_10_0_9) OR FIREABLE(T_9_9_4_4) OR (FIREABLE(T_2_10_1_8) AND FIREABLE(T_6_8_2_5) AND FIREABLE(T_9_13_6_6) AND FIREABLE(T_0_10_0_9))))))
lola: processed formula length: 325
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_6_4_0_3) AND NOT FIREABLE(T_4_14_4_9) AND (NOT FIREABLE(T_12_6_4_1) OR NOT FIREABLE(T_13_15_9_5)) AND (FIREABLE(T_16_12_9_2) OR FIREABLE(T_9_3_1_1) OR FIREABLE(T_0_10_0_9) OR FIREABLE(T_9_9_4_4) OR (FIREABLE(T_2_10_1_8) AND FIREABLE(T_6_8_2_5) AND FIREABLE(T_9_13_6_6) AND FIREABLE(T_0_10_0_9))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes no yes yes yes no no yes yes yes yes no no
lola:
preliminary result: yes yes yes yes no yes yes yes no no yes yes yes yes no no
lola: memory consumption: 15620 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 1552772714171
--------------------
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-10"
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-10, 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-155272225300027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-10.tgz
mv NQueens-PT-10 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 ;