Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987881900146.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is DNAwalker-PT-09ringLR, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987881900146
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 3.4K Mar 31 04:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 31 04:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 29 20:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 29 20:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 13:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 28 13:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 06:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 27 06:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 112K Mar 24 05:37 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 DNAwalker-PT-09ringLR-00
FORMULA_NAME DNAwalker-PT-09ringLR-01
FORMULA_NAME DNAwalker-PT-09ringLR-02
FORMULA_NAME DNAwalker-PT-09ringLR-03
FORMULA_NAME DNAwalker-PT-09ringLR-04
FORMULA_NAME DNAwalker-PT-09ringLR-05
FORMULA_NAME DNAwalker-PT-09ringLR-06
FORMULA_NAME DNAwalker-PT-09ringLR-07
FORMULA_NAME DNAwalker-PT-09ringLR-08
FORMULA_NAME DNAwalker-PT-09ringLR-09
FORMULA_NAME DNAwalker-PT-09ringLR-10
FORMULA_NAME DNAwalker-PT-09ringLR-11
FORMULA_NAME DNAwalker-PT-09ringLR-12
FORMULA_NAME DNAwalker-PT-09ringLR-13
FORMULA_NAME DNAwalker-PT-09ringLR-14
FORMULA_NAME DNAwalker-PT-09ringLR-15

=== Now, execution of the tool begins

BK_START 1591206188161

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 17:43:10] [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]
[2020-06-03 17:43:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 17:43:10] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2020-06-03 17:43:10] [INFO ] Transformed 27 places.
[2020-06-03 17:43:10] [INFO ] Transformed 260 transitions.
[2020-06-03 17:43:10] [INFO ] Parsed PT model containing 27 places and 260 transitions in 144 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 8036 resets, run finished after 500 ms. (steps per millisecond=200 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1]
[2020-06-03 17:43:11] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2020-06-03 17:43:11] [INFO ] Computed 0 place invariants in 6 ms
[2020-06-03 17:43:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:43:11] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2020-06-03 17:43:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:43:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:43:11] [INFO ] [Nat]Absence check using state equation in 240 ms returned unsat
[2020-06-03 17:43:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:43:12] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2020-06-03 17:43:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:43:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:43:12] [INFO ] [Nat]Absence check using state equation in 660 ms returned unsat
[2020-06-03 17:43:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:43:12] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2020-06-03 17:43:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:43:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:43:13] [INFO ] [Nat]Absence check using state equation in 242 ms returned unsat
[2020-06-03 17:43:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:43:13] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2020-06-03 17:43:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:43:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:43:13] [INFO ] [Nat]Absence check using state equation in 207 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2020-06-03 17:43:14] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 17:43:14] [INFO ] Flatten gal took : 102 ms
FORMULA DNAwalker-PT-09ringLR-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-09ringLR-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-09ringLR-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-09ringLR-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-09ringLR-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 17:43:14] [INFO ] Flatten gal took : 29 ms
[2020-06-03 17:43:14] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2020-06-03 17:43:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DNAwalker-PT-09ringLR @ 3570 seconds

FORMULA DNAwalker-PT-09ringLR-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2593
rslt: Output for LTLFireability @ DNAwalker-PT-09ringLR

