Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r189-tajo-162089433000402.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ResAllocation-PT-R020C002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089433000402
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 10:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 10:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 14:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 14:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 9 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 85K 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 ResAllocation-PT-R020C002-00
FORMULA_NAME ResAllocation-PT-R020C002-01
FORMULA_NAME ResAllocation-PT-R020C002-02
FORMULA_NAME ResAllocation-PT-R020C002-03
FORMULA_NAME ResAllocation-PT-R020C002-04
FORMULA_NAME ResAllocation-PT-R020C002-05
FORMULA_NAME ResAllocation-PT-R020C002-06
FORMULA_NAME ResAllocation-PT-R020C002-07
FORMULA_NAME ResAllocation-PT-R020C002-08
FORMULA_NAME ResAllocation-PT-R020C002-09
FORMULA_NAME ResAllocation-PT-R020C002-10
FORMULA_NAME ResAllocation-PT-R020C002-11
FORMULA_NAME ResAllocation-PT-R020C002-12
FORMULA_NAME ResAllocation-PT-R020C002-13
FORMULA_NAME ResAllocation-PT-R020C002-14
FORMULA_NAME ResAllocation-PT-R020C002-15

=== Now, execution of the tool begins

BK_START 1621430354112

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 13:19:15] [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-19 13:19:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 13:19:16] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2021-05-19 13:19:16] [INFO ] Transformed 80 places.
[2021-05-19 13:19:16] [INFO ] Transformed 42 transitions.
[2021-05-19 13:19:16] [INFO ] Parsed PT model containing 80 places and 42 transitions in 119 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 860 resets, run finished after 176 ms. (steps per millisecond=568 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 42 rows 80 cols
[2021-05-19 13:19:16] [INFO ] Computed 40 place invariants in 3 ms
[2021-05-19 13:19:16] [INFO ] [Real]Absence check using 40 positive place invariants in 45 ms returned sat
[2021-05-19 13:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:16] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-19 13:19:16] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 4 ms.
[2021-05-19 13:19:16] [INFO ] Added : 18 causal constraints over 4 iterations in 48 ms. Result :sat
[2021-05-19 13:19:16] [INFO ] [Real]Absence check using 40 positive place invariants in 31 ms returned sat
[2021-05-19 13:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:16] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-19 13:19:16] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 14 ms.
[2021-05-19 13:19:16] [INFO ] Added : 33 causal constraints over 7 iterations in 94 ms. Result :sat
[2021-05-19 13:19:16] [INFO ] [Real]Absence check using 40 positive place invariants in 8 ms returned sat
[2021-05-19 13:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:16] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-19 13:19:16] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 7 ms.
[2021-05-19 13:19:16] [INFO ] Added : 33 causal constraints over 7 iterations in 47 ms. Result :sat
[2021-05-19 13:19:17] [INFO ] [Real]Absence check using 40 positive place invariants in 72 ms returned sat
[2021-05-19 13:19:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:17] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-19 13:19:17] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2021-05-19 13:19:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2021-05-19 13:19:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:19:17] [INFO ] [Nat]Absence check using 40 positive place invariants in 13 ms returned sat
[2021-05-19 13:19:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:17] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-19 13:19:17] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2021-05-19 13:19:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2021-05-19 13:19:17] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 5 ms.
[2021-05-19 13:19:17] [INFO ] Added : 29 causal constraints over 6 iterations in 36 ms. Result :sat
[2021-05-19 13:19:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-19 13:19:17] [INFO ] Flatten gal took : 50 ms
FORMULA ResAllocation-PT-R020C002-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 13:19:17] [INFO ] Flatten gal took : 7 ms
[2021-05-19 13:19:17] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-19 13:19:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ResAllocation-PT-R020C002 @ 3570 seconds

