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-162038334600110.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-N0100P0, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334600110
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 173K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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.9K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 12:33 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.2K 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-N0100P0-00
FORMULA_NAME ClientsAndServers-PT-N0100P0-01
FORMULA_NAME ClientsAndServers-PT-N0100P0-02
FORMULA_NAME ClientsAndServers-PT-N0100P0-03
FORMULA_NAME ClientsAndServers-PT-N0100P0-04
FORMULA_NAME ClientsAndServers-PT-N0100P0-05
FORMULA_NAME ClientsAndServers-PT-N0100P0-06
FORMULA_NAME ClientsAndServers-PT-N0100P0-07
FORMULA_NAME ClientsAndServers-PT-N0100P0-08
FORMULA_NAME ClientsAndServers-PT-N0100P0-09
FORMULA_NAME ClientsAndServers-PT-N0100P0-10
FORMULA_NAME ClientsAndServers-PT-N0100P0-11
FORMULA_NAME ClientsAndServers-PT-N0100P0-12
FORMULA_NAME ClientsAndServers-PT-N0100P0-13
FORMULA_NAME ClientsAndServers-PT-N0100P0-14
FORMULA_NAME ClientsAndServers-PT-N0100P0-15

=== Now, execution of the tool begins

BK_START 1620898006641

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 09:26:47] [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:26:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 09:26:48] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2021-05-13 09:26:48] [INFO ] Transformed 25 places.
[2021-05-13 09:26:48] [INFO ] Transformed 18 transitions.
[2021-05-13 09:26:48] [INFO ] Parsed PT model containing 25 places and 18 transitions in 50 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 84630 steps, including 7 resets, run visited all 24 properties in 38 ms. (steps per millisecond=2227 )
[2021-05-13 09:26:48] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-13 09:26:48] [INFO ] Flatten gal took : 23 ms
FORMULA ClientsAndServers-PT-N0100P0-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 09:26:48] [INFO ] Flatten gal took : 3 ms
[2021-05-13 09:26:48] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2021-05-13 09:26:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ClientsAndServers-PT-N0100P0 @ 3570 seconds

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

FORMULA ClientsAndServers-PT-N0100P0-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0100P0-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0100P0-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0100P0-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0100P0-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ClientsAndServers-PT-N0100P0-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ClientsAndServers-PT-N0100P0-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0100P0-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2370
rslt: Output for LTLFireability @ ClientsAndServers-PT-N0100P0

{
"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:26:48 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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 <= p24)",
"processed_size": 10,
"rewrites": 63
},
"result":
{
"edges": 13577,
"markings": 13577,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"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": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "G (((1 <= p11) AND (1 <= p17)))",
"processed_size": 31,
"rewrites": 61
},
"result":
{
"edges": 820,
"markings": 820,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((F (((1 <= p3))) AND (1 <= p9)) U X (X ((p9 <= 0))))",
"processed_size": 53,
"rewrites": 61
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 11
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "(((1 <= p2)) U (1 <= p20))",
"processed_size": 26,
"rewrites": 61
},
"result":
{
"edges": 820,
"markings": 820,
"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"
}
},

{
"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": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((1 <= p10) OR ((1 <= p11) AND (1 <= p17))))",
"processed_size": 48,
"rewrites": 61
},
"result":
{
"edges": 5001,
"markings": 5001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((X (((F (((1 <= p2))) OR ((1 <= p2))) AND X (((1 <= p0) AND (1 <= p13))))) OR (1 <= p24))))",
"processed_size": 97,
"rewrites": 61
},
"result":
{
"edges": 5006,
"markings": 5005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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": "G ((p20 <= 0))",
"processed_size": 14,
"rewrites": 61
},
"result":
{
"edges": 4399,
"markings": 4399,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "G (F ((G (((1 <= p3))) AND (1 <= p16))))",
"processed_size": 40,
"rewrites": 61
},
"result":
{
"edges": 5002,
"markings": 5002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F (((p8 <= 0) OR (p15 <= 0) OR (p12 <= 0))) OR (p18 <= 0)))",
"processed_size": 65,
"rewrites": 61
},
"result":
{
"edges": 15664,
"markings": 13457,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 1189
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"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": "(p9 <= 0)",
"processed_size": 9,
"rewrites": 61
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": "G ((1 <= p22))",
"processed_size": 14,
"rewrites": 61
},
"result":
{
"edges": 820,
"markings": 820,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"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": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1521
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1521
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "((1 <= p7) AND (1 <= p23))",
"processed_size": 26,
"rewrites": 61
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3043
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((p7 <= 0) OR (p23 <= 0))",
"processed_size": 26,
"rewrites": 63
},
"result":
{
"edges": 93033107,
"markings": 66506607,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2994
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2994
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "G (((1 <= p7) AND (1 <= p23)))",
"processed_size": 30,
"rewrites": 61
},
"result":
{
"edges": 820,
"markings": 820,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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 (((1 <= p7) AND (1 <= p23))))",
"processed_size": 34,
"rewrites": 61
},
"result":
{
"edges": 825,
"markings": 824,
"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"
}
},

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

