Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r184-oct2-158987928700570.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Kanban-PT-20000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928700570
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.0K Apr 8 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 8 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 7 16:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 7 16:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 6 19:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 6 19:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 6 02:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 6 02:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 14K 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 Kanban-PT-20000-00
FORMULA_NAME Kanban-PT-20000-01
FORMULA_NAME Kanban-PT-20000-02
FORMULA_NAME Kanban-PT-20000-03
FORMULA_NAME Kanban-PT-20000-04
FORMULA_NAME Kanban-PT-20000-05
FORMULA_NAME Kanban-PT-20000-06
FORMULA_NAME Kanban-PT-20000-07
FORMULA_NAME Kanban-PT-20000-08
FORMULA_NAME Kanban-PT-20000-09
FORMULA_NAME Kanban-PT-20000-10
FORMULA_NAME Kanban-PT-20000-11
FORMULA_NAME Kanban-PT-20000-12
FORMULA_NAME Kanban-PT-20000-13
FORMULA_NAME Kanban-PT-20000-14
FORMULA_NAME Kanban-PT-20000-15

=== Now, execution of the tool begins

BK_START 1591214421347

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:00:23] [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 20:00:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:00:23] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2020-06-03 20:00:23] [INFO ] Transformed 16 places.
[2020-06-03 20:00:23] [INFO ] Transformed 16 transitions.
[2020-06-03 20:00:23] [INFO ] Parsed PT model containing 16 places and 16 transitions in 63 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100005 steps, including 0 resets, run finished after 49 ms. (steps per millisecond=2040 ) properties seen :[1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0]
// Phase 1: matrix 16 rows 16 cols
[2020-06-03 20:00:23] [INFO ] Computed 5 place invariants in 3 ms
[2020-06-03 20:00:23] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2020-06-03 20:00:23] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-03 20:00:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:23] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-03 20:00:23] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 3 ms.
[2020-06-03 20:00:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:00:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2020-06-03 20:00:23] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 16 ms returned sat
[2020-06-03 20:00:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:23] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-03 20:00:23] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 7 ms.
[2020-06-03 20:00:23] [INFO ] Added : 9 causal constraints over 2 iterations in 31 ms. Result :sat
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-06-03 20:00:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 12 ms.
[2020-06-03 20:00:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2020-06-03 20:00:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 4 ms.
[2020-06-03 20:00:24] [INFO ] Added : 14 causal constraints over 4 iterations in 32 ms. Result :sat
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 5 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-03 20:00:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:00:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-03 20:00:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:00:24] [INFO ] Added : 11 causal constraints over 3 iterations in 27 ms. Result :sat
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using 4 positive place invariants in 26 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-06-03 20:00:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 5 ms.
[2020-06-03 20:00:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-03 20:00:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:00:24] [INFO ] Added : 2 causal constraints over 2 iterations in 10 ms. Result :sat
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-06-03 20:00:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2020-06-03 20:00:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2020-06-03 20:00:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2020-06-03 20:00:24] [INFO ] Added : 13 causal constraints over 4 iterations in 11 ms. Result :sat
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-03 20:00:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:00:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-06-03 20:00:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:00:24] [INFO ] Added : 11 causal constraints over 3 iterations in 19 ms. Result :sat
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-03 20:00:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:00:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2020-06-03 20:00:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2020-06-03 20:00:24] [INFO ] Added : 10 causal constraints over 3 iterations in 12 ms. Result :sat
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-06-03 20:00:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:00:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2020-06-03 20:00:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 0 ms.
[2020-06-03 20:00:24] [INFO ] Added : 7 causal constraints over 2 iterations in 14 ms. Result :sat
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:24] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-06-03 20:00:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 0 ms.
[2020-06-03 20:00:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:00:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:00:24] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2020-06-03 20:00:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 3 ms.
[2020-06-03 20:00:24] [INFO ] Added : 9 causal constraints over 2 iterations in 20 ms. Result :sat
[2020-06-03 20:00:24] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 20:00:24] [INFO ] Flatten gal took : 30 ms
FORMULA Kanban-PT-20000-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 20:00:24] [INFO ] Flatten gal took : 4 ms
[2020-06-03 20:00:24] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2020-06-03 20:00:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Kanban-PT-20000 @ 3570 seconds

FORMULA Kanban-PT-20000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3302
rslt: Output for LTLFireability @ Kanban-PT-20000

