fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r056-oct2-162038334500074
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for ClientsAndServers-PT-N0010P0

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16253.359 3600000.00 872170.00 7438.90 ?FFTFTTFFFFFFFFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2021-input.r056-oct2-162038334500074.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 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 gold2020
Input is ClientsAndServers-PT-N0010P0, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334500074
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 9.3K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 12:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 12:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.1K May 5 16:51 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 ClientsAndServers-PT-N0010P0-00
FORMULA_NAME ClientsAndServers-PT-N0010P0-01
FORMULA_NAME ClientsAndServers-PT-N0010P0-02
FORMULA_NAME ClientsAndServers-PT-N0010P0-03
FORMULA_NAME ClientsAndServers-PT-N0010P0-04
FORMULA_NAME ClientsAndServers-PT-N0010P0-05
FORMULA_NAME ClientsAndServers-PT-N0010P0-06
FORMULA_NAME ClientsAndServers-PT-N0010P0-07
FORMULA_NAME ClientsAndServers-PT-N0010P0-08
FORMULA_NAME ClientsAndServers-PT-N0010P0-09
FORMULA_NAME ClientsAndServers-PT-N0010P0-10
FORMULA_NAME ClientsAndServers-PT-N0010P0-11
FORMULA_NAME ClientsAndServers-PT-N0010P0-12
FORMULA_NAME ClientsAndServers-PT-N0010P0-13
FORMULA_NAME ClientsAndServers-PT-N0010P0-14
FORMULA_NAME ClientsAndServers-PT-N0010P0-15

=== Now, execution of the tool begins

BK_START 1620896944353

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 09:09:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 09:09:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 09:09:05] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2021-05-13 09:09:05] [INFO ] Transformed 25 places.
[2021-05-13 09:09:05] [INFO ] Transformed 18 transitions.
[2021-05-13 09:09:05] [INFO ] Parsed PT model containing 25 places and 18 transitions in 58 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 43906 steps, including 46 resets, run visited all 24 properties in 27 ms. (steps per millisecond=1626 )
[2021-05-13 09:09:06] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-13 09:09:06] [INFO ] Flatten gal took : 19 ms
FORMULA ClientsAndServers-PT-N0010P0-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P0-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P0-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 09:09:06] [INFO ] Flatten gal took : 3 ms
[2021-05-13 09:09:06] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2021-05-13 09:09:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ClientsAndServers-PT-N0010P0 @ 3570 seconds

FORMULA ClientsAndServers-PT-N0010P0-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P0-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P0-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P0-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P0-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P0-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P0-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P0-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P0-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P0-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P0-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P0-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P0-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2707
rslt: Output for LTLFireability @ ClientsAndServers-PT-N0010P0