FORMULA ResAllocation-PT-R020C002-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3206
rslt: Output for LTLFireability @ ResAllocation-PT-R020C002

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 13:19:17 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 1,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (X ((F ((F (G (((1 <= p13) AND (1 <= p53) AND (1 <= p54)))) AND G ((((1 <= p1) AND (1 <= p41) AND (1 <= p42)) OR G (((1 <= p13) AND (1 <= p53) AND (1 <= p54))))))) U ((1 <= p13) AND (1 <= p53) AND (1 <= p54)))))",
"processed_size": 213,
"rewrites": 64
},
"result":
{
"edges": 214,
"markings": 213,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 19
},
"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": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (((((p2 <= 0) OR (p5 <= 0)) OR (G (((1 <= p27) AND (1 <= p67) AND (1 <= p68))) AND F (((p2 <= 0) OR (p5 <= 0))))) AND ((p15 <= 0) OR (p55 <= 0) OR (p56 <= 0))))",
"processed_size": 166,
"rewrites": 64
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 274
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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 <= p13) AND (1 <= p53) AND (1 <= p54))",
"processed_size": 42,
"rewrites": 64
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "G (((p15 <= 0) OR (p55 <= 0) OR (p56 <= 0)))",
"processed_size": 46,
"rewrites": 64
},
"result":
{
"edges": 232,
"markings": 232,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"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": "X (G (((1 <= p35) AND (1 <= p75) AND (1 <= p76))))",
"processed_size": 50,
"rewrites": 64
},
"result":
{
"edges": 211,
"markings": 211,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"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": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p16) AND (1 <= p19))) U ((p21 <= 0) OR (p61 <= 0) OR (p62 <= 0))))",
"processed_size": 82,
"rewrites": 64
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (F ((G (((1 <= p35) AND (1 <= p75) AND (1 <= p76))) OR ((1 <= p4) AND (1 <= p7)))))",
"processed_size": 85,
"rewrites": 64
},
"result":
{
"edges": 211,
"markings": 211,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"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": 6,
"visible_transitions": 0
},
"processed": "X ((F (((p4 <= 0) OR (p7 <= 0))) AND (X (F (((p19 <= 0) OR (p59 <= 0) OR (p60 <= 0)))) OR (1 <= p38))))",
"processed_size": 106,
"rewrites": 64
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p9 <= 0) OR (p49 <= 0) OR (p50 <= 0))",
"processed_size": 41,
"rewrites": 66
},
"result":
{
"edges": 135,
"markings": 136,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X ((G ((G (((1 <= p18) AND (1 <= p21))) AND ((p14 <= 0) OR (p17 <= 0)))) AND ((1 <= p18) AND (1 <= p21)))))",
"processed_size": 111,
"rewrites": 64
},
"result":
{
"edges": 211,
"markings": 211,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 4,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X ((G ((((p18 <= 0) OR (p21 <= 0)) AND ((p1 <= 0) OR (p41 <= 0) OR (p42 <= 0)))) OR (F (((p33 <= 0) OR (p73 <= 0) OR (p74 <= 0))) OR G (((p33 <= 0) OR (p73 <= 0) OR (p74 <= 0))))))",
"processed_size": 187,
"rewrites": 64
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 5,
"adisj": 0,
"aneg": 5,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (F ((((p4 <= 0) OR (p7 <= 0)) AND (G (((p4 <= 0) OR (p7 <= 0))) OR G (F ((X ((((p36 <= 0) OR (p39 <= 0)) R ((p4 <= 0) OR (p7 <= 0)))) AND ((p24 <= 0) OR (p27 <= 0)))))))))",
"processed_size": 178,
"rewrites": 64
},
"result":
{
"edges": 512352836,
"markings": 54749730,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"compoundnumber": 9,
"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": 641
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (X (G ((((1 <= p23) AND (1 <= p63) AND (1 <= p64)) AND (F (((p18 <= 0) OR (p21 <= 0))) OR ((1 <= p30) AND (1 <= p33)))))))",
"processed_size": 125,
"rewrites": 64
},
"result":
{
"edges": 211,
"markings": 211,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 10,
"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": 801
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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": "G (((p29 <= 0) OR (p69 <= 0) OR (p70 <= 0)))",
"processed_size": 46,
"rewrites": 64
},
"result":
{
"edges": 85,
"markings": 85,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1068
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (F ((G (F (((1 <= p19) AND (1 <= p59) AND (1 <= p60)))) AND ((p26 <= 0) OR (p29 <= 0)))))",
"processed_size": 92,
"rewrites": 64
},
"result":
{
"edges": 121,
"markings": 121,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1603
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"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": 6,
"visible_transitions": 0
},
"processed": "G (F ((F (G ((1 <= p38))) AND (((1 <= p12) AND (1 <= p15)) U ((1 <= p7) AND (1 <= p47) AND (1 <= p48))))))",
"processed_size": 106,
"rewrites": 64
},
"result":
{
"edges": 25,
"markings": 24,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3206
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"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": "F (G (((1 <= p21) AND (1 <= p61) AND (1 <= p62))))",
"processed_size": 50,
"rewrites": 64
},
"result":
{
"edges": 196,
"markings": 194,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 34864,
"runtime": 364.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X((F((F(G(**)) AND G((** OR G(**))))) U **))) : X(((** OR (G(**) AND F(**))) AND **)) : (X(**) AND (G(*) OR **)) : X(G(**)) : G(F((G(F(**)) AND **))) : X((F(**) U **)) : G(**) : X(F((G(**) OR **))) : X((F(*) AND (X(F(*)) OR **))) : G(F((F(G(**)) AND (** U **)))) : (X(X((G((G(**) AND **)) AND (** AND **)))) OR F(**)) : X((G((* AND *)) OR (F(*) OR G(*)))) : (F(G(**)) AND G((** OR G(**)))) : X(F((* AND (G(*) OR G(F((X((* R *)) AND *))))))) : X(X(G((** AND (F(*) OR **)))))"
},
"net":
{
"arcs": 200,
"conflict_clusters": 22,
"places": 80,
"places_significant": 40,
"singleton_clusters": 0,
"transitions": 42
},
"result":
{
"preliminary_value": "no yes no no no yes no no yes no no yes no no no ",
"value": "no yes no no no yes no no yes no no yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 122/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 80
lola: finding significant places
lola: 80 places, 42 transitions, 40 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: X (X ((F (G ((((1 <= p1) AND (1 <= p41) AND (1 <= p42)) U G (((1 <= p13) AND (1 <= p53) AND (1 <= p54)))))) U ((1 <= p13) AND (1 <= p53) AND (1 <= p54))))) : X (((G (((1 <= p27) AND (1 <= p67) AND (1 <= p68))) U ((p2 <= 0) OR (p5 <= 0))) AND ((p15 <= 0) OR (p55 <= 0) OR (p56 <= 0)))) : (X (((p13 <= 0) OR (p53 <= 0) OR (p54 <= 0) OR (p8 <= 0) OR (p11 <= 0) OR ((1 <= p7) AND (1 <= p47) AND (1 <= p48) AND (1 <= p8) AND (1 <= p11)))) AND (NOT(F (((1 <= p15) AND (1 <= p55) AND (1 <= p56)))) OR ((1 <= p13) AND (1 <= p53) AND (1 <= p54)))) : G (X (((1 <= p35) AND (1 <= p75) AND (1 <= p76)))) : G (X (X (X (F (X ((X (G (F (((1 <= p19) AND (1 <= p59) AND (1 <= p60))))) AND ((p26 <= 0) OR (p29 <= 0))))))))) : X ((F (((1 <= p16) AND (1 <= p19))) U ((p21 <= 0) OR (p61 <= 0) OR (p62 <= 0)))) : G (((p29 <= 0) OR (p69 <= 0) OR (p70 <= 0))) : F (X (F ((G (((1 <= p35) AND (1 <= p75) AND (1 <= p76))) OR ((1 <= p4) AND (1 <= p7)))))) : (NOT(G (X (G (((1 <= p4) AND (1 <= p7)))))) AND X ((NOT(X (G (((1 <= p19) AND (1 <= p59) AND (1 <= p60))))) OR (1 <= p38)))) : (F (((1 <= p7) AND (1 <= p47) AND (1 <= p48))) U G (F ((F (G ((1 <= p38))) AND (((1 <= p12) AND (1 <= p15)) U ((1 <= p7) AND (1 <= p47) AND (1 <= p48))))))) : (X (X (((G ((G (((1 <= p18) AND (1 <= p21))) AND ((p14 <= 0) OR (p17 <= 0)))) AND (1 <= p18)) AND (1 <= p21)))) OR F (((1 <= p9) AND (1 <= p49) AND (1 <= p50)))) : NOT(X ((((F ((((1 <= p14) AND (1 <= p17)) U ((1 <= p18) AND (1 <= p21)))) OR F (((1 <= p1) AND (1 <= p41) AND (1 <= p42)))) AND G (((1 <= p33) AND (1 <= p73) AND (1 <= p74)))) AND F (((1 <= p33) AND (1 <= p73) AND (1 <= p74)))))) : G ((((p28 <= 0) OR (p31 <= 0)) U G (((1 <= p21) AND (1 <= p61) AND (1 <= p62))))) : X (NOT(G ((F (G ((X ((((1 <= p36) AND (1 <= p39)) U ((1 <= p4) AND (1 <= p7)))) OR ((1 <= p24) AND (1 <= p27))))) U ((1 <= p4) AND (1 <= p7)))))) : G (X (X ((((1 <= p23) AND (1 <= p63) AND (1 <= p64)) AND (NOT(G (((1 <= p18) AND (1 <= p21)))) OR ((1 <= p30) AND (1 <= p33)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k: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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F ((F (G (((1 <= p13) AND (1 <= p53) AND (1 <= p54)))) AND G ((((1 <= p1) AND (1 <= p41) AND (1 <= p42)) OR G (((1 <= p13) AND (1 <= p53) AND (1 <= p54))))))) U ((1 <= p13) AND (1 <= p53) AND (1 <= p54)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((F (G (((1 <= p13) AND (1 <= p53) AND (1 <= p54)))) AND G ((((1 <= p1) AND (1 <= p41) AND (1 <= p42)) OR G (((1 <= p13) AND (1 <= p53) AND (1 <= p54))))))) U ((1 <= p13) AND (1 <= p53) AND (1 <= p54)))))
lola: processed formula length: 213
lola: 64 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 19 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: 213 markings, 214 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((p2 <= 0) OR (p5 <= 0)) OR (G (((1 <= p27) AND (1 <= p67) AND (1 <= p68))) AND F (((p2 <= 0) OR (p5 <= 0))))) AND ((p15 <= 0) OR (p55 <= 0) OR (p56 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((p2 <= 0) OR (p5 <= 0)) OR (G (((1 <= p27) AND (1 <= p67) AND (1 <= p68))) AND F (((p2 <= 0) OR (p5 <= 0))))) AND ((p15 <= 0) OR (p55 <= 0) OR (p56 <= 0))))
lola: processed formula length: 166
lola: 64 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: 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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((p13 <= 0) OR (p53 <= 0) OR (p54 <= 0) OR (p8 <= 0) OR (p11 <= 0) OR ((1 <= p7) AND (1 <= p47) AND (1 <= p48) AND (1 <= p8) AND (1 <= p11)))) AND (G (((p15 <= 0) OR (p55 <= 0) OR (p56 <= 0))) OR ((1 <= p13) AND (1 <= p53) AND (1 <= p54))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p13) AND (1 <= p53) AND (1 <= p54))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p13) AND (1 <= p53) AND (1 <= p54))
lola: processed formula length: 42
lola: 64 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 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 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p15 <= 0) OR (p55 <= 0) OR (p56 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p15 <= 0) OR (p55 <= 0) OR (p56 <= 0)))
lola: processed formula length: 46
lola: 64 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: 232 markings, 232 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p35) AND (1 <= p75) AND (1 <= p76))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p35) AND (1 <= p75) AND (1 <= p76))))
lola: processed formula length: 50
lola: 64 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: 211 markings, 211 edges
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p16) AND (1 <= p19))) U ((p21 <= 0) OR (p61 <= 0) OR (p62 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p16) AND (1 <= p19))) U ((p21 <= 0) OR (p61 <= 0) OR (p62 <= 0))))
lola: processed formula length: 82
lola: 64 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (((1 <= p35) AND (1 <= p75) AND (1 <= p76))) OR ((1 <= p4) AND (1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((1 <= p35) AND (1 <= p75) AND (1 <= p76))) OR ((1 <= p4) AND (1 <= p7)))))
lola: processed formula length: 85
lola: 64 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: 211 markings, 211 edges
lola: ========================================
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((p4 <= 0) OR (p7 <= 0))) AND (X (F (((p19 <= 0) OR (p59 <= 0) OR (p60 <= 0)))) OR (1 <= p38))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((p4 <= 0) OR (p7 <= 0))) AND (X (F (((p19 <= 0) OR (p59 <= 0) OR (p60 <= 0)))) OR (1 <= p38))))
lola: processed formula length: 106
lola: 64 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((G ((G (((1 <= p18) AND (1 <= p21))) AND ((p14 <= 0) OR (p17 <= 0)))) AND ((1 <= p18) AND (1 <= p21))))) OR F (((1 <= p9) AND (1 <= p49) AND (1 <= p50))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p9) AND (1 <= p49) AND (1 <= p50)))
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: ((p9 <= 0) OR (p49 <= 0) OR (p50 <= 0))
lola: processed formula length: 41
lola: 66 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: 136 markings, 135 edges
lola: ========================================
lola: subprocess 8 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((G ((G (((1 <= p18) AND (1 <= p21))) AND ((p14 <= 0) OR (p17 <= 0)))) AND ((1 <= p18) AND (1 <= p21)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((G ((G (((1 <= p18) AND (1 <= p21))) AND ((p14 <= 0) OR (p17 <= 0)))) AND ((1 <= p18) AND (1 <= p21)))))
lola: processed formula length: 111
lola: 64 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: 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: 211 markings, 211 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((((p18 <= 0) OR (p21 <= 0)) AND ((p1 <= 0) OR (p41 <= 0) OR (p42 <= 0)))) OR (F (((p33 <= 0) OR (p73 <= 0) OR (p74 <= 0))) OR G (((p33 <= 0) OR (p73 <= 0) OR (p74 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((((p18 <= 0) OR (p21 <= 0)) AND ((p1 <= 0) OR (p41 <= 0) OR (p42 <= 0)))) OR (F (((p33 <= 0) OR (p73 <= 0) OR (p74 <= 0))) OR G (((p33 <= 0) OR (p73 <= 0) OR (p74 <= 0))))))
lola: processed formula length: 187
lola: 64 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 9 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p4 <= 0) OR (p7 <= 0)) AND (G (((p4 <= 0) OR (p7 <= 0))) OR G (F ((X ((((p36 <= 0) OR (p39 <= 0)) R ((p4 <= 0) OR (p7 <= 0)))) AND ((p24 <= 0) OR (p27 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p4 <= 0) OR (p7 <= 0)) AND (G (((p4 <= 0) OR (p7 <= 0))) OR G (F ((X ((((p36 <= 0) OR (p39 <= 0)) R ((p4 <= 0) OR (p7 <= 0)))) AND ((p24 <= 0) OR (p27 <= 0)))))))))
lola: processed formula length: 178
lola: 64 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 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: 1339703 markings, 6499044 edges, 267941 markings/sec, 0 secs
lola: 2485420 markings, 13631969 edges, 229143 markings/sec, 5 secs
lola: 3559387 markings, 20834420 edges, 214793 markings/sec, 10 secs
lola: 4557905 markings, 28206097 edges, 199704 markings/sec, 15 secs
lola: 5509442 markings, 35526759 edges, 190307 markings/sec, 20 secs
lola: 6529032 markings, 43691875 edges, 203918 markings/sec, 25 secs
lola: 7574640 markings, 51952551 edges, 209122 markings/sec, 30 secs
lola: 8539417 markings, 59968553 edges, 192955 markings/sec, 35 secs
lola: 9512533 markings, 68141760 edges, 194623 markings/sec, 40 secs
lola: 10477009 markings, 76361635 edges, 192895 markings/sec, 45 secs
lola: 11414870 markings, 84300953 edges, 187572 markings/sec, 50 secs
lola: 12322776 markings, 92252537 edges, 181581 markings/sec, 55 secs
lola: 13120758 markings, 99313149 edges, 159596 markings/sec, 60 secs
lola: 13918166 markings, 106370541 edges, 159482 markings/sec, 65 secs
lola: 14742503 markings, 113868595 edges, 164867 markings/sec, 70 secs
lola: 15582482 markings, 121290891 edges, 167996 markings/sec, 75 secs
lola: 16370329 markings, 128476963 edges, 157569 markings/sec, 80 secs
lola: 17156747 markings, 135453999 edges, 157284 markings/sec, 85 secs
lola: 17936388 markings, 142761847 edges, 155928 markings/sec, 90 secs
lola: 18852490 markings, 150643812 edges, 183220 markings/sec, 95 secs
lola: 19707579 markings, 158384571 edges, 171018 markings/sec, 100 secs
lola: 20529643 markings, 165846437 edges, 164413 markings/sec, 105 secs
lola: 21317229 markings, 172846662 edges, 157517 markings/sec, 110 secs
lola: 22094926 markings, 179860062 edges, 155539 markings/sec, 115 secs
lola: 22831487 markings, 186540807 edges, 147312 markings/sec, 120 secs
lola: 23590742 markings, 193270274 edges, 151851 markings/sec, 125 secs
lola: 24342068 markings, 200230440 edges, 150265 markings/sec, 130 secs
lola: 25135498 markings, 207463179 edges, 158686 markings/sec, 135 secs
lola: 25977694 markings, 214973906 edges, 168439 markings/sec, 140 secs
lola: 26780477 markings, 222371424 edges, 160557 markings/sec, 145 secs
lola: 27612384 markings, 229888619 edges, 166381 markings/sec, 150 secs
lola: 28422528 markings, 237498323 edges, 162029 markings/sec, 155 secs
lola: 29185256 markings, 244613576 edges, 152546 markings/sec, 160 secs
lola: 29862152 markings, 251760072 edges, 135379 markings/sec, 165 secs
lola: 30566779 markings, 258962066 edges, 140925 markings/sec, 170 secs
lola: 31334487 markings, 266013944 edges, 153542 markings/sec, 175 secs
lola: 32054896 markings, 273130862 edges, 144082 markings/sec, 180 secs
lola: 32822297 markings, 280252534 edges, 153480 markings/sec, 185 secs
lola: 33546215 markings, 287029075 edges, 144784 markings/sec, 190 secs
lola: 34196445 markings, 293889123 edges, 130046 markings/sec, 195 secs
lola: 34881552 markings, 300970554 edges, 137021 markings/sec, 200 secs
lola: 35574104 markings, 308169420 edges, 138510 markings/sec, 205 secs
lola: 36218842 markings, 315148373 edges, 128948 markings/sec, 210 secs
lola: 36878197 markings, 322055391 edges, 131871 markings/sec, 215 secs
lola: 37532928 markings, 328854782 edges, 130946 markings/sec, 220 secs
lola: 38187232 markings, 335818708 edges, 130861 markings/sec, 225 secs
lola: 38896666 markings, 342456099 edges, 141887 markings/sec, 230 secs
lola: 39576900 markings, 349127062 edges, 136047 markings/sec, 235 secs
lola: 40181276 markings, 355813673 edges, 120875 markings/sec, 240 secs
lola: 40824993 markings, 362510805 edges, 128743 markings/sec, 245 secs
lola: 41538086 markings, 369645696 edges, 142619 markings/sec, 250 secs
lola: 42181281 markings, 376516590 edges, 128639 markings/sec, 255 secs
lola: 42804179 markings, 383346255 edges, 124580 markings/sec, 260 secs
lola: 43338439 markings, 390063064 edges, 106852 markings/sec, 265 secs
lola: 43977439 markings, 396759774 edges, 127800 markings/sec, 270 secs
lola: 44662637 markings, 403413734 edges, 137040 markings/sec, 275 secs
lola: 45333809 markings, 410220498 edges, 134234 markings/sec, 280 secs
lola: 45918797 markings, 417078294 edges, 116998 markings/sec, 285 secs
lola: 46545642 markings, 423934675 edges, 125369 markings/sec, 290 secs
lola: 47131693 markings, 430536184 edges, 117210 markings/sec, 295 secs
lola: 47689011 markings, 437194444 edges, 111464 markings/sec, 300 secs
lola: 48494139 markings, 444136610 edges, 161026 markings/sec, 305 secs
lola: 49130927 markings, 451083311 edges, 127358 markings/sec, 310 secs
lola: 49737582 markings, 457647299 edges, 121331 markings/sec, 315 secs
lola: 50376056 markings, 464515803 edges, 127695 markings/sec, 320 secs
lola: 50936517 markings, 471496517 edges, 112092 markings/sec, 325 secs
lola: 51518686 markings, 478046484 edges, 116434 markings/sec, 330 secs
lola: 52298857 markings, 484990794 edges, 156034 markings/sec, 335 secs
lola: 52989555 markings, 491821474 edges, 138140 markings/sec, 340 secs
lola: 53583349 markings, 498662308 edges, 118759 markings/sec, 345 secs
lola: 54205003 markings, 505273502 edges, 124331 markings/sec, 350 secs
lola: 54671268 markings, 511307069 edges, 93253 markings/sec, 355 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: 54749730 markings, 512352836 edges
lola: ========================================
lola: subprocess 10 will run for 641 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((1 <= p23) AND (1 <= p63) AND (1 <= p64)) AND (F (((p18 <= 0) OR (p21 <= 0))) OR ((1 <= p30) AND (1 <= p33)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((1 <= p23) AND (1 <= p63) AND (1 <= p64)) AND (F (((p18 <= 0) OR (p21 <= 0))) OR ((1 <= p30) AND (1 <= p33)))))))
lola: processed formula length: 125
lola: 64 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 211 markings, 211 edges
lola: ========================================
lola: subprocess 11 will run for 801 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p29 <= 0) OR (p69 <= 0) OR (p70 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p29 <= 0) OR (p69 <= 0) OR (p70 <= 0)))
lola: processed formula length: 46
lola: 64 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: 85 markings, 85 edges
lola: ========================================
lola: subprocess 12 will run for 1068 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (F (((1 <= p19) AND (1 <= p59) AND (1 <= p60)))) AND ((p26 <= 0) OR (p29 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (F (((1 <= p19) AND (1 <= p59) AND (1 <= p60)))) AND ((p26 <= 0) OR (p29 <= 0)))))
lola: processed formula length: 92
lola: 64 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 121 markings, 121 edges
lola: ========================================
lola: subprocess 13 will run for 1603 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (G ((1 <= p38))) AND (((1 <= p12) AND (1 <= p15)) U ((1 <= p7) AND (1 <= p47) AND (1 <= p48))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G ((1 <= p38))) AND (((1 <= p12) AND (1 <= p15)) U ((1 <= p7) AND (1 <= p47) AND (1 <= p48))))))
lola: processed formula length: 106
lola: 64 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: 24 markings, 25 edges
lola: ========================================
lola: subprocess 14 will run for 3206 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p21) AND (1 <= p61) AND (1 <= p62)))) AND G ((((p28 <= 0) OR (p31 <= 0)) OR G (((1 <= p21) AND (1 <= p61) AND (1 <= p62))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3206 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p21) AND (1 <= p61) AND (1 <= p62))))
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 <= p21) AND (1 <= p61) AND (1 <= p62))))
lola: processed formula length: 50
lola: 64 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: 194 markings, 196 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no yes no no yes no no yes no no no
lola:
preliminary result: no yes no no no yes no no yes no no yes no no no
lola: memory consumption: 34864 KB
lola: time consumption: 364 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="ResAllocation-PT-R020C002"
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 ResAllocation-PT-R020C002, 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 r189-tajo-162089433000402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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