About the Execution of 2019-Gold for NeighborGrid-PT-d5n4m1t35
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15917.880 | 824542.00 | 869214.00 | 1681.70 | FF?F?F?FF?F????? | 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-158961292400054.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-d5n4m1t35, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r120-csrt-158961292400054
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 59M
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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.4K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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 59M 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-d5n4m1t35-00
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-01
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-02
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-03
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-04
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-05
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-06
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-07
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-08
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-09
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-10
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-11
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-12
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-13
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-14
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-15
=== Now, execution of the tool begins
BK_START 1590336780277
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ NeighborGrid-PT-d5n4m1t35 @ 3570 seconds
FORMULA NeighborGrid-PT-d5n4m1t35-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-13 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-14 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-09 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-15 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-06 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-04 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeighborGrid-PT-d5n4m1t35-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2746
rslt: Output for LTLFireability @ NeighborGrid-PT-d5n4m1t35
{
"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:13:00 2020
",
"timelimit": 3570
},
"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": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (X ((FIREABLE(ti_1_2_3_2_0v_2_3_0_2_0) R NOT FIREABLE(ti_0_0_0_3_1v_0_1_3_2_1))))",
"processed_size": 83,
"rewrites": 87
},
"result":
{
"edges": 2536,
"markings": 2536,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 4,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A ((NOT FIREABLE(to_1_2_0_0_2v_2_3_1_3_1) OR G ((NOT FIREABLE(ti_0_0_3_3_2v_3_1_2_2_1) AND (F (NOT FIREABLE(to_0_0_0_1_3v_3_3_3_1_2)) OR G (NOT FIREABLE(ti_0_0_3_3_2v_3_1_2_2_1)))))))",
"processed_size": 183,
"rewrites": 87
},
"result":
{
"edges": 3646,
"markings": 3646,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 252
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 252
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"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 (F (FIREABLE(to_3_2_0_0_0v_3_2_1_3_1))))",
"processed_size": 45,
"rewrites": 87
},
"result":
{
"edges": 7021,
"markings": 7011,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 260
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 4,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A (F (G (((FIREABLE(to_0_2_0_2_3v_1_2_3_2_2) OR FIREABLE(to_1_3_1_3_2v_2_0_0_3_2)) OR (FIREABLE(ti_2_3_1_3_1v_3_3_0_3_2) AND X (FIREABLE(to_1_3_1_3_2v_2_0_0_3_2)))))))",
"processed_size": 168,
"rewrites": 87
},
"result":
{
"edges": 2538,
"markings": 2537,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 283
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 283
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"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": 4,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A (G ((NOT FIREABLE(ti_2_3_3_3_2v_3_3_2_0_2) OR ((FIREABLE(ti_2_2_2_3_2v_3_1_2_0_3) AND FIREABLE(ti_2_2_2_2_1v_3_2_3_1_0)) AND X (G (FIREABLE(ti_2_3_3_3_2v_3_3_2_0_2)))))))",
"processed_size": 172,
"rewrites": 87
},
"result":
{
"edges": 2536,
"markings": 2536,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 311
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 3,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A (((X (NOT FIREABLE(ti_0_3_2_0_3v_1_0_1_3_0)) R (NOT FIREABLE(to_0_0_0_0_0v_3_0_3_3_0) AND FIREABLE(to_0_2_1_0_3v_1_1_0_1_0) AND NOT FIREABLE(ti_0_3_2_0_3v_1_0_1_3_0))) R FIREABLE(to_0_0_0_0_0v_3_0_3_3_0)))",
"processed_size": 207,
"rewrites": 87
},
"result":
{
"edges": 2536,
"markings": 2536,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 6,
"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": 346
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 3,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "A (((FIREABLE(ti_2_0_2_3_3v_3_3_1_3_2) U FIREABLE(ti_1_2_3_0_0v_1_3_2_1_3)) U (FIREABLE(to_2_1_3_1_1v_3_1_3_2_0) U X (FIREABLE(to_1_0_1_0_0v_2_1_1_0_1)))))",
"processed_size": 155,
"rewrites": 87
},
"result":
{
"edges": 3627,
"markings": 3627,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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"
}
}
],
"exit":
{
"error": null,
"memory": 1138376,
"runtime": 824.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X((* R *))) : (A(X(F(**))) AND A((* OR G((* AND (F(*) OR G(*))))))) : A(F(G((* OR X(F(*)))))) : (A(X(G(**))) AND A(G(F(**)))) : A(G((** OR (F(**) AND F(G(*)))))) : A(F(G((** OR (** AND X(**)))))) : A(F((* AND G(*)))) : (A(G(F((** AND X(G(**)))))) AND A(G((** OR (** AND X(G(**))))))) : A(((X(*) R *) R *)) : A(G(**)) : A(((** U **) U (** U X(**)))) : A(F(*)) : A(F(G((F((* OR X(**))) AND **)))) : (A(F(**)) AND A(X(G((F(**) AND (** OR **)))))) : A((X((** OR G((F(**) AND (** OR **))))) OR F(**))) : A(F(**))"
},
"net":
{
"arcs": 393216,
"conflict_clusters": 1024,
"places": 1024,
"places_significant": 1023,
"singleton_clusters": 0,
"transitions": 196608
},
"result":
{
"preliminary_value": "no no unknown no no no no no unknown ",
"value": "no no unknown no no no no no unknown "
},
"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: 197632/268435456 symbol table entries, 5872 collisions
lola: preprocessing...
lola: Size of bit vector: 32768
lola: finding significant places
lola: 1024 places, 196608 transitions, 1023 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 (NOT((X (NOT FIREABLE(ti_1_2_3_2_0v_2_3_0_2_0)) U X (FIREABLE(ti_0_0_0_3_1v_0_1_3_2_1))))) : A ((X (F ((FIREABLE(ti_0_3_0_3_3v_3_0_3_0_2) AND F (FIREABLE(ti_0_3_0_3_3v_3_0_3_0_2))))) AND NOT((FIREABLE(to_1_2_0_0_2v_2_3_1_3_1) AND F ((G (FIREABLE(to_0_0_0_1_3v_3_3_3_1_2)) U FIREABLE(ti_0_0_3_3_2v_3_1_2_2_1))))))) : A (G (F (G (NOT(X ((NOT FIREABLE(to_0_2_3_3_0v_0_3_2_2_1) AND X (G (FIREABLE(ti_0_1_2_0_1v_3_1_1_3_0)))))))))) : A ((G (X (FIREABLE(ti_0_1_1_3_1v_3_2_2_2_2))) AND G (X (F (FIREABLE(to_3_2_0_0_0v_3_2_1_3_1)))))) : A (G ((X ((X (NOT FIREABLE(ti_2_0_0_3_3v_3_3_1_3_3)) U F (NOT(X (F (FIREABLE(ti_1_0_2_1_3v_2_1_1_1_3))))))) U FIREABLE(to_2_2_0_3_1v_3_1_0_2_0)))) : A (NOT(G (F (NOT(((FIREABLE(to_0_2_0_2_3v_1_2_3_2_2) OR FIREABLE(to_1_3_1_3_2v_2_0_0_3_2)) OR (FIREABLE(ti_2_3_1_3_1v_3_3_0_3_2) AND X (FIREABLE(to_1_3_1_3_2v_2_0_0_3_2))))))))) : A (F (NOT(((FIREABLE(ti_1_1_2_3_1v_2_0_2_3_2) OR FIREABLE(to_0_3_3_2_2v_1_2_0_1_1)) OR F (FIREABLE(to_0_3_3_2_2v_1_2_0_1_1)))))) : A (G ((NOT FIREABLE(ti_2_3_3_3_2v_3_3_2_0_2) U ((FIREABLE(ti_2_2_2_3_2v_3_1_2_0_3) AND FIREABLE(ti_2_2_2_2_1v_3_2_3_1_0)) AND X (G (FIREABLE(ti_2_3_3_3_2v_3_3_2_0_2))))))) : A (NOT(((X (FIREABLE(ti_0_3_2_0_3v_1_0_1_3_0)) U (FIREABLE(to_0_0_0_0_0v_3_0_3_3_0) OR NOT FIREABLE(to_0_2_1_0_3v_1_1_0_1_0) OR FIREABLE(ti_0_3_2_0_3v_1_0_1_3_0))) U NOT FIREABLE(to_0_0_0_0_0v_3_0_3_3_0)))) : A (G (FIREABLE(to_2_3_2_0_3v_3_2_3_3_2))) : A (((FIREABLE(ti_2_0_2_3_3v_3_3_1_3_2) U FIREABLE(ti_1_2_3_0_0v_1_3_2_1_3)) U (FIREABLE(to_2_1_3_1_1v_3_1_3_2_0) U X (FIREABLE(to_1_0_1_0_0v_2_1_1_0_1))))) : A (F (NOT(G (FIREABLE(to_1_2_3_2_1v_2_2_2_1_0))))) : A (X (X (F ((G (F (NOT((FIREABLE(ti_0_2_0_1_3v_0_3_0_0_0) AND NOT(X (FIREABLE(ti_0_2_0_1_3v_0_3_0_0_0))))))) AND G (NOT FIREABLE(to_0_3_1_2_2v_3_0_0_2_2))))))) : A ((F (FIREABLE(to_1_2_1_1_1v_2_3_1_2_1)) AND G (X ((NOT FIREABLE(to_1_3_3_2_0v_2_3_0_3_3) U FIREABLE(ti_0_1_1_2_3v_0_1_2_3_2)))))) : A (((X (FIREABLE(ti_2_1_1_0_2v_2_2_2_1_3)) OR X (G ((FIREABLE(ti_2_1_1_0_2v_2_2_2_1_3) U FIREABLE(ti_0_1_3_0_1v_3_2_2_0_0))))) OR F ((FIREABLE(to_0_2_2_3_0v_1_1_1_3_0) U FIREABLE(ti_2_1_1_0_2v_2_2_2_1_3))))) : A (F (FIREABLE(ti_0_0_3_3_2v_1_1_2_2_2)))
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:497
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:536
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:353
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:536
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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 ((FIREABLE(ti_1_2_3_2_0v_2_3_0_2_0) R NOT FIREABLE(ti_0_0_0_3_1v_0_1_3_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((FIREABLE(ti_1_2_3_2_0v_2_3_0_2_0) R NOT FIREABLE(ti_0_0_0_3_1v_0_1_3_2_1))))
lola: processed formula length: 83
lola: 87 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: 2536 markings, 2536 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (F (FIREABLE(ti_0_3_0_3_3v_3_0_3_0_2)))) AND A ((NOT FIREABLE(to_1_2_0_0_2v_2_3_1_3_1) OR G ((NOT FIREABLE(ti_0_0_3_3_2v_3_1_2_2_1) AND (F (NOT FIREABLE(to_0_0_0_1_3v_3_3_3_1_2)) OR G (NOT FIREABLE(ti_0_0_3_3_2v_3_1_2_2_1))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(to_1_2_0_0_2v_2_3_1_3_1) OR G ((NOT FIREABLE(ti_0_0_3_3_2v_3_1_2_2_1) AND (F (NOT FIREABLE(to_0_0_0_1_3v_3_3_3_1_2)) OR G (NOT FIREABLE(ti_0_0_3_3_2v_3_1_2_2_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((NOT FIREABLE(to_1_2_0_0_2v_2_3_1_3_1) OR G ((NOT FIREABLE(ti_0_0_3_3_2v_3_1_2_2_1) AND (F (NOT FIREABLE(to_0_0_0_1_3v_3_3_3_1_2)) OR G (NOT FIREABLE(ti_0_0_3_3_2v_3_1_2_2_1)))))))
lola: processed formula length: 183
lola: 87 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: 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: 1478 markings, 1477 edges, 296 markings/sec, 0 secs
lola: 2205 markings, 2204 edges, 145 markings/sec, 5 secs
lola: 2766 markings, 2765 edges, 112 markings/sec, 10 secs
lola: 3103 markings, 3102 edges, 67 markings/sec, 15 secs
lola: 3556 markings, 3555 edges, 91 markings/sec, 20 secs
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: 3646 markings, 3646 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((FIREABLE(to_0_2_3_3_0v_0_3_2_2_1) OR X (F (NOT FIREABLE(ti_0_1_2_0_1v_3_1_1_3_0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((FIREABLE(to_0_2_3_3_0v_0_3_2_2_1) OR X (F (NOT FIREABLE(ti_0_1_2_0_1v_3_1_1_3_0)))))))
lola: processed formula length: 96
lola: 87 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: 7482 markings, 7499 edges, 1496 markings/sec, 0 secs
lola: 25564 markings, 26005 edges, 3616 markings/sec, 5 secs
lola: 47920 markings, 48992 edges, 4471 markings/sec, 10 secs
lola: 74428 markings, 76737 edges, 5302 markings/sec, 15 secs
lola: 103455 markings, 107948 edges, 5805 markings/sec, 20 secs
lola: 131852 markings, 138479 edges, 5679 markings/sec, 25 secs
lola: 160175 markings, 168933 edges, 5665 markings/sec, 30 secs
lola: 188556 markings, 199447 edges, 5676 markings/sec, 35 secs
lola: 216976 markings, 229805 edges, 5684 markings/sec, 40 secs
lola: 245397 markings, 259617 edges, 5684 markings/sec, 45 secs
lola: 273569 markings, 288727 edges, 5634 markings/sec, 50 secs
lola: 301821 markings, 317990 edges, 5650 markings/sec, 55 secs
lola: 329278 markings, 349253 edges, 5491 markings/sec, 60 secs
lola: 356972 markings, 380812 edges, 5539 markings/sec, 65 secs
lola: 384721 markings, 412400 edges, 5550 markings/sec, 70 secs
lola: 412542 markings, 444090 edges, 5564 markings/sec, 75 secs
lola: 440311 markings, 475730 edges, 5554 markings/sec, 80 secs
lola: 468106 markings, 507390 edges, 5559 markings/sec, 85 secs
lola: 495923 markings, 539056 edges, 5563 markings/sec, 90 secs
lola: 523833 markings, 570845 edges, 5582 markings/sec, 95 secs
lola: 551636 markings, 602513 edges, 5561 markings/sec, 100 secs
lola: 579323 markings, 634068 edges, 5537 markings/sec, 105 secs
lola: 607008 markings, 665585 edges, 5537 markings/sec, 110 secs
lola: 634623 markings, 697030 edges, 5523 markings/sec, 115 secs
lola: 662328 markings, 728600 edges, 5541 markings/sec, 120 secs
lola: 690636 markings, 758877 edges, 5662 markings/sec, 125 secs
lola: 718905 markings, 788353 edges, 5654 markings/sec, 130 secs
lola: 746755 markings, 817131 edges, 5570 markings/sec, 135 secs
lola: 774649 markings, 847011 edges, 5579 markings/sec, 140 secs
lola: 802264 markings, 878453 edges, 5523 markings/sec, 145 secs
lola: 829781 markings, 909795 edges, 5503 markings/sec, 150 secs
lola: 855121 markings, 938654 edges, 5068 markings/sec, 155 secs
lola: 880130 markings, 967136 edges, 5002 markings/sec, 160 secs
lola: 904691 markings, 995110 edges, 4912 markings/sec, 165 secs
lola: 929724 markings, 1023616 edges, 5007 markings/sec, 170 secs
lola: 955591 markings, 1053096 edges, 5173 markings/sec, 175 secs
lola: 981284 markings, 1082359 edges, 5139 markings/sec, 180 secs
lola: 1006004 markings, 1110503 edges, 4944 markings/sec, 185 secs
lola: 1030999 markings, 1138967 edges, 4999 markings/sec, 190 secs
lola: 1056927 markings, 1168509 edges, 5186 markings/sec, 195 secs
lola: 1082482 markings, 1197601 edges, 5111 markings/sec, 200 secs
lola: 1107785 markings, 1226419 edges, 5061 markings/sec, 205 secs
lola: 1132939 markings, 1254922 edges, 5031 markings/sec, 210 secs
lola: 1159774 markings, 1283133 edges, 5367 markings/sec, 215 secs
lola: 1188618 markings, 1313089 edges, 5769 markings/sec, 220 secs
lola: 1217500 markings, 1342934 edges, 5776 markings/sec, 225 secs
lola: 1246127 markings, 1374501 edges, 5725 markings/sec, 230 secs
lola: 1274412 markings, 1406715 edges, 5657 markings/sec, 235 secs
lola: 1300596 markings, 1436525 edges, 5237 markings/sec, 240 secs
lola: 1325926 markings, 1465375 edges, 5066 markings/sec, 245 secs
lola: local time limit reached - aborting
lola:
preliminary result: no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (G (FIREABLE(ti_0_1_1_3_1v_3_2_2_2_2)))) AND A (G (F (FIREABLE(to_3_2_0_0_0v_3_2_1_3_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(to_3_2_0_0_0v_3_2_1_3_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(to_3_2_0_0_0v_3_2_1_3_1))))
lola: processed formula length: 45
lola: 87 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: 1323 markings, 1322 edges, 265 markings/sec, 0 secs
lola: 2072 markings, 2071 edges, 150 markings/sec, 5 secs
lola: 2607 markings, 2606 edges, 107 markings/sec, 10 secs
lola: 3077 markings, 3076 edges, 94 markings/sec, 15 secs
lola: 3378 markings, 3387 edges, 60 markings/sec, 20 secs
lola: 3592 markings, 3601 edges, 43 markings/sec, 25 secs
lola: 3671 markings, 3680 edges, 16 markings/sec, 30 secs
lola: 3757 markings, 3766 edges, 17 markings/sec, 35 secs
lola: 3826 markings, 3835 edges, 14 markings/sec, 40 secs
lola: 3886 markings, 3895 edges, 12 markings/sec, 45 secs
lola: 3980 markings, 3989 edges, 19 markings/sec, 50 secs
lola: 4049 markings, 4058 edges, 14 markings/sec, 55 secs
lola: 4135 markings, 4144 edges, 17 markings/sec, 60 secs
lola: 4436 markings, 4445 edges, 60 markings/sec, 65 secs
lola: 4783 markings, 4792 edges, 69 markings/sec, 70 secs
lola: 5050 markings, 5059 edges, 53 markings/sec, 75 secs
lola: 5192 markings, 5201 edges, 28 markings/sec, 80 secs
lola: 5292 markings, 5301 edges, 20 markings/sec, 85 secs
lola: 5389 markings, 5398 edges, 19 markings/sec, 90 secs
lola: 5477 markings, 5486 edges, 18 markings/sec, 95 secs
lola: 5557 markings, 5566 edges, 16 markings/sec, 100 secs
lola: 5633 markings, 5642 edges, 15 markings/sec, 105 secs
lola: 5712 markings, 5721 edges, 16 markings/sec, 110 secs
lola: 5792 markings, 5801 edges, 16 markings/sec, 115 secs
lola: 5875 markings, 5884 edges, 17 markings/sec, 120 secs
lola: 6012 markings, 6021 edges, 27 markings/sec, 125 secs
lola: 6267 markings, 6276 edges, 51 markings/sec, 130 secs
lola: 6524 markings, 6533 edges, 51 markings/sec, 135 secs
lola: 6639 markings, 6648 edges, 23 markings/sec, 140 secs
lola: 6759 markings, 6768 edges, 24 markings/sec, 145 secs
lola: 6967 markings, 6976 edges, 42 markings/sec, 150 secs
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: 7011 markings, 7021 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((FIREABLE(to_0_2_0_2_3v_1_2_3_2_2) OR FIREABLE(to_1_3_1_3_2v_2_0_0_3_2)) OR (FIREABLE(ti_2_3_1_3_1v_3_3_0_3_2) AND X (FIREABLE(to_1_3_1_3_2v_2_0_0_3_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((FIREABLE(to_0_2_0_2_3v_1_2_3_2_2) OR FIREABLE(to_1_3_1_3_2v_2_0_0_3_2)) OR (FIREABLE(ti_2_3_1_3_1v_3_3_0_3_2) AND X (FIREABLE(to_1_3_1_3_2v_2_0_0_3_2)))))))
lola: processed formula length: 168
lola: 87 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: 2537 markings, 2538 edges
lola: ========================================
lola: subprocess 5 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F (((FIREABLE(ti_2_2_2_3_2v_3_1_2_0_3) AND FIREABLE(ti_2_2_2_2_1v_3_2_3_1_0)) AND X (G (FIREABLE(ti_2_3_3_3_2v_3_3_2_0_2))))))) AND A (G ((NOT FIREABLE(ti_2_3_3_3_2v_3_3_2_0_2) OR ((FIREABLE(ti_2_2_2_3_2v_3_1_2_0_3) AND FIREABLE(ti_2_2_2_2_1v_3_2_3_1_0)) AND X (G (FIREABLE(ti_2_3_3_3_2v_3_3_2_0_2))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(ti_2_3_3_3_2v_3_3_2_0_2) OR ((FIREABLE(ti_2_2_2_3_2v_3_1_2_0_3) AND FIREABLE(ti_2_2_2_2_1v_3_2_3_1_0)) AND X (G (FIREABLE(ti_2_3_3_3_2v_3_3_2_0_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((NOT FIREABLE(ti_2_3_3_3_2v_3_3_2_0_2) OR ((FIREABLE(ti_2_2_2_3_2v_3_1_2_0_3) AND FIREABLE(ti_2_2_2_2_1v_3_2_3_1_0)) AND X (G (FIREABLE(ti_2_3_3_3_2v_3_3_2_0_2)))))))
lola: processed formula length: 172
lola: 87 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: 2536 markings, 2536 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((X (NOT FIREABLE(ti_0_3_2_0_3v_1_0_1_3_0)) R (NOT FIREABLE(to_0_0_0_0_0v_3_0_3_3_0) AND FIREABLE(to_0_2_1_0_3v_1_1_0_1_0) AND NOT FIREABLE(ti_0_3_2_0_3v_1_0_1_3_0))) R FIREABLE(to_0_0_0_0_0v_3_0_3_3_0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((X (NOT FIREABLE(ti_0_3_2_0_3v_1_0_1_3_0)) R (NOT FIREABLE(to_0_0_0_0_0v_3_0_3_3_0) AND FIREABLE(to_0_2_1_0_3v_1_1_0_1_0) AND NOT FIREABLE(ti_0_3_2_0_3v_1_0_1_3_0))) R FIREABLE(to_0_0_0_0_0v_3_0_3_3_0)))
lola: processed formula length: 207
lola: 87 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: 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: 2536 markings, 2536 edges
lola: ========================================
lola: subprocess 7 will run for 346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(ti_2_0_2_3_3v_3_3_1_3_2) U FIREABLE(ti_1_2_3_0_0v_1_3_2_1_3)) U (FIREABLE(to_2_1_3_1_1v_3_1_3_2_0) U X (FIREABLE(to_1_0_1_0_0v_2_1_1_0_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((FIREABLE(ti_2_0_2_3_3v_3_3_1_3_2) U FIREABLE(ti_1_2_3_0_0v_1_3_2_1_3)) U (FIREABLE(to_2_1_3_1_1v_3_1_3_2_0) U X (FIREABLE(to_1_0_1_0_0v_2_1_1_0_1)))))
lola: processed formula length: 155
lola: 87 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: 3627 markings, 3627 edges
lola: ========================================
lola: subprocess 8 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((NOT FIREABLE(ti_0_2_0_1_3v_0_3_0_0_0) OR X (FIREABLE(ti_0_2_0_1_3v_0_3_0_0_0)))) AND NOT FIREABLE(to_0_3_1_2_2v_3_0_0_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((NOT FIREABLE(ti_0_2_0_1_3v_0_3_0_0_0) OR X (FIREABLE(ti_0_2_0_1_3v_0_3_0_0_0)))) AND NOT FIREABLE(to_0_3_1_2_2v_3_0_0_2_2)))))
lola: processed formula length: 140
lola: 87 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: 7434 markings, 7451 edges, 1487 markings/sec, 0 secs
lola: 25575 markings, 26028 edges, 3628 markings/sec, 5 secs
lola: 48276 markings, 49396 edges, 4540 markings/sec, 10 secs
lola: 75899 markings, 78502 edges, 5525 markings/sec, 15 secs
lola: 104682 markings, 109625 edges, 5757 markings/sec, 20 secs
lola: 133304 markings, 140574 edges, 5724 markings/sec, 25 secs
lola: 162385 markings, 172021 edges, 5816 markings/sec, 30 secs
lola: 191466 markings, 203556 edges, 5816 markings/sec, 35 secs
lola: 220522 markings, 234182 edges, 5811 markings/sec, 40 secs
lola: 249060 markings, 263845 edges, 5708 markings/sec, 45 secs
lola: 277462 markings, 293227 edges, 5680 markings/sec, 50 secs
lola: 305855 markings, 324403 edges, 5679 markings/sec, 55 secs
lola: 333789 markings, 355745 edges, 5587 markings/sec, 60 secs
lola: 361428 markings, 386772 edges, 5528 markings/sec, 65 secs
lola: 389055 markings, 417765 edges, 5525 markings/sec, 70 secs
lola: 416780 markings, 448863 edges, 5545 markings/sec, 75 secs
lola: 444552 markings, 480029 edges, 5554 markings/sec, 80 secs
lola: 472416 markings, 511295 edges, 5573 markings/sec, 85 secs
lola: 499446 markings, 541616 edges, 5406 markings/sec, 90 secs
lola: 527028 markings, 572569 edges, 5516 markings/sec, 95 secs
lola: 554384 markings, 603267 edges, 5471 markings/sec, 100 secs
lola: 581767 markings, 633982 edges, 5477 markings/sec, 105 secs
lola: 609241 markings, 664812 edges, 5495 markings/sec, 110 secs
lola: 635138 markings, 692956 edges, 5179 markings/sec, 115 secs
lola: 660740 markings, 719858 edges, 5120 markings/sec, 120 secs
lola: 685973 markings, 745961 edges, 5047 markings/sec, 125 secs
lola: 713280 markings, 774209 edges, 5461 markings/sec, 130 secs
lola: 741412 markings, 805733 edges, 5626 markings/sec, 135 secs
lola: 769511 markings, 837247 edges, 5620 markings/sec, 140 secs
lola: 797295 markings, 868427 edges, 5557 markings/sec, 145 secs
lola: 824889 markings, 899384 edges, 5519 markings/sec, 150 secs
lola: 852692 markings, 930586 edges, 5561 markings/sec, 155 secs
lola: 880560 markings, 961857 edges, 5574 markings/sec, 160 secs
lola: 908354 markings, 993046 edges, 5559 markings/sec, 165 secs
lola: 936380 markings, 1024483 edges, 5605 markings/sec, 170 secs
lola: 963312 markings, 1054699 edges, 5386 markings/sec, 175 secs
lola: 991352 markings, 1086177 edges, 5608 markings/sec, 180 secs
lola: 1019172 markings, 1117372 edges, 5564 markings/sec, 185 secs
lola: 1046655 markings, 1148270 edges, 5497 markings/sec, 190 secs
lola: 1074797 markings, 1178081 edges, 5628 markings/sec, 195 secs
lola: 1102749 markings, 1207185 edges, 5590 markings/sec, 200 secs
lola: 1130534 markings, 1235928 edges, 5557 markings/sec, 205 secs
lola: 1158227 markings, 1266028 edges, 5539 markings/sec, 210 secs
lola: 1185136 markings, 1296218 edges, 5382 markings/sec, 215 secs
lola: 1210336 markings, 1324493 edges, 5040 markings/sec, 220 secs
lola: 1235518 markings, 1352749 edges, 5036 markings/sec, 225 secs
lola: 1260479 markings, 1380751 edges, 4992 markings/sec, 230 secs
lola: 1285579 markings, 1408919 edges, 5020 markings/sec, 235 secs
lola: 1310832 markings, 1437249 edges, 5051 markings/sec, 240 secs
lola: 1338038 markings, 1467775 edges, 5441 markings/sec, 245 secs
lola: 1366173 markings, 1499349 edges, 5627 markings/sec, 250 secs
lola: 1394179 markings, 1530765 edges, 5601 markings/sec, 255 secs
lola: 1422367 markings, 1562395 edges, 5638 markings/sec, 260 secs
lola: 1449132 markings, 1592434 edges, 5353 markings/sec, 265 secs
lola: 1475418 markings, 1622016 edges, 5257 markings/sec, 270 secs
lola: 1500918 markings, 1648894 edges, 5100 markings/sec, 275 secs
lola: 1527534 markings, 1676634 edges, 5323 markings/sec, 280 secs
lola: 1555437 markings, 1705499 edges, 5581 markings/sec, 285 secs
lola: 1583640 markings, 1735995 edges, 5641 markings/sec, 290 secs
lola: 1611549 markings, 1767316 edges, 5582 markings/sec, 295 secs
lola: 1639750 markings, 1798952 edges, 5640 markings/sec, 300 secs
lola: 1667696 markings, 1830315 edges, 5589 markings/sec, 305 secs
lola: 1695510 markings, 1861514 edges, 5563 markings/sec, 310 secs
lola: 1722914 markings, 1892261 edges, 5481 markings/sec, 315 secs
lola: 1750397 markings, 1923103 edges, 5497 markings/sec, 320 secs
lola: 1777946 markings, 1954014 edges, 5510 markings/sec, 325 secs
lola: 1805603 markings, 1985039 edges, 5531 markings/sec, 330 secs
lola: 1833669 markings, 2016543 edges, 5613 markings/sec, 335 secs
lola: 1861071 markings, 2047272 edges, 5480 markings/sec, 340 secs
lola: 1886971 markings, 2076331 edges, 5180 markings/sec, 345 secs
lola: 1892640 markings, 2082696 edges, 1134 markings/sec, 350 secs
lola: 1893486 markings, 2083658 edges, 169 markings/sec, 355 secs
lola: 1894599 markings, 2084903 edges, 223 markings/sec, 360 secs
lola: Child process aborted or communication problem between parent and child process
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: RESULT
lola:
SUMMARY: no no unknown no no no no no unknown
lola:
preliminary result: no no unknown no no no no no unknown
lola: memory consumption: 1138376 KB
lola: time consumption: 824 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished
BK_STOP 1590337604819
--------------------
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-d5n4m1t35"
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-d5n4m1t35, 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-158961292400054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NeighborGrid-PT-d5n4m1t35.tgz
mv NeighborGrid-PT-d5n4m1t35 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 ;