{
"child":
[

{
"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": "(p9 <= 0)",
"processed_size": 9,
"rewrites": 61
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": "G ((1 <= p22))",
"processed_size": 14,
"rewrites": 61
},
"result":
{
"edges": 820,
"markings": 820,
"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": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "((1 <= p7) AND (1 <= p23))",
"processed_size": 26,
"rewrites": 61
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((p7 <= 0) OR (p23 <= 0))",
"processed_size": 26,
"rewrites": 63
},
"result":
{
"edges": 93033107,
"markings": 66506607,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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 ((1 <= p6)))",
"processed_size": 17,
"rewrites": 61
},
"result":
{
"edges": 5003,
"markings": 5002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3776,
"runtime": 1200.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((F(*) OR **)) : (F(*) AND X(X(G(*)))) : (((F(**) AND **) U X(X(**))) OR G(**)) : G(*) : (** U X(**)) : G(F((G(**) AND **))) : (X(X(X(**))) AND (X(**) OR (** U **))) : (** OR (F(**) AND F(G(*)))) : (F(G(**)) OR ((G(**) AND F(G(**))) OR (G(F(**)) AND F((F(G(**)) OR (G(**) AND F(G(**)))))))) : (G(F(**)) OR (G(**) AND **)) : F(G((X(((F(**) OR **) AND X(**))) OR **)))"
},
"net":
{
"arcs": 54,
"conflict_clusters": 16,
"places": 25,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "no no yes no no no no no no unknown no ",
"value": "no no yes no no no no no no unknown no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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: G ((NOT(G (((1 <= p8) AND (1 <= p15) AND (1 <= p12)))) OR (p18 <= 0))) : (NOT(G ((1 <= p24))) AND X (NOT(F (X (((1 <= p4) AND (1 <= p21))))))) : (((F (((1 <= p3))) AND (1 <= p9)) U X (X ((p9 <= 0)))) OR G (((1 <= p11) AND (1 <= p17)))) : G (NOT((F ((X ((1 <= p9)) OR (p24 <= 0))) U F ((X (((1 <= p4) AND (1 <= p21))) U (1 <= p20)))))) : ((1 <= p16) U X (((1 <= p18) AND (1 <= p22)))) : NOT(((NOT(X ((1 <= p16))) AND ((p3 <= 0))) U F (X (NOT(F ((G (((1 <= p3))) AND (1 <= p16)))))))) : (NOT(X (X (NOT(X (((1 <= p2))))))) AND (X (((1 <= p10) OR ((1 <= p11) AND (1 <= p17)))) OR (((1 <= p2)) U (1 <= p20)))) : (NOT(F (X (G (F (X ((p6 <= 0))))))) U ((1 <= p7) AND (1 <= p23))) : (G (F (((1 <= p7) AND (1 <= p23)))) U (G (((1 <= p7) AND (1 <= p23))) U F (X (G (X (((1 <= p7) AND (1 <= p23)))))))) : (NOT(F (NOT(F ((1 <= p22))))) OR (G ((1 <= p22)) AND (p9 <= 0))) : F (G (X ((X (((F (((1 <= p2))) OR ((1 <= p2))) AND X (((1 <= p0) AND (1 <= p13))))) OR (1 <= p24)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:356
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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: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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:428
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p24 <= 0)) AND X (X (G (((p4 <= 0) OR (p21 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p24 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (1 <= p24)
lola: processed formula length: 10
lola: 63 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: 13577 markings, 13577 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((F (((1 <= p3))) AND (1 <= p9)) U X (X ((p9 <= 0)))) OR G (((1 <= p11) AND (1 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p11) AND (1 <= p17)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p11) AND (1 <= p17)))
lola: processed formula length: 31
lola: 61 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: 820 markings, 820 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((1 <= p3))) AND (1 <= p9)) U X (X ((p9 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F (((1 <= p3))) AND (1 <= p9)) U X (X ((p9 <= 0))))
lola: processed formula length: 53
lola: 61 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 14 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p16) U X (((1 <= p18) AND (1 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p16) U X (((1 <= p18) AND (1 <= p22))))
lola: processed formula length: 46
lola: 61 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: 5001 markings, 5001 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X (((1 <= p2))))) AND (X (((1 <= p10) OR ((1 <= p11) AND (1 <= p17)))) OR (((1 <= p2)) U (1 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p2)) U (1 <= p20))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p2)) U (1 <= p20))
lola: processed formula length: 26
lola: 61 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: 820 markings, 820 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p10) 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 <= p10) OR ((1 <= p11) AND (1 <= p17))))
lola: processed formula length: 48
lola: 61 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: 5001 markings, 5001 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (((F (((1 <= p2))) OR ((1 <= p2))) AND X (((1 <= p0) AND (1 <= p13))))) OR (1 <= p24))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (((F (((1 <= p2))) OR ((1 <= p2))) AND X (((1 <= p0) AND (1 <= p13))))) OR (1 <= p24))))
lola: processed formula length: 97
lola: 61 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: 5005 markings, 5006 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p20 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p20 <= 0))
lola: processed formula length: 14
lola: 61 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: 4399 markings, 4399 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((1 <= p3))) AND (1 <= p16))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((1 <= p3))) AND (1 <= p16))))
lola: processed formula length: 40
lola: 61 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5002 markings, 5002 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((p8 <= 0) OR (p15 <= 0) OR (p12 <= 0))) OR (p18 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((p8 <= 0) OR (p15 <= 0) OR (p12 <= 0))) OR (p18 <= 0)))
lola: processed formula length: 65
lola: 61 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: 13457 markings, 15664 edges
lola: ========================================
lola: subprocess 8 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((1 <= p22))) OR (G ((1 <= p22)) AND (p9 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p9 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p9 <= 0)
lola: processed formula length: 9
lola: 61 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p22))
lola: processed formula length: 14
lola: 61 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: 820 markings, 820 edges
lola: ========================================
lola: subprocess 10 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p22)))
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 <= p22)))
lola: processed formula length: 18
lola: 61 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: 2189140 markings, 6673615 edges, 437828 markings/sec, 0 secs
lola: 3960131 markings, 12263632 edges, 354198 markings/sec, 5 secs
lola: 6013267 markings, 18762861 edges, 410627 markings/sec, 10 secs
lola: 7965416 markings, 25041043 edges, 390430 markings/sec, 15 secs
lola: 9944608 markings, 31323177 edges, 395838 markings/sec, 20 secs
lola: 11613290 markings, 36677845 edges, 333736 markings/sec, 25 secs
lola: 13329749 markings, 42180642 edges, 343292 markings/sec, 30 secs
lola: 15114188 markings, 47906873 edges, 356888 markings/sec, 35 secs
lola: 16905872 markings, 53640978 edges, 358337 markings/sec, 40 secs
lola: 18717819 markings, 59443504 edges, 362389 markings/sec, 45 secs
lola: 20546717 markings, 65292977 edges, 365780 markings/sec, 50 secs
lola: 22209277 markings, 70725978 edges, 332512 markings/sec, 55 secs
lola: 23989562 markings, 76403795 edges, 356057 markings/sec, 60 secs
lola: 25836543 markings, 82293791 edges, 369396 markings/sec, 65 secs
lola: 27474702 markings, 87645206 edges, 327632 markings/sec, 70 secs
lola: 29303995 markings, 93467327 edges, 365859 markings/sec, 75 secs
lola: 31095665 markings, 99318771 edges, 358334 markings/sec, 80 secs
lola: 32832054 markings, 104828990 edges, 347278 markings/sec, 85 secs
lola: 34572208 markings, 110478973 edges, 348031 markings/sec, 90 secs
lola: 36061990 markings, 115204113 edges, 297956 markings/sec, 95 secs
lola: 37438868 markings, 119693701 edges, 275376 markings/sec, 100 secs
lola: 39131214 markings, 125041793 edges, 338469 markings/sec, 105 secs
lola: 40511721 markings, 129548468 edges, 276101 markings/sec, 110 secs
lola: 42196936 markings, 134979575 edges, 337043 markings/sec, 115 secs
lola: 43798474 markings, 140085070 edges, 320308 markings/sec, 120 secs
lola: 45339401 markings, 145108406 edges, 308185 markings/sec, 125 secs
lola: 47303631 markings, 151313660 edges, 392846 markings/sec, 130 secs
lola: 48952544 markings, 156691537 edges, 329783 markings/sec, 135 secs
lola: 50807737 markings, 162703763 edges, 371039 markings/sec, 140 secs
lola: 52695000 markings, 168684074 edges, 377453 markings/sec, 145 secs
lola: 54436894 markings, 174357919 edges, 348379 markings/sec, 150 secs
lola: 56505427 markings, 180884027 edges, 413707 markings/sec, 155 secs
lola: 58240560 markings, 186535877 edges, 347027 markings/sec, 160 secs
lola: 59978655 markings, 192192501 edges, 347619 markings/sec, 165 secs
lola: 62020914 markings, 198620140 edges, 408452 markings/sec, 170 secs
lola: 63701703 markings, 204098026 edges, 336158 markings/sec, 175 secs
lola: 65452833 markings, 209786859 edges, 350226 markings/sec, 180 secs
lola: 67440786 markings, 216025822 edges, 397591 markings/sec, 185 secs
lola: 69123276 markings, 221502772 edges, 336498 markings/sec, 190 secs
lola: 70819346 markings, 227015024 edges, 339214 markings/sec, 195 secs
lola: 72808921 markings, 233239419 edges, 397915 markings/sec, 200 secs
lola: 74485798 markings, 238703722 edges, 335375 markings/sec, 205 secs
lola: 76116585 markings, 244002947 edges, 326157 markings/sec, 210 secs
lola: 77813372 markings, 249498022 edges, 339357 markings/sec, 215 secs
lola: 79743250 markings, 255529700 edges, 385976 markings/sec, 220 secs
lola: 81325440 markings, 260681073 edges, 316438 markings/sec, 225 secs
lola: 82942810 markings, 265928249 edges, 323474 markings/sec, 230 secs
lola: 84652516 markings, 271456424 edges, 341941 markings/sec, 235 secs
lola: 86551675 markings, 277378367 edges, 379832 markings/sec, 240 secs
lola: 88157573 markings, 282606954 edges, 321180 markings/sec, 245 secs
lola: 89780255 markings, 287865738 edges, 324536 markings/sec, 250 secs
lola: 91463313 markings, 293293706 edges, 336612 markings/sec, 255 secs
lola: 93417178 markings, 299392076 edges, 390773 markings/sec, 260 secs
lola: 95012481 markings, 304574321 edges, 319061 markings/sec, 265 secs
lola: 96605385 markings, 309743220 edges, 318581 markings/sec, 270 secs
lola: 98245275 markings, 315042011 edges, 327978 markings/sec, 275 secs
lola: 100247786 markings, 321253561 edges, 400502 markings/sec, 280 secs
lola: 101867150 markings, 326521935 edges, 323873 markings/sec, 285 secs
lola: 103466425 markings, 331705838 edges, 319855 markings/sec, 290 secs
lola: 105074649 markings, 336901807 edges, 321645 markings/sec, 295 secs
lola: 106802894 markings, 342479383 edges, 345649 markings/sec, 300 secs
lola: 108689886 markings, 348327793 edges, 377398 markings/sec, 305 secs
lola: 110299175 markings, 353553960 edges, 321858 markings/sec, 310 secs
lola: 111899210 markings, 358733037 edges, 320007 markings/sec, 315 secs
lola: 113505079 markings, 363926048 edges, 321174 markings/sec, 320 secs
lola: 115216029 markings, 369432726 edges, 342190 markings/sec, 325 secs
lola: 117125199 markings, 375340910 edges, 381834 markings/sec, 330 secs
lola: 118699731 markings, 380456092 edges, 314906 markings/sec, 335 secs
lola: 120161658 markings, 385186564 edges, 292385 markings/sec, 340 secs
lola: 121268186 markings, 388758600 edges, 221306 markings/sec, 345 secs
lola: 122831586 markings, 393787666 edges, 312680 markings/sec, 350 secs
lola: 124654043 markings, 399452102 edges, 364491 markings/sec, 355 secs
lola: 124855235 markings, 400022406 edges, 40238 markings/sec, 360 secs
lola: 124889072 markings, 400131170 edges, 6767 markings/sec, 365 secs
lola: 124997952 markings, 400482512 edges, 21776 markings/sec, 370 secs
lola: 125243523 markings, 401279102 edges, 49114 markings/sec, 375 secs
lola: 125684924 markings, 402715182 edges, 88280 markings/sec, 380 secs
lola: 126675103 markings, 405936788 edges, 198036 markings/sec, 385 secs
lola: 127877178 markings, 409832692 edges, 240415 markings/sec, 390 secs
lola: 129059347 markings, 413658114 edges, 236434 markings/sec, 395 secs
lola: 130241605 markings, 417472558 edges, 236452 markings/sec, 400 secs
lola: 131440567 markings, 421331954 edges, 239792 markings/sec, 405 secs
lola: 132718659 markings, 425438199 edges, 255618 markings/sec, 410 secs
lola: 134237465 markings, 430029187 edges, 303761 markings/sec, 415 secs
lola: 134950911 markings, 432343982 edges, 142689 markings/sec, 420 secs
lola: 135659934 markings, 434649809 edges, 141805 markings/sec, 425 secs
lola: 136278793 markings, 436661683 edges, 123772 markings/sec, 430 secs
lola: 137276644 markings, 439894857 edges, 199570 markings/sec, 435 secs
lola: 138418856 markings, 443586251 edges, 228442 markings/sec, 440 secs
lola: 139576170 markings, 447310393 edges, 231463 markings/sec, 445 secs
lola: 140717726 markings, 450988200 edges, 228311 markings/sec, 450 secs
lola: 141917399 markings, 454842265 edges, 239935 markings/sec, 455 secs
lola: 142743365 markings, 457483612 edges, 165193 markings/sec, 460 secs
lola: 142930193 markings, 458088148 edges, 37366 markings/sec, 465 secs
lola: 143140860 markings, 458754425 edges, 42133 markings/sec, 470 secs
lola: 143339354 markings, 459321373 edges, 39699 markings/sec, 475 secs
lola: 144110709 markings, 461583212 edges, 154271 markings/sec, 480 secs
lola: 144811969 markings, 463861275 edges, 140252 markings/sec, 485 secs
lola: 145455492 markings, 465955983 edges, 128705 markings/sec, 490 secs
lola: 145949023 markings, 467555276 edges, 98706 markings/sec, 495 secs
lola: 146480792 markings, 469282125 edges, 106354 markings/sec, 500 secs
lola: 146808063 markings, 470335635 edges, 65454 markings/sec, 505 secs
lola: 147304852 markings, 471939953 edges, 99358 markings/sec, 510 secs
lola: 147921089 markings, 473932008 edges, 123247 markings/sec, 515 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 9 will run for 1521 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p7) AND (1 <= p23)) OR (F (((1 <= p7) AND (1 <= p23))) AND F (G ((1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1521 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p7) AND (1 <= p23))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p7) AND (1 <= p23))
lola: processed formula length: 26
lola: 61 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 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 10 will run for 3043 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p7) AND (1 <= p23)))
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: ((p7 <= 0) OR (p23 <= 0))
lola: processed formula length: 26
lola: 63 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: 7141570 markings, 9972045 edges, 1428314 markings/sec, 0 secs
lola: 13911656 markings, 19444751 edges, 1354017 markings/sec, 5 secs
lola: 20638069 markings, 28856396 edges, 1345283 markings/sec, 10 secs
lola: 27269103 markings, 38134512 edges, 1326207 markings/sec, 15 secs
lola: 33645414 markings, 47056252 edges, 1275262 markings/sec, 20 secs
lola: 40011124 markings, 55963150 edges, 1273142 markings/sec, 25 secs
lola: 46679752 markings, 65293898 edges, 1333726 markings/sec, 30 secs
lola: 53381005 markings, 74670319 edges, 1340251 markings/sec, 35 secs
lola: 60224298 markings, 84245441 edges, 1368659 markings/sec, 40 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 66506607 markings, 93033107 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 10 will run for 2994 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p7) AND (1 <= p23)))) OR ((G (((1 <= p7) AND (1 <= p23))) AND F (G (((1 <= p7) AND (1 <= p23))))) OR (G (F (((1 <= p7) AND (1 <= p23)))) AND F ((F (G (((1 <= p7) AND (1 <= p23)))) OR (G (((1 <= p7) AND (1 <= p23))) AND F (G (((1 <= p7) AND (1 <= p23))))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 2994 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p7) AND (1 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p7) AND (1 <= p23)))
lola: processed formula length: 30
lola: 61 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: 820 markings, 820 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p7) AND (1 <= p23))))
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 (((1 <= p7) AND (1 <= p23))))
lola: processed formula length: 34
lola: 61 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: 824 markings, 825 edges
lola: ========================================
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G (((1 <= p7) AND (1 <= p23)))) OR (G (((1 <= p7) AND (1 <= p23))) AND F (G (((1 <= p7) AND (1 <= p23)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G (((1 <= p7) AND (1 <= p23)))) OR (G (((1 <= p7) AND (1 <= p23))) AND F (G (((1 <= p7) AND (1 <= p23)))))))
lola: processed formula length: 115
lola: 61 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 826 markings, 826 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (F ((1 <= p22))) OR (G ((1 <= p22)) AND (p9 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p9 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p9 <= 0)
lola: processed formula length: 9
lola: 61 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((1 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p22))
lola: processed formula length: 14
lola: 61 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: 820 markings, 820 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p22)))
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 <= p22)))
lola: processed formula length: 18
lola: 61 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: 2283271 markings, 6979831 edges, 456654 markings/sec, 0 secs
lola: 4151143 markings, 12885807 edges, 373574 markings/sec, 5 secs
lola: 6115575 markings, 19083473 edges, 392886 markings/sec, 10 secs
lola: 8005308 markings, 25165220 edges, 377947 markings/sec, 15 secs
lola: 9911552 markings, 31213002 edges, 381249 markings/sec, 20 secs
lola: 11714265 markings, 37008023 edges, 360543 markings/sec, 25 secs
lola: 13498591 markings, 42735601 edges, 356865 markings/sec, 30 secs
lola: 15299726 markings, 48509917 edges, 360227 markings/sec, 35 secs
lola: 17084218 markings, 54227538 edges, 356898 markings/sec, 40 secs
lola: 18912497 markings, 60079361 edges, 365656 markings/sec, 45 secs
lola: 20721123 markings, 65861588 edges, 361725 markings/sec, 50 secs
lola: 22515361 markings, 71707748 edges, 358848 markings/sec, 55 secs
lola: 24273725 markings, 77332184 edges, 351673 markings/sec, 60 secs
lola: 26197510 markings, 83473053 edges, 384757 markings/sec, 65 secs
lola: 27835718 markings, 88821031 edges, 327642 markings/sec, 70 secs
lola: 29606223 markings, 94450204 edges, 354101 markings/sec, 75 secs
lola: 31409019 markings, 100216666 edges, 360559 markings/sec, 80 secs
lola: 33060819 markings, 105571824 edges, 330360 markings/sec, 85 secs
lola: 34901609 markings, 111424019 edges, 368158 markings/sec, 90 secs
lola: 36512289 markings, 116673977 edges, 322136 markings/sec, 95 secs
lola: 38370038 markings, 122638073 edges, 371550 markings/sec, 100 secs
lola: 40005361 markings, 127896648 edges, 327065 markings/sec, 105 secs
lola: 41706821 markings, 133443817 edges, 340292 markings/sec, 110 secs
lola: 43496234 markings, 139097737 edges, 357883 markings/sec, 115 secs
lola: 45103562 markings, 144340669 edges, 321466 markings/sec, 120 secs
lola: 46977727 markings, 150254973 edges, 374833 markings/sec, 125 secs
lola: 48365367 markings, 154777334 edges, 277528 markings/sec, 130 secs
lola: 49593303 markings, 158783347 edges, 245587 markings/sec, 135 secs
lola: 51240861 markings, 163950350 edges, 329512 markings/sec, 140 secs
lola: 52491614 markings, 168025886 edges, 250151 markings/sec, 145 secs
lola: 53673571 markings, 171873362 edges, 236391 markings/sec, 150 secs
lola: 54920247 markings, 175932337 edges, 249335 markings/sec, 155 secs
lola: 56575344 markings, 181111023 edges, 331019 markings/sec, 160 secs
lola: 57851129 markings, 185267541 edges, 255157 markings/sec, 165 secs
lola: 59066623 markings, 189229706 edges, 243099 markings/sec, 170 secs
lola: 60385575 markings, 193503466 edges, 263790 markings/sec, 175 secs
lola: 61899452 markings, 198223215 edges, 302775 markings/sec, 180 secs
lola: 63024874 markings, 201891216 edges, 225084 markings/sec, 185 secs
lola: 64157333 markings, 205578738 edges, 226492 markings/sec, 190 secs
lola: 65367251 markings, 209508543 edges, 241984 markings/sec, 195 secs
lola: 66963486 markings, 214471802 edges, 319247 markings/sec, 200 secs
lola: 68128517 markings, 218268999 edges, 233006 markings/sec, 205 secs
lola: 69323906 markings, 222153286 edges, 239078 markings/sec, 210 secs
lola: 70557513 markings, 226166633 edges, 246721 markings/sec, 215 secs
lola: 71966629 markings, 230730854 edges, 281823 markings/sec, 220 secs
lola: 73511484 markings, 235527567 edges, 308971 markings/sec, 225 secs
lola: 74725806 markings, 239479330 edges, 242864 markings/sec, 230 secs
lola: 75928890 markings, 243385408 edges, 240617 markings/sec, 235 secs
lola: 77217348 markings, 247564341 edges, 257692 markings/sec, 240 secs
lola: 78866918 markings, 252679485 edges, 329914 markings/sec, 245 secs
lola: 80084136 markings, 256636670 edges, 243444 markings/sec, 250 secs
lola: 81259373 markings, 260464846 edges, 235047 markings/sec, 255 secs
lola: 82456958 markings, 264346962 edges, 239517 markings/sec, 260 secs
lola: 83717623 markings, 268425034 edges, 252133 markings/sec, 265 secs
lola: 85386313 markings, 273596454 edges, 333738 markings/sec, 270 secs
lola: 86628580 markings, 277633195 edges, 248453 markings/sec, 275 secs
lola: 87803301 markings, 281451301 edges, 234944 markings/sec, 280 secs
lola: 89038880 markings, 285457893 edges, 247116 markings/sec, 285 secs
lola: 90377549 markings, 289793925 edges, 267734 markings/sec, 290 secs
lola: 92049117 markings, 295116488 edges, 334314 markings/sec, 295 secs
lola: 93572369 markings, 299892567 edges, 304650 markings/sec, 300 secs
lola: 94818946 markings, 303948111 edges, 249315 markings/sec, 305 secs
lola: 96052160 markings, 307945950 edges, 246643 markings/sec, 310 secs
lola: 97398545 markings, 312305414 edges, 269277 markings/sec, 315 secs
lola: 98842305 markings, 316957267 edges, 288752 markings/sec, 320 secs
lola: 100519518 markings, 322139179 edges, 335443 markings/sec, 325 secs
lola: 101757547 markings, 326167783 edges, 247606 markings/sec, 330 secs
lola: 102977434 markings, 330125669 edges, 243977 markings/sec, 335 secs
lola: 104277849 markings, 334338678 edges, 260083 markings/sec, 340 secs
lola: 105672378 markings, 338841050 edges, 278906 markings/sec, 345 secs
lola: 107186854 markings, 343687603 edges, 302895 markings/sec, 350 secs
lola: 108684134 markings, 348309021 edges, 299456 markings/sec, 355 secs
lola: 109864259 markings, 352141933 edges, 236025 markings/sec, 360 secs
lola: 111068784 markings, 356050176 edges, 240905 markings/sec, 365 secs
lola: 112354079 markings, 360210514 edges, 257059 markings/sec, 370 secs
lola: 113661686 markings, 364422694 edges, 261521 markings/sec, 375 secs
lola: 114962107 markings, 368601909 edges, 260084 markings/sec, 380 secs
lola: 116566861 markings, 373522591 edges, 320951 markings/sec, 385 secs
lola: 117784781 markings, 377480612 edges, 243584 markings/sec, 390 secs
lola: 119030507 markings, 381528179 edges, 249145 markings/sec, 395 secs
lola: 120336648 markings, 385754730 edges, 261228 markings/sec, 400 secs
lola: 121668532 markings, 390051413 edges, 266377 markings/sec, 405 secs
lola: 122990260 markings, 394306711 edges, 264346 markings/sec, 410 secs
lola: 124439524 markings, 398858025 edges, 289853 markings/sec, 415 secs
lola: 124947438 markings, 400321606 edges, 101583 markings/sec, 420 secs
lola: 125274683 markings, 401382239 edges, 65449 markings/sec, 425 secs
lola: 125880618 markings, 403353679 edges, 121187 markings/sec, 430 secs
lola: 127010465 markings, 407024689 edges, 225969 markings/sec, 435 secs
lola: 128164491 markings, 410763921 edges, 230805 markings/sec, 440 secs
lola: 129623242 markings, 415472233 edges, 291750 markings/sec, 445 secs
lola: 131082886 markings, 420178475 edges, 291929 markings/sec, 450 secs
lola: 132514952 markings, 424777045 edges, 286413 markings/sec, 455 secs
lola: 133928658 markings, 429103401 edges, 282741 markings/sec, 460 secs
lola: 134897465 markings, 432173474 edges, 193761 markings/sec, 465 secs
lola: 135924347 markings, 435511891 edges, 205376 markings/sec, 470 secs
lola: 137032071 markings, 439102076 edges, 221545 markings/sec, 475 secs
lola: 138328879 markings, 443295745 edges, 259362 markings/sec, 480 secs
lola: 139758445 markings, 447905223 edges, 285913 markings/sec, 485 secs
lola: 141157792 markings, 452401683 edges, 279869 markings/sec, 490 secs
lola: 142113971 markings, 455465987 edges, 191236 markings/sec, 495 secs
lola: 142252509 markings, 455912144 edges, 27708 markings/sec, 500 secs
lola: 142626053 markings, 457102249 edges, 74709 markings/sec, 505 secs
lola: 143758541 markings, 460454758 edges, 226498 markings/sec, 510 secs
lola: 143885819 markings, 460858687 edges, 25456 markings/sec, 515 secs
lola: 143920002 markings, 460968170 edges, 6837 markings/sec, 520 secs
lola: 144066350 markings, 461440016 edges, 29270 markings/sec, 525 secs
lola: 144505193 markings, 462865150 edges, 87769 markings/sec, 530 secs
lola: 145070297 markings, 464700400 edges, 113021 markings/sec, 535 secs
lola: 145673002 markings, 466662872 edges, 120541 markings/sec, 540 secs
lola: 146158938 markings, 468236288 edges, 97187 markings/sec, 545 secs
lola: 146786431 markings, 470264050 edges, 125499 markings/sec, 550 secs
lola: 147213479 markings, 471652986 edges, 85410 markings/sec, 555 secs
lola: 147602125 markings, 472900729 edges, 77729 markings/sec, 560 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((1 <= p7) AND (1 <= p23)) OR (F (((1 <= p7) AND (1 <= p23))) AND F (G ((1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p7) AND (1 <= p23))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p7) AND (1 <= p23))
lola: processed formula length: 26
lola: 61 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 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: ========================================
lola: ...considering subproblem: F (((1 <= p7) AND (1 <= p23)))
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: ((p7 <= 0) OR (p23 <= 0))
lola: processed formula length: 26
lola: 63 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: 6819774 markings, 9521769 edges, 1363955 markings/sec, 0 secs
lola: 13448784 markings, 18797129 edges, 1325802 markings/sec, 5 secs
lola: 20056936 markings, 28043209 edges, 1321630 markings/sec, 10 secs
lola: 26464525 markings, 37008739 edges, 1281518 markings/sec, 15 secs
lola: 32777893 markings, 45842439 edges, 1262674 markings/sec, 20 secs
lola: 38336837 markings, 53620504 edges, 1111789 markings/sec, 25 secs
lola: 44277708 markings, 61932947 edges, 1188174 markings/sec, 30 secs
lola: 50181358 markings, 70193360 edges, 1180730 markings/sec, 35 secs
lola: 56329052 markings, 78795276 edges, 1229539 markings/sec, 40 secs
lola: 62714501 markings, 87729571 edges, 1277090 markings/sec, 45 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 66506607 markings, 93033107 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p6)))
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 ((1 <= p6)))
lola: processed formula length: 17
lola: 61 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: 5002 markings, 5003 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no no no no unknown no
lola:
preliminary result: no no yes no no no no no no unknown no
lola: memory consumption: 3776 KB
lola: time consumption: 1200 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-N0100P0"
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-N0100P0, 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-162038334600110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0100P0.tgz
mv ClientsAndServers-PT-N0100P0 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 ;