{
"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 20:00:25 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((G ((p8 <= 0)) OR (1 <= p6)))",
"processed_size": 32,
"rewrites": 87
},
"result":
{
"edges": 120005,
"markings": 120005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((X ((G ((p1 <= 0)) AND (F ((p10 <= 0)) OR G ((p1 <= 0))))) AND F ((p1 <= 0)))))",
"processed_size": 85,
"rewrites": 87
},
"result":
{
"edges": 240007,
"markings": 240006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 18
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((1 <= p8)))",
"processed_size": 17,
"rewrites": 87
},
"result":
{
"edges": 160003,
"markings": 160003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((F ((X (G ((1 <= p8))) OR (1 <= p12))) AND ((1 <= p6) OR X ((X (G ((1 <= p8))) OR (1 <= p12)))))))",
"processed_size": 104,
"rewrites": 87
},
"result":
{
"edges": 120010,
"markings": 120009,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 594
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((((p8 <= 0) R (p10 <= 0)) AND (X ((p10 <= 0)) AND (p8 <= 0))))",
"processed_size": 65,
"rewrites": 87
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": 3,
"visible_transitions": 0
},
"processed": "F ((G ((1 <= p5)) AND ((p2 <= 0) AND (p8 <= 0))))",
"processed_size": 49,
"rewrites": 87
},
"result":
{
"edges": 120006,
"markings": 120006,
"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": 1189
},
"child":
[

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3436
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p5 <= 0))",
"processed_size": 13,
"rewrites": 87
},
"result":
{
"edges": 20005,
"markings": 20005,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3436
},
"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 <= p3) AND (1 <= p9) AND (1 <= p14))",
"processed_size": 40,
"rewrites": 87
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p5 <= 0)",
"processed_size": 9,
"rewrites": 89
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p5 <= 0)",
"processed_size": 9,
"rewrites": 89
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p5 <= 0))",
"processed_size": 13,
"rewrites": 87
},
"result":
{
"edges": 20005,
"markings": 20005,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p8) U (1 <= p2))",
"processed_size": 23,
"rewrites": 87
},
"result":
{
"edges": 20002,
"markings": 20002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"child":
[

{
"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 <= p3) AND (1 <= p9) AND (1 <= p14))",
"processed_size": 40,
"rewrites": 87
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"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": 4,
"visible_transitions": 0
},
"processed": "(G ((p12 <= 0)) R (G (F (((1 <= p3) AND (1 <= p9) AND (1 <= p14)))) OR (1 <= p12)))",
"processed_size": 83,
"rewrites": 87
},
"result":
{
"edges": 20002,
"markings": 20002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3340,
"runtime": 268.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G(F((G(*) OR *))) AND F(**)) : X((G(*) OR **)) : G(**) : X(F((X((G(*) AND (F(*) OR G(*)))) AND F(*)))) : X(F(**)) : G((F(**) AND (X(**) OR (** U **)))) : (** OR (G(((X(G(*)) AND G(*)) OR *)) AND F(**))) : F(G((F((X(G(**)) OR **)) AND (** OR X((X(G(**)) OR **)))))) : (G(**) OR (F(**) AND (** U **))) : ((G(*) R (G(F(**)) OR *)) OR **) : F(((* R *) AND (X(*) AND **))) : F((G(**) AND (** AND **)))"
},
"net":
{
"arcs": 40,
"conflict_clusters": 12,
"places": 16,
"places_significant": 11,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "unknown no no no no no no no no no yes no ",
"value": "unknown 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: 32/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 16 transitions, 11 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: (G (NOT(X (F (G ((F ((1 <= p5)) AND (p5 <= 0))))))) AND F ((1 <= p5))) : X ((G (NOT(F ((1 <= p8)))) OR (1 <= p6))) : G ((p12 <= 0)) : F (NOT(X ((X ((G ((1 <= p10)) U F ((1 <= p1)))) OR G ((1 <= p1)))))) : X (F ((G (X (((1 <= p1) OR (1 <= p8)))) U (1 <= p8)))) : G (NOT(F (NOT((X ((1 <= p5)) U ((p8 <= 0) U (1 <= p5))))))) : (NOT(F (((F (X ((1 <= p5))) OR F ((1 <= p8))) AND (1 <= p5)))) U (1 <= p12)) : F (G (X (((1 <= p6) U X ((G (X ((1 <= p8))) OR (1 <= p12))))))) : (G ((p5 <= 0)) OR (F (((1 <= p8) U (1 <= p5))) AND ((1 <= p8) U (1 <= p2)))) : (NOT((F ((1 <= p12)) U (F (X (NOT(G (F (((1 <= p3) AND (1 <= p9) AND (1 <= p14))))))) AND (p12 <= 0)))) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p14))) : F (((NOT(((1 <= p8) U (1 <= p10))) AND NOT(X ((1 <= p10)))) AND (p8 <= 0))) : F (((G ((1 <= p5)) AND (p2 <= 0)) AND (p8 <= 0)))
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p8 <= 0)) OR (1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p8 <= 0)) OR (1 <= p6)))
lola: processed formula length: 32
lola: 87 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 120005 markings, 120005 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X ((G ((p1 <= 0)) AND (F ((p10 <= 0)) OR G ((p1 <= 0))))) AND F ((p1 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X ((G ((p1 <= 0)) AND (F ((p10 <= 0)) OR G ((p1 <= 0))))) AND F ((p1 <= 0)))))
lola: processed formula length: 85
lola: 87 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 18 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: 240006 markings, 240007 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((1 <= p8)))
lola: processed formula length: 17
lola: 87 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 160003 markings, 160003 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((1 <= p5)) AND (X ((1 <= p5)) OR ((p8 <= 0) U (1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((1 <= p5)) AND (X ((1 <= p5)) OR ((p8 <= 0) U (1 <= p5)))))
lola: processed formula length: 66
lola: 87 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p12) OR (G (((X (G ((p5 <= 0))) AND G ((p8 <= 0))) OR (p5 <= 0))) AND F ((1 <= p12))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p12)
lola: processed formula length: 10
lola: 87 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p12))
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: (p12 <= 0)
lola: processed formula length: 10
lola: 89 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: 20002 markings, 20002 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((X (G ((1 <= p8))) OR (1 <= p12))) AND ((1 <= p6) OR X ((X (G ((1 <= p8))) OR (1 <= p12)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((X (G ((1 <= p8))) OR (1 <= p12))) AND ((1 <= p6) OR X ((X (G ((1 <= p8))) OR (1 <= p12)))))))
lola: processed formula length: 104
lola: 87 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 120009 markings, 120010 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p8 <= 0) R (p10 <= 0)) AND (X ((p10 <= 0)) AND (p8 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((p8 <= 0) R (p10 <= 0)) AND (X ((p10 <= 0)) AND (p8 <= 0))))
lola: processed formula length: 65
lola: 87 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p12 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p12 <= 0))
lola: processed formula length: 14
lola: 87 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 100002 markings, 120002 edges
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((1 <= p5)) AND ((p2 <= 0) AND (p8 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((1 <= p5)) AND ((p2 <= 0) AND (p8 <= 0))))
lola: processed formula length: 49
lola: 87 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 120006 markings, 120006 edges
lola: ========================================
lola: subprocess 9 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((G ((p5 <= 0)) OR (1 <= p5)))) AND F ((1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p5))
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: (p5 <= 0)
lola: processed formula length: 9
lola: 89 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p5 <= 0)) OR (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p5 <= 0)) OR (1 <= p5))))
lola: processed formula length: 36
lola: 87 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: 6194225 markings, 8792706 edges, 1238845 markings/sec, 0 secs
lola: 12031792 markings, 17089657 edges, 1167513 markings/sec, 5 secs
lola: 17697465 markings, 25143018 edges, 1133135 markings/sec, 10 secs
lola: 23344564 markings, 33170862 edges, 1129420 markings/sec, 15 secs
lola: 28894201 markings, 41054579 edges, 1109927 markings/sec, 20 secs
lola: 34343071 markings, 48796947 edges, 1089774 markings/sec, 25 secs
lola: 39758834 markings, 56491156 edges, 1083153 markings/sec, 30 secs
lola: 45160650 markings, 64178989 edges, 1080363 markings/sec, 35 secs
lola: 50492697 markings, 71750158 edges, 1066409 markings/sec, 40 secs
lola: 55809054 markings, 79299752 edges, 1063271 markings/sec, 45 secs
lola: 61106784 markings, 86829358 edges, 1059546 markings/sec, 50 secs
lola: 66373135 markings, 94316831 edges, 1053270 markings/sec, 55 secs
lola: 71617069 markings, 101771265 edges, 1048787 markings/sec, 60 secs
lola: 76807611 markings, 109146197 edges, 1038108 markings/sec, 65 secs
lola: 81998822 markings, 116522725 edges, 1038242 markings/sec, 70 secs
lola: 87115700 markings, 123794935 edges, 1023376 markings/sec, 75 secs
lola: 92418451 markings, 131333349 edges, 1060550 markings/sec, 80 secs
lola: 97673028 markings, 138806688 edges, 1050915 markings/sec, 85 secs
lola: 102906452 markings, 146248885 edges, 1046685 markings/sec, 90 secs
lola: 106320437 markings, 151094124 edges, 682797 markings/sec, 95 secs
lola: 110495293 markings, 157022721 edges, 834971 markings/sec, 100 secs
lola: 114811970 markings, 163161727 edges, 863335 markings/sec, 105 secs
lola: 118730556 markings, 168738170 edges, 783717 markings/sec, 110 secs
lola: 122956390 markings, 174732953 edges, 845167 markings/sec, 115 secs
lola: 126852192 markings, 180286519 edges, 779160 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 10 will run for 1718 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p5 <= 0)) OR (F ((1 <= p5)) AND ((1 <= p8) U (1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1718 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p5))
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: (p5 <= 0)
lola: processed formula length: 9
lola: 89 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: subprocess 11 will run for 3436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p5 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p5 <= 0))
lola: processed formula length: 13
lola: 87 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: ========================================
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: 20005 markings, 20005 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 11 will run for 3436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G ((p12 <= 0)) R (G (F (((1 <= p3) AND (1 <= p9) AND (1 <= p14)))) OR (1 <= p12))) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p14)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p3) AND (1 <= p9) AND (1 <= p14))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p3) AND (1 <= p9) AND (1 <= p14))
lola: processed formula length: 40
lola: 87 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (F ((G ((p5 <= 0)) OR (1 <= p5)))) AND F ((1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((1 <= p5))
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: (p5 <= 0)
lola: processed formula length: 9
lola: 89 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p5 <= 0)) OR (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p5 <= 0)) OR (1 <= p5))))
lola: processed formula length: 36
lola: 87 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: 6134929 markings, 8703762 edges, 1226986 markings/sec, 0 secs
lola: 11865037 markings, 16850889 edges, 1146022 markings/sec, 5 secs
lola: 17574915 markings, 24968347 edges, 1141976 markings/sec, 10 secs
lola: 23249246 markings, 33033156 edges, 1134866 markings/sec, 15 secs
lola: 28752105 markings, 40845396 edges, 1100572 markings/sec, 20 secs
lola: 34218710 markings, 48625676 edges, 1093321 markings/sec, 25 secs
lola: 39710835 markings, 56419159 edges, 1098425 markings/sec, 30 secs
lola: 45151741 markings, 64166069 edges, 1088181 markings/sec, 35 secs
lola: 50501793 markings, 71762286 edges, 1070010 markings/sec, 40 secs
lola: 55846490 markings, 79351560 edges, 1068939 markings/sec, 45 secs
lola: 61155190 markings, 86901967 edges, 1061740 markings/sec, 50 secs
lola: 66452665 markings, 94436124 edges, 1059495 markings/sec, 55 secs
lola: 71724608 markings, 101932573 edges, 1054389 markings/sec, 60 secs
lola: 77028424 markings, 109462908 edges, 1060763 markings/sec, 65 secs
lola: 82305478 markings, 116956785 edges, 1055411 markings/sec, 70 secs
lola: 87550698 markings, 124411592 edges, 1049044 markings/sec, 75 secs
lola: 92768395 markings, 131829065 edges, 1043539 markings/sec, 80 secs
lola: 97979195 markings, 139236781 edges, 1042160 markings/sec, 85 secs
lola: 103246070 markings, 146729196 edges, 1053375 markings/sec, 90 secs
lola: 106665092 markings, 151588599 edges, 683804 markings/sec, 95 secs
lola: 110586535 markings, 157162748 edges, 784289 markings/sec, 100 secs
lola: 113619070 markings, 161473746 edges, 606507 markings/sec, 105 secs
lola: 117899569 markings, 167547265 edges, 856100 markings/sec, 110 secs
lola: 121496524 markings, 172656548 edges, 719391 markings/sec, 115 secs
lola: 125531569 markings, 178391970 edges, 807009 markings/sec, 120 secs
lola: 129209166 markings, 183618133 edges, 735519 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G ((p5 <= 0)) OR (F ((1 <= p5)) AND ((1 <= p8) U (1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((1 <= p5))
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: (p5 <= 0)
lola: processed formula length: 9
lola: 89 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((p5 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p5 <= 0))
lola: processed formula length: 13
lola: 87 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 20005 markings, 20005 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((1 <= p8) U (1 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p8) U (1 <= p2))
lola: processed formula length: 23
lola: 87 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 20002 markings, 20002 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((G ((p12 <= 0)) R (G (F (((1 <= p3) AND (1 <= p9) AND (1 <= p14)))) OR (1 <= p12))) OR ((1 <= p3) AND (1 <= p9) AND (1 <= p14)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p3) AND (1 <= p9) AND (1 <= p14))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p3) AND (1 <= p9) AND (1 <= p14))
lola: processed formula length: 40
lola: 87 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: ========================================
lola: ...considering subproblem: (G ((p12 <= 0)) R (G (F (((1 <= p3) AND (1 <= p9) AND (1 <= p14)))) OR (1 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (G ((p12 <= 0)) R (G (F (((1 <= p3) AND (1 <= p9) AND (1 <= p14)))) OR (1 <= p12)))
lola: processed formula length: 83
lola: 87 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: 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: 20002 markings, 20002 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no no no no no no no no no yes no
lola:
preliminary result: unknown no no no no no no no no no yes no
lola: memory consumption: 3340 KB
lola: time consumption: 268 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="Kanban-PT-20000"
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 Kanban-PT-20000, 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 r184-oct2-158987928700570"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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