Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 06:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 06:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 07:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 07:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 14K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1620927626002

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 17:40:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 17:40:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 17:40:27] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-13 17:40:27] [INFO ] Transformed 16 places.
[2021-05-13 17:40:27] [INFO ] Transformed 16 transitions.
[2021-05-13 17:40:27] [INFO ] Parsed PT model containing 16 places and 16 transitions in 59 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100005 steps, including 0 resets, run finished after 55 ms. (steps per millisecond=1818 ) properties seen :[0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 17:40:27] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-13 17:40:27] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2021-05-13 17:40:27] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:27] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 17:40:27] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 3 ms.
[2021-05-13 17:40:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:40:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2021-05-13 17:40:27] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:27] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-13 17:40:27] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 5 ms.
[2021-05-13 17:40:27] [INFO ] Added : 8 causal constraints over 2 iterations in 19 ms. Result :sat
[2021-05-13 17:40:27] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:40:27] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:40:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:27] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-13 17:40:27] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:40:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:40:27] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Added : 7 causal constraints over 2 iterations in 25 ms. Result :sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 12 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Added : 13 causal constraints over 4 iterations in 11 ms. Result :sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2021-05-13 17:40:28] [INFO ] Added : 13 causal constraints over 4 iterations in 11 ms. Result :sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Added : 13 causal constraints over 4 iterations in 10 ms. Result :sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2021-05-13 17:40:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Added : 13 causal constraints over 4 iterations in 11 ms. Result :sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Added : 11 causal constraints over 3 iterations in 7 ms. Result :sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Added : 13 causal constraints over 4 iterations in 13 ms. Result :sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Added : 9 causal constraints over 2 iterations in 6 ms. Result :sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Added : 9 causal constraints over 2 iterations in 6 ms. Result :sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Added : 10 causal constraints over 3 iterations in 7 ms. Result :sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Added : 7 causal constraints over 2 iterations in 6 ms. Result :sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:40:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Added : 8 causal constraints over 2 iterations in 5 ms. Result :sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Added : 3 causal constraints over 2 iterations in 4 ms. Result :sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:40:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2021-05-13 17:40:28] [INFO ] Added : 7 causal constraints over 2 iterations in 7 ms. Result :sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 0 ms.
[2021-05-13 17:40:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Added : 10 causal constraints over 3 iterations in 10 ms. Result :sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:40:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Added : 14 causal constraints over 4 iterations in 9 ms. Result :sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Added : 9 causal constraints over 2 iterations in 5 ms. Result :sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 17:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 17:40:28] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 17:40:28] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2021-05-13 17:40:28] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
[2021-05-13 17:40:29] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-13 17:40:29] [INFO ] Flatten gal took : 24 ms
FORMULA Kanban-PT-20000-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 17:40:29] [INFO ] Flatten gal took : 4 ms
[2021-05-13 17:40:29] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-13 17:40:29] [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-01 FALSE 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-06 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 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-07 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-15 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

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-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Kanban-PT-20000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1245
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": "Thu May 13 17:40:30 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X ((G ((F ((1 <= p6)) OR (1 <= p8))) AND (1 <= p4))) AND (G ((1 <= p6)) AND (1 <= p8))))",
"processed_size": 92,
"rewrites": 110
},
"result":
{
"edges": 120004,
"markings": 120004,
"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": 276
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 301
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "X (X (G (((1 <= p11) AND (1 <= p3) AND (1 <= p9) AND (1 <= p14)))))",
"processed_size": 67,
"rewrites": 110
},
"result":
{
"edges": 120004,
"markings": 120004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 334
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (((F ((1 <= p8)) OR X ((1 <= p6))) U (G ((1 <= p8)) OR (1 <= p8))))",
"processed_size": 69,
"rewrites": 110
},
"result":
{
"edges": 160003,
"markings": 160003,
"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": 376
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 376
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"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": 1,
"visible_transitions": 0
},
"processed": "X ((F ((1 <= p6)) U (1 <= p6)))",
"processed_size": 31,
"rewrites": 110
},
"result":
{
"edges": 120004,
"markings": 120004,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 430
},
"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": "(p1 <= 0)",
"processed_size": 9,
"rewrites": 112
},
"result":
{
"edges": 20002,
"markings": 20002,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"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": 501
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "F (G ((1 <= p5)))",
"processed_size": 17,
"rewrites": 110
},
"result":
{
"edges": 7,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 602
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 4,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F (((G (F ((1 <= p8))) AND (p8 <= 0)) OR (G ((1 <= p12)) AND F ((G (F ((1 <= p8))) AND (p8 <= 0)))))))",
"processed_size": 105,
"rewrites": 110
},
"result":
{
"edges": 20002,
"markings": 20002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 38
},
"compoundnumber": 9,
"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": 752
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 5,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((((1 <= p3) AND (1 <= p9) AND (1 <= p14)) AND (G ((F (((1 <= p3) AND (1 <= p9) AND (1 <= p14))) AND ((1 <= p3) AND ((1 <= p9) AND ((1 <= p14) AND (p12 <= 0)))))) OR (1 <= p1))))",
"processed_size": 180,
"rewrites": 110
},
"result":
{
"edges": 20002,
"markings": 20002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"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": 112
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 16,
"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": 13,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)))",
"processed_size": 44,
"rewrites": 110
},
"result":
{
"edges": 200006,
"markings": 160006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 17,
"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": 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 ((p1 <= 0))",
"processed_size": 13,
"rewrites": 110
},
"result":
{
"edges": 120002,
"markings": 100002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 18,
"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": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3728,
"runtime": 2325.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((X(F(*)) AND (G(*) AND (G((X(F(*)) AND G(*))) OR G(F(*)))))) : F((X((G((F(**) OR **)) AND **)) AND (G(**) AND **))) : (X(X(G(*))) AND (F(*) OR X(X(G(*))))) : G(F(((G(F(**)) AND **) OR (G(**) AND F((G(F(**)) AND **)))))) : X((G((X(X(G(*))) AND *)) R *)) : X(X(G(**))) : F(G(**)) : F(**) : X(((F(*) OR X(**)) U (G(**) OR **))) : ((** U ((* R *) R *)) U (F(**) OR **)) : (F(*) AND G(*)) : (* AND ((F(*) OR G(*)) AND G(**))) : (G(F((X(**) OR G(**)))) AND X((F(**) U **))) : F((** AND (G((F(**) AND (** AND (** AND (** AND **))))) OR **)))"
},
"net":
{
"arcs": 40,
"conflict_clusters": 12,
"places": 16,
"places_significant": 11,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "unknown no no no unknown no no no no unknown no no no no ",
"value": "unknown no no no unknown no no no no unknown no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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((F (G ((1 <= p15))) U (X (G ((1 <= p1))) OR F ((1 <= p15)))))) : F ((((X (G ((F ((1 <= p6)) OR (1 <= p8)))) AND X ((1 <= p4))) AND G ((1 <= p6))) AND (1 <= p8))) : NOT((G (((1 <= p5) AND (1 <= p11))) U X (F (X (F ((((1 <= p11) AND (1 <= p5)) OR (1 <= p15)))))))) : F (G (F ((G ((1 <= p12)) U (G (F ((1 <= p8))) AND (p8 <= 0)))))) : X (NOT((F ((X (X (F ((1 <= p15)))) OR (1 <= p1))) U ((p5 <= 0) AND (1 <= p15))))) : X (G (X (((1 <= p11) AND (1 <= p3) AND (1 <= p9) AND (1 <= p14))))) : NOT(G (X (NOT(F (G ((1 <= p5))))))) : (NOT(G ((((G ((1 <= p1)) U ((1 <= p1) U (1 <= p2))) OR (1 <= p1)) OR (1 <= p15)))) U F ((1 <= p1))) : ((F (NOT(X ((p8 <= 0)))) OR X (X ((1 <= p6)))) U X ((G ((1 <= p8)) OR (1 <= p8)))) : ((((1 <= p2) OR (1 <= p1)) U NOT((((1 <= p4) U (1 <= p1)) U ((1 <= p3) AND (1 <= p9) AND (1 <= p14))))) U (F (((1 <= p3) AND (1 <= p9) AND (1 <= p14))) OR (1 <= p2))) : (NOT(G ((p4 <= 0))) AND NOT(F ((1 <= p11)))) : (NOT((G (((1 <= p3) AND (1 <= p9) AND (1 <= p14))) U ((1 <= p3) AND (1 <= p9) AND (1 <= p14)))) AND G ((p1 <= 0))) : (X (G (F ((X ((1 <= p6)) OR G ((1 <= p1)))))) AND X ((F ((1 <= p6)) U (1 <= p6)))) : F ((((1 <= p3) AND (1 <= p9) AND (1 <= p14)) AND (G (((((F (((1 <= p3) AND (1 <= p9) AND (1 <= p14))) AND (1 <= p3)) AND (1 <= p9)) AND (1 <= p14)) AND (p12 <= 0))) OR (1 <= p1))))
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:338
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:335
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:318
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k: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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (F ((p1 <= 0))) AND (G ((p15 <= 0)) AND (G ((X (F ((p1 <= 0))) AND G ((p15 <= 0)))) OR G (F ((p15 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F ((p1 <= 0))) AND (G ((p15 <= 0)) AND (G ((X (F ((p1 <= 0))) AND G ((p15 <= 0)))) OR G (F ((p15 <= 0)))))))
lola: processed formula length: 115
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 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: 3060392 markings, 5909056 edges, 612078 markings/sec, 0 secs
lola: 5661991 markings, 11106910 edges, 520320 markings/sec, 5 secs
lola: 8078781 markings, 15937982 edges, 483358 markings/sec, 10 secs
lola: 10283156 markings, 20344029 edges, 440875 markings/sec, 15 secs
lola: 12306525 markings, 24386580 edges, 404674 markings/sec, 20 secs
lola: 14203658 markings, 28178234 edges, 379427 markings/sec, 25 secs
lola: 15995510 markings, 31761322 edges, 358370 markings/sec, 30 secs
lola: 17837140 markings, 35443860 edges, 368326 markings/sec, 35 secs
lola: 19549978 markings, 38866775 edges, 342568 markings/sec, 40 secs
lola: 21288881 markings, 42342915 edges, 347781 markings/sec, 45 secs
lola: 22976356 markings, 45715851 edges, 337495 markings/sec, 50 secs
lola: 24660219 markings, 49085078 edges, 336773 markings/sec, 55 secs
lola: 26269319 markings, 52298513 edges, 321820 markings/sec, 60 secs
lola: 27879958 markings, 55520433 edges, 322128 markings/sec, 65 secs
lola: 29515813 markings, 58791951 edges, 327171 markings/sec, 70 secs
lola: 31138244 markings, 62036868 edges, 324486 markings/sec, 75 secs
lola: 32708992 markings, 65174112 edges, 314150 markings/sec, 80 secs
lola: 34287743 markings, 68331165 edges, 315750 markings/sec, 85 secs
lola: 35882584 markings, 71522824 edges, 318968 markings/sec, 90 secs
lola: 37442803 markings, 74638683 edges, 312044 markings/sec, 95 secs
lola: 39005598 markings, 77764212 edges, 312559 markings/sec, 100 secs
lola: 40561011 markings, 80876570 edges, 311083 markings/sec, 105 secs
lola: 42112915 markings, 83977395 edges, 310381 markings/sec, 110 secs
lola: 43676686 markings, 87106206 edges, 312754 markings/sec, 115 secs
lola: 45219612 markings, 90189380 edges, 308585 markings/sec, 120 secs
lola: 46791681 markings, 93329164 edges, 314414 markings/sec, 125 secs
lola: 48360477 markings, 96467367 edges, 313759 markings/sec, 130 secs
lola: 49884357 markings, 99515295 edges, 304776 markings/sec, 135 secs
lola: 51405824 markings, 102560832 edges, 304293 markings/sec, 140 secs
lola: 52915115 markings, 105575970 edges, 301858 markings/sec, 145 secs
lola: 54423743 markings, 108595606 edges, 301726 markings/sec, 150 secs
lola: 55929154 markings, 111601103 edges, 301082 markings/sec, 155 secs
lola: 57429717 markings, 114600592 edges, 300113 markings/sec, 160 secs
lola: 58928630 markings, 117601693 edges, 299783 markings/sec, 165 secs
lola: 60429162 markings, 120596598 edges, 300106 markings/sec, 170 secs
lola: 61924984 markings, 123588968 edges, 299164 markings/sec, 175 secs
lola: 63416391 markings, 126574524 edges, 298281 markings/sec, 180 secs
lola: 64909501 markings, 129558549 edges, 298622 markings/sec, 185 secs
lola: 66395040 markings, 132530624 edges, 297108 markings/sec, 190 secs
lola: 67875632 markings, 135489328 edges, 296118 markings/sec, 195 secs
lola: 69352298 markings, 138445282 edges, 295333 markings/sec, 200 secs
lola: 70833453 markings, 141403718 edges, 296231 markings/sec, 205 secs
lola: 72298004 markings, 144328362 edges, 292910 markings/sec, 210 secs
lola: 73766300 markings, 147265585 edges, 293659 markings/sec, 215 secs
lola: 75237133 markings, 150213279 edges, 294167 markings/sec, 220 secs
lola: 76711426 markings, 153156903 edges, 294859 markings/sec, 225 secs
lola: 78188366 markings, 156111675 edges, 295388 markings/sec, 230 secs
lola: 79657644 markings, 159047172 edges, 293856 markings/sec, 235 secs
lola: 81131007 markings, 161999133 edges, 294673 markings/sec, 240 secs
lola: 82594829 markings, 164925277 edges, 292764 markings/sec, 245 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((G ((F ((1 <= p6)) OR (1 <= p8))) AND (1 <= p4))) AND (G ((1 <= p6)) AND (1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((G ((F ((1 <= p6)) OR (1 <= p8))) AND (1 <= p4))) AND (G ((1 <= p6)) AND (1 <= p8))))
lola: processed formula length: 92
lola: 110 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: 120004 markings, 120004 edges
lola: ========================================
lola: subprocess 2 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G ((((p11 <= 0) OR (p5 <= 0)) AND (p15 <= 0))))) AND (F (((p5 <= 0) OR (p11 <= 0))) OR X (X (G ((((p11 <= 0) OR (p5 <= 0)) AND (p15 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p5 <= 0) OR (p11 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p5) AND (1 <= p11))
lola: processed formula length: 26
lola: 112 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 3 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((p11 <= 0) OR (p5 <= 0)) AND (p15 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((p11 <= 0) OR (p5 <= 0)) AND (p15 <= 0)))))
lola: processed formula length: 55
lola: 110 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: 320082 markings, 440126 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((X (X (G ((p15 <= 0)))) AND (p1 <= 0))) R ((1 <= p5) OR (p15 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((X (X (G ((p15 <= 0)))) AND (p1 <= 0))) R ((1 <= p5) OR (p15 <= 0))))
lola: processed formula length: 77
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3392201 markings, 7607672 edges, 678440 markings/sec, 0 secs
lola: 6590548 markings, 14926374 edges, 639669 markings/sec, 5 secs
lola: 9850994 markings, 22387156 edges, 652089 markings/sec, 10 secs
lola: 12679725 markings, 28317173 edges, 565746 markings/sec, 15 secs
lola: 15238871 markings, 33430416 edges, 511829 markings/sec, 20 secs
lola: 17650609 markings, 38249924 edges, 482348 markings/sec, 25 secs
lola: 19895374 markings, 42736188 edges, 448953 markings/sec, 30 secs
lola: 22016567 markings, 46975900 edges, 424239 markings/sec, 35 secs
lola: 24054280 markings, 51048758 edges, 407543 markings/sec, 40 secs
lola: 26018733 markings, 54975451 edges, 392891 markings/sec, 45 secs
lola: 27916436 markings, 58771086 edges, 379541 markings/sec, 50 secs
lola: 29772254 markings, 62482668 edges, 371164 markings/sec, 55 secs
lola: 31597715 markings, 66129817 edges, 365092 markings/sec, 60 secs
lola: 33391817 markings, 69715767 edges, 358820 markings/sec, 65 secs
lola: 35163127 markings, 73260061 edges, 354262 markings/sec, 70 secs
lola: 36907423 markings, 76746068 edges, 348859 markings/sec, 75 secs
lola: 38635368 markings, 80198758 edges, 345589 markings/sec, 80 secs
lola: 40370337 markings, 83669146 edges, 346994 markings/sec, 85 secs
lola: 42108151 markings, 87143617 edges, 347563 markings/sec, 90 secs
lola: 43798980 markings, 90526537 edges, 338166 markings/sec, 95 secs
lola: 45420462 markings, 93764265 edges, 324296 markings/sec, 100 secs
lola: 47079021 markings, 97083634 edges, 331712 markings/sec, 105 secs
lola: 48696112 markings, 100315877 edges, 323418 markings/sec, 110 secs
lola: 50360487 markings, 103642885 edges, 332875 markings/sec, 115 secs
lola: 51994961 markings, 106910895 edges, 326895 markings/sec, 120 secs
lola: 53625523 markings, 110168332 edges, 326112 markings/sec, 125 secs
lola: 55222305 markings, 113364831 edges, 319356 markings/sec, 130 secs
lola: 56808589 markings, 116535362 edges, 317257 markings/sec, 135 secs
lola: 58373019 markings, 119665012 edges, 312886 markings/sec, 140 secs
lola: 59921767 markings, 122762765 edges, 309750 markings/sec, 145 secs
lola: 61463737 markings, 125844131 edges, 308394 markings/sec, 150 secs
lola: 63004714 markings, 128925727 edges, 308195 markings/sec, 155 secs
lola: 64518501 markings, 131948313 edges, 302757 markings/sec, 160 secs
lola: 66051953 markings, 135020611 edges, 306690 markings/sec, 165 secs
lola: 67578166 markings, 138066395 edges, 305243 markings/sec, 170 secs
lola: 69085759 markings, 141081503 edges, 301519 markings/sec, 175 secs
lola: 70574354 markings, 144061272 edges, 297719 markings/sec, 180 secs
lola: 72090838 markings, 147091247 edges, 303297 markings/sec, 185 secs
lola: 73583844 markings, 150078349 edges, 298601 markings/sec, 190 secs
lola: 75085718 markings, 153080159 edges, 300375 markings/sec, 195 secs
lola: 76573462 markings, 156054463 edges, 297549 markings/sec, 200 secs
lola: 78053377 markings, 159016126 edges, 295983 markings/sec, 205 secs
lola: 79552636 markings, 162013267 edges, 299852 markings/sec, 210 secs
lola: 81038149 markings, 164981103 edges, 297103 markings/sec, 215 secs
lola: 82488049 markings, 167878154 edges, 289980 markings/sec, 220 secs
lola: 83930632 markings, 170770582 edges, 288517 markings/sec, 225 secs
lola: 85371386 markings, 173645483 edges, 288151 markings/sec, 230 secs
lola: 86507583 markings, 175923920 edges, 227239 markings/sec, 235 secs
lola: 87589811 markings, 178084461 edges, 216446 markings/sec, 240 secs
lola: 88851061 markings, 180604578 edges, 252250 markings/sec, 245 secs
lola: 89914085 markings, 182733564 edges, 212605 markings/sec, 250 secs
lola: 91019531 markings, 184943391 edges, 221089 markings/sec, 255 secs
lola: 92047473 markings, 187000020 edges, 205588 markings/sec, 260 secs
lola: 93241345 markings, 189384129 edges, 238774 markings/sec, 265 secs
lola: 94221097 markings, 191339806 edges, 195950 markings/sec, 270 secs
lola: 95397494 markings, 193691629 edges, 235279 markings/sec, 275 secs
lola: 96685101 markings, 196274235 edges, 257521 markings/sec, 280 secs
lola: 97957912 markings, 198814430 edges, 254562 markings/sec, 285 secs
lola: 99165148 markings, 201225938 edges, 241447 markings/sec, 290 secs
lola: 100265056 markings, 203429001 edges, 219982 markings/sec, 295 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p11) AND (1 <= p3) AND (1 <= p9) AND (1 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p11) AND (1 <= p3) AND (1 <= p9) AND (1 <= p14)))))
lola: processed formula length: 67
lola: 110 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: 120004 markings, 120004 edges
lola: subprocess 5 will run for 334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (((F ((1 <= p8)) OR X ((1 <= p6))) U (G ((1 <= p8)) OR (1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((F ((1 <= p8)) OR X ((1 <= p6))) U (G ((1 <= p8)) OR (1 <= p8))))
lola: processed formula length: 69
lola: 110 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: 160003 markings, 160003 edges
lola: ========================================
lola: subprocess 6 will run for 376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((X ((1 <= p6)) OR G ((1 <= p1))))) AND X ((F ((1 <= p6)) U (1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((1 <= p6)) U (1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((1 <= p6)) U (1 <= p6)))
lola: processed formula length: 31
lola: 110 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: 120004 markings, 120004 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p1))
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: (p1 <= 0)
lola: processed formula length: 9
lola: 112 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: ========================================
lola: subprocess 8 will run for 501 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((1 <= p5)))
lola: processed formula length: 17
lola: 110 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: add low 0
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: 6 markings, 7 edges
lola: ========================================
lola: subprocess 9 will run for 602 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((G (F ((1 <= p8))) AND (p8 <= 0)) OR (G ((1 <= p12)) AND F ((G (F ((1 <= p8))) AND (p8 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((G (F ((1 <= p8))) AND (p8 <= 0)) OR (G ((1 <= p12)) AND F ((G (F ((1 <= p8))) AND (p8 <= 0)))))))
lola: processed formula length: 105
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 38 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: subprocess 10 will run for 752 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p3) AND (1 <= p9) AND (1 <= p14)) AND (G ((F (((1 <= p3) AND (1 <= p9) AND (1 <= p14))) AND ((1 <= p3) AND ((1 <= p9) AND ((1 <= p14) AND (p12 <= 0)))))) OR (1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((1 <= p3) AND (1 <= p9) AND (1 <= p14)) AND (G ((F (((1 <= p3) AND (1 <= p9) AND (1 <= p14))) AND ((1 <= p3) AND ((1 <= p9) AND ((1 <= p14) AND (p12 <= 0)))))) OR (1 <= p1))))
lola: processed formula length: 180
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20002 markings, 20002 edges
lola: ========================================
lola: subprocess 11 will run for 1003 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p2) OR (1 <= p1)) U (((p4 <= 0) R (p1 <= 0)) R ((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)))) U (F (((1 <= p3) AND (1 <= p9) AND (1 <= p14))) OR (1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p2) OR (1 <= p1)) U (((p4 <= 0) R (p1 <= 0)) R ((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)))) U (F (((1 <= p3) AND (1 <= p9) AND (1 <= p14))) OR (1 <= p2)))
lola: processed formula length: 162
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 2274285 markings, 8239828 edges, 454857 markings/sec, 0 secs
lola: 4265346 markings, 16228524 edges, 398212 markings/sec, 5 secs
lola: 6240131 markings, 24054637 edges, 394957 markings/sec, 10 secs
lola: 8155389 markings, 31703528 edges, 383052 markings/sec, 15 secs
lola: 10083570 markings, 39332557 edges, 385636 markings/sec, 20 secs
lola: 11975613 markings, 46934156 edges, 378409 markings/sec, 25 secs
lola: 13864129 markings, 54443902 edges, 377703 markings/sec, 30 secs
lola: 15730949 markings, 61937699 edges, 373364 markings/sec, 35 secs
lola: 17607372 markings, 69405104 edges, 375285 markings/sec, 40 secs
lola: 19468889 markings, 76794554 edges, 372303 markings/sec, 45 secs
lola: 21295989 markings, 84115119 edges, 365420 markings/sec, 50 secs
lola: 23130658 markings, 91436397 edges, 366934 markings/sec, 55 secs
lola: 24975884 markings, 98794623 edges, 369045 markings/sec, 60 secs
lola: 26815685 markings, 106133859 edges, 367960 markings/sec, 65 secs
lola: 28616892 markings, 113338001 edges, 360241 markings/sec, 70 secs
lola: 30418914 markings, 120545025 edges, 360404 markings/sec, 75 secs
lola: 32250057 markings, 127853955 edges, 366229 markings/sec, 80 secs
lola: 34027623 markings, 134975364 edges, 355513 markings/sec, 85 secs
lola: 35840896 markings, 142164934 edges, 362655 markings/sec, 90 secs
lola: 37656640 markings, 149416805 edges, 363149 markings/sec, 95 secs
lola: 39405933 markings, 156439257 edges, 349859 markings/sec, 100 secs
lola: 41212117 markings, 163660842 edges, 361237 markings/sec, 105 secs
lola: 42980616 markings, 170690505 edges, 353700 markings/sec, 110 secs
lola: 44769090 markings, 177850103 edges, 357695 markings/sec, 115 secs
lola: 46532724 markings, 184922755 edges, 352727 markings/sec, 120 secs
lola: 48316188 markings, 192004814 edges, 356693 markings/sec, 125 secs
lola: 50112485 markings, 199121174 edges, 359259 markings/sec, 130 secs
lola: 51859077 markings, 206144806 edges, 349318 markings/sec, 135 secs
lola: 53641327 markings, 213255765 edges, 356450 markings/sec, 140 secs
lola: 55386384 markings, 220230250 edges, 349011 markings/sec, 145 secs
lola: 57148203 markings, 227296541 edges, 352364 markings/sec, 150 secs
lola: 58913932 markings, 234316540 edges, 353146 markings/sec, 155 secs
lola: 60646675 markings, 241281061 edges, 346549 markings/sec, 160 secs
lola: 62438392 markings, 248392017 edges, 358343 markings/sec, 165 secs
lola: 64143312 markings, 255259164 edges, 340984 markings/sec, 170 secs
lola: 65949438 markings, 262420554 edges, 361225 markings/sec, 175 secs
lola: 67641748 markings, 269239377 edges, 338462 markings/sec, 180 secs
lola: 69456906 markings, 276436574 edges, 363032 markings/sec, 185 secs
lola: 71160706 markings, 283239796 edges, 340760 markings/sec, 190 secs
lola: 72910400 markings, 290263649 edges, 349939 markings/sec, 195 secs
lola: 74668566 markings, 297257191 edges, 351633 markings/sec, 200 secs
lola: 76361975 markings, 304072904 edges, 338682 markings/sec, 205 secs
lola: 78172459 markings, 311260689 edges, 362097 markings/sec, 210 secs
lola: 79858296 markings, 318001047 edges, 337167 markings/sec, 215 secs
lola: 81634768 markings, 325052997 edges, 355294 markings/sec, 220 secs
lola: 83353595 markings, 331974472 edges, 343765 markings/sec, 225 secs
lola: 85048300 markings, 338745862 edges, 338941 markings/sec, 230 secs
lola: 86831898 markings, 345888405 edges, 356720 markings/sec, 235 secs
lola: 88518175 markings, 352630304 edges, 337255 markings/sec, 240 secs
lola: 90248394 markings, 359526000 edges, 346044 markings/sec, 245 secs
lola: 92006143 markings, 366578076 edges, 351550 markings/sec, 250 secs
lola: 93683838 markings, 373289928 edges, 335539 markings/sec, 255 secs
lola: 95442895 markings, 380326283 edges, 351811 markings/sec, 260 secs
lola: 97172280 markings, 387179359 edges, 345877 markings/sec, 265 secs
lola: 98847885 markings, 393883904 edges, 335121 markings/sec, 270 secs
lola: 100623239 markings, 400997602 edges, 355071 markings/sec, 275 secs
lola: 102307082 markings, 407730984 edges, 336769 markings/sec, 280 secs
lola: 103983184 markings, 414437260 edges, 335220 markings/sec, 285 secs
lola: 105768393 markings, 421525461 edges, 357042 markings/sec, 290 secs
lola: 107446004 markings, 428237019 edges, 335522 markings/sec, 295 secs
lola: 109125011 markings, 434953471 edges, 335801 markings/sec, 300 secs
lola: 110890812 markings, 442033732 edges, 353160 markings/sec, 305 secs
lola: 112564756 markings, 448732461 edges, 334789 markings/sec, 310 secs
lola: 114243028 markings, 455440044 edges, 335654 markings/sec, 315 secs
lola: 116017370 markings, 462496499 edges, 354868 markings/sec, 320 secs
lola: 117691910 markings, 469197317 edges, 334908 markings/sec, 325 secs
lola: 119340877 markings, 475808637 edges, 329793 markings/sec, 330 secs
lola: 120344679 markings, 479802198 edges, 200760 markings/sec, 335 secs
lola: 121750613 markings, 485382644 edges, 281187 markings/sec, 340 secs
lola: 122902474 markings, 490014108 edges, 230372 markings/sec, 345 secs
lola: 124109816 markings, 494839760 edges, 241468 markings/sec, 350 secs
lola: 125467533 markings, 500251705 edges, 271543 markings/sec, 355 secs
lola: 126871426 markings, 505885307 edges, 280779 markings/sec, 360 secs
lola: 128268395 markings, 511434646 edges, 279394 markings/sec, 365 secs
lola: 129579215 markings, 516682453 edges, 262164 markings/sec, 370 secs
lola: 131039465 markings, 522513268 edges, 292050 markings/sec, 375 secs
lola: 132719721 markings, 529234133 edges, 336051 markings/sec, 380 secs
lola: 133685255 markings, 533093458 edges, 193107 markings/sec, 385 secs
lola: 135157023 markings, 538964578 edges, 294354 markings/sec, 390 secs
lola: 136010389 markings, 542431327 edges, 170673 markings/sec, 395 secs
lola: 136904248 markings, 545979787 edges, 178772 markings/sec, 400 secs
lola: 137950207 markings, 550120645 edges, 209192 markings/sec, 405 secs
lola: 138706873 markings, 553188943 edges, 151333 markings/sec, 410 secs
lola: 138798636 markings, 553510118 edges, 18353 markings/sec, 415 secs
lola: 140243807 markings, 559307596 edges, 289034 markings/sec, 420 secs
lola: 140334217 markings, 559664576 edges, 18082 markings/sec, 425 secs
lola: 141409984 markings, 563969713 edges, 215153 markings/sec, 430 secs
lola: 142222820 markings, 567234597 edges, 162567 markings/sec, 435 secs
lola: 143173262 markings, 571041106 edges, 190088 markings/sec, 440 secs
lola: 144136733 markings, 574893255 edges, 192694 markings/sec, 445 secs
lola: 144313520 markings, 575572008 edges, 35357 markings/sec, 450 secs
lola: 145737754 markings, 581276761 edges, 284847 markings/sec, 455 secs
lola: 146432471 markings, 584068234 edges, 138943 markings/sec, 460 secs
lola: 147159579 markings, 586973089 edges, 145422 markings/sec, 465 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 1265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p4)) AND G ((p11 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p11 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p11 <= 0))
lola: processed formula length: 14
lola: 110 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: 360004 markings, 460004 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 2529 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)) AND ((F (((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0))) OR G (((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)))) AND G ((p1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 2529 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)))
lola: processed formula length: 44
lola: 110 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: 160006 markings, 200006 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0))
lola: processed formula length: 40
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 16 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p3) AND (1 <= p9) AND (1 <= p14))
lola: processed formula length: 40
lola: 112 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((X (F ((p1 <= 0))) AND (G ((p15 <= 0)) AND (G ((X (F ((p1 <= 0))) AND G ((p15 <= 0)))) OR G (F ((p15 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F ((p1 <= 0))) AND (G ((p15 <= 0)) AND (G ((X (F ((p1 <= 0))) AND G ((p15 <= 0)))) OR G (F ((p15 <= 0)))))))
lola: processed formula length: 115
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 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: 3063296 markings, 5914449 edges, 612659 markings/sec, 0 secs
lola: 5700913 markings, 11184728 edges, 527523 markings/sec, 5 secs
lola: 8185678 markings, 16151238 edges, 496953 markings/sec, 10 secs
lola: 10536215 markings, 20848807 edges, 470107 markings/sec, 15 secs
lola: 12738239 markings, 25248598 edges, 440405 markings/sec, 20 secs
lola: 14783519 markings, 29337467 edges, 409056 markings/sec, 25 secs
lola: 16748870 markings, 33267521 edges, 393070 markings/sec, 30 secs
lola: 18760327 markings, 37288338 edges, 402291 markings/sec, 35 secs
lola: 20624503 markings, 41013570 edges, 372835 markings/sec, 40 secs
lola: 22408557 markings, 44580932 edges, 356811 markings/sec, 45 secs
lola: 24107283 markings, 47977848 edges, 339745 markings/sec, 50 secs
lola: 25717884 markings, 51199139 edges, 322120 markings/sec, 55 secs
lola: 27366051 markings, 54494819 edges, 329633 markings/sec, 60 secs
lola: 29064077 markings, 57889167 edges, 339605 markings/sec, 65 secs
lola: 30737813 markings, 61234239 edges, 334747 markings/sec, 70 secs
lola: 32398411 markings, 64553970 edges, 332120 markings/sec, 75 secs
lola: 34040574 markings, 67835342 edges, 328433 markings/sec, 80 secs
lola: 35650798 markings, 71054357 edges, 322045 markings/sec, 85 secs
lola: 37247994 markings, 74249282 edges, 319439 markings/sec, 90 secs
lola: 38851764 markings, 77458932 edges, 320754 markings/sec, 95 secs
lola: 40454618 markings, 80661094 edges, 320571 markings/sec, 100 secs
lola: 42045659 markings, 83845554 edges, 318208 markings/sec, 105 secs
lola: 43620218 markings, 86991758 edges, 314912 markings/sec, 110 secs
lola: 45161585 markings, 90074917 edges, 308273 markings/sec, 115 secs
lola: 46730041 markings, 93212429 edges, 313691 markings/sec, 120 secs
lola: 48270888 markings, 96291088 edges, 308169 markings/sec, 125 secs
lola: 49829816 markings, 99408007 edges, 311786 markings/sec, 130 secs
lola: 51391488 markings, 102532123 edges, 312334 markings/sec, 135 secs
lola: 52950224 markings, 105647184 edges, 311747 markings/sec, 140 secs
lola: 54493429 markings, 108731952 edges, 308641 markings/sec, 145 secs
lola: 56015722 markings, 111772362 edges, 304459 markings/sec, 150 secs
lola: 57546184 markings, 114834864 edges, 306092 markings/sec, 155 secs
lola: 59060066 markings, 117862135 edges, 302776 markings/sec, 160 secs
lola: 60538054 markings, 120814627 edges, 295598 markings/sec, 165 secs
lola: 61750548 markings, 123242063 edges, 242499 markings/sec, 170 secs
lola: 62941167 markings, 125624773 edges, 238124 markings/sec, 175 secs
lola: 64435969 markings, 128611947 edges, 298960 markings/sec, 180 secs
lola: 65948042 markings, 131633261 edges, 302415 markings/sec, 185 secs
lola: 67446458 markings, 134628725 edges, 299683 markings/sec, 190 secs
lola: 68936198 markings, 137614386 edges, 297948 markings/sec, 195 secs
lola: 70433634 markings, 140606935 edges, 299487 markings/sec, 200 secs
lola: 71928093 markings, 143591283 edges, 298892 markings/sec, 205 secs
lola: 73413532 markings, 146566949 edges, 297088 markings/sec, 210 secs
lola: 74890879 markings, 149520477 edges, 295469 markings/sec, 215 secs
lola: 76380558 markings, 152496210 edges, 297936 markings/sec, 220 secs
lola: 77868957 markings, 155470932 edges, 297680 markings/sec, 225 secs
lola: 79356571 markings, 158446639 edges, 297523 markings/sec, 230 secs
lola: 80838001 markings, 161407634 edges, 296286 markings/sec, 235 secs
lola: 82316627 markings, 164364561 edges, 295725 markings/sec, 240 secs
lola: 83791506 markings, 167315079 edges, 294976 markings/sec, 245 secs
lola: 85273560 markings, 170274000 edges, 296411 markings/sec, 250 secs
lola: 86750938 markings, 173230766 edges, 295476 markings/sec, 255 secs
lola: 88221636 markings, 176175979 edges, 294140 markings/sec, 260 secs
lola: 89316630 markings, 178361488 edges, 218999 markings/sec, 265 secs
lola: 90697416 markings, 181124406 edges, 276157 markings/sec, 270 secs
lola: 91435361 markings, 182602843 edges, 147589 markings/sec, 275 secs
lola: 92824919 markings, 185373874 edges, 277912 markings/sec, 280 secs
lola: 93826685 markings, 187378200 edges, 200353 markings/sec, 285 secs
lola: 94554522 markings, 188840204 edges, 145567 markings/sec, 290 secs
lola: 95351713 markings, 190433796 edges, 159438 markings/sec, 295 secs
lola: 96203776 markings, 192129871 edges, 170413 markings/sec, 300 secs
lola: 96203776 markings, 192129871 edges, 0 markings/sec, 305 secs
lola: 96273893 markings, 192277116 edges, 14023 markings/sec, 310 secs
lola: 97665822 markings, 195060728 edges, 278386 markings/sec, 315 secs
lola: 97690458 markings, 195108913 edges, 4927 markings/sec, 320 secs
lola: 97690458 markings, 195108913 edges, 0 markings/sec, 325 secs
lola: 98777302 markings, 197283822 edges, 217369 markings/sec, 330 secs
lola: 99416202 markings, 198558562 edges, 127780 markings/sec, 335 secs
lola: 99583539 markings, 198889688 edges, 33467 markings/sec, 340 secs
lola: 100950393 markings, 201630115 edges, 273371 markings/sec, 345 secs
lola: 100954931 markings, 201635673 edges, 908 markings/sec, 350 secs
lola: 101126394 markings, 201977408 edges, 34293 markings/sec, 355 secs
lola: 102496827 markings, 204718098 edges, 274087 markings/sec, 360 secs
lola: 102554624 markings, 204830806 edges, 11559 markings/sec, 365 secs
lola: 102919927 markings, 205562251 edges, 73061 markings/sec, 370 secs
lola: 104081423 markings, 207888330 edges, 232299 markings/sec, 375 secs
lola: 105432437 markings, 210591935 edges, 270203 markings/sec, 380 secs
lola: 105794032 markings, 211307181 edges, 72319 markings/sec, 385 secs
lola: 107147157 markings, 214017340 edges, 270625 markings/sec, 390 secs
lola: 108552327 markings, 216831491 edges, 281034 markings/sec, 395 secs
lola: 109590546 markings, 218902951 edges, 207644 markings/sec, 400 secs
lola: 110808382 markings, 221340080 edges, 243567 markings/sec, 405 secs
lola: 111980394 markings, 223677321 edges, 234402 markings/sec, 410 secs
lola: 112374799 markings, 224473482 edges, 78881 markings/sec, 415 secs
lola: 112374896 markings, 224473578 edges, 19 markings/sec, 420 secs
lola: 112374959 markings, 224473641 edges, 13 markings/sec, 425 secs
lola: 112375019 markings, 224473702 edges, 12 markings/sec, 430 secs
lola: 112375098 markings, 224473781 edges, 16 markings/sec, 435 secs
lola: 112375161 markings, 224473843 edges, 13 markings/sec, 440 secs
lola: 112375219 markings, 224473902 edges, 12 markings/sec, 445 secs
lola: 112375320 markings, 224474003 edges, 20 markings/sec, 450 secs
lola: 112375370 markings, 224474053 edges, 10 markings/sec, 455 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X ((G ((X (X (G ((p15 <= 0)))) AND (p1 <= 0))) R ((1 <= p5) OR (p15 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((X (X (G ((p15 <= 0)))) AND (p1 <= 0))) R ((1 <= p5) OR (p15 <= 0))))
lola: processed formula length: 77
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3334784 markings, 7476247 edges, 666957 markings/sec, 0 secs
lola: 6528611 markings, 14784619 edges, 638765 markings/sec, 5 secs
lola: 9742985 markings, 22139948 edges, 642875 markings/sec, 10 secs
lola: 12319706 markings, 27599244 edges, 515344 markings/sec, 15 secs
lola: 14722458 markings, 32397933 edges, 480550 markings/sec, 20 secs
lola: 16906729 markings, 36763499 edges, 436854 markings/sec, 25 secs
lola: 18977093 markings, 40901640 edges, 414073 markings/sec, 30 secs
lola: 20943622 markings, 44832094 edges, 393306 markings/sec, 35 secs
lola: 22851788 markings, 48648273 edges, 381633 markings/sec, 40 secs
lola: 24652210 markings, 52244466 edges, 360084 markings/sec, 45 secs
lola: 26339743 markings, 55620325 edges, 337507 markings/sec, 50 secs
lola: 27995499 markings, 58929508 edges, 331151 markings/sec, 55 secs
lola: 29640766 markings, 62220098 edges, 329053 markings/sec, 60 secs
lola: 31284940 markings, 65503612 edges, 328835 markings/sec, 65 secs
lola: 32936150 markings, 68807072 edges, 330242 markings/sec, 70 secs
lola: 34579760 markings, 72094001 edges, 328722 markings/sec, 75 secs
lola: 36208338 markings, 75349246 edges, 325716 markings/sec, 80 secs
lola: 37811611 markings, 78552881 edges, 320655 markings/sec, 85 secs
lola: 39409142 markings, 81747227 edges, 319506 markings/sec, 90 secs
lola: 40992792 markings, 84914342 edges, 316730 markings/sec, 95 secs
lola: 42562109 markings, 88053173 edges, 313863 markings/sec, 100 secs
lola: 44113474 markings, 91154587 edges, 310273 markings/sec, 105 secs
lola: 45660534 markings, 94247243 edges, 309412 markings/sec, 110 secs
lola: 47195979 markings, 97316295 edges, 307089 markings/sec, 115 secs
lola: 48708021 markings, 100340155 edges, 302408 markings/sec, 120 secs
lola: 50214558 markings, 103350825 edges, 301307 markings/sec, 125 secs
lola: 51733010 markings, 106389527 edges, 303690 markings/sec, 130 secs
lola: 53242063 markings, 109404652 edges, 301811 markings/sec, 135 secs
lola: 54744609 markings, 112411543 edges, 300509 markings/sec, 140 secs
lola: 56244727 markings, 115408225 edges, 300024 markings/sec, 145 secs
lola: 57744381 markings, 118404808 edges, 299931 markings/sec, 150 secs
lola: 59244555 markings, 121406722 edges, 300035 markings/sec, 155 secs
lola: 60736526 markings, 124389095 edges, 298394 markings/sec, 160 secs
lola: 62225914 markings, 127370059 edges, 297878 markings/sec, 165 secs
lola: 63715039 markings, 130343213 edges, 297825 markings/sec, 170 secs
lola: 65195819 markings, 133304131 edges, 296156 markings/sec, 175 secs
lola: 66676448 markings, 136265439 edges, 296126 markings/sec, 180 secs
lola: 68147165 markings, 139209099 edges, 294143 markings/sec, 185 secs
lola: 69617851 markings, 142147241 edges, 294137 markings/sec, 190 secs
lola: 71080462 markings, 145071658 edges, 292522 markings/sec, 195 secs
lola: 72543078 markings, 147999628 edges, 292523 markings/sec, 200 secs
lola: 74002403 markings, 150917153 edges, 291865 markings/sec, 205 secs
lola: 75471888 markings, 153851885 edges, 293897 markings/sec, 210 secs
lola: 76926049 markings, 156759062 edges, 290832 markings/sec, 215 secs
lola: 78383343 markings, 159675333 edges, 291459 markings/sec, 220 secs
lola: 79841878 markings, 162592028 edges, 291707 markings/sec, 225 secs
lola: 81298552 markings, 165505517 edges, 291335 markings/sec, 230 secs
lola: 82754433 markings, 168416345 edges, 291176 markings/sec, 235 secs
lola: 84209551 markings, 171324029 edges, 291024 markings/sec, 240 secs
lola: 85655548 markings, 174219997 edges, 289199 markings/sec, 245 secs
lola: 87047515 markings, 177002476 edges, 278393 markings/sec, 250 secs
lola: 88339594 markings, 179580770 edges, 258416 markings/sec, 255 secs
lola: 89167319 markings, 181239869 edges, 165545 markings/sec, 260 secs
lola: 90187755 markings, 183274847 edges, 204087 markings/sec, 265 secs
lola: 91151515 markings, 185205748 edges, 192752 markings/sec, 270 secs
lola: 91959928 markings, 186824566 edges, 161683 markings/sec, 275 secs
lola: 93019261 markings, 188936253 edges, 211867 markings/sec, 280 secs
lola: 94106127 markings, 191115061 edges, 217373 markings/sec, 285 secs
lola: 95327331 markings, 193553154 edges, 244241 markings/sec, 290 secs
lola: 96401470 markings, 195702802 edges, 214828 markings/sec, 295 secs
lola: 97696180 markings, 198291009 edges, 258942 markings/sec, 300 secs
lola: 98887718 markings, 200676176 edges, 238308 markings/sec, 305 secs
lola: 100003599 markings, 202909958 edges, 223176 markings/sec, 310 secs
lola: 101336572 markings, 205573505 edges, 266595 markings/sec, 315 secs
lola: 102315530 markings, 207527328 edges, 195792 markings/sec, 320 secs
lola: 103181999 markings, 209258292 edges, 173294 markings/sec, 325 secs
lola: 104132545 markings, 211159531 edges, 190109 markings/sec, 330 secs
lola: 104942019 markings, 212778888 edges, 161895 markings/sec, 335 secs
lola: 105723701 markings, 214339691 edges, 156336 markings/sec, 340 secs
lola: 106875942 markings, 216646974 edges, 230448 markings/sec, 345 secs
lola: 107765307 markings, 218421984 edges, 177873 markings/sec, 350 secs
lola: 107839202 markings, 218574800 edges, 14779 markings/sec, 355 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((((1 <= p2) OR (1 <= p1)) U (((p4 <= 0) R (p1 <= 0)) R ((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)))) U (F (((1 <= p3) AND (1 <= p9) AND (1 <= p14))) OR (1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p2) OR (1 <= p1)) U (((p4 <= 0) R (p1 <= 0)) R ((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)))) U (F (((1 <= p3) AND (1 <= p9) AND (1 <= p14))) OR (1 <= p2)))
lola: processed formula length: 162
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 2266769 markings, 8187213 edges, 453354 markings/sec, 0 secs
lola: 4245165 markings, 16157886 edges, 395679 markings/sec, 5 secs
lola: 6213090 markings, 23932043 edges, 393585 markings/sec, 10 secs
lola: 8118735 markings, 31575231 edges, 381129 markings/sec, 15 secs
lola: 10034585 markings, 39180640 edges, 383170 markings/sec, 20 secs
lola: 11922699 markings, 46748957 edges, 377623 markings/sec, 25 secs
lola: 13804434 markings, 54234968 edges, 376347 markings/sec, 30 secs
lola: 15681192 markings, 61703552 edges, 375352 markings/sec, 35 secs
lola: 17549707 markings, 69143279 edges, 373703 markings/sec, 40 secs
lola: 19398967 markings, 76514871 edges, 369852 markings/sec, 45 secs
lola: 21213405 markings, 83826067 edges, 362888 markings/sec, 50 secs
lola: 23049092 markings, 91150905 edges, 367137 markings/sec, 55 secs
lola: 24896382 markings, 98516362 edges, 369458 markings/sec, 60 secs
lola: 26736150 markings, 105855482 edges, 367954 markings/sec, 65 secs
lola: 28532830 markings, 113043785 edges, 359336 markings/sec, 70 secs
lola: 30354085 markings, 120258126 edges, 364251 markings/sec, 75 secs
lola: 32183085 markings, 127559556 edges, 365800 markings/sec, 80 secs
lola: 33957389 markings, 134669546 edges, 354861 markings/sec, 85 secs
lola: 35758049 markings, 141871797 edges, 360132 markings/sec, 90 secs
lola: 37573960 markings, 149127419 edges, 363182 markings/sec, 95 secs
lola: 39336591 markings, 156136552 edges, 352526 markings/sec, 100 secs
lola: 41146207 markings, 163370152 edges, 361923 markings/sec, 105 secs
lola: 42894360 markings, 170388606 edges, 349631 markings/sec, 110 secs
lola: 44702492 markings, 177557025 edges, 361626 markings/sec, 115 secs
lola: 46459686 markings, 184607126 edges, 351439 markings/sec, 120 secs
lola: 48241242 markings, 191688518 edges, 356311 markings/sec, 125 secs
lola: 50012493 markings, 198781812 edges, 354250 markings/sec, 130 secs
lola: 51761337 markings, 205789731 edges, 349769 markings/sec, 135 secs
lola: 53541272 markings, 212872416 edges, 355987 markings/sec, 140 secs
lola: 55281436 markings, 219849204 edges, 348033 markings/sec, 145 secs
lola: 57045241 markings, 226876172 edges, 352761 markings/sec, 150 secs
lola: 58801538 markings, 233903388 edges, 351259 markings/sec, 155 secs
lola: 60535717 markings, 240832712 edges, 346836 markings/sec, 160 secs
lola: 62321645 markings, 247940348 edges, 357186 markings/sec, 165 secs
lola: 64027537 markings, 254793955 edges, 341178 markings/sec, 170 secs
lola: 65832697 markings, 261951973 edges, 361032 markings/sec, 175 secs
lola: 67521749 markings, 268758671 edges, 337810 markings/sec, 180 secs
lola: 69330393 markings, 275933779 edges, 361729 markings/sec, 185 secs
lola: 71034892 markings, 282739453 edges, 340900 markings/sec, 190 secs
lola: 72765695 markings, 289697186 edges, 346161 markings/sec, 195 secs
lola: 74531578 markings, 296717729 edges, 353177 markings/sec, 200 secs
lola: 76232027 markings, 303509223 edges, 340090 markings/sec, 205 secs
lola: 78020963 markings, 310670454 edges, 357787 markings/sec, 210 secs
lola: 80082954 markings, 318907339 edges, 412398 markings/sec, 215 secs
lola: 81857483 markings, 326018136 edges, 354906 markings/sec, 220 secs
lola: 83561194 markings, 332821055 edges, 340742 markings/sec, 225 secs
lola: 85259053 markings, 339603483 edges, 339572 markings/sec, 230 secs
lola: 87042355 markings, 346720814 edges, 356660 markings/sec, 235 secs
lola: 88722348 markings, 353413293 edges, 335999 markings/sec, 240 secs
lola: 90450780 markings, 360354340 edges, 345686 markings/sec, 245 secs
lola: 92197394 markings, 367307449 edges, 349323 markings/sec, 250 secs
lola: 94762472 markings, 377565443 edges, 513016 markings/sec, 255 secs
lola: 96525890 markings, 384617030 edges, 352684 markings/sec, 260 secs
lola: 98785001 markings, 393663806 edges, 451822 markings/sec, 265 secs
lola: 100565613 markings, 400735919 edges, 356122 markings/sec, 270 secs
lola: 102245948 markings, 407457021 edges, 336067 markings/sec, 275 secs
lola: 103916455 markings, 414143713 edges, 334101 markings/sec, 280 secs
lola: 105682899 markings, 421220054 edges, 353289 markings/sec, 285 secs
lola: 107362892 markings, 427903687 edges, 335999 markings/sec, 290 secs
lola: 109037292 markings, 434586458 edges, 334880 markings/sec, 295 secs
lola: 110795929 markings, 441641649 edges, 351727 markings/sec, 300 secs
lola: 112466550 markings, 448328747 edges, 334124 markings/sec, 305 secs
lola: 114126923 markings, 454979985 edges, 332075 markings/sec, 310 secs
lola: 115899995 markings, 462025699 edges, 354614 markings/sec, 315 secs
lola: 117568358 markings, 468704891 edges, 333673 markings/sec, 320 secs
lola: 119203177 markings, 475224260 edges, 326964 markings/sec, 325 secs
lola: 120365637 markings, 479875380 edges, 232492 markings/sec, 330 secs
lola: 121650960 markings, 485033870 edges, 257065 markings/sec, 335 secs
lola: 122997814 markings, 490407792 edges, 269371 markings/sec, 340 secs
lola: 124156631 markings, 495003605 edges, 231763 markings/sec, 345 secs
lola: 125433549 markings, 500132760 edges, 255384 markings/sec, 350 secs
lola: 126659861 markings, 505024846 edges, 245262 markings/sec, 355 secs
lola: 127967826 markings, 510262664 edges, 261593 markings/sec, 360 secs
lola: 129377316 markings, 515915819 edges, 281898 markings/sec, 365 secs
lola: 130883570 markings, 521907642 edges, 301251 markings/sec, 370 secs
lola: 132228786 markings, 527275881 edges, 269043 markings/sec, 375 secs
lola: 133642265 markings, 532942987 edges, 282696 markings/sec, 380 secs
lola: 134970178 markings, 538250623 edges, 265583 markings/sec, 385 secs
lola: 136287768 markings, 543522143 edges, 263518 markings/sec, 390 secs
lola: 137677406 markings, 549022652 edges, 277928 markings/sec, 395 secs
lola: 139043812 markings, 554517927 edges, 273281 markings/sec, 400 secs
lola: 140626582 markings, 560867843 edges, 316554 markings/sec, 405 secs
lola: 141923800 markings, 566047374 edges, 259444 markings/sec, 410 secs
lola: 143396938 markings, 571880481 edges, 294628 markings/sec, 415 secs
lola: 144723978 markings, 577236390 edges, 265408 markings/sec, 420 secs
lola: 146129706 markings, 582828576 edges, 281146 markings/sec, 425 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)) AND ((F (((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0))) OR G (((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)))) AND G ((p1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p3 <= 0) OR (p9 <= 0) OR (p14 <= 0)))
lola: processed formula length: 44
lola: 110 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: 160006 markings, 200006 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((p1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p1 <= 0))
lola: processed formula length: 13
lola: 110 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no no no unknown no no no no unknown no no no no
lola: ========================================
lola:
preliminary result: unknown no no no unknown no no no no unknown no no no no
lola: memory consumption: 3728 KB
lola: time consumption: 2325 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="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is 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 r132-tall-162075428500286"
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 ;