{
"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": "mcc2020",
"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": "Thu May 13 09:09:06 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 3,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((F (((1 <= p0) AND (1 <= p13))) U (1 <= p10)) AND (((p10 <= 0) U G ((1 <= p10))) AND X (((1 <= p4) AND (1 <= p21))))) U ((1 <= p0) AND (1 <= p13)))",
"processed_size": 149,
"rewrites": 59
},
"result":
{
"edges": 503,
"markings": 502,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((1 <= p16) AND (X (((1 <= p11) AND (1 <= p17))) OR (G ((1 <= p16)) AND (F (((1 <= p11) AND (1 <= p17))) OR ((1 <= p11) AND (1 <= p17)))))))",
"processed_size": 143,
"rewrites": 59
},
"result":
{
"edges": 501,
"markings": 501,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((X (F ((p22 <= 0))) AND (1 <= p16)))",
"processed_size": 39,
"rewrites": 59
},
"result":
{
"edges": 558,
"markings": 480,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 356
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p22)",
"processed_size": 10,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((F (((p2 <= 0))) AND (p22 <= 0)))",
"processed_size": 36,
"rewrites": 59
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((G ((1 <= p12)) AND F ((1 <= p12))))",
"processed_size": 39,
"rewrites": 59
},
"result":
{
"edges": 501,
"markings": 501,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 4,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (X (X (G ((((p0 <= 0) OR (p13 <= 0)) AND ((p0 <= 0) OR (p13 <= 0))))))))",
"processed_size": 79,
"rewrites": 59
},
"result":
{
"edges": 501,
"markings": 501,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 509
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (((p0 <= 0) OR (p13 <= 0)))",
"processed_size": 30,
"rewrites": 59
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p2 <= 0))",
"processed_size": 11,
"rewrites": 61
},
"result":
{
"edges": 8539,
"markings": 7609,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((p3 <= 0))))",
"processed_size": 19,
"rewrites": 59
},
"result":
{
"edges": 321,
"markings": 319,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1050
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((F (G (((1 <= p10) OR (1 <= p16)))) OR (G ((1 <= p10)) AND F ((1 <= p10)))))",
"processed_size": 80,
"rewrites": 59
},
"result":
{
"edges": 502,
"markings": 502,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 1575
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((G (((p16 <= 0) AND ((p8 <= 0) OR (p15 <= 0)))) R (F (((1 <= p5) AND (1 <= p15))) AND (p16 <= 0))))",
"processed_size": 103,
"rewrites": 59
},
"result":
{
"edges": 150928415,
"markings": 26315843,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 3078
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3078
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((p5 <= 0) OR (p15 <= 0))))",
"processed_size": 34,
"rewrites": 59
},
"result":
{
"edges": 693,
"markings": 576,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3328,
"runtime": 863.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(*)) : (((F(**) U **) AND ((** U G(**)) AND X(**))) U **) : X((** AND (X(**) OR (G(**) AND (F(**) OR **))))) : F(**) : F((X(F(*)) AND **)) : ((X(G(**)) U **) OR (** OR X((F(*) AND *)))) : F((G(*) R (F(*) AND *))) : X((G(**) AND F(**))) : X(X(X(X(G(*))))) : (G((F(G(**)) AND *)) AND F(G(*))) : F((F(G(**)) OR (G(**) AND F(**)))) : F(G(*)) : (G(F((X(G(**)) AND F(**)))) OR X(*))"
},
"net":
{
"arcs": 54,
"conflict_clusters": 16,
"places": 25,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "unknown no no no yes yes no no no no no no yes ",
"value": "unknown no no no yes yes no no no no no no 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: 43/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 18 transitions, 17 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: LP says that atomic proposition is always true: (1 <= p14)
lola: LP says that atomic proposition is always true: (1 <= p14)
lola: LP says that atomic proposition is always true: (1 <= p14)
lola: LP says that atomic proposition is always true: (1 <= p14)
lola: LP says that atomic proposition is always true: (1 <= p14)
lola: LP says that atomic proposition is always true: (1 <= p14)
lola: LP says that atomic proposition is always true: (1 <= p14)
lola: X (X ((((1 <= p10) AND (1 <= p5) AND (1 <= p15)) U F (G (NOT(F (X (G ((p10 <= 0)))))))))) : ((((F (((1 <= p0) AND (1 <= p13))) U (1 <= p10)) AND ((p10 <= 0) U G ((1 <= p10)))) AND X (((1 <= p4) AND (1 <= p21)))) U ((1 <= p0) AND (1 <= p13))) : X (((1 <= p16) AND (X (((1 <= p11) AND (1 <= p17))) OR (G ((1 <= p16)) AND (F (((1 <= p11) AND (1 <= p17))) OR ((1 <= p11) AND (1 <= p17))))))) : F (((1 <= p2))) : F ((NOT(X (G ((1 <= p22)))) AND (1 <= p16))) : (((G (X (((1 <= p7) AND (1 <= p23)))) U ((1 <= p2))) OR (1 <= p22)) OR NOT(X ((G (((1 <= p2))) OR (1 <= p22))))) : F (NOT((F (((1 <= p16) OR ((1 <= p8) AND (1 <= p15)))) U (G (((p5 <= 0) OR (p15 <= 0))) OR (1 <= p16))))) : X ((G ((1 <= p12)) AND F ((1 <= p12)))) : X (X (X (NOT(F (X (F ((((1 <= p0) AND (1 <= p13)) OR ((1 <= p0) AND (1 <= p13)))))))))) : (NOT(F ((F (G (NOT(G (((1 <= p7) AND (1 <= p23)))))) OR (1 <= p6)))) AND NOT(G (F (((1 <= p5) AND (1 <= p15)))))) : F ((F ((((1 <= p3)) U X (G (((1 <= p10) OR (1 <= p16)))))) OR (G ((1 <= p10)) AND F ((1 <= p10))))) : F (G (NOT(((1 <= p12) U G (X (F (((1 <= p3))))))))) : (X (G (F ((X (G (((1 <= p0) AND (1 <= p13) AND (1 <= p2)))) AND F (((1 <= p3))))))) OR NOT(X (((1 <= p0) AND (1 <= p13)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:335
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:297
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((F (((1 <= p0) AND (1 <= p13))) U (1 <= p10)) AND (((p10 <= 0) U G ((1 <= p10))) AND X (((1 <= p4) AND (1 <= p21))))) U ((1 <= p0) AND (1 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((F (((1 <= p0) AND (1 <= p13))) U (1 <= p10)) AND (((p10 <= 0) U G ((1 <= p10))) AND X (((1 <= p4) AND (1 <= p21))))) U ((1 <= p0) AND (1 <= p13)))
lola: processed formula length: 149
lola: 59 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: 502 markings, 503 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p16) AND (X (((1 <= p11) AND (1 <= p17))) OR (G ((1 <= p16)) AND (F (((1 <= p11) AND (1 <= p17))) OR ((1 <= p11) AND (1 <= p17)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p16) AND (X (((1 <= p11) AND (1 <= p17))) OR (G ((1 <= p16)) AND (F (((1 <= p11) AND (1 <= p17))) OR ((1 <= p11) AND (1 <= p17)))))))
lola: processed formula length: 143
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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: 501 markings, 501 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F ((p22 <= 0))) AND (1 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F ((p22 <= 0))) AND (1 <= p16)))
lola: processed formula length: 39
lola: 59 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: 480 markings, 558 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (G (((1 <= p7) AND (1 <= p23)))) U ((1 <= p2))) OR ((1 <= p22) OR X ((F (((p2 <= 0))) AND (p22 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p22)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p22)
lola: processed formula length: 10
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((p2 <= 0))) AND (p22 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((p2 <= 0))) AND (p22 <= 0)))
lola: processed formula length: 36
lola: 59 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: 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: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((1 <= p12)) AND F ((1 <= p12))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((1 <= p12)) AND F ((1 <= p12))))
lola: processed formula length: 39
lola: 59 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: 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: 501 markings, 501 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (G ((((p0 <= 0) OR (p13 <= 0)) AND ((p0 <= 0) OR (p13 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (G ((((p0 <= 0) OR (p13 <= 0)) AND ((p0 <= 0) OR (p13 <= 0))))))))
lola: processed formula length: 79
lola: 59 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: 501 markings, 501 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((X (G (((1 <= p0) AND (1 <= p13) AND (1 <= p2)))) AND F (((1 <= p3)))))) OR X (((p0 <= 0) OR (p13 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p0 <= 0) OR (p13 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p0 <= 0) OR (p13 <= 0)))
lola: processed formula length: 30
lola: 59 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p2)))
lola: lola: ========================================
lola: ========================================SUBTASK
lola: checking eventual occurrence

lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p2 <= 0))
lola: processed formula length: 11
lola: 61 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7609 markings, 8539 edges
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p3 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p3 <= 0))))
lola: processed formula length: 19
lola: 59 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: 319 markings, 321 edges
lola: ========================================
lola: subprocess 9 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((1 <= p10)))
lola: processed formula length: 18
lola: 59 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: 2696935 markings, 9210728 edges, 539387 markings/sec, 0 secs
lola: 4977854 markings, 17584118 edges, 456184 markings/sec, 5 secs
lola: 7159400 markings, 25954988 edges, 436309 markings/sec, 10 secs
lola: 9159391 markings, 34071277 edges, 399998 markings/sec, 15 secs
lola: 11309796 markings, 42140114 edges, 430081 markings/sec, 20 secs
lola: 13365729 markings, 50000328 edges, 411187 markings/sec, 25 secs
lola: 15481620 markings, 58313237 edges, 423178 markings/sec, 30 secs
lola: 17444585 markings, 66534478 edges, 392593 markings/sec, 35 secs
lola: 19366841 markings, 74647879 edges, 384451 markings/sec, 40 secs
lola: 21286919 markings, 82813382 edges, 384016 markings/sec, 45 secs
lola: 23315209 markings, 91076828 edges, 405658 markings/sec, 50 secs
lola: 25351531 markings, 99036782 edges, 407264 markings/sec, 55 secs
lola: 27262031 markings, 106592112 edges, 382100 markings/sec, 60 secs
lola: 29209297 markings, 114390182 edges, 389453 markings/sec, 65 secs
lola: 31222783 markings, 122354366 edges, 402697 markings/sec, 70 secs
lola: 33405795 markings, 130978993 edges, 436602 markings/sec, 75 secs
lola: 35429914 markings, 139682824 edges, 404824 markings/sec, 80 secs
lola: 37393195 markings, 148210812 edges, 392656 markings/sec, 85 secs
lola: 39313212 markings, 156599784 edges, 384003 markings/sec, 90 secs
lola: 41251468 markings, 165030704 edges, 387651 markings/sec, 95 secs
lola: 43159111 markings, 173424125 edges, 381529 markings/sec, 100 secs
lola: 45071579 markings, 181850523 edges, 382494 markings/sec, 105 secs
lola: 46948564 markings, 190082196 edges, 375397 markings/sec, 110 secs
lola: 48866041 markings, 198510798 edges, 383495 markings/sec, 115 secs
lola: 50865154 markings, 207064360 edges, 399823 markings/sec, 120 secs
lola: 52966698 markings, 215387785 edges, 420309 markings/sec, 125 secs
lola: 54974719 markings, 223542229 edges, 401604 markings/sec, 130 secs
lola: 56954985 markings, 231620131 edges, 396053 markings/sec, 135 secs
lola: 58847707 markings, 239451890 edges, 378544 markings/sec, 140 secs
lola: 60810610 markings, 247490626 edges, 392581 markings/sec, 145 secs
lola: 62761987 markings, 255584719 edges, 390275 markings/sec, 150 secs
lola: 64696142 markings, 263602472 edges, 386831 markings/sec, 155 secs
lola: 66735685 markings, 271857683 edges, 407909 markings/sec, 160 secs
lola: 68816429 markings, 280152551 edges, 416149 markings/sec, 165 secs
lola: 70926746 markings, 289014155 edges, 422063 markings/sec, 170 secs
lola: 72857161 markings, 297518407 edges, 386083 markings/sec, 175 secs
lola: 74726393 markings, 305851294 edges, 373846 markings/sec, 180 secs
lola: 76591143 markings, 314152181 edges, 372950 markings/sec, 185 secs
lola: 78408707 markings, 322304977 edges, 363513 markings/sec, 190 secs
lola: 80158759 markings, 330146348 edges, 350010 markings/sec, 195 secs
lola: 81951353 markings, 338187792 edges, 358519 markings/sec, 200 secs
lola: 83702820 markings, 346085186 edges, 350293 markings/sec, 205 secs
lola: 85440972 markings, 353979257 edges, 347630 markings/sec, 210 secs
lola: 87196975 markings, 361838609 edges, 351201 markings/sec, 215 secs
lola: 88899377 markings, 369518167 edges, 340480 markings/sec, 220 secs
lola: 90685823 markings, 377647553 edges, 357289 markings/sec, 225 secs
lola: 92465877 markings, 385627862 edges, 356011 markings/sec, 230 secs
lola: 94167119 markings, 393444480 edges, 340248 markings/sec, 235 secs
lola: 95974223 markings, 401552013 edges, 361421 markings/sec, 240 secs
lola: 97678219 markings, 409408697 edges, 340799 markings/sec, 245 secs
lola: 99489562 markings, 417552467 edges, 362269 markings/sec, 250 secs
lola: 101197848 markings, 425441748 edges, 341657 markings/sec, 255 secs
lola: 103077087 markings, 433806588 edges, 375848 markings/sec, 260 secs
lola: 104819531 markings, 441822555 edges, 348489 markings/sec, 265 secs
lola: 106883128 markings, 450015839 edges, 412719 markings/sec, 270 secs
lola: 108777875 markings, 457831032 edges, 378949 markings/sec, 275 secs
lola: 110654958 markings, 465673453 edges, 375417 markings/sec, 280 secs
lola: 112544410 markings, 473512851 edges, 377890 markings/sec, 285 secs
lola: 113246906 markings, 476528894 edges, 140499 markings/sec, 290 secs
lola: 113359133 markings, 476953361 edges, 22445 markings/sec, 295 secs
lola: 113382306 markings, 477043133 edges, 4635 markings/sec, 300 secs
lola: 113396957 markings, 477100968 edges, 2930 markings/sec, 305 secs
lola: 113396957 markings, 477100968 edges, 0 markings/sec, 310 secs
lola: 113396957 markings, 477100968 edges, 0 markings/sec, 315 secs
lola: 114179587 markings, 480393396 edges, 156526 markings/sec, 320 secs
lola: 115769590 markings, 487080652 edges, 318001 markings/sec, 325 secs
lola: 117315705 markings, 493587095 edges, 309223 markings/sec, 330 secs
lola: 118839528 markings, 500006339 edges, 304765 markings/sec, 335 secs
lola: 120324975 markings, 506391433 edges, 297089 markings/sec, 340 secs
lola: 121858370 markings, 512836553 edges, 306679 markings/sec, 345 secs
lola: 123422598 markings, 519423148 edges, 312846 markings/sec, 350 secs
lola: 124897253 markings, 525785458 edges, 294931 markings/sec, 355 secs
lola: 126477371 markings, 532415052 edges, 316024 markings/sec, 360 secs
lola: 127975650 markings, 538904640 edges, 299656 markings/sec, 365 secs
lola: 129546798 markings, 545474813 edges, 314230 markings/sec, 370 secs
lola: 131081895 markings, 552131643 edges, 307019 markings/sec, 375 secs
lola: 132756202 markings, 558949785 edges, 334861 markings/sec, 380 secs
lola: 134376055 markings, 565750824 edges, 323971 markings/sec, 385 secs
lola: 135745000 markings, 571535846 edges, 273789 markings/sec, 390 secs
lola: 137440214 markings, 578256386 edges, 339043 markings/sec, 395 secs
lola: 139208270 markings, 585423058 edges, 353611 markings/sec, 400 secs
lola: 140711607 markings, 592132503 edges, 300667 markings/sec, 405 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 1050 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G (((1 <= p10) OR (1 <= p16)))) OR (G ((1 <= p10)) AND F ((1 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G (((1 <= p10) OR (1 <= p16)))) OR (G ((1 <= p10)) AND F ((1 <= p10)))))
lola: processed formula length: 80
lola: 59 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: 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: 502 markings, 502 edges
lola: ========================================
lola: subprocess 11 will run for 1575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((p16 <= 0) AND ((p8 <= 0) OR (p15 <= 0)))) R (F (((1 <= p5) AND (1 <= p15))) AND (p16 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((p16 <= 0) AND ((p8 <= 0) OR (p15 <= 0)))) R (F (((1 <= p5) AND (1 <= p15))) AND (p16 <= 0))))
lola: processed formula length: 103
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 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: 1958957 markings, 10919976 edges, 391791 markings/sec, 0 secs
lola: 3781738 markings, 21324376 edges, 364556 markings/sec, 5 secs
lola: 5602077 markings, 31771146 edges, 364068 markings/sec, 10 secs
lola: 7432188 markings, 42272339 edges, 366022 markings/sec, 15 secs
lola: 9233512 markings, 52608142 edges, 360265 markings/sec, 20 secs
lola: 11076663 markings, 63185084 edges, 368630 markings/sec, 25 secs
lola: 12895054 markings, 73676629 edges, 363678 markings/sec, 30 secs
lola: 14728635 markings, 84281316 edges, 366716 markings/sec, 35 secs
lola: 16539699 markings, 94773063 edges, 362213 markings/sec, 40 secs
lola: 18341736 markings, 105290815 edges, 360407 markings/sec, 45 secs
lola: 20163753 markings, 115900355 edges, 364403 markings/sec, 50 secs
lola: 21996429 markings, 126582874 edges, 366535 markings/sec, 55 secs
lola: 23852933 markings, 137282712 edges, 371301 markings/sec, 60 secs
lola: 25755204 markings, 148020179 edges, 380454 markings/sec, 65 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: 26315843 markings, 150928415 edges
lola: ========================================
lola: subprocess 12 will run for 3078 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F (G (((1 <= p7) AND (1 <= p23)))) AND (p6 <= 0))) AND F (G (((p5 <= 0) OR (p15 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3078 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p5 <= 0) OR (p15 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p5 <= 0) OR (p15 <= 0))))
lola: processed formula length: 34
lola: 59 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: 576 markings, 693 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((1 <= p10)))
lola: processed formula length: 18
lola: 59 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: 2796004 markings, 9589118 edges, 559201 markings/sec, 0 secs
lola: 5339133 markings, 18885094 edges, 508626 markings/sec, 5 secs
lola: 7647981 markings, 27924605 edges, 461770 markings/sec, 10 secs
lola: 9875139 markings, 36730871 edges, 445432 markings/sec, 15 secs
lola: 12044653 markings, 44951604 edges, 433903 markings/sec, 20 secs
lola: 14347842 markings, 53649943 edges, 460638 markings/sec, 25 secs
lola: 16503220 markings, 62579599 edges, 431076 markings/sec, 30 secs
lola: 18515117 markings, 71078547 edges, 402379 markings/sec, 35 secs
lola: 20555947 markings, 79708179 edges, 408166 markings/sec, 40 secs
lola: 22545840 markings, 88193146 edges, 397979 markings/sec, 45 secs
lola: 24811793 markings, 96911584 edges, 453191 markings/sec, 50 secs
lola: 26890474 markings, 105133831 edges, 415736 markings/sec, 55 secs
lola: 28988106 markings, 113488434 edges, 419526 markings/sec, 60 secs
lola: 31144826 markings, 122040436 edges, 431344 markings/sec, 65 secs
lola: 33372641 markings, 130835391 edges, 445563 markings/sec, 70 secs
lola: 35387590 markings, 139496664 edges, 402990 markings/sec, 75 secs
lola: 37300034 markings, 147828242 edges, 382489 markings/sec, 80 secs
lola: 39207578 markings, 156129557 edges, 381509 markings/sec, 85 secs
lola: 41111557 markings, 164410745 edges, 380796 markings/sec, 90 secs
lola: 42981202 markings, 172631069 edges, 373929 markings/sec, 95 secs
lola: 44875205 markings, 180970650 edges, 378801 markings/sec, 100 secs
lola: 46741249 markings, 189204194 edges, 373209 markings/sec, 105 secs
lola: 48631994 markings, 197556476 edges, 378149 markings/sec, 110 secs
lola: 50675122 markings, 206332044 edges, 408626 markings/sec, 115 secs
lola: 52871689 markings, 215040566 edges, 439313 markings/sec, 120 secs
lola: 54946735 markings, 223436049 edges, 415009 markings/sec, 125 secs
lola: 56968705 markings, 231678561 edges, 404394 markings/sec, 130 secs
lola: 58844794 markings, 239440589 edges, 375218 markings/sec, 135 secs
lola: 60772149 markings, 247328966 edges, 385471 markings/sec, 140 secs
lola: 62646007 markings, 255094993 edges, 374772 markings/sec, 145 secs
lola: 64551547 markings, 262990180 edges, 381108 markings/sec, 150 secs
lola: 66503340 markings, 270895943 edges, 390359 markings/sec, 155 secs
lola: 68448317 markings, 278679031 edges, 388995 markings/sec, 160 secs
lola: 70483251 markings, 287047689 edges, 406987 markings/sec, 165 secs
lola: 72385861 markings, 295456642 edges, 380522 markings/sec, 170 secs
lola: 74251893 markings, 303748828 edges, 373206 markings/sec, 175 secs
lola: 76103246 markings, 311996208 edges, 370271 markings/sec, 180 secs
lola: 77953281 markings, 320232418 edges, 370007 markings/sec, 185 secs
lola: 79754435 markings, 328310265 edges, 360231 markings/sec, 190 secs
lola: 81536642 markings, 336317960 edges, 356441 markings/sec, 195 secs
lola: 83257714 markings, 344162777 edges, 344214 markings/sec, 200 secs
lola: 85030975 markings, 352099158 edges, 354652 markings/sec, 205 secs
lola: 86736019 markings, 359731081 edges, 341009 markings/sec, 210 secs
lola: 88338544 markings, 367072143 edges, 320505 markings/sec, 215 secs
lola: 90123556 markings, 375068238 edges, 357002 markings/sec, 220 secs
lola: 91918398 markings, 383147649 edges, 358968 markings/sec, 225 secs
lola: 93661114 markings, 391113504 edges, 348543 markings/sec, 230 secs
lola: 95428413 markings, 399054064 edges, 353460 markings/sec, 235 secs
lola: 97086075 markings, 406671310 edges, 331532 markings/sec, 240 secs
lola: 98826985 markings, 414508219 edges, 348182 markings/sec, 245 secs
lola: 100473966 markings, 422095972 edges, 329396 markings/sec, 250 secs
lola: 102232803 markings, 429945611 edges, 351767 markings/sec, 255 secs
lola: 103866776 markings, 437436384 edges, 326795 markings/sec, 260 secs
lola: 105718191 markings, 445333360 edges, 370283 markings/sec, 265 secs
lola: 107643974 markings, 453141977 edges, 385157 markings/sec, 270 secs
lola: 109522483 markings, 460937410 edges, 375702 markings/sec, 275 secs
lola: 111377453 markings, 468635269 edges, 370994 markings/sec, 280 secs
lola: 113216575 markings, 476404646 edges, 367824 markings/sec, 285 secs
lola: 115023881 markings, 483913121 edges, 361461 markings/sec, 290 secs
lola: 116651202 markings, 490804842 edges, 325464 markings/sec, 295 secs
lola: 118345045 markings, 498028737 edges, 338769 markings/sec, 300 secs
lola: 120039612 markings, 505163799 edges, 338913 markings/sec, 305 secs
lola: 121753248 markings, 512376717 edges, 342727 markings/sec, 310 secs
lola: 123499063 markings, 519747212 edges, 349163 markings/sec, 315 secs
lola: 125177391 markings, 526992660 edges, 335666 markings/sec, 320 secs
lola: 126930709 markings, 534372066 edges, 350664 markings/sec, 325 secs
lola: 128664400 markings, 541683310 edges, 346738 markings/sec, 330 secs
lola: 130209060 markings, 548343355 edges, 308932 markings/sec, 335 secs
lola: 131801479 markings, 554975765 edges, 318484 markings/sec, 340 secs
lola: 133499595 markings, 562049300 edges, 339623 markings/sec, 345 secs
lola: 135215907 markings, 569290971 edges, 343262 markings/sec, 350 secs
lola: 136961591 markings, 576464161 edges, 349137 markings/sec, 355 secs
lola: 138918452 markings, 584122763 edges, 391372 markings/sec, 360 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown no no no yes yes no no no no no no yes
lola:
preliminary result: unknown no no no yes yes no no no no no no yes
lola: memory consumption: 3328 KB
lola: time consumption: 863 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

--------------------
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="ClientsAndServers-PT-N0010P0"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is ClientsAndServers-PT-N0010P0, 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 r056-oct2-162038334500074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0010P0.tgz
mv ClientsAndServers-PT-N0010P0 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;