About the Execution of 2019-Gold for NeighborGrid-PT-d4n3m2c23
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15913.520 | 129126.00 | 140714.00 | 358.20 | TFFFF?FFFFTT?FTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r120-csrt-158961292400052.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is NeighborGrid-PT-d4n3m2c23, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r120-csrt-158961292400052
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 3.6K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 10 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rwxr-xr-x 1 mcc users 469K Apr 27 15:14 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 NeighborGrid-PT-d4n3m2c23-00
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-01
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-02
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-03
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-04
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-05
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-06
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-07
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-08
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-09
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-10
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-11
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-12
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-13
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-14
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-15
=== Now, execution of the tool begins
BK_START 1590336639607
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ NeighborGrid-PT-d4n3m2c23 @ 3570 seconds
FORMULA NeighborGrid-PT-d4n3m2c23-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d4n3m2c23-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d4n3m2c23-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d4n3m2c23-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d4n3m2c23-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d4n3m2c23-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d4n3m2c23-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d4n3m2c23-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d4n3m2c23-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d4n3m2c23-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d4n3m2c23-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d4n3m2c23-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d4n3m2c23-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d4n3m2c23-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d4n3m2c23-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d4n3m2c23-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3441
rslt: Output for LTLFireability @ NeighborGrid-PT-d4n3m2c23
{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 24 16:10:39 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (X ((NOT FIREABLE(ti_0_0_0_1v_0_0_1_0) R NOT FIREABLE(to_1_1_1_2v_2_1_0_1))))",
"processed_size": 79,
"rewrites": 102
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (G (F ((X (F (NOT FIREABLE(to_2_1_0_1v_2_2_1_2))) OR (G (FIREABLE(to_1_2_1_0v_2_1_1_0)) AND X (F (NOT FIREABLE(to_2_1_0_1v_2_2_1_2))))))))",
"processed_size": 140,
"rewrites": 102
},
"result":
{
"edges": 782560,
"markings": 479696,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (F (G ((F (FIREABLE(to_1_2_0_1v_2_1_1_1)) AND (FIREABLE(ti_1_0_1_2v_2_1_1_2) OR X (FIREABLE(to_1_2_0_1v_2_1_1_1)))))))",
"processed_size": 120,
"rewrites": 102
},
"result":
{
"edges": 53,
"markings": 34,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 294
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 294
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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 (X (NOT FIREABLE(to_2_1_0_2v_2_1_1_1)))",
"processed_size": 41,
"rewrites": 102
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 320
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 4,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A ((F (FIREABLE(to_1_2_2_1v_2_1_2_1)) OR (F (FIREABLE(to_1_2_2_1v_2_1_2_1)) AND F (G ((FIREABLE(ti_2_0_0_1v_2_0_1_2) AND X (FIREABLE(ti_0_1_2_0v_1_2_2_1))))))))",
"processed_size": 160,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 389
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A (X ((F (FIREABLE(to_0_0_1_2v_0_1_2_1)) OR (NOT FIREABLE(to_0_0_2_1v_1_0_1_2) AND X (G (NOT FIREABLE(ti_1_0_1_0v_2_1_1_0)))))))",
"processed_size": 128,
"rewrites": 102
},
"result":
{
"edges": 3264,
"markings": 3265,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 437
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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 (X (F (FIREABLE(to_1_1_0_1v_2_1_1_2))))",
"processed_size": 41,
"rewrites": 102
},
"result":
{
"edges": 1632,
"markings": 1633,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 500
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (G ((NOT FIREABLE(to_1_1_0_1v_1_2_0_0) OR NOT FIREABLE(to_2_1_0_1v_2_2_0_2))))",
"processed_size": 81,
"rewrites": 104
},
"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": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 583
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (F ((F (G (FIREABLE(ti_1_0_1_1v_2_0_2_2))) OR (FIREABLE(ti_1_0_1_1v_2_0_2_2) U G (FIREABLE(ti_1_0_1_1v_2_0_2_2))))))",
"processed_size": 118,
"rewrites": 102
},
"result":
{
"edges": 140327,
"markings": 92164,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 699
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A ((FIREABLE(to_1_2_0_2v_2_2_1_2) OR G (NOT FIREABLE(ti_0_2_1_2v_0_2_2_1))))",
"processed_size": 76,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 874
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 5,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 5,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (((FIREABLE(to_0_1_2_1v_0_2_2_2) AND G (FIREABLE(ti_2_1_1_0v_2_1_2_1))) OR (G (F (NOT FIREABLE(to_0_1_2_1v_0_2_2_2))) AND F ((FIREABLE(to_0_1_2_1v_0_2_2_2) AND G (FIREABLE(ti_2_1_1_0v_2_1_2_1)))))))",
"processed_size": 200,
"rewrites": 102
},
"result":
{
"edges": 3616,
"markings": 2180,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1166
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A ((F (NOT FIREABLE(to_1_0_2_1v_2_1_2_2)) OR G (NOT FIREABLE(ti_0_1_1_1v_1_1_1_2))))",
"processed_size": 84,
"rewrites": 102
},
"result":
{
"edges": 44,
"markings": 44,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1749
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 4,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A ((F (FIREABLE(to_0_0_2_0v_1_0_1_0)) OR (FIREABLE(ti_1_0_2_1v_2_0_2_0) AND (F (FIREABLE(to_0_0_2_0v_1_0_1_0)) AND F (NOT FIREABLE(ti_0_0_2_1v_1_1_1_1))))))",
"processed_size": 156,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3499
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3499
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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 (NOT FIREABLE(to_1_2_1_2v_2_1_1_1)))",
"processed_size": 41,
"rewrites": 104
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 16528,
"runtime": 129.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((** OR G(*))) : (A(X(X(F(*)))) AND A(X((* R *)))) : A(((** AND G(**)) OR (G(F(*)) AND F((** AND G(**)))))) : A(G(F((X(F(*)) OR (G(**) AND X(F(*))))))) : A(F(G((F(**) AND (** OR X(**)))))) : A((** OR F((X(F(*)) OR (X(*) R *))))) : A(F((F(G(**)) OR (** U G(**))))) : A((F(*) OR G(*))) : (A(X(*)) AND A(X(G(*)))) : A(G(*)) : A((F(**) OR (** AND (F(**) AND F(**))))) : A((F(**) OR (F(**) AND F(G((** AND X(**))))))) : A(F((** AND (G(**) AND (** U X(**)))))) : (A(G(*)) AND A(G(F(*)))) : A(X((F(**) OR (* AND X(G(*)))))) : A(X(F(**)))"
},
"net":
{
"arcs": 3264,
"conflict_clusters": 81,
"places": 81,
"places_significant": 80,
"singleton_clusters": 0,
"transitions": 1632
},
"result":
{
"preliminary_value": "yes no no no no unknown no no no no yes yes unknown no yes yes ",
"value": "yes no no no no unknown no no no no yes yes unknown no 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: 1713/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2592
lola: finding significant places
lola: 81 places, 1632 transitions, 80 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 LTLFireability.xml
lola: A ((FIREABLE(to_1_2_0_2v_2_2_1_2) OR NOT(F ((FIREABLE(to_1_0_0_0v_2_0_1_0) U FIREABLE(ti_0_2_1_2v_0_2_2_1)))))) : A (NOT(X ((G (X (FIREABLE(to_0_2_2_0v_1_1_2_0))) OR (FIREABLE(ti_0_0_0_1v_0_0_1_0) U FIREABLE(to_1_1_1_2v_2_1_0_1)))))) : A ((F (NOT(X (F (G (FIREABLE(to_0_1_2_1v_0_2_2_2)))))) U (FIREABLE(to_0_1_2_1v_0_2_2_2) AND G (FIREABLE(ti_2_1_1_0v_2_1_2_1))))) : A (G (F ((G (FIREABLE(to_1_2_1_0v_2_1_1_0)) U F ((NOT((FIREABLE(ti_0_1_2_0v_1_0_1_0) U FIREABLE(to_1_2_1_0v_2_1_1_0))) U NOT(G (X (FIREABLE(to_2_1_0_1v_2_2_1_2)))))))))) : A (F (X (G (F (((FIREABLE(ti_1_1_0_0v_2_1_1_1) AND FIREABLE(ti_0_1_2_0v_1_1_2_1)) U G (X (G ((FIREABLE(ti_1_0_1_2v_2_1_1_2) U X (FIREABLE(to_1_2_0_1v_2_1_1_1)))))))))))) : A ((NOT FIREABLE(ti_0_1_0_2v_0_2_0_1) OR F (NOT(G ((G (X (FIREABLE(ti_1_0_0_1v_1_1_1_1))) AND (X (FIREABLE(ti_0_1_0_2v_0_2_0_1)) U NOT FIREABLE(ti_0_1_0_2v_0_2_0_1)))))))) : A (F ((F (G (FIREABLE(ti_1_0_1_1v_2_0_2_2))) OR (FIREABLE(ti_1_0_1_1v_2_0_2_2) U G (FIREABLE(ti_1_0_1_1v_2_0_2_2)))))) : A (NOT((G (FIREABLE(to_1_0_2_1v_2_1_2_2)) AND F ((FIREABLE(ti_1_0_0_2v_2_0_1_2) U FIREABLE(ti_0_1_1_1v_1_1_1_2)))))) : A ((NOT(X (FIREABLE(to_2_1_0_2v_2_1_1_1))) AND NOT(F (X ((X (G (FIREABLE(ti_0_2_0_2v_1_1_0_1))) U F (FIREABLE(to_0_2_1_0v_1_2_2_0)))))))) : A (NOT((F (NOT(((FIREABLE(to_1_0_1_2v_1_1_2_1) OR G (FIREABLE(to_0_2_1_1v_1_1_2_1))) OR F (FIREABLE(to_0_2_1_1v_1_1_2_1))))) U F ((FIREABLE(to_1_1_0_1v_1_2_0_0) AND FIREABLE(to_2_1_0_1v_2_2_0_2)))))) : A ((F (FIREABLE(to_0_0_2_0v_1_0_1_0)) OR ((FIREABLE(ti_1_0_2_1v_2_0_2_0) AND F (FIREABLE(to_0_0_2_0v_1_0_1_0))) AND (FIREABLE(to_0_1_0_0v_0_1_1_1) U F (NOT FIREABLE(ti_0_0_2_1v_1_1_1_1)))))) : A ((F (G ((FIREABLE(ti_2_0_0_1v_2_0_1_2) AND X (FIREABLE(ti_0_1_2_0v_1_2_2_1))))) U ((FIREABLE(to_1_1_0_1v_2_2_0_2) OR X (NOT FIREABLE(ti_2_0_0_1v_2_0_1_2))) U F (FIREABLE(to_1_2_2_1v_2_1_2_1))))) : A (F ((((FIREABLE(ti_0_2_2_1v_1_1_1_1) AND FIREABLE(to_0_1_0_1v_0_2_1_2)) AND G (FIREABLE(ti_1_0_1_2v_2_0_2_2))) AND (FIREABLE(ti_0_2_0_0v_1_2_1_0) U X (FIREABLE(to_0_1_0_1v_0_2_1_2)))))) : A (G (NOT((FIREABLE(to_1_2_1_2v_2_1_1_1) OR G (FIREABLE(ti_1_0_2_0v_2_1_2_1)))))) : A ((X (F (FIREABLE(to_0_0_1_2v_0_1_2_1))) OR NOT(X ((FIREABLE(to_0_0_2_1v_1_0_1_2) OR X (F (FIREABLE(ti_1_0_1_0v_2_1_1_0)))))))) : A (X (F ((FIREABLE(to_1_1_1_1v_2_0_1_0) U FIREABLE(to_1_1_0_1v_2_1_1_2)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (X (F (NOT FIREABLE(to_0_2_2_0v_1_1_2_0))))) AND A (X ((NOT FIREABLE(ti_0_0_0_1v_0_0_1_0) R NOT FIREABLE(to_1_1_1_2v_2_1_0_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((NOT FIREABLE(ti_0_0_0_1v_0_0_1_0) R NOT FIREABLE(to_1_1_1_2v_2_1_0_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((NOT FIREABLE(ti_0_0_0_1v_0_0_1_0) R NOT FIREABLE(to_1_1_1_2v_2_1_0_1))))
lola: processed formula length: 79
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((X (F (NOT FIREABLE(to_2_1_0_1v_2_2_1_2))) OR (G (FIREABLE(to_1_2_1_0v_2_1_1_0)) AND X (F (NOT FIREABLE(to_2_1_0_1v_2_2_1_2))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((X (F (NOT FIREABLE(to_2_1_0_1v_2_2_1_2))) OR (G (FIREABLE(to_1_2_1_0v_2_1_1_0)) AND X (F (NOT FIREABLE(to_2_1_0_1v_2_2_1_2))))))))
lola: processed formula length: 140
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 479696 markings, 782560 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F (FIREABLE(to_1_2_0_1v_2_1_1_1)) AND (FIREABLE(ti_1_0_1_2v_2_1_1_2) OR X (FIREABLE(to_1_2_0_1v_2_1_1_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F (FIREABLE(to_1_2_0_1v_2_1_1_1)) AND (FIREABLE(ti_1_0_1_2v_2_1_1_2) OR X (FIREABLE(to_1_2_0_1v_2_1_1_1)))))))
lola: processed formula length: 120
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 34 markings, 53 edges
lola: ========================================
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(ti_0_1_0_2v_0_2_0_1) OR F ((X (F (NOT FIREABLE(ti_1_0_0_1v_1_1_1_1))) OR (X (NOT FIREABLE(ti_0_1_0_2v_0_2_0_1)) R FIREABLE(ti_0_1_0_2v_0_2_0_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((NOT FIREABLE(ti_0_1_0_2v_0_2_0_1) OR F ((X (F (NOT FIREABLE(ti_1_0_0_1v_1_1_1_1))) OR (X (NOT FIREABLE(ti_0_1_0_2v_0_2_0_1)) R FIREABLE(ti_0_1_0_2v_0_2_0_1))))))
lola: processed formula length: 165
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 525049 markings, 954454 edges, 105010 markings/sec, 0 secs
lola: 1011434 markings, 1829396 edges, 97277 markings/sec, 5 secs
lola: 1479998 markings, 2678711 edges, 93713 markings/sec, 10 secs
lola: 1936309 markings, 3509532 edges, 91262 markings/sec, 15 secs
lola: 2388955 markings, 4336005 edges, 90529 markings/sec, 20 secs
lola: 2852844 markings, 5179799 edges, 92778 markings/sec, 25 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (NOT FIREABLE(to_2_1_0_2v_2_1_1_1))) AND A (X (G (NOT FIREABLE(to_0_2_1_0v_1_2_2_0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (NOT FIREABLE(to_2_1_0_2v_2_1_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (NOT FIREABLE(to_2_1_0_2v_2_1_1_1)))
lola: processed formula length: 41
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F (FIREABLE(to_1_2_2_1v_2_1_2_1)) OR (F (FIREABLE(to_1_2_2_1v_2_1_2_1)) AND F (G ((FIREABLE(ti_2_0_0_1v_2_0_1_2) AND X (FIREABLE(ti_0_1_2_0v_1_2_2_1))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (FIREABLE(to_1_2_2_1v_2_1_2_1)) OR (F (FIREABLE(to_1_2_2_1v_2_1_2_1)) AND F (G ((FIREABLE(ti_2_0_0_1v_2_0_1_2) AND X (FIREABLE(ti_0_1_2_0v_1_2_2_1))))))))
lola: processed formula length: 160
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((FIREABLE(ti_0_2_2_1v_1_1_1_1) AND FIREABLE(to_0_1_0_1v_0_2_1_2)) AND (G (FIREABLE(ti_1_0_1_2v_2_0_2_2)) AND (FIREABLE(ti_0_2_0_0v_1_2_1_0) U X (FIREABLE(to_0_1_0_1v_0_2_1_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((FIREABLE(ti_0_2_2_1v_1_1_1_1) AND FIREABLE(to_0_1_0_1v_0_2_1_2)) AND (G (FIREABLE(ti_1_0_1_2v_2_0_2_2)) AND (FIREABLE(ti_0_2_0_0v_1_2_1_0) U X (FIREABLE(to_0_1_0_1v_0_2_1_2)))))))
lola: processed formula length: 187
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 505906 markings, 919853 edges, 101181 markings/sec, 0 secs
lola: 1030379 markings, 1864027 edges, 104895 markings/sec, 5 secs
lola: 1549875 markings, 2805871 edges, 103899 markings/sec, 10 secs
lola: 2061124 markings, 3737762 edges, 102250 markings/sec, 15 secs
lola: 2571214 markings, 4667693 edges, 102018 markings/sec, 20 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F (FIREABLE(to_0_0_1_2v_0_1_2_1)) OR (NOT FIREABLE(to_0_0_2_1v_1_0_1_2) AND X (G (NOT FIREABLE(ti_1_0_1_0v_2_1_1_0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F (FIREABLE(to_0_0_1_2v_0_1_2_1)) OR (NOT FIREABLE(to_0_0_2_1v_1_0_1_2) AND X (G (NOT FIREABLE(ti_1_0_1_0v_2_1_1_0)))))))
lola: processed formula length: 128
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3265 markings, 3264 edges
lola: ========================================
lola: subprocess 8 will run for 437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (FIREABLE(to_1_1_0_1v_2_1_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (FIREABLE(to_1_1_0_1v_2_1_1_2))))
lola: processed formula length: 41
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1633 markings, 1632 edges
lola: ========================================
lola: subprocess 9 will run for 500 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(to_1_1_0_1v_1_2_0_0) OR NOT FIREABLE(to_2_1_0_1v_2_2_0_2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((NOT FIREABLE(to_1_1_0_1v_1_2_0_0) OR NOT FIREABLE(to_2_1_0_1v_2_2_0_2))))
lola: processed formula length: 81
lola: 104 rewrites
lola: closed formula file LTLFireability.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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(to_1_1_0_1v_1_2_0_0) AND FIREABLE(to_2_1_0_1v_2_2_0_2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 583 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((F (G (FIREABLE(ti_1_0_1_1v_2_0_2_2))) OR (FIREABLE(ti_1_0_1_1v_2_0_2_2) U G (FIREABLE(ti_1_0_1_1v_2_0_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F (G (FIREABLE(ti_1_0_1_1v_2_0_2_2))) OR (FIREABLE(ti_1_0_1_1v_2_0_2_2) U G (FIREABLE(ti_1_0_1_1v_2_0_2_2))))))
lola: processed formula length: 118
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 7
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 92164 markings, 140327 edges
lola: ========================================
lola: subprocess 11 will run for 699 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(to_1_2_0_2v_2_2_1_2) OR G (NOT FIREABLE(ti_0_2_1_2v_0_2_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((FIREABLE(to_1_2_0_2v_2_2_1_2) OR G (NOT FIREABLE(ti_0_2_1_2v_0_2_2_1))))
lola: processed formula length: 76
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 874 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(to_0_1_2_1v_0_2_2_2) AND G (FIREABLE(ti_2_1_1_0v_2_1_2_1))) OR (G (F (NOT FIREABLE(to_0_1_2_1v_0_2_2_2))) AND F ((FIREABLE(to_0_1_2_1v_0_2_2_2) AND G (FIREABLE(ti_2_1_1_0v_2_1_2_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((FIREABLE(to_0_1_2_1v_0_2_2_2) AND G (FIREABLE(ti_2_1_1_0v_2_1_2_1))) OR (G (F (NOT FIREABLE(to_0_1_2_1v_0_2_2_2))) AND F ((FIREABLE(to_0_1_2_1v_0_2_2_2) AND G (FIREABLE(ti_2_1_1_0v_2_1_2_1)))))))
lola: processed formula length: 200
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2180 markings, 3616 edges
lola: ========================================
lola: subprocess 13 will run for 1166 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F (NOT FIREABLE(to_1_0_2_1v_2_1_2_2)) OR G (NOT FIREABLE(ti_0_1_1_1v_1_1_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (NOT FIREABLE(to_1_0_2_1v_2_1_2_2)) OR G (NOT FIREABLE(ti_0_1_1_1v_1_1_1_2))))
lola: processed formula length: 84
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 44 markings, 44 edges
lola: ========================================
lola: subprocess 14 will run for 1749 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F (FIREABLE(to_0_0_2_0v_1_0_1_0)) OR (FIREABLE(ti_1_0_2_1v_2_0_2_0) AND (F (FIREABLE(to_0_0_2_0v_1_0_1_0)) AND F (NOT FIREABLE(ti_0_0_2_1v_1_1_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (FIREABLE(to_0_0_2_0v_1_0_1_0)) OR (FIREABLE(ti_1_0_2_1v_2_0_2_0) AND (F (FIREABLE(to_0_0_2_0v_1_0_1_0)) AND F (NOT FIREABLE(ti_0_0_2_1v_1_1_1_1))))))
lola: processed formula length: 156
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3499 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (NOT FIREABLE(to_1_2_1_2v_2_1_1_1))) AND A (G (F (NOT FIREABLE(ti_1_0_2_0v_2_1_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3499 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(to_1_2_1_2v_2_1_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (NOT FIREABLE(to_1_2_1_2v_2_1_1_1)))
lola: processed formula length: 41
lola: 104 rewrites
lola: closed formula file LTLFireability.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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(to_1_2_1_2v_2_1_1_1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(ti_0_1_0_2v_0_2_0_1) OR F ((X (F (NOT FIREABLE(ti_1_0_0_1v_1_1_1_1))) OR (X (NOT FIREABLE(ti_0_1_0_2v_0_2_0_1)) R FIREABLE(ti_0_1_0_2v_0_2_0_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((NOT FIREABLE(ti_0_1_0_2v_0_2_0_1) OR F ((X (F (NOT FIREABLE(ti_1_0_0_1v_1_1_1_1))) OR (X (NOT FIREABLE(ti_0_1_0_2v_0_2_0_1)) R FIREABLE(ti_0_1_0_2v_0_2_0_1))))))
lola: processed formula length: 165
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 473797 markings, 861694 edges, 94759 markings/sec, 0 secs
lola: 986416 markings, 1784107 edges, 102524 markings/sec, 5 secs
lola: 1488278 markings, 2693698 edges, 100372 markings/sec, 10 secs
lola: 1988378 markings, 3604609 edges, 100020 markings/sec, 15 secs
lola: 2483799 markings, 4508388 edges, 99084 markings/sec, 20 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (F (((FIREABLE(ti_0_2_2_1v_1_1_1_1) AND FIREABLE(to_0_1_0_1v_0_2_1_2)) AND (G (FIREABLE(ti_1_0_1_2v_2_0_2_2)) AND (FIREABLE(ti_0_2_0_0v_1_2_1_0) U X (FIREABLE(to_0_1_0_1v_0_2_1_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((FIREABLE(ti_0_2_2_1v_1_1_1_1) AND FIREABLE(to_0_1_0_1v_0_2_1_2)) AND (G (FIREABLE(ti_1_0_1_2v_2_0_2_2)) AND (FIREABLE(ti_0_2_0_0v_1_2_1_0) U X (FIREABLE(to_0_1_0_1v_0_2_1_2)))))))
lola: processed formula length: 187
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 511592 markings, 930117 edges, 102318 markings/sec, 0 secs
lola: 1007594 markings, 1822420 edges, 99200 markings/sec, 5 secs
lola: 1525854 markings, 2761963 edges, 103652 markings/sec, 10 secs
lola: 2027902 markings, 3676878 edges, 100410 markings/sec, 15 secs
lola: 2532063 markings, 4596587 edges, 100832 markings/sec, 20 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no no no no unknown no no no no yes yes unknown no yes yes
lola:
preliminary result: yes no no no no unknown no no no no yes yes unknown no yes yes
lola: memory consumption: 16528 KB
lola: time consumption: 129 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished
BK_STOP 1590336768733
--------------------
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="NeighborGrid-PT-d4n3m2c23"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="win2019"
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-4028"
echo " Executing tool win2019"
echo " Input is NeighborGrid-PT-d4n3m2c23, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r120-csrt-158961292400052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NeighborGrid-PT-d4n3m2c23.tgz
mv NeighborGrid-PT-d4n3m2c23 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; 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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;