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.r151-tall-162089151400302.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 Peterson-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151400302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 79K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 360K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 257K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.4K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 100K 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 Peterson-PT-2-00
FORMULA_NAME Peterson-PT-2-01
FORMULA_NAME Peterson-PT-2-02
FORMULA_NAME Peterson-PT-2-03
FORMULA_NAME Peterson-PT-2-04
FORMULA_NAME Peterson-PT-2-05
FORMULA_NAME Peterson-PT-2-06
FORMULA_NAME Peterson-PT-2-07
FORMULA_NAME Peterson-PT-2-08
FORMULA_NAME Peterson-PT-2-09
FORMULA_NAME Peterson-PT-2-10
FORMULA_NAME Peterson-PT-2-11
FORMULA_NAME Peterson-PT-2-12
FORMULA_NAME Peterson-PT-2-13
FORMULA_NAME Peterson-PT-2-14
FORMULA_NAME Peterson-PT-2-15

=== Now, execution of the tool begins

BK_START 1621024554006

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 20:35:55] [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-14 20:35:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 20:35:55] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2021-05-14 20:35:55] [INFO ] Transformed 102 places.
[2021-05-14 20:35:55] [INFO ] Transformed 126 transitions.
[2021-05-14 20:35:55] [INFO ] Found NUPN structural information;
[2021-05-14 20:35:55] [INFO ] Parsed PT model containing 102 places and 126 transitions in 92 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 393 ms. (steps per millisecond=254 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]
[2021-05-14 20:35:56] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-14 20:35:56] [INFO ] Computed 11 place invariants in 5 ms
[2021-05-14 20:35:56] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned unsat
[2021-05-14 20:35:56] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-14 20:35:56] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 20:35:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:35:56] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2021-05-14 20:35:56] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 20:35:56] [INFO ] [Real]Added 26 Read/Feed constraints in 8 ms returned sat
[2021-05-14 20:35:56] [INFO ] Deduced a trap composed of 13 places in 68 ms
[2021-05-14 20:35:56] [INFO ] Deduced a trap composed of 45 places in 49 ms
[2021-05-14 20:35:56] [INFO ] Deduced a trap composed of 25 places in 50 ms
[2021-05-14 20:35:56] [INFO ] Deduced a trap composed of 34 places in 45 ms
[2021-05-14 20:35:56] [INFO ] Deduced a trap composed of 15 places in 38 ms
[2021-05-14 20:35:56] [INFO ] Deduced a trap composed of 42 places in 32 ms
[2021-05-14 20:35:56] [INFO ] Deduced a trap composed of 50 places in 35 ms
[2021-05-14 20:35:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 379 ms
[2021-05-14 20:35:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:35:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2021-05-14 20:35:56] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:35:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:35:56] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2021-05-14 20:35:56] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2021-05-14 20:35:56] [INFO ] Deduced a trap composed of 12 places in 41 ms
[2021-05-14 20:35:57] [INFO ] Deduced a trap composed of 8 places in 39 ms
[2021-05-14 20:35:57] [INFO ] Deduced a trap composed of 8 places in 35 ms
[2021-05-14 20:35:57] [INFO ] Deduced a trap composed of 13 places in 32 ms
[2021-05-14 20:35:57] [INFO ] Deduced a trap composed of 29 places in 40 ms
[2021-05-14 20:35:57] [INFO ] Deduced a trap composed of 50 places in 28 ms
[2021-05-14 20:35:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 271 ms
[2021-05-14 20:35:57] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 10 ms.
[2021-05-14 20:35:57] [INFO ] Added : 108 causal constraints over 22 iterations in 216 ms. Result :sat
[2021-05-14 20:35:57] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 20:35:57] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:35:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:35:57] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2021-05-14 20:35:57] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2021-05-14 20:35:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:35:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-14 20:35:57] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 20:35:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:35:57] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2021-05-14 20:35:57] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2021-05-14 20:35:57] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 10 ms.
[2021-05-14 20:35:57] [INFO ] Added : 117 causal constraints over 24 iterations in 194 ms. Result :sat
[2021-05-14 20:35:57] [INFO ] Deduced a trap composed of 11 places in 38 ms
[2021-05-14 20:35:57] [INFO ] Deduced a trap composed of 8 places in 29 ms
[2021-05-14 20:35:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2021-05-14 20:35:57] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 20:35:57] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 20:35:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:35:57] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-14 20:35:57] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:35:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:35:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-14 20:35:57] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:35:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:35:58] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2021-05-14 20:35:58] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:35:58] [INFO ] Deduced a trap composed of 8 places in 31 ms
[2021-05-14 20:35:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2021-05-14 20:35:58] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 10 ms.
[2021-05-14 20:35:58] [INFO ] Added : 117 causal constraints over 24 iterations in 185 ms. Result :sat
[2021-05-14 20:35:58] [INFO ] Deduced a trap composed of 12 places in 22 ms
[2021-05-14 20:35:58] [INFO ] Deduced a trap composed of 12 places in 25 ms
[2021-05-14 20:35:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2021-05-14 20:35:58] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 20:35:58] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:35:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:35:58] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-14 20:35:58] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 20:35:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:35:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2021-05-14 20:35:58] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:35:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:35:58] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2021-05-14 20:35:58] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:35:58] [INFO ] Deduced a trap composed of 29 places in 22 ms
[2021-05-14 20:35:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2021-05-14 20:35:58] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2021-05-14 20:35:58] [INFO ] Added : 117 causal constraints over 24 iterations in 178 ms. Result :sat
[2021-05-14 20:35:58] [INFO ] Deduced a trap composed of 11 places in 36 ms
[2021-05-14 20:35:58] [INFO ] Deduced a trap composed of 29 places in 20 ms
[2021-05-14 20:35:58] [INFO ] Deduced a trap composed of 8 places in 25 ms
[2021-05-14 20:35:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 119 ms
[2021-05-14 20:35:58] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned sat
[2021-05-14 20:35:58] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:35:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:35:58] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-14 20:35:58] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:35:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:35:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-14 20:35:58] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 20:35:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:35:58] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2021-05-14 20:35:58] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:35:59] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2021-05-14 20:35:59] [INFO ] Added : 116 causal constraints over 24 iterations in 173 ms. Result :sat
[2021-05-14 20:35:59] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 20:35:59] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:35:59] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-14 20:35:59] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 20:35:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:35:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-14 20:35:59] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 20:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:35:59] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2021-05-14 20:35:59] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:35:59] [INFO ] Deduced a trap composed of 8 places in 31 ms
[2021-05-14 20:35:59] [INFO ] Deduced a trap composed of 8 places in 30 ms
[2021-05-14 20:35:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2021-05-14 20:35:59] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 18 ms.
[2021-05-14 20:35:59] [INFO ] Added : 116 causal constraints over 24 iterations in 213 ms. Result :sat
[2021-05-14 20:35:59] [INFO ] Deduced a trap composed of 25 places in 23 ms
[2021-05-14 20:35:59] [INFO ] Deduced a trap composed of 26 places in 23 ms
[2021-05-14 20:35:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 70 ms
[2021-05-14 20:35:59] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-14 20:35:59] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:35:59] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-14 20:35:59] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:35:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:35:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-14 20:35:59] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:35:59] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2021-05-14 20:35:59] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:35:59] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2021-05-14 20:36:00] [INFO ] Added : 117 causal constraints over 24 iterations in 173 ms. Result :sat
[2021-05-14 20:36:00] [INFO ] Deduced a trap composed of 29 places in 20 ms
[2021-05-14 20:36:00] [INFO ] Deduced a trap composed of 29 places in 17 ms
[2021-05-14 20:36:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 57 ms
[2021-05-14 20:36:00] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 20:36:00] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 20:36:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:00] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2021-05-14 20:36:00] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:36:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-14 20:36:00] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:00] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2021-05-14 20:36:00] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:00] [INFO ] Deduced a trap composed of 8 places in 27 ms
[2021-05-14 20:36:00] [INFO ] Deduced a trap composed of 15 places in 29 ms
[2021-05-14 20:36:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 68 ms
[2021-05-14 20:36:00] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2021-05-14 20:36:00] [INFO ] Added : 117 causal constraints over 24 iterations in 174 ms. Result :sat
[2021-05-14 20:36:00] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 20:36:00] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:00] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-14 20:36:00] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:36:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2021-05-14 20:36:00] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:00] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2021-05-14 20:36:00] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:00] [INFO ] Deduced a trap composed of 11 places in 19 ms
[2021-05-14 20:36:00] [INFO ] Deduced a trap composed of 16 places in 12 ms
[2021-05-14 20:36:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 44 ms
[2021-05-14 20:36:00] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2021-05-14 20:36:00] [INFO ] Added : 114 causal constraints over 24 iterations in 172 ms. Result :sat
[2021-05-14 20:36:00] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 20:36:00] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:00] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-14 20:36:00] [INFO ] [Real]Added 26 Read/Feed constraints in 30 ms returned sat
[2021-05-14 20:36:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:36:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-14 20:36:00] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:01] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2021-05-14 20:36:01] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:01] [INFO ] Deduced a trap composed of 29 places in 25 ms
[2021-05-14 20:36:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2021-05-14 20:36:01] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2021-05-14 20:36:01] [INFO ] Added : 114 causal constraints over 23 iterations in 165 ms. Result :sat
[2021-05-14 20:36:01] [INFO ] Deduced a trap composed of 29 places in 22 ms
[2021-05-14 20:36:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2021-05-14 20:36:01] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 20:36:01] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 20:36:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:01] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-14 20:36:01] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:36:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-14 20:36:01] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:01] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2021-05-14 20:36:01] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 20:36:01] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 8 ms.
[2021-05-14 20:36:01] [INFO ] Added : 114 causal constraints over 24 iterations in 177 ms. Result :sat
[2021-05-14 20:36:01] [INFO ] Deduced a trap composed of 12 places in 31 ms
[2021-05-14 20:36:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2021-05-14 20:36:01] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 20:36:01] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:01] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-14 20:36:01] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:36:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-14 20:36:01] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:01] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2021-05-14 20:36:01] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:01] [INFO ] Deduced a trap composed of 12 places in 33 ms
[2021-05-14 20:36:01] [INFO ] Deduced a trap composed of 8 places in 25 ms
[2021-05-14 20:36:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 69 ms
[2021-05-14 20:36:01] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2021-05-14 20:36:02] [INFO ] Added : 117 causal constraints over 24 iterations in 173 ms. Result :sat
[2021-05-14 20:36:02] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 20:36:02] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:02] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-14 20:36:02] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:02] [INFO ] Deduced a trap composed of 8 places in 15 ms
[2021-05-14 20:36:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2021-05-14 20:36:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:36:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-14 20:36:02] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:02] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2021-05-14 20:36:02] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:02] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2021-05-14 20:36:02] [INFO ] Added : 115 causal constraints over 24 iterations in 171 ms. Result :sat
[2021-05-14 20:36:02] [INFO ] Deduced a trap composed of 8 places in 30 ms
[2021-05-14 20:36:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2021-05-14 20:36:02] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 20:36:02] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 20:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:02] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-14 20:36:02] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:36:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2021-05-14 20:36:02] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:02] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2021-05-14 20:36:02] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 20:36:02] [INFO ] Deduced a trap composed of 12 places in 20 ms
[2021-05-14 20:36:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2021-05-14 20:36:02] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2021-05-14 20:36:02] [INFO ] Added : 105 causal constraints over 22 iterations in 158 ms. Result :sat
[2021-05-14 20:36:02] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 20:36:02] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:02] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-14 20:36:02] [INFO ] [Real]Added 26 Read/Feed constraints in 2 ms returned sat
[2021-05-14 20:36:02] [INFO ] Deduced a trap composed of 13 places in 23 ms
[2021-05-14 20:36:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2021-05-14 20:36:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:36:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2021-05-14 20:36:02] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:02] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2021-05-14 20:36:02] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:02] [INFO ] Deduced a trap composed of 13 places in 22 ms
[2021-05-14 20:36:03] [INFO ] Deduced a trap composed of 12 places in 23 ms
[2021-05-14 20:36:03] [INFO ] Deduced a trap composed of 8 places in 27 ms
[2021-05-14 20:36:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 87 ms
[2021-05-14 20:36:03] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 10 ms.
[2021-05-14 20:36:03] [INFO ] Added : 110 causal constraints over 23 iterations in 162 ms. Result :sat
[2021-05-14 20:36:03] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 20:36:03] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:03] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-14 20:36:03] [INFO ] [Real]Added 26 Read/Feed constraints in 2 ms returned sat
[2021-05-14 20:36:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:36:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2021-05-14 20:36:03] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 20:36:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:03] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2021-05-14 20:36:03] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:03] [INFO ] Deduced a trap composed of 8 places in 28 ms
[2021-05-14 20:36:03] [INFO ] Deduced a trap composed of 12 places in 39 ms
[2021-05-14 20:36:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2021-05-14 20:36:03] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 9 ms.
[2021-05-14 20:36:03] [INFO ] Added : 102 causal constraints over 21 iterations in 152 ms. Result :sat
[2021-05-14 20:36:03] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 20:36:03] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:03] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-14 20:36:03] [INFO ] [Real]Added 26 Read/Feed constraints in 2 ms returned sat
[2021-05-14 20:36:03] [INFO ] Deduced a trap composed of 12 places in 24 ms
[2021-05-14 20:36:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2021-05-14 20:36:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:36:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-14 20:36:03] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 20:36:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:03] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2021-05-14 20:36:03] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 20:36:03] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2021-05-14 20:36:03] [INFO ] Added : 112 causal constraints over 23 iterations in 162 ms. Result :sat
[2021-05-14 20:36:03] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 20:36:03] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:04] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-14 20:36:04] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:36:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-14 20:36:04] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:04] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-14 20:36:04] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 20:36:04] [INFO ] Deduced a trap composed of 29 places in 25 ms
[2021-05-14 20:36:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2021-05-14 20:36:04] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2021-05-14 20:36:04] [INFO ] Added : 117 causal constraints over 24 iterations in 172 ms. Result :sat
[2021-05-14 20:36:04] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 20:36:04] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 20:36:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:04] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-14 20:36:04] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 20:36:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:36:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-14 20:36:04] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:04] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2021-05-14 20:36:04] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:04] [INFO ] Deduced a trap composed of 8 places in 43 ms
[2021-05-14 20:36:04] [INFO ] Deduced a trap composed of 8 places in 28 ms
[2021-05-14 20:36:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 83 ms
[2021-05-14 20:36:04] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2021-05-14 20:36:04] [INFO ] Added : 109 causal constraints over 22 iterations in 160 ms. Result :sat
[2021-05-14 20:36:04] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 20:36:04] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:04] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-14 20:36:04] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:36:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-14 20:36:04] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:04] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2021-05-14 20:36:04] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:04] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2021-05-14 20:36:05] [INFO ] Added : 110 causal constraints over 22 iterations in 156 ms. Result :sat
[2021-05-14 20:36:05] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 20:36:05] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 20:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:05] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-14 20:36:05] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:36:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2021-05-14 20:36:05] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 20:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:05] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2021-05-14 20:36:05] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:05] [INFO ] Deduced a trap composed of 12 places in 26 ms
[2021-05-14 20:36:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2021-05-14 20:36:05] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2021-05-14 20:36:05] [INFO ] Added : 117 causal constraints over 24 iterations in 166 ms. Result :sat
[2021-05-14 20:36:05] [INFO ] Deduced a trap composed of 29 places in 18 ms
[2021-05-14 20:36:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2021-05-14 20:36:05] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 20:36:05] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:05] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-14 20:36:05] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:36:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2021-05-14 20:36:05] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:05] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2021-05-14 20:36:05] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:05] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2021-05-14 20:36:05] [INFO ] Added : 110 causal constraints over 22 iterations in 153 ms. Result :sat
[2021-05-14 20:36:05] [INFO ] Deduced a trap composed of 8 places in 28 ms
[2021-05-14 20:36:05] [INFO ] Deduced a trap composed of 29 places in 18 ms
[2021-05-14 20:36:05] [INFO ] Deduced a trap composed of 29 places in 18 ms
[2021-05-14 20:36:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 94 ms
[2021-05-14 20:36:05] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 20:36:05] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:05] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-14 20:36:05] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:36:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-14 20:36:05] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:05] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2021-05-14 20:36:05] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:05] [INFO ] Deduced a trap composed of 8 places in 34 ms
[2021-05-14 20:36:06] [INFO ] Deduced a trap composed of 29 places in 25 ms
[2021-05-14 20:36:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2021-05-14 20:36:06] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 8 ms.
[2021-05-14 20:36:06] [INFO ] Added : 117 causal constraints over 24 iterations in 198 ms. Result :sat
[2021-05-14 20:36:06] [INFO ] Deduced a trap composed of 12 places in 31 ms
[2021-05-14 20:36:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2021-05-14 20:36:06] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 20:36:06] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 20:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:06] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-14 20:36:06] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:36:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-14 20:36:06] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:06] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-14 20:36:06] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:06] [INFO ] Deduced a trap composed of 8 places in 37 ms
[2021-05-14 20:36:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2021-05-14 20:36:06] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2021-05-14 20:36:06] [INFO ] Added : 117 causal constraints over 24 iterations in 186 ms. Result :sat
[2021-05-14 20:36:06] [INFO ] Deduced a trap composed of 11 places in 23 ms
[2021-05-14 20:36:06] [INFO ] Deduced a trap composed of 8 places in 21 ms
[2021-05-14 20:36:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 67 ms
[2021-05-14 20:36:06] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 20:36:06] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:06] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-14 20:36:06] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 20:36:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:36:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-14 20:36:06] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 20:36:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:06] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2021-05-14 20:36:06] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:06] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 8 ms.
[2021-05-14 20:36:07] [INFO ] Added : 114 causal constraints over 23 iterations in 184 ms. Result :sat
[2021-05-14 20:36:07] [INFO ] Deduced a trap composed of 29 places in 17 ms
[2021-05-14 20:36:07] [INFO ] Deduced a trap composed of 12 places in 33 ms
[2021-05-14 20:36:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
[2021-05-14 20:36:07] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 20:36:07] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 20:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:07] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2021-05-14 20:36:07] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:36:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-14 20:36:07] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 20:36:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:36:07] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2021-05-14 20:36:07] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 20:36:07] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2021-05-14 20:36:07] [INFO ] Added : 115 causal constraints over 23 iterations in 164 ms. Result :sat
[2021-05-14 20:36:07] [INFO ] Deduced a trap composed of 26 places in 20 ms
[2021-05-14 20:36:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-14 20:36:07] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-14 20:36:07] [INFO ] Flatten gal took : 59 ms
FORMULA Peterson-PT-2-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 20:36:07] [INFO ] Applying decomposition
[2021-05-14 20:36:07] [INFO ] Flatten gal took : 13 ms
[2021-05-14 20:36:07] [INFO ] Decomposing Gal with order
[2021-05-14 20:36:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 20:36:07] [INFO ] Removed a total of 57 redundant transitions.
[2021-05-14 20:36:07] [INFO ] Flatten gal took : 74 ms
[2021-05-14 20:36:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 4 ms.
[2021-05-14 20:36:07] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 16 ms.
[2021-05-14 20:36:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Peterson-PT-2 @ 3570 seconds

FORMULA Peterson-PT-2-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLFireability @ Peterson-PT-2

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 14 20:36:09 2021
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 30,
"adisj": 3,
"aneg": 0,
"comp": 54,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 54,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "F ((((((1 <= p42) AND (1 <= p60)) OR ((1 <= p44) AND (1 <= p52)) OR ((1 <= p42) AND (1 <= p58)) OR ((1 <= p42) AND (1 <= p59)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p41) AND (1 <= p55)) OR ((1 <= p41) AND (1 <= p54)) OR ((1 <= p42) AND (1 <= p53)) OR ((1 <= p44) AND (1 <= p45)) OR ((1 <= p44) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p51))) U (((1 <= p46) AND (1 <= p60)) OR ((1 <= p46) AND (1 <= p58)) OR ((1 <= p46) AND (1 <= p59)) OR ((1 <= p48) AND (1 <= p50)) OR ((1 <= p48) AND (1 <= p51)) OR ((1 <= p47) AND (1 <= p54)) OR ((1 <= p47) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p49)) OR ((1 <= p46) AND (1 <= p53)) OR ((1 <= p45) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p52)))) AND (((1 <= p80)) OR ((1 <= p83)) OR ((1 <= p69)) OR ((1 <= p73)) OR ((1 <= p72)) OR ((1 <= p62)))))",
"processed_size": 877,
"rewrites": 253
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 3,
"aconj": 24,
"adisj": 2,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X ((X (X (G ((((1 <= p81)) OR ((1 <= p64)) OR ((1 <= p82)) OR ((1 <= p84)) OR ((1 <= p71)) OR ((1 <= p70)) OR ((1 <= p75)) OR ((1 <= p74)) OR ((1 <= p77)) OR ((1 <= p76)) OR ((1 <= p63)) OR ((1 <= p78)))))) OR G ((((1 <= p81)) OR ((1 <= p64)) OR ((1 <= p82)) OR ((1 <= p84)) OR ((1 <= p71)) OR ((1 <= p70)) OR ((1 <= p75)) OR ((1 <= p74)) OR ((1 <= p77)) OR ((1 <= p76)) OR ((1 <= p63)) OR ((1 <= p78))))))",
"processed_size": 428,
"rewrites": 253
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 15,
"adisj": 1,
"aneg": 0,
"comp": 27,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 27,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "X (X (G ((((1 <= p17)) OR ((1 <= p19)) OR ((1 <= p20)) OR ((1 <= p66) AND (1 <= p89)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p65) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p79)) OR ((1 <= p68) AND (1 <= p90)) OR ((1 <= p65) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p92)) OR ((1 <= p57) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p91)) OR ((1 <= p68) AND (1 <= p86)) OR ((1 <= p67) AND (1 <= p86))))))",
"processed_size": 444,
"rewrites": 253
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 18,
"adisj": 2,
"aneg": 0,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "F ((X (G ((((1 <= p81)) OR ((1 <= p64)) OR ((1 <= p82)) OR ((1 <= p84)) OR ((1 <= p71)) OR ((1 <= p70)) OR ((1 <= p75)) OR ((1 <= p74)) OR ((1 <= p77)) OR ((1 <= p76)) OR ((1 <= p63)) OR ((1 <= p78))))) OR G ((((1 <= p80)) OR ((1 <= p83)) OR ((1 <= p69)) OR ((1 <= p73)) OR ((1 <= p72)) OR ((1 <= p62))))))",
"processed_size": 322,
"rewrites": 253
},
"result":
{
"edges": 22,
"markings": 22,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 7,
"aconj": 4,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X ((F (((p66 <= 0) OR (p89 <= 0))) AND X (F ((X (X (((1 <= p14)))) OR (G (((1 <= p73))) AND X (X (F (((1 <= p14))))))))))))",
"processed_size": 127,
"rewrites": 253
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((X (F (((G (((1 <= p38))) OR ((1 <= p19))) AND ((1 <= p38))))) AND ((1 <= p38)))))",
"processed_size": 88,
"rewrites": 253
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 3,
"aneg": 3,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (F (((G (((1 <= p46) AND (1 <= p87))) AND (((1 <= p66)) AND ((1 <= p91)))) R (((p22 <= 0)) AND ((p66 <= 0) OR (p91 <= 0))))))",
"processed_size": 128,
"rewrites": 253
},
"result":
{
"edges": 137,
"markings": 96,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 0,
"aconj": 79,
"adisj": 7,
"aneg": 3,
"comp": 153,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 153,
"taut": 0,
"tconj": 0,
"tdisj": 20,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "((G ((((((p89 <= 0) OR (p99 <= 0)) AND ((p89 <= 0) OR (p100 <= 0)) AND ((p79 <= 0) OR (p99 <= 0)) AND ((p79 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p96 <= 0)) AND ((p91 <= 0) OR (p97 <= 0)) AND ((p89 <= 0) OR (p97 <= 0)) AND ((p91 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p95 <= 0)) AND ((p91 <= 0) OR (p99 <= 0)) AND ((p86 <= 0) OR (p98 <= 0)) AND ((p90 <= 0) OR (p96 <= 0)) AND ((p90 <= 0) OR (p95 <= 0)) AND ((p90 <= 0) OR (p98 <= 0)) AND ((p92 <= 0) OR (p98 <= 0)) AND ((p92 <= 0) OR (p96 <= 0)) AND ((p92 <= 0) OR (p95 <= 0)) AND ((p79 <= 0) OR (p97 <= 0))) R (((p89 <= 0) OR (p99 <= 0)) AND ((p89 <= 0) OR (p100 <= 0)) AND ((p79 <= 0) OR (p99 <= 0)) AND ((p79 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p96 <= 0)) AND ((p91 <= 0) OR (p97 <= 0)) AND ((p89 <= 0) OR (p97 <= 0)) AND ((p91 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p95 <= 0)) AND ((p91 <= 0) OR (p99 <= 0)) AND ((p86 <= 0) OR (p98 <= 0)) AND ((p90 <= 0) OR (p96 <= 0)) AND ((p90 <= 0) OR (p95 <= 0)) AND ((p90 <= 0) OR (p98 <= 0)) AND ((p92 <= 0) OR (p98 <= 0)) AND ((p92 <= 0) OR (p96 <= 0)) AND ((p92 <= 0) OR (p95 <= 0)) AND ((p79 <= 0) OR (p97 <= 0)))) OR (((p89 <= 0) OR (p99 <= 0)) AND ((p89 <= 0) OR (p100 <= 0)) AND ((p79 <= 0) OR (p99 <= 0)) AND ((p79 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p96 <= 0)) AND ((p91 <= 0) OR (p97 <= 0)) AND ((p89 <= 0) OR (p97 <= 0)) AND ((p91 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p95 <= 0)) AND ((p91 <= 0) OR (p99 <= 0)) AND ((p86 <= 0) OR (p98 <= 0)) AND ((p90 <= 0) OR (p96 <= 0)) AND ((p90 <= 0) OR (p95 <= 0)) AND ((p90 <= 0) OR (p98 <= 0)) AND ((p92 <= 0) OR (p98 <= 0)) AND ((p92 <= 0) OR (p96 <= 0)) AND ((p92 <= 0) OR (p95 <= 0)) AND ((p79 <= 0) OR (p97 <= 0))))) OR (((p21 <= 0)) AND ((p22 <= 0)) AND ((p24 <= 0)))) U (G (F ((((1 <= p16)) OR ((1 <= p18)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15))))) OR (((1 <= p89) AND (1 <= p99)) OR (((1 <= p89) AND (1 <= p100)) OR (((1 <= p79) AND (1 <= p99)) OR (((1 <= p79) AND (1 <= p100)) OR (((1 <= p86) AND (1 <= p96)) OR (((1 <= p91) AND (1 <= p97)) OR (((1 <= p89) AND (1 <= p97)) OR (((1 <= p91) AND (1 <= p100)) OR (((1 <= p86) AND (1 <= p95)) OR (((1 <= p91) AND (1 <= p99)) OR (((1 <= p86) AND (1 <= p98)) OR (((1 <= p90) AND (1 <= p96)) OR (((1 <= p90) AND (1 <= p95)) OR (((1 <= p90) AND (1 <= p98)) OR (((1 <= p92) AND (1 <= p98)) OR (((1 <= p92) AND (1 <= p96)) OR (((1 <= p92) AND (1 <= p95)) OR ((1 <= p79) AND (1 <= p97)))))))))))))))))))))",
"processed_size": 2506,
"rewrites": 253
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 0,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "(((1 <= p42) AND (1 <= p60)) OR ((1 <= p44) AND (1 <= p52)) OR ((1 <= p42) AND (1 <= p58)) OR ((1 <= p42) AND (1 <= p59)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p41) AND (1 <= p55)) OR ((1 <= p41) AND (1 <= p54)) OR ((1 <= p42) AND (1 <= p53)) OR ((1 <= p44) AND (1 <= p45)) OR ((1 <= p44) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p51)))",
"processed_size": 370,
"rewrites": 274
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 0,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "(((1 <= p42) AND (1 <= p60)) OR ((1 <= p44) AND (1 <= p52)) OR ((1 <= p42) AND (1 <= p58)) OR ((1 <= p42) AND (1 <= p59)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p41) AND (1 <= p55)) OR ((1 <= p41) AND (1 <= p54)) OR ((1 <= p42) AND (1 <= p53)) OR ((1 <= p44) AND (1 <= p45)) OR ((1 <= p44) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p51)))",
"processed_size": 370,
"rewrites": 274
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 30,
"adisj": 2,
"aneg": 0,
"comp": 42,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 42,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "F (G ((F ((((1 <= p65) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p86)) OR ((1 <= p68) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p90)))) AND (((1 <= p65) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p86)) OR ((1 <= p68) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p90)) OR ((1 <= p32)) OR ((1 <= p33)) OR ((1 <= p34)) OR ((1 <= p35)) OR ((1 <= p37)) OR ((1 <= p36)) OR ((1 <= p39)) OR ((1 <= p38)) OR ((1 <= p40)) OR ((1 <= p43)) OR ((1 <= p23)) OR ((1 <= p25)) OR ((1 <= p26)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p29)) OR ((1 <= p30)) OR ((1 <= p31))))))",
"processed_size": 703,
"rewrites": 253
},
"result":
{
"edges": 24,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"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": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 143408,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(F(**))) : (X((X(X(G(**))) OR G(**))) OR F(((** U **) AND **))) : ((G(((* R *) OR *)) OR **) U (G(F(**)) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **))))))))))))))))))) : X(X(G(**))) : F((X(G(**)) OR G(**))) : (F(G((F(**) AND **))) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))))) : X(X((F(*) AND X(F((X(X(**)) OR (G(**) AND X(X(F(**)))))))))) : G(F((X(F(((G(**) OR **) AND **))) AND **))) : X(F(((G(**) AND (* AND *)) R *))) : X(G(((** U X(**)) AND **)))"
},
"net":
{
"arcs": 384,
"conflict_clusters": 65,
"places": 102,
"places_significant": 91,
"singleton_clusters": 0,
"transitions": 126
},
"result":
{
"preliminary_value": "no no yes no no no no no no no ",
"value": "no no yes no no no 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: 228/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 102
lola: finding significant places
lola: 102 places, 126 transitions, 91 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: F (X (X ((((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p24)))))) : (X ((X (G (X ((((1 <= p81)) OR ((1 <= p64)) OR ((1 <= p82)) OR ((1 <= p84)) OR ((1 <= p71)) OR ((1 <= p70)) OR ((1 <= p75)) OR ((1 <= p74)) OR ((1 <= p77)) OR ((1 <= p76)) OR ((1 <= p63)) OR ((1 <= p78)))))) OR G ((((1 <= p81)) OR ((1 <= p64)) OR ((1 <= p82)) OR ((1 <= p84)) OR ((1 <= p71)) OR ((1 <= p70)) OR ((1 <= p75)) OR ((1 <= p74)) OR ((1 <= p77)) OR ((1 <= p76)) OR ((1 <= p63)) OR ((1 <= p78)))))) OR F ((((((1 <= p42) AND (1 <= p60)) OR ((1 <= p44) AND (1 <= p52)) OR ((1 <= p42) AND (1 <= p58)) OR ((1 <= p42) AND (1 <= p59)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p41) AND (1 <= p55)) OR ((1 <= p41) AND (1 <= p54)) OR ((1 <= p42) AND (1 <= p53)) OR ((1 <= p44) AND (1 <= p45)) OR ((1 <= p44) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p51))) U (((1 <= p46) AND (1 <= p60)) OR ((1 <= p46) AND (1 <= p58)) OR ((1 <= p46) AND (1 <= p59)) OR ((1 <= p48) AND (1 <= p50)) OR ((1 <= p48) AND (1 <= p51)) OR ((1 <= p47) AND (1 <= p54)) OR ((1 <= p47) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p49)) OR ((1 <= p46) AND (1 <= p53)) OR ((1 <= p45) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p52)))) AND (((1 <= p80)) OR ((1 <= p83)) OR ((1 <= p69)) OR ((1 <= p73)) OR ((1 <= p72)) OR ((1 <= p62)))))) : ((NOT(F ((((((1 <= p89) AND (1 <= p99)) OR ((1 <= p89) AND (1 <= p100)) OR ((1 <= p79) AND (1 <= p99)) OR ((1 <= p79) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p96)) OR ((1 <= p91) AND (1 <= p97)) OR ((1 <= p89) AND (1 <= p97)) OR ((1 <= p91) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p95)) OR ((1 <= p91) AND (1 <= p99)) OR ((1 <= p86) AND (1 <= p98)) OR ((1 <= p90) AND (1 <= p96)) OR ((1 <= p90) AND (1 <= p95)) OR ((1 <= p90) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p96)) OR ((1 <= p92) AND (1 <= p95)) OR ((1 <= p79) AND (1 <= p97))) U (((1 <= p89) AND (1 <= p99)) OR ((1 <= p89) AND (1 <= p100)) OR ((1 <= p79) AND (1 <= p99)) OR ((1 <= p79) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p96)) OR ((1 <= p91) AND (1 <= p97)) OR ((1 <= p89) AND (1 <= p97)) OR ((1 <= p91) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p95)) OR ((1 <= p91) AND (1 <= p99)) OR ((1 <= p86) AND (1 <= p98)) OR ((1 <= p90) AND (1 <= p96)) OR ((1 <= p90) AND (1 <= p95)) OR ((1 <= p90) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p96)) OR ((1 <= p92) AND (1 <= p95)) OR ((1 <= p79) AND (1 <= p97)))) AND (((1 <= p89) AND (1 <= p99)) OR ((1 <= p89) AND (1 <= p100)) OR ((1 <= p79) AND (1 <= p99)) OR ((1 <= p79) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p96)) OR ((1 <= p91) AND (1 <= p97)) OR ((1 <= p89) AND (1 <= p97)) OR ((1 <= p91) AND (1 <= p100)) OR ((1 <= p86) AND (1 <= p95)) OR ((1 <= p91) AND (1 <= p99)) OR ((1 <= p86) AND (1 <= p98)) OR ((1 <= p90) AND (1 <= p96)) OR ((1 <= p90) AND (1 <= p95)) OR ((1 <= p90) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p98)) OR ((1 <= p92) AND (1 <= p96)) OR ((1 <= p92) AND (1 <= p95)) OR ((1 <= p79) AND (1 <= p97)))))) OR (((p21 <= 0)) AND ((p22 <= 0)) AND ((p24 <= 0)))) U ((((((((((((((((((G (F ((((1 <= p16)) OR ((1 <= p18)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15))))) OR ((1 <= p89) AND (1 <= p99))) OR ((1 <= p89) AND (1 <= p100))) OR ((1 <= p79) AND (1 <= p99))) OR ((1 <= p79) AND (1 <= p100))) OR ((1 <= p86) AND (1 <= p96))) OR ((1 <= p91) AND (1 <= p97))) OR ((1 <= p89) AND (1 <= p97))) OR ((1 <= p91) AND (1 <= p100))) OR ((1 <= p86) AND (1 <= p95))) OR ((1 <= p91) AND (1 <= p99))) OR ((1 <= p86) AND (1 <= p98))) OR ((1 <= p90) AND (1 <= p96))) OR ((1 <= p90) AND (1 <= p95))) OR ((1 <= p90) AND (1 <= p98))) OR ((1 <= p92) AND (1 <= p98))) OR ((1 <= p92) AND (1 <= p96))) OR ((1 <= p92) AND (1 <= p95))) OR ((1 <= p79) AND (1 <= p97)))) : X (G (X ((((1 <= p17)) OR ((1 <= p19)) OR ((1 <= p20)) OR ((1 <= p66) AND (1 <= p89)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p65) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p79)) OR ((1 <= p68) AND (1 <= p90)) OR ((1 <= p65) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p92)) OR ((1 <= p57) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p91)) OR ((1 <= p68) AND (1 <= p86)) OR ((1 <= p67) AND (1 <= p86)))))) : F ((G (X (G ((((1 <= p81)) OR ((1 <= p64)) OR ((1 <= p82)) OR ((1 <= p84)) OR ((1 <= p71)) OR ((1 <= p70)) OR ((1 <= p75)) OR ((1 <= p74)) OR ((1 <= p77)) OR ((1 <= p76)) OR ((1 <= p63)) OR ((1 <= p78)))))) OR G ((((1 <= p80)) OR ((1 <= p83)) OR ((1 <= p69)) OR ((1 <= p73)) OR ((1 <= p72)) OR ((1 <= p62)))))) : ((((((((((((F (G ((F ((((1 <= p65) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p86)) OR ((1 <= p68) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p90)))) AND (((1 <= p65) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p86)) OR ((1 <= p68) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p90)) OR ((1 <= p32)) OR ((1 <= p33)) OR ((1 <= p34)) OR ((1 <= p35)) OR ((1 <= p37)) OR ((1 <= p36)) OR ((1 <= p39)) OR ((1 <= p38)) OR ((1 <= p40)) OR ((1 <= p43)) OR ((1 <= p23)) OR ((1 <= p25)) OR ((1 <= p26)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p29)) OR ((1 <= p30)) OR ((1 <= p31)))))) OR ((1 <= p42) AND (1 <= p60))) OR ((1 <= p44) AND (1 <= p52))) OR ((1 <= p42) AND (1 <= p58))) OR ((1 <= p42) AND (1 <= p59))) OR ((1 <= p41) AND (1 <= p56))) OR ((1 <= p41) AND (1 <= p55))) OR ((1 <= p41) AND (1 <= p54))) OR ((1 <= p42) AND (1 <= p53))) OR ((1 <= p44) AND (1 <= p45))) OR ((1 <= p44) AND (1 <= p50))) OR ((1 <= p41) AND (1 <= p49))) OR ((1 <= p44) AND (1 <= p51))) : X (X ((F (NOT(G (((1 <= p66) AND (1 <= p89))))) AND F (X ((G (((1 <= p73))) U X (X (((1 <= p14)))))))))) : G (F (X ((X (F (((G (((1 <= p38))) OR ((1 <= p19))) AND ((1 <= p38))))) AND ((1 <= p38)))))) : F (X (NOT((((NOT(G (((1 <= p46) AND (1 <= p87)))) OR ((p66 <= 0))) OR ((p91 <= 0))) U (((1 <= p22)) OR ((1 <= p66) AND (1 <= p91))))))) : X (G (((((1 <= p62)) U X (((1 <= p62)))) AND (((1 <= p62)) OR ((1 <= p44) AND (1 <= p51))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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:254
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: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:297
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p24))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p24))))))
lola: processed formula length: 60
lola: 253 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (X (G ((((1 <= p81)) OR ((1 <= p64)) OR ((1 <= p82)) OR ((1 <= p84)) OR ((1 <= p71)) OR ((1 <= p70)) OR ((1 <= p75)) OR ((1 <= p74)) OR ((1 <= p77)) OR ((1 <= p76)) OR ((1 <= p63)) OR ((1 <= p78)))))) OR G ((((1 <= p81)) OR ((1 <= p64)) OR ((1 <= p82)) OR ((1 <= p84)) OR ((1 <= p71)) OR ((1 <= p70)) OR ((1 <= p75)) OR ((1 <= p74)) OR ((1 <= p77)) OR ((1 <= p76)) OR ((1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((((1 <= p42) AND (1 <= p60)) OR ((1 <= p44) AND (1 <= p52)) OR ((1 <= p42) AND (1 <= p58)) OR ((1 <= p42) AND (1 <= p59)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p41) AND (1 <= p55)) OR ((1 <= p41) AND (1 <= p54)) OR ((1 <= p42) AND (1 <= p53)) OR ((1 <= p44) AND (1 <= p45)) OR ((1 <= p44) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p51))) U (((1 <= p46... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((((1 <= p42) AND (1 <= p60)) OR ((1 <= p44) AND (1 <= p52)) OR ((1 <= p42) AND (1 <= p58)) OR ((1 <= p42) AND (1 <= p59)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p41) AND (1 <= p55)) OR ((1 <= p41) AND (1 <= p54)) OR ((1 <= p42) AND (1 <= p53)) OR ((1 <= p44) AND (1 <= p45)) OR ((1 <= p44) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p51))) U (((1 <= p46... (shortened)
lola: processed formula length: 877
lola: 253 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: 25 markings, 25 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (G ((((1 <= p81)) OR ((1 <= p64)) OR ((1 <= p82)) OR ((1 <= p84)) OR ((1 <= p71)) OR ((1 <= p70)) OR ((1 <= p75)) OR ((1 <= p74)) OR ((1 <= p77)) OR ((1 <= p76)) OR ((1 <= p63)) OR ((1 <= p78)))))) OR G ((((1 <= p81)) OR ((1 <= p64)) OR ((1 <= p82)) OR ((1 <= p84)) OR ((1 <= p71)) OR ((1 <= p70)) OR ((1 <= p75)) OR ((1 <= p74)) OR ((1 <= p77)) OR ((1 <= p76)) OR ((1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (G ((((1 <= p81)) OR ((1 <= p64)) OR ((1 <= p82)) OR ((1 <= p84)) OR ((1 <= p71)) OR ((1 <= p70)) OR ((1 <= p75)) OR ((1 <= p74)) OR ((1 <= p77)) OR ((1 <= p76)) OR ((1 <= p63)) OR ((1 <= p78)))))) OR G ((((1 <= p81)) OR ((1 <= p64)) OR ((1 <= p82)) OR ((1 <= p84)) OR ((1 <= p71)) OR ((1 <= p70)) OR ((1 <= p75)) OR ((1 <= p74)) OR ((1 <= p77)) OR ((1 <= p76)) OR ((1 <... (shortened)
lola: processed formula length: 428
lola: 253 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((1 <= p17)) OR ((1 <= p19)) OR ((1 <= p20)) OR ((1 <= p66) AND (1 <= p89)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p65) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p79)) OR ((1 <= p68) AND (1 <= p90)) OR ((1 <= p65) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p92)) OR ((1 <= p57) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p91)) OR ((1 <= p68) AND (1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((1 <= p17)) OR ((1 <= p19)) OR ((1 <= p20)) OR ((1 <= p66) AND (1 <= p89)) OR ((1 <= p61) AND (1 <= p90)) OR ((1 <= p65) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p79)) OR ((1 <= p68) AND (1 <= p90)) OR ((1 <= p65) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p92)) OR ((1 <= p57) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p91)) OR ((1 <= p68) AND (1 ... (shortened)
lola: processed formula length: 444
lola: 253 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (G ((((1 <= p81)) OR ((1 <= p64)) OR ((1 <= p82)) OR ((1 <= p84)) OR ((1 <= p71)) OR ((1 <= p70)) OR ((1 <= p75)) OR ((1 <= p74)) OR ((1 <= p77)) OR ((1 <= p76)) OR ((1 <= p63)) OR ((1 <= p78))))) OR G ((((1 <= p80)) OR ((1 <= p83)) OR ((1 <= p69)) OR ((1 <= p73)) OR ((1 <= p72)) OR ((1 <= p62))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G ((((1 <= p81)) OR ((1 <= p64)) OR ((1 <= p82)) OR ((1 <= p84)) OR ((1 <= p71)) OR ((1 <= p70)) OR ((1 <= p75)) OR ((1 <= p74)) OR ((1 <= p77)) OR ((1 <= p76)) OR ((1 <= p63)) OR ((1 <= p78))))) OR G ((((1 <= p80)) OR ((1 <= p83)) OR ((1 <= p69)) OR ((1 <= p73)) OR ((1 <= p72)) OR ((1 <= p62))))))
lola: processed formula length: 322
lola: 253 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F (((p66 <= 0) OR (p89 <= 0))) AND X (F ((X (X (((1 <= p14)))) OR (G (((1 <= p73))) AND X (X (F (((1 <= p14))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F (((p66 <= 0) OR (p89 <= 0))) AND X (F ((X (X (((1 <= p14)))) OR (G (((1 <= p73))) AND X (X (F (((1 <= p14))))))))))))
lola: processed formula length: 127
lola: 253 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23 markings, 23 edges
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (F (((G (((1 <= p38))) OR ((1 <= p19))) AND ((1 <= p38))))) AND ((1 <= p38)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (F (((G (((1 <= p38))) OR ((1 <= p19))) AND ((1 <= p38))))) AND ((1 <= p38)))))
lola: processed formula length: 88
lola: 253 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((G (((1 <= p46) AND (1 <= p87))) AND (((1 <= p66)) AND ((1 <= p91)))) R (((p22 <= 0)) AND ((p66 <= 0) OR (p91 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((G (((1 <= p46) AND (1 <= p87))) AND (((1 <= p66)) AND ((1 <= p91)))) R (((p22 <= 0)) AND ((p66 <= 0) OR (p91 <= 0))))))
lola: processed formula length: 128
lola: 253 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: add low 27
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: 96 markings, 137 edges
lola: ========================================
lola: subprocess 7 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((((1 <= p62)) U X (((1 <= p62)))) AND (((1 <= p62)) OR ((1 <= p44) AND (1 <= p51))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((((1 <= p62)) U X (((1 <= p62)))) AND (((1 <= p62)) OR ((1 <= p44) AND (1 <= p51))))))
lola: processed formula length: 94
lola: 253 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 22 edges
lola: ========================================
lola: subprocess 8 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G ((((((p89 <= 0) OR (p99 <= 0)) AND ((p89 <= 0) OR (p100 <= 0)) AND ((p79 <= 0) OR (p99 <= 0)) AND ((p79 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p96 <= 0)) AND ((p91 <= 0) OR (p97 <= 0)) AND ((p89 <= 0) OR (p97 <= 0)) AND ((p91 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p95 <= 0)) AND ((p91 <= 0) OR (p99 <= 0)) AND ((p86 <= 0) OR (p98 <= 0)) AND ((p90 <= 0) OR (p96 <= 0)) AND ((p90... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G ((((((p89 <= 0) OR (p99 <= 0)) AND ((p89 <= 0) OR (p100 <= 0)) AND ((p79 <= 0) OR (p99 <= 0)) AND ((p79 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p96 <= 0)) AND ((p91 <= 0) OR (p97 <= 0)) AND ((p89 <= 0) OR (p97 <= 0)) AND ((p91 <= 0) OR (p100 <= 0)) AND ((p86 <= 0) OR (p95 <= 0)) AND ((p91 <= 0) OR (p99 <= 0)) AND ((p86 <= 0) OR (p98 <= 0)) AND ((p90 <= 0) OR (p96 <= 0)) AND ((p90... (shortened)
lola: processed formula length: 2506
lola: 253 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 9 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((F ((((1 <= p65) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p86)) OR ((1 <= p68) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p90)))) AND (((1 <= p65) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p86)) OR ((1 <= p68) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p90)) OR (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p42) AND (1 <= p60)) OR (((1 <= p44) AND (1 <= p52)) OR (((1 <= p42) AND (1 <= p58)) OR (((1 <= p42) AND (1 <= p59)) OR (((1 <= p41) AND (1 <= p56)) OR (((1 <= p41) AND (1 <= p55)) OR (((1 <= p41) AND (1 <= p54)) OR (((1 <= p42) AND (1 <= p53)) OR (((1 <= p44) AND (1 <= p45)) OR (((1 <= p44) AND (1 <= p50)) OR (((1 <= p41) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p51)))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: (((1 <= p42) AND (1 <= p60)) OR ((1 <= p44) AND (1 <= p52)) OR ((1 <= p42) AND (1 <= p58)) OR ((1 <= p42) AND (1 <= p59)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p41) AND (1 <= p55)) OR ((1 <= p41) AND (1 <= p54)) OR ((1 <= p42) AND (1 <= p53)) OR ((1 <= p44) AND (1 <= p45)) OR ((1 <= p44) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p51)))
lola: processed formula length: 370
lola: 274 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 24 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F (G ((F ((((1 <= p65) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p86)) OR ((1 <= p68) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p90)))) AND (((1 <= p65) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p86)) OR ((1 <= p68) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p90)) OR (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((1 <= p42) AND (1 <= p60)) OR (((1 <= p44) AND (1 <= p52)) OR (((1 <= p42) AND (1 <= p58)) OR (((1 <= p42) AND (1 <= p59)) OR (((1 <= p41) AND (1 <= p56)) OR (((1 <= p41) AND (1 <= p55)) OR (((1 <= p41) AND (1 <= p54)) OR (((1 <= p42) AND (1 <= p53)) OR (((1 <= p44) AND (1 <= p45)) OR (((1 <= p44) AND (1 <= p50)) OR (((1 <= p41) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p51)))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: (((1 <= p42) AND (1 <= p60)) OR ((1 <= p44) AND (1 <= p52)) OR ((1 <= p42) AND (1 <= p58)) OR ((1 <= p42) AND (1 <= p59)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p41) AND (1 <= p55)) OR ((1 <= p41) AND (1 <= p54)) OR ((1 <= p42) AND (1 <= p53)) OR ((1 <= p44) AND (1 <= p45)) OR ((1 <= p44) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p51)))
lola: processed formula length: 370
lola: 274 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 24 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((1 <= p65) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p86)) OR ((1 <= p68) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p90)))) AND (((1 <= p65) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p86)) OR ((1 <= p68) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p90)) OR ((... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((1 <= p65) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p86)) OR ((1 <= p68) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p90)))) AND (((1 <= p65) AND (1 <= p89)) OR ((1 <= p57) AND (1 <= p79)) OR ((1 <= p61) AND (1 <= p86)) OR ((1 <= p68) AND (1 <= p92)) OR ((1 <= p66) AND (1 <= p91)) OR ((1 <= p67) AND (1 <= p90)) OR ((... (shortened)
lola: processed formula length: 703
lola: 253 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: 23 markings, 24 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no no no no no
lola:
preliminary result: no no yes no no no no no no no
lola: memory consumption: 143408 KB
lola: time consumption: 4 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="Peterson-PT-2"
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 Peterson-PT-2, 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 r151-tall-162089151400302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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