{
"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": "Wed Jun 3 17:43:14 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 259
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 3,
"X": 1,
"aconj": 6,
"adisj": 1,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(X ((F (G ((F (((2 <= p1) AND (1 <= p15))) AND ((((2 <= p9) AND (1 <= p17)) U ((2 <= p15) AND (1 <= p17))) OR ((2 <= p1) AND (1 <= p15)))))) OR ((2 <= p9) AND (1 <= p17)))) U (((p9 <= 0) OR (p11 <= 1)) U ((2 <= p1) AND (1 <= p15))))",
"processed_size": 233,
"rewrites": 52
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 15
},
"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": 285
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 3,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G (F (((2 <= p16) AND (1 <= p25)))) OR G ((F ((X (G (((2 <= p16) AND (1 <= p25)))) AND ((p9 <= 1)))) AND F (((2 <= p16) AND (1 <= p25)))))))",
"processed_size": 144,
"rewrites": 52
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"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": 317
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 3,
"aconj": 3,
"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": 5,
"visible_transitions": 0
},
"processed": "G ((F (G (((1 <= p1) AND (2 <= p9)))) AND X (X ((F (((p1 <= 0) OR (p3 <= 1))) OR X (((p19 <= 1) OR (p21 <= 0))))))))",
"processed_size": 118,
"rewrites": 52
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 357
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 357
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G (((1 <= p3) AND (2 <= p9))) AND X (((p3 <= 1) OR (p5 <= 0)))))",
"processed_size": 69,
"rewrites": 52
},
"result":
{
"edges": 8,
"markings": 7,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 408
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 1,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X (G ((F (((p16 <= 1))) AND (X (((p16 <= 1))) AND ((p16 <= 1)))))))",
"processed_size": 70,
"rewrites": 52
},
"result":
{
"edges": 29179,
"markings": 5843,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 476
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 3,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((X (((1 <= p6) AND (2 <= p23))) AND (X (((G (((1 <= p6) AND (2 <= p23))) AND ((2 <= p19) AND (1 <= p21))) OR ((2 <= p19) AND (1 <= p21)))) OR ((2 <= p19) AND (1 <= p21)))))",
"processed_size": 175,
"rewrites": 52
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 571
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((((p3 <= 0) OR (p7 <= 1)) U ((1 <= p3) AND (2 <= p7))))",
"processed_size": 59,
"rewrites": 52
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1380
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((X (G (((p1 <= 0) OR (p25 <= 1)))) R F (((p3 <= 0) OR (p5 <= 1))))))",
"processed_size": 76,
"rewrites": 52
},
"result":
{
"edges": 249294087,
"markings": 31385435,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 2593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((G (((2 <= p6) AND (1 <= p25))) OR (((2 <= p16) AND (1 <= p21)) OR ((2 <= p6) AND (1 <= p25)))))",
"processed_size": 99,
"rewrites": 52
},
"result":
{
"edges": 11,
"markings": 10,
"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"
}
}
],
"exit":
{
"error": null,
"memory": 43108,
"runtime": 977.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X((F(G((F(**) AND ((** U **) OR **)))) OR **)) U (** U **)) : F((G(F(**)) OR G((F((X(G(**)) AND *)) AND F(**))))) : G((F(G(**)) AND X(X((F(*) OR X(*)))))) : (F((G(**) AND X(*))) AND (X(**) OR F(**))) : X(X(G((F(*) AND (X(*) AND **))))) : G((X(**) AND (X(((G(**) AND (** AND **)) OR **)) OR **))) : X((** U **)) : (F((F(**) AND G(**))) U X(X(X(F(**))))) : (G(*) OR F(G((X(G(*)) AND G(*))))) : X(G((X(G(*)) R F(*)))) : F((G(**) OR (** OR **)))"
},
"net":
{
"arcs": 760,
"conflict_clusters": 7,
"places": 27,
"places_significant": 27,
"singleton_clusters": 0,
"transitions": 260
},
"result":
{
"preliminary_value": "no no no no no no no no no yes no ",
"value": "no no no no no no no no no yes 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: 287/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 260 transitions, 27 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: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: (X ((F (G (((((2 <= p9) AND (1 <= p17)) U ((2 <= p15) AND (1 <= p17))) U ((2 <= p1) AND (1 <= p15))))) OR ((2 <= p9) AND (1 <= p17)))) U (((p9 <= 0) OR (p11 <= 1)) U ((2 <= p1) AND (1 <= p15)))) : F ((NOT(F (G ((X (NOT(G (((2 <= p16) AND (1 <= p25))))) OR ((2 <= p9)))))) U G (F (((2 <= p16) AND (1 <= p25)))))) : G ((F (X (G (((1 <= p1) AND (2 <= p9))))) AND X (NOT(X ((G (((1 <= p1) AND (2 <= p3))) AND X (((2 <= p19) AND (1 <= p21))))))))) : (F ((G (((1 <= p3) AND (2 <= p9))) AND NOT(X (((2 <= p3) AND (1 <= p5)))))) AND (X (((2 <= p1))) OR F (((2 <= p3) AND (1 <= p5))))) : X (X (G (((NOT(G (((2 <= p16)))) AND NOT(X (((2 <= p16))))) AND ((p16 <= 1)))))) : G ((X (((1 <= p6) AND (2 <= p23))) AND (X ((((G (((1 <= p6) AND (2 <= p23))) AND (2 <= p19)) AND (1 <= p21)) OR ((2 <= p19) AND (1 <= p21)))) OR ((2 <= p19) AND (1 <= p21))))) : X ((((p3 <= 0) OR (p7 <= 1)) U ((1 <= p3) AND (2 <= p7)))) : (F ((F ((((1 <= p9) AND (2 <= p13)) U ((1 <= p10) AND (2 <= p13)))) AND G (((2 <= p18))))) U X (X (F (X (((2 <= p18))))))) : (NOT((((2 <= p9) AND (1 <= p16)) U F (((2 <= p5) AND (1 <= p25))))) OR NOT(G (F ((X (F (((p0 <= 1) OR (p5 <= 0)))) OR F (((2 <= p0) AND (1 <= p5)))))))) : G (X (NOT((F (X (((1 <= p1) AND (2 <= p25)))) U G (((1 <= p3) AND (2 <= p5))))))) : F (((G (((2 <= p6) AND (1 <= p25))) OR ((2 <= p16) AND (1 <= p21))) OR ((2 <= p6) AND (1 <= p25))))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F (G ((F (((2 <= p1) AND (1 <= p15))) AND ((((2 <= p9) AND (1 <= p17)) U ((2 <= p15) AND (1 <= p17))) OR ((2 <= p1) AND (1 <= p15)))))) OR ((2 <= p9) AND (1 <= p17)))) U (((p9 <= 0) OR (p11 <= 1)) U ((2 <= p1) AND (1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((F (G ((F (((2 <= p1) AND (1 <= p15))) AND ((((2 <= p9) AND (1 <= p17)) U ((2 <= p15) AND (1 <= p17))) OR ((2 <= p1) AND (1 <= p15)))))) OR ((2 <= p9) AND (1 <= p17)))) U (((p9 <= 0) OR (p11 <= 1)) U ((2 <= p1) AND (1 <= p15))))
lola: processed formula length: 233
lola: 52 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 15 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F (((2 <= p16) AND (1 <= p25)))) OR G ((F ((X (G (((2 <= p16) AND (1 <= p25)))) AND ((p9 <= 1)))) AND F (((2 <= p16) AND (1 <= p25)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F (((2 <= p16) AND (1 <= p25)))) OR G ((F ((X (G (((2 <= p16) AND (1 <= p25)))) AND ((p9 <= 1)))) AND F (((2 <= p16) AND (1 <= p25)))))))
lola: processed formula length: 144
lola: 52 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G (((1 <= p1) AND (2 <= p9)))) AND X (X ((F (((p1 <= 0) OR (p3 <= 1))) OR X (((p19 <= 1) OR (p21 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G (((1 <= p1) AND (2 <= p9)))) AND X (X ((F (((p1 <= 0) OR (p3 <= 1))) OR X (((p19 <= 1) OR (p21 <= 0))))))))
lola: processed formula length: 118
lola: 52 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23 markings, 23 edges
lola: ========================================
lola: subprocess 3 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G (((1 <= p3) AND (2 <= p9))) AND X (((p3 <= 1) OR (p5 <= 0))))) AND (X (((2 <= p1))) OR F (((2 <= p3) AND (1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((1 <= p3) AND (2 <= p9))) AND X (((p3 <= 1) OR (p5 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((1 <= p3) AND (2 <= p9))) AND X (((p3 <= 1) OR (p5 <= 0)))))
lola: processed formula length: 69
lola: 52 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: 7 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((F (((p16 <= 1))) AND (X (((p16 <= 1))) AND ((p16 <= 1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((F (((p16 <= 1))) AND (X (((p16 <= 1))) AND ((p16 <= 1)))))))
lola: processed formula length: 70
lola: 52 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5843 markings, 29179 edges
lola: ========================================
lola: subprocess 5 will run for 476 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((1 <= p6) AND (2 <= p23))) AND (X (((G (((1 <= p6) AND (2 <= p23))) AND ((2 <= p19) AND (1 <= p21))) OR ((2 <= p19) AND (1 <= p21)))) OR ((2 <= p19) AND (1 <= p21)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((1 <= p6) AND (2 <= p23))) AND (X (((G (((1 <= p6) AND (2 <= p23))) AND ((2 <= p19) AND (1 <= p21))) OR ((2 <= p19) AND (1 <= p21)))) OR ((2 <= p19) AND (1 <= p21)))))
lola: processed formula length: 175
lola: 52 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 6 will run for 571 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p3 <= 0) OR (p7 <= 1)) U ((1 <= p3) AND (2 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p3 <= 0) OR (p7 <= 1)) U ((1 <= p3) AND (2 <= p7))))
lola: processed formula length: 59
lola: 52 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((F (((1 <= p10) AND (2 <= p13))) AND G (((2 <= p18))))) U X (X (X (F (((2 <= p18)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((F (((1 <= p10) AND (2 <= p13))) AND G (((2 <= p18))))) U X (X (X (F (((2 <= p18)))))))
lola: processed formula length: 91
lola: 52 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 15 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 8 will run for 952 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p5 <= 1) OR (p25 <= 0))) OR F (G ((X (G (((2 <= p0) AND (1 <= p5)))) AND G (((p0 <= 1) OR (p5 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 952 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p5 <= 1) OR (p25 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p5 <= 1) OR (p25 <= 0)))
lola: processed formula length: 30
lola: 52 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: 52 markings, 93 edges
lola: ========================================
lola: subprocess 9 will run for 1428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (G (((2 <= p0) AND (1 <= p5)))) AND G (((p0 <= 1) OR (p5 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (G (((2 <= p0) AND (1 <= p5)))) AND G (((p0 <= 1) OR (p5 <= 0))))))
lola: processed formula length: 77
lola: 52 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 687060 markings, 9726191 edges, 137412 markings/sec, 0 secs
lola: 1326684 markings, 19575005 edges, 127925 markings/sec, 5 secs
lola: 2023602 markings, 30171986 edges, 139384 markings/sec, 10 secs
lola: 2651680 markings, 39685522 edges, 125616 markings/sec, 15 secs
lola: 3340144 markings, 50048209 edges, 137693 markings/sec, 20 secs
lola: 3992528 markings, 60197220 edges, 130477 markings/sec, 25 secs
lola: 4622627 markings, 70220578 edges, 126020 markings/sec, 30 secs
lola: 5138592 markings, 78691674 edges, 103193 markings/sec, 35 secs
lola: 5742523 markings, 87605890 edges, 120786 markings/sec, 40 secs
lola: 6357729 markings, 97352744 edges, 123041 markings/sec, 45 secs
lola: 7021096 markings, 107417760 edges, 132673 markings/sec, 50 secs
lola: 7623132 markings, 117369504 edges, 120407 markings/sec, 55 secs
lola: 8164081 markings, 125945695 edges, 108190 markings/sec, 60 secs
lola: 8821807 markings, 135975923 edges, 131545 markings/sec, 65 secs
lola: 9413502 markings, 145892449 edges, 118339 markings/sec, 70 secs
lola: 10052822 markings, 155753034 edges, 127864 markings/sec, 75 secs
lola: 10602760 markings, 165413534 edges, 109988 markings/sec, 80 secs
lola: 11139077 markings, 175201819 edges, 107263 markings/sec, 85 secs
lola: 11628014 markings, 184064230 edges, 97787 markings/sec, 90 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: 11761277 markings, 186697503 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 1380 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (G (((p1 <= 0) OR (p25 <= 1)))) R F (((p3 <= 0) OR (p5 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (G (((p1 <= 0) OR (p25 <= 1)))) R F (((p3 <= 0) OR (p5 <= 1))))))
lola: processed formula length: 76
lola: 52 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: 1293673 markings, 8993748 edges, 258735 markings/sec, 0 secs
lola: 2513169 markings, 17693244 edges, 243899 markings/sec, 5 secs
lola: 3632461 markings, 25914608 edges, 223858 markings/sec, 10 secs
lola: 4725809 markings, 33840889 edges, 218670 markings/sec, 15 secs
lola: 5733545 markings, 41513766 edges, 201547 markings/sec, 20 secs
lola: 6549498 markings, 48696298 edges, 163191 markings/sec, 25 secs
lola: 7708317 markings, 57147016 edges, 231764 markings/sec, 30 secs
lola: 8697265 markings, 64635869 edges, 197790 markings/sec, 35 secs
lola: 9744712 markings, 72841643 edges, 209489 markings/sec, 40 secs
lola: 10522257 markings, 78933497 edges, 155509 markings/sec, 45 secs
lola: 11506011 markings, 86635902 edges, 196751 markings/sec, 50 secs
lola: 12460334 markings, 93920908 edges, 190865 markings/sec, 55 secs
lola: 13298817 markings, 101565876 edges, 167697 markings/sec, 60 secs
lola: 13927854 markings, 107109636 edges, 125807 markings/sec, 65 secs
lola: 14994405 markings, 114680687 edges, 213310 markings/sec, 70 secs
lola: 15902446 markings, 121275854 edges, 181608 markings/sec, 75 secs
lola: 16820603 markings, 128242952 edges, 183631 markings/sec, 80 secs
lola: 17741802 markings, 135229364 edges, 184240 markings/sec, 85 secs
lola: 18814184 markings, 143442520 edges, 214476 markings/sec, 90 secs
lola: 19761405 markings, 150739265 edges, 189444 markings/sec, 95 secs
lola: 20722942 markings, 158617345 edges, 192307 markings/sec, 100 secs
lola: 21386437 markings, 164969173 edges, 132699 markings/sec, 105 secs
lola: 22448699 markings, 173013309 edges, 212452 markings/sec, 110 secs
lola: 23336143 markings, 179995632 edges, 177489 markings/sec, 115 secs
lola: 24322405 markings, 187852611 edges, 197252 markings/sec, 120 secs
lola: 25161999 markings, 194794315 edges, 167919 markings/sec, 125 secs
lola: 26030332 markings, 201977421 edges, 173667 markings/sec, 130 secs
lola: 26990190 markings, 209844709 edges, 191972 markings/sec, 135 secs
lola: 27825173 markings, 216706733 edges, 166997 markings/sec, 140 secs
lola: 28647734 markings, 223857864 edges, 164512 markings/sec, 145 secs
lola: 29489092 markings, 231122786 edges, 168272 markings/sec, 150 secs
lola: 30355756 markings, 238978756 edges, 173333 markings/sec, 155 secs
lola: 31154849 markings, 246962361 edges, 159819 markings/sec, 160 secs
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: 31385435 markings, 249294087 edges
lola: ========================================
lola: subprocess 10 will run for 2593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((2 <= p6) AND (1 <= p25))) OR (((2 <= p16) AND (1 <= p21)) OR ((2 <= p6) AND (1 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((2 <= p6) AND (1 <= p25))) OR (((2 <= p16) AND (1 <= p21)) OR ((2 <= p6) AND (1 <= p25)))))
lola: processed formula length: 99
lola: 52 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: 10 markings, 11 edges
lola: RESULT
lola: lola: ========================================
SUMMARY: no no no no no no no no no yes no

lola:
preliminary result: no no no no no no no no no yes no
lola: memory consumption: 43108 KB
lola: time consumption: 977 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="DNAwalker-PT-09ringLR"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is DNAwalker-PT-09ringLR, 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 r178-tajo-158987881900146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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