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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K 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 3.6K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 42K 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-COL-2-00
FORMULA_NAME Peterson-COL-2-01
FORMULA_NAME Peterson-COL-2-02
FORMULA_NAME Peterson-COL-2-03
FORMULA_NAME Peterson-COL-2-04
FORMULA_NAME Peterson-COL-2-05
FORMULA_NAME Peterson-COL-2-06
FORMULA_NAME Peterson-COL-2-07
FORMULA_NAME Peterson-COL-2-08
FORMULA_NAME Peterson-COL-2-09
FORMULA_NAME Peterson-COL-2-10
FORMULA_NAME Peterson-COL-2-11
FORMULA_NAME Peterson-COL-2-12
FORMULA_NAME Peterson-COL-2-13
FORMULA_NAME Peterson-COL-2-14
FORMULA_NAME Peterson-COL-2-15

=== Now, execution of the tool begins

BK_START 1621019599977

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 19:13:21] [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 19:13:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 19:13:21] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-14 19:13:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 543 ms
[2021-05-14 19:13:22] [INFO ] sort/places :
ProcTourProc->BeginLoop,TestIdentity,TestAlone,IsEndLoop,
ProcBool->WantSection,
TourProc->Turn,
ProcTour->AskForSection,TestTurn,EndTurn,
Process->Idle,CS,

[2021-05-14 19:13:22] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 108 PT places and 159.0 transition bindings in 23 ms.
[2021-05-14 19:13:22] [INFO ] Computed order based on color domains.
[2021-05-14 19:13:22] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions in 13 ms.
[2021-05-14 19:13:22] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 12 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 45 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 366 ms. (steps per millisecond=273 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1]
[2021-05-14 19:13:22] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-14 19:13:22] [INFO ] Computed 11 place invariants in 6 ms
[2021-05-14 19:13:22] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned unsat
[2021-05-14 19:13:22] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-14 19:13:22] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:22] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2021-05-14 19:13:22] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 19:13:22] [INFO ] [Real]Added 26 Read/Feed constraints in 9 ms returned sat
[2021-05-14 19:13:22] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 15 ms.
[2021-05-14 19:13:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-14 19:13:22] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 4 ms returned sat
[2021-05-14 19:13:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:23] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2021-05-14 19:13:23] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:13:23] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 9 ms.
[2021-05-14 19:13:23] [INFO ] Added : 117 causal constraints over 24 iterations in 239 ms. Result :sat
[2021-05-14 19:13:23] [INFO ] Deduced a trap composed of 8 places in 26 ms
[2021-05-14 19:13:23] [INFO ] Deduced a trap composed of 14 places in 19 ms
[2021-05-14 19:13:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
[2021-05-14 19:13:23] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 19:13:23] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 7 ms returned sat
[2021-05-14 19:13:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:23] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-14 19:13:23] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:13:23] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:13:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:23] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-14 19:13:23] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:13:23] [INFO ] Deduced a trap composed of 26 places in 33 ms
[2021-05-14 19:13:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2021-05-14 19:13:23] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 9 ms.
[2021-05-14 19:13:23] [INFO ] Added : 117 causal constraints over 24 iterations in 194 ms. Result :sat
[2021-05-14 19:13:23] [INFO ] Deduced a trap composed of 12 places in 30 ms
[2021-05-14 19:13:23] [INFO ] Deduced a trap composed of 28 places in 29 ms
[2021-05-14 19:13:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2021-05-14 19:13:23] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-14 19:13:23] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 6 ms returned sat
[2021-05-14 19:13:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:23] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-14 19:13:23] [INFO ] [Real]Added 26 Read/Feed constraints in 2 ms returned sat
[2021-05-14 19:13:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:13:23] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:23] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2021-05-14 19:13:23] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:13:24] [INFO ] Deduced a trap composed of 26 places in 25 ms
[2021-05-14 19:13:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2021-05-14 19:13:24] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 13 ms.
[2021-05-14 19:13:24] [INFO ] Added : 117 causal constraints over 24 iterations in 200 ms. Result :sat
[2021-05-14 19:13:24] [INFO ] Deduced a trap composed of 12 places in 40 ms
[2021-05-14 19:13:24] [INFO ] Deduced a trap composed of 28 places in 23 ms
[2021-05-14 19:13:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2021-05-14 19:13:24] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 19:13:24] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:13:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:24] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-14 19:13:24] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:13:24] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:24] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-14 19:13:24] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:13:24] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 8 ms.
[2021-05-14 19:13:24] [INFO ] Added : 117 causal constraints over 24 iterations in 182 ms. Result :sat
[2021-05-14 19:13:24] [INFO ] Deduced a trap composed of 15 places in 20 ms
[2021-05-14 19:13:24] [INFO ] Deduced a trap composed of 8 places in 18 ms
[2021-05-14 19:13:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 59 ms
[2021-05-14 19:13:24] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-14 19:13:24] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:24] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-14 19:13:24] [INFO ] [Real]Added 26 Read/Feed constraints in 2 ms returned sat
[2021-05-14 19:13:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:13:24] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:24] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-14 19:13:24] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:13:24] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 12 ms.
[2021-05-14 19:13:25] [INFO ] Added : 117 causal constraints over 24 iterations in 199 ms. Result :sat
[2021-05-14 19:13:25] [INFO ] Deduced a trap composed of 17 places in 19 ms
[2021-05-14 19:13:25] [INFO ] Deduced a trap composed of 8 places in 14 ms
[2021-05-14 19:13:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 54 ms
[2021-05-14 19:13:25] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-14 19:13:25] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:25] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2021-05-14 19:13:25] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:13:25] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:25] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-14 19:13:25] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:25] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2021-05-14 19:13:25] [INFO ] Added : 117 causal constraints over 24 iterations in 183 ms. Result :sat
[2021-05-14 19:13:25] [INFO ] Deduced a trap composed of 17 places in 17 ms
[2021-05-14 19:13:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2021-05-14 19:13:25] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-14 19:13:25] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:25] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-14 19:13:25] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:13:25] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 9 ms.
[2021-05-14 19:13:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:13:25] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:25] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2021-05-14 19:13:25] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:25] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2021-05-14 19:13:25] [INFO ] Added : 117 causal constraints over 24 iterations in 175 ms. Result :sat
[2021-05-14 19:13:25] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-14 19:13:25] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:25] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-14 19:13:25] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:13:25] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:26] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-14 19:13:26] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:13:26] [INFO ] Deduced a trap composed of 10 places in 14 ms
[2021-05-14 19:13:26] [INFO ] Deduced a trap composed of 12 places in 13 ms
[2021-05-14 19:13:26] [INFO ] Deduced a trap composed of 10 places in 13 ms
[2021-05-14 19:13:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 56 ms
[2021-05-14 19:13:26] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2021-05-14 19:13:26] [INFO ] Added : 117 causal constraints over 24 iterations in 178 ms. Result :sat
[2021-05-14 19:13:26] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 19:13:26] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:26] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-14 19:13:26] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:13:26] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:13:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:26] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-14 19:13:26] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:13:26] [INFO ] Deduced a trap composed of 8 places in 20 ms
[2021-05-14 19:13:26] [INFO ] Deduced a trap composed of 8 places in 20 ms
[2021-05-14 19:13:26] [INFO ] Deduced a trap composed of 22 places in 12 ms
[2021-05-14 19:13:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 75 ms
[2021-05-14 19:13:26] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2021-05-14 19:13:26] [INFO ] Added : 117 causal constraints over 24 iterations in 170 ms. Result :sat
[2021-05-14 19:13:26] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-14 19:13:26] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:13:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:26] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-14 19:13:26] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:13:26] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:26] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2021-05-14 19:13:26] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:13:26] [INFO ] Deduced a trap composed of 14 places in 20 ms
[2021-05-14 19:13:26] [INFO ] Deduced a trap composed of 14 places in 23 ms
[2021-05-14 19:13:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 54 ms
[2021-05-14 19:13:26] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 5 ms.
[2021-05-14 19:13:27] [INFO ] Added : 117 causal constraints over 24 iterations in 174 ms. Result :sat
[2021-05-14 19:13:27] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-14 19:13:27] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:27] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-14 19:13:27] [INFO ] [Real]Added 26 Read/Feed constraints in 9 ms returned sat
[2021-05-14 19:13:27] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2021-05-14 19:13:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:13:27] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:27] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-14 19:13:27] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:27] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2021-05-14 19:13:27] [INFO ] Added : 117 causal constraints over 24 iterations in 177 ms. Result :sat
[2021-05-14 19:13:27] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:13:27] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:27] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-14 19:13:27] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:13:27] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:27] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-14 19:13:27] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:13:27] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2021-05-14 19:13:27] [INFO ] Added : 117 causal constraints over 24 iterations in 169 ms. Result :sat
[2021-05-14 19:13:27] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 19:13:27] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:27] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-14 19:13:27] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:13:27] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:27] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-14 19:13:27] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:13:27] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2021-05-14 19:13:28] [INFO ] Added : 117 causal constraints over 24 iterations in 173 ms. Result :sat
[2021-05-14 19:13:28] [INFO ] Deduced a trap composed of 8 places in 18 ms
[2021-05-14 19:13:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2021-05-14 19:13:28] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-14 19:13:28] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:28] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-14 19:13:28] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:13:28] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:13:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:28] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-14 19:13:28] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:28] [INFO ] Deduced a trap composed of 26 places in 21 ms
[2021-05-14 19:13:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2021-05-14 19:13:28] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2021-05-14 19:13:28] [INFO ] Added : 117 causal constraints over 24 iterations in 167 ms. Result :sat
[2021-05-14 19:13:28] [INFO ] Deduced a trap composed of 8 places in 20 ms
[2021-05-14 19:13:28] [INFO ] Deduced a trap composed of 34 places in 19 ms
[2021-05-14 19:13:28] [INFO ] Deduced a trap composed of 22 places in 12 ms
[2021-05-14 19:13:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 77 ms
[2021-05-14 19:13:28] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-14 19:13:28] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:28] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-14 19:13:28] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:13:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:13:28] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:28] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2021-05-14 19:13:28] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:13:28] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 10 ms.
[2021-05-14 19:13:28] [INFO ] Added : 117 causal constraints over 24 iterations in 174 ms. Result :sat
[2021-05-14 19:13:28] [INFO ] Deduced a trap composed of 22 places in 22 ms
[2021-05-14 19:13:28] [INFO ] Deduced a trap composed of 16 places in 30 ms
[2021-05-14 19:13:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2021-05-14 19:13:28] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-14 19:13:28] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:13:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:28] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-14 19:13:28] [INFO ] [Real]Added 26 Read/Feed constraints in 2 ms returned sat
[2021-05-14 19:13:28] [INFO ] Deduced a trap composed of 8 places in 22 ms
[2021-05-14 19:13:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2021-05-14 19:13:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 19:13:29] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:13:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:29] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2021-05-14 19:13:29] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:29] [INFO ] Deduced a trap composed of 12 places in 22 ms
[2021-05-14 19:13:29] [INFO ] Deduced a trap composed of 8 places in 21 ms
[2021-05-14 19:13:29] [INFO ] Deduced a trap composed of 17 places in 25 ms
[2021-05-14 19:13:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 91 ms
[2021-05-14 19:13:29] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2021-05-14 19:13:29] [INFO ] Added : 117 causal constraints over 24 iterations in 172 ms. Result :sat
[2021-05-14 19:13:29] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-14 19:13:29] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:29] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-14 19:13:29] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:29] [INFO ] Deduced a trap composed of 11 places in 28 ms
[2021-05-14 19:13:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2021-05-14 19:13:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:13:29] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:13:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:29] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2021-05-14 19:13:29] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:29] [INFO ] Deduced a trap composed of 26 places in 17 ms
[2021-05-14 19:13:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2021-05-14 19:13:29] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2021-05-14 19:13:29] [INFO ] Added : 117 causal constraints over 24 iterations in 170 ms. Result :sat
[2021-05-14 19:13:29] [INFO ] Deduced a trap composed of 25 places in 32 ms
[2021-05-14 19:13:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2021-05-14 19:13:29] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-14 19:13:29] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:29] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-14 19:13:29] [INFO ] [Real]Added 26 Read/Feed constraints in 2 ms returned sat
[2021-05-14 19:13:29] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2021-05-14 19:13:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:13:29] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:29] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-14 19:13:29] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:29] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2021-05-14 19:13:30] [INFO ] Added : 117 causal constraints over 24 iterations in 172 ms. Result :sat
[2021-05-14 19:13:30] [INFO ] Deduced a trap composed of 30 places in 18 ms
[2021-05-14 19:13:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2021-05-14 19:13:30] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 19:13:30] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:30] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-14 19:13:30] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:13:30] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:30] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-14 19:13:30] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:30] [INFO ] Deduced a trap composed of 12 places in 11 ms
[2021-05-14 19:13:30] [INFO ] Deduced a trap composed of 15 places in 11 ms
[2021-05-14 19:13:30] [INFO ] Deduced a trap composed of 26 places in 17 ms
[2021-05-14 19:13:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 56 ms
[2021-05-14 19:13:30] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2021-05-14 19:13:30] [INFO ] Added : 117 causal constraints over 24 iterations in 168 ms. Result :sat
[2021-05-14 19:13:30] [INFO ] Deduced a trap composed of 26 places in 26 ms
[2021-05-14 19:13:30] [INFO ] Deduced a trap composed of 13 places in 18 ms
[2021-05-14 19:13:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
[2021-05-14 19:13:30] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-14 19:13:30] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:30] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-14 19:13:30] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:13:30] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:30] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-14 19:13:30] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:13:30] [INFO ] Deduced a trap composed of 26 places in 25 ms
[2021-05-14 19:13:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2021-05-14 19:13:30] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 12 ms.
[2021-05-14 19:13:30] [INFO ] Added : 117 causal constraints over 24 iterations in 183 ms. Result :sat
[2021-05-14 19:13:30] [INFO ] Deduced a trap composed of 12 places in 24 ms
[2021-05-14 19:13:30] [INFO ] Deduced a trap composed of 28 places in 21 ms
[2021-05-14 19:13:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2021-05-14 19:13:31] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-14 19:13:31] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:31] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-14 19:13:31] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 19:13:31] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:13:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:31] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-14 19:13:31] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:13:31] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2021-05-14 19:13:31] [INFO ] Added : 117 causal constraints over 24 iterations in 202 ms. Result :sat
[2021-05-14 19:13:31] [INFO ] Deduced a trap composed of 15 places in 16 ms
[2021-05-14 19:13:31] [INFO ] Deduced a trap composed of 8 places in 15 ms
[2021-05-14 19:13:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 50 ms
[2021-05-14 19:13:31] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-14 19:13:31] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:31] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-14 19:13:31] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:13:31] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:31] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-14 19:13:31] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:13:31] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2021-05-14 19:13:31] [INFO ] Added : 117 causal constraints over 24 iterations in 174 ms. Result :sat
[2021-05-14 19:13:31] [INFO ] Deduced a trap composed of 15 places in 16 ms
[2021-05-14 19:13:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-14 19:13:31] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-14 19:13:31] [INFO ] Flatten gal took : 39 ms
FORMULA Peterson-COL-2-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 19:13:31] [INFO ] Applying decomposition
[2021-05-14 19:13:31] [INFO ] Flatten gal took : 14 ms
[2021-05-14 19:13:31] [INFO ] Decomposing Gal with order
[2021-05-14 19:13:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 19:13:31] [INFO ] Removed a total of 72 redundant transitions.
[2021-05-14 19:13:32] [INFO ] Flatten gal took : 79 ms
[2021-05-14 19:13:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-14 19:13:32] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 9 ms.
[2021-05-14 19:13:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Peterson-COL-2 @ 3570 seconds

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

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

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

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

FORMULA Peterson-COL-2-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-COL-2-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Peterson-COL-2-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA Peterson-COL-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-COL-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 19:13:32 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (F (((1 <= p48) OR (1 <= p50) OR (1 <= p46)))))",
"processed_size": 54,
"rewrites": 292
},
"result":
{
"edges": 53,
"markings": 53,
"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": 324
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 24,
"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 <= p6) AND (1 <= p72)) OR ((1 <= p6) AND (1 <= p81)) OR ((1 <= p8) AND (1 <= p75)) OR ((1 <= p8) AND (1 <= p73)) OR ((1 <= p4) AND (1 <= p82)) OR ((1 <= p6) AND (1 <= p83)) OR ((1 <= p4) AND (1 <= p80)) OR ((1 <= p6) AND (1 <= p74)) OR ((1 <= p4) AND (1 <= p78)) OR ((1 <= p4) AND (1 <= p76)) OR ((1 <= p8) AND (1 <= p79)) OR ((1 <= p8) AND (1 <= p77))) U (((1 <= p5) AND (1 <= p83)) OR ((1 <= p7) AND (1 <= p79)) OR ((1 <= p5) AND (1 <= p81)) OR ((1 <= p7) AND (1 <= p73)) OR ((1 <= p5) AND (1 <= p74)) OR ((1 <= p7) AND (1 <= p75)) OR ((1 <= p7) AND (1 <= p77)) OR ((1 <= p3) AND (1 <= p76)) OR ((1 <= p5) AND (1 <= p72)) OR ((1 <= p3) AND (1 <= p78)) OR ((1 <= p3) AND (1 <= p80)) OR ((1 <= p3) AND (1 <= p82)))) AND ((1 <= p64) OR (1 <= p68) OR (1 <= p71) OR (1 <= p54) OR (1 <= p57) OR (1 <= p61))))",
"processed_size": 841,
"rewrites": 292
},
"result":
{
"edges": 52,
"markings": 52,
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 3,
"aconj": 0,
"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 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62))))) OR G (((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62)))))",
"processed_size": 380,
"rewrites": 292
},
"result":
{
"edges": 46,
"markings": 46,
"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": 356
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 12,
"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 <= p49) OR (1 <= p45) OR (1 <= p47) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p20) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p22)) OR ((1 <= p19) AND (1 <= p22)) OR ((1 <= p18) AND (1 <= p24)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p17) AND (1 <= p23)) OR ((1 <= p16) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p23)) OR ((1 <= p18) AND (1 <= p26))))))",
"processed_size": 438,
"rewrites": 292
},
"result":
{
"edges": 46,
"markings": 46,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"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 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62)))) OR G (((1 <= p64) OR (1 <= p68) OR (1 <= p71) OR (1 <= p54) OR (1 <= p57) OR (1 <= p61)))))",
"processed_size": 286,
"rewrites": 292
},
"result":
{
"edges": 46,
"markings": 46,
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 3,
"aconj": 3,
"adisj": 5,
"aneg": 1,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(X (X (G ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p7)))))) U (X (F (((p48 <= 0) AND (p50 <= 0) AND (p46 <= 0)))) AND (((p1 <= 0) OR (p5 <= 0)) AND (((p0 <= 0) OR (p3 <= 0)) AND ((p2 <= 0) OR (p7 <= 0))))))",
"processed_size": 250,
"rewrites": 292
},
"result":
{
"edges": 101,
"markings": 90,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 509
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F (G ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p7)))))",
"processed_size": 95,
"rewrites": 292
},
"result":
{
"edges": 166,
"markings": 152,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 36,
"adisj": 1,
"aneg": 1,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "F (G ((((p12 <= 0) OR (p18 <= 0)) AND ((p12 <= 0) OR (p19 <= 0)) AND ((p11 <= 0) OR (p15 <= 0)) AND ((p11 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p15 <= 0)) AND ((p11 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p13 <= 0) OR (p15 <= 0)) AND ((p13 <= 0) OR (p16 <= 0)) AND ((p13 <= 0) OR (p17 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p14 <= 0) OR (p18 <= 0)) AND ((p14 <= 0) OR (p19 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p18 <= 0)) AND ((p12 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p19 <= 0)) AND ((p12 <= 0) OR (p18 <= 0)) AND ((p12 <= 0) OR (p19 <= 0)) AND ((p11 <= 0) OR (p15 <= 0)) AND ((p11 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p15 <= 0)) AND ((p11 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p13 <= 0) OR (p15 <= 0)) AND ((p13 <= 0) OR (p16 <= 0)) AND ((p13 <= 0) OR (p17 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p14 <= 0) OR (p18 <= 0)) AND ((p14 <= 0) OR (p19 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p18 <= 0)) AND ((p12 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p19 <= 0)))))",
"processed_size": 1151,
"rewrites": 292
},
"result":
{
"edges": 48,
"markings": 47,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 6,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(F (((1 <= p48) OR (1 <= p50) OR (1 <= p46))) U (G (((1 <= p48) OR (1 <= p50) OR (1 <= p46))) AND ((p64 <= 0) AND ((p68 <= 0) AND ((p71 <= 0) AND ((p54 <= 0) AND ((p57 <= 0) AND (p61 <= 0))))))))",
"processed_size": 199,
"rewrites": 292
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "G (((p65 <= 0) AND (p67 <= 0) AND (p66 <= 0) AND (p69 <= 0) AND (p55 <= 0) AND (p70 <= 0) AND (p56 <= 0) AND (p59 <= 0) AND (p58 <= 0) AND (p60 <= 0) AND (p63 <= 0) AND (p62 <= 0)))",
"processed_size": 181,
"rewrites": 292
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 0,
"aconj": 73,
"adisj": 4,
"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 ((((((p12 <= 0) OR (p18 <= 0)) AND ((p12 <= 0) OR (p19 <= 0)) AND ((p11 <= 0) OR (p15 <= 0)) AND ((p11 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p15 <= 0)) AND ((p11 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p13 <= 0) OR (p15 <= 0)) AND ((p13 <= 0) OR (p16 <= 0)) AND ((p13 <= 0) OR (p17 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p14 <= 0) OR (p18 <= 0)) AND ((p14 <= 0) OR (p19 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p18 <= 0)) AND ((p12 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p19 <= 0))) R (((p12 <= 0) OR (p18 <= 0)) AND ((p12 <= 0) OR (p19 <= 0)) AND ((p11 <= 0) OR (p15 <= 0)) AND ((p11 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p15 <= 0)) AND ((p11 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p13 <= 0) OR (p15 <= 0)) AND ((p13 <= 0) OR (p16 <= 0)) AND ((p13 <= 0) OR (p17 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p14 <= 0) OR (p18 <= 0)) AND ((p14 <= 0) OR (p19 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p18 <= 0)) AND ((p12 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p19 <= 0)))) OR (((p12 <= 0) OR (p18 <= 0)) AND ((p12 <= 0) OR (p19 <= 0)) AND ((p11 <= 0) OR (p15 <= 0)) AND ((p11 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p15 <= 0)) AND ((p11 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p13 <= 0) OR (p15 <= 0)) AND ((p13 <= 0) OR (p16 <= 0)) AND ((p13 <= 0) OR (p17 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p14 <= 0) OR (p18 <= 0)) AND ((p14 <= 0) OR (p19 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p18 <= 0)) AND ((p12 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p19 <= 0))))) OR ((p48 <= 0) AND (p50 <= 0) AND (p46 <= 0))) U (G (F (((1 <= p92) OR (1 <= p95) OR (1 <= p98) OR (1 <= p101) OR (1 <= p86) OR (1 <= p89)))) OR (((1 <= p12) AND (1 <= p18)) OR (((1 <= p12) AND (1 <= p19)) OR (((1 <= p11) AND (1 <= p15)) OR (((1 <= p11) AND (1 <= p16)) OR (((1 <= p9) AND (1 <= p15)) OR (((1 <= p11) AND (1 <= p17)) OR (((1 <= p9) AND (1 <= p16)) OR (((1 <= p9) AND (1 <= p17)) OR (((1 <= p13) AND (1 <= p15)) OR (((1 <= p13) AND (1 <= p16)) OR (((1 <= p13) AND (1 <= p17)) OR (((1 <= p14) AND (1 <= p20)) OR (((1 <= p14) AND (1 <= p18)) OR (((1 <= p14) AND (1 <= p19)) OR (((1 <= p10) AND (1 <= p20)) OR (((1 <= p10) AND (1 <= p18)) OR (((1 <= p12) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p19)))))))))))))))))))))",
"processed_size": 2465,
"rewrites": 292
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (F ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p7)))))",
"processed_size": 95,
"rewrites": 292
},
"result":
{
"edges": 107,
"markings": 101,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "F (G ((G (((1 <= p64) OR (1 <= p68) OR (1 <= p71) OR (1 <= p54) OR (1 <= p57) OR (1 <= p61))) AND ((1 <= p48) OR (1 <= p50) OR (1 <= p46)))))",
"processed_size": 148,
"rewrites": 292
},
"result":
{
"edges": 17,
"markings": 16,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"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 <= p6) AND (1 <= p72)) OR ((1 <= p6) AND (1 <= p81)) OR ((1 <= p8) AND (1 <= p75)) OR ((1 <= p8) AND (1 <= p73)) OR ((1 <= p4) AND (1 <= p82)) OR ((1 <= p6) AND (1 <= p83)) OR ((1 <= p4) AND (1 <= p80)) OR ((1 <= p6) AND (1 <= p74)) OR ((1 <= p4) AND (1 <= p78)) OR ((1 <= p4) AND (1 <= p76)) OR ((1 <= p8) AND (1 <= p79)) OR ((1 <= p8) AND (1 <= p77)))",
"processed_size": 358,
"rewrites": 313
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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 <= p6) AND (1 <= p72)) OR ((1 <= p6) AND (1 <= p81)) OR ((1 <= p8) AND (1 <= p75)) OR ((1 <= p8) AND (1 <= p73)) OR ((1 <= p4) AND (1 <= p82)) OR ((1 <= p6) AND (1 <= p83)) OR ((1 <= p4) AND (1 <= p80)) OR ((1 <= p6) AND (1 <= p74)) OR ((1 <= p4) AND (1 <= p78)) OR ((1 <= p4) AND (1 <= p76)) OR ((1 <= p8) AND (1 <= p79)) OR ((1 <= p8) AND (1 <= p77)))",
"processed_size": 358,
"rewrites": 313
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 12,
"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 <= p16) AND (1 <= p23)) OR ((1 <= p20) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p24)) OR ((1 <= p18) AND (1 <= p22)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p25)))) AND (((1 <= p16) AND (1 <= p23)) OR ((1 <= p20) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p24)) OR ((1 <= p18) AND (1 <= p22)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p25)) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p36) OR (1 <= p37) OR (1 <= p39) OR (1 <= p38) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p44) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31)))))",
"processed_size": 667,
"rewrites": 292
},
"result":
{
"edges": 19,
"markings": 18,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"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": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 110636,
"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(G(**))) U (X(F(*)) AND (** AND (** AND **)))) : (X(F(*)) OR (X(F(*)) AND F(G(**)))) : (F(G((G(**) AND **))) OR G(F(**))) : F(G(*)) : (F(**) U (G(**) AND (** AND (** AND (** AND (** AND (** AND **))))))) : G(*)"
},
"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 yes no no no no ",
"value": "no no yes no no no no yes 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: F (X (X (((1 <= p48) OR (1 <= p50) OR (1 <= p46))))) : (X ((X (G (X (((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62))))) OR G (((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62))))) OR F ((((((1 <= p6) AND (1 <= p72)) OR ((1 <= p6) AND (1 <= p81)) OR ((1 <= p8) AND (1 <= p75)) OR ((1 <= p8) AND (1 <= p73)) OR ((1 <= p4) AND (1 <= p82)) OR ((1 <= p6) AND (1 <= p83)) OR ((1 <= p4) AND (1 <= p80)) OR ((1 <= p6) AND (1 <= p74)) OR ((1 <= p4) AND (1 <= p78)) OR ((1 <= p4) AND (1 <= p76)) OR ((1 <= p8) AND (1 <= p79)) OR ((1 <= p8) AND (1 <= p77))) U (((1 <= p5) AND (1 <= p83)) OR ((1 <= p7) AND (1 <= p79)) OR ((1 <= p5) AND (1 <= p81)) OR ((1 <= p7) AND (1 <= p73)) OR ((1 <= p5) AND (1 <= p74)) OR ((1 <= p7) AND (1 <= p75)) OR ((1 <= p7) AND (1 <= p77)) OR ((1 <= p3) AND (1 <= p76)) OR ((1 <= p5) AND (1 <= p72)) OR ((1 <= p3) AND (1 <= p78)) OR ((1 <= p3) AND (1 <= p80)) OR ((1 <= p3) AND (1 <= p82)))) AND ((1 <= p64) OR (1 <= p68) OR (1 <= p71) OR (1 <= p54) OR (1 <= p57) OR (1 <= p61))))) : ((NOT(F ((((((1 <= p12) AND (1 <= p18)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p11) AND (1 <= p15)) OR ((1 <= p11) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p11) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p13) AND (1 <= p15)) OR ((1 <= p13) AND (1 <= p16)) OR ((1 <= p13) AND (1 <= p17)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p18)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p18)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p19))) U (((1 <= p12) AND (1 <= p18)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p11) AND (1 <= p15)) OR ((1 <= p11) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p11) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p13) AND (1 <= p15)) OR ((1 <= p13) AND (1 <= p16)) OR ((1 <= p13) AND (1 <= p17)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p18)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p18)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p19)))) AND (((1 <= p12) AND (1 <= p18)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p11) AND (1 <= p15)) OR ((1 <= p11) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p11) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p13) AND (1 <= p15)) OR ((1 <= p13) AND (1 <= p16)) OR ((1 <= p13) AND (1 <= p17)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p18)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p18)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p19)))))) OR ((p48 <= 0) AND (p50 <= 0) AND (p46 <= 0))) U ((((((((((((((((((G (F (((1 <= p92) OR (1 <= p95) OR (1 <= p98) OR (1 <= p101) OR (1 <= p86) OR (1 <= p89)))) OR ((1 <= p12) AND (1 <= p18))) OR ((1 <= p12) AND (1 <= p19))) OR ((1 <= p11) AND (1 <= p15))) OR ((1 <= p11) AND (1 <= p16))) OR ((1 <= p9) AND (1 <= p15))) OR ((1 <= p11) AND (1 <= p17))) OR ((1 <= p9) AND (1 <= p16))) OR ((1 <= p9) AND (1 <= p17))) OR ((1 <= p13) AND (1 <= p15))) OR ((1 <= p13) AND (1 <= p16))) OR ((1 <= p13) AND (1 <= p17))) OR ((1 <= p14) AND (1 <= p20))) OR ((1 <= p14) AND (1 <= p18))) OR ((1 <= p14) AND (1 <= p19))) OR ((1 <= p10) AND (1 <= p20))) OR ((1 <= p10) AND (1 <= p18))) OR ((1 <= p12) AND (1 <= p20))) OR ((1 <= p10) AND (1 <= p19)))) : X (G (X (((1 <= p49) OR (1 <= p45) OR (1 <= p47) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p20) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p22)) OR ((1 <= p19) AND (1 <= p22)) OR ((1 <= p18) AND (1 <= p24)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p17) AND (1 <= p23)) OR ((1 <= p16) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p23)) OR ((1 <= p18) AND (1 <= p26)))))) : F ((G (X (G (((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62))))) OR G (((1 <= p64) OR (1 <= p68) OR (1 <= p71) OR (1 <= p54) OR (1 <= p57) OR (1 <= p61))))) : ((((((((((((F (G ((F ((((1 <= p16) AND (1 <= p23)) OR ((1 <= p20) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p24)) OR ((1 <= p18) AND (1 <= p22)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p25)))) AND (((1 <= p16) AND (1 <= p23)) OR ((1 <= p20) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p24)) OR ((1 <= p18) AND (1 <= p22)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p25)) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p36) OR (1 <= p37) OR (1 <= p39) OR (1 <= p38) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p44) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31))))) OR ((1 <= p6) AND (1 <= p72))) OR ((1 <= p6) AND (1 <= p81))) OR ((1 <= p8) AND (1 <= p75))) OR ((1 <= p8) AND (1 <= p73))) OR ((1 <= p4) AND (1 <= p82))) OR ((1 <= p6) AND (1 <= p83))) OR ((1 <= p4) AND (1 <= p80))) OR ((1 <= p6) AND (1 <= p74))) OR ((1 <= p4) AND (1 <= p78))) OR ((1 <= p4) AND (1 <= p76))) OR ((1 <= p8) AND (1 <= p79))) OR ((1 <= p8) AND (1 <= p77))) : (G (X (X ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p7)))))) U (((NOT(X (G (((1 <= p48) OR (1 <= p50) OR (1 <= p46))))) AND ((p1 <= 0) OR (p5 <= 0))) AND ((p0 <= 0) OR (p3 <= 0))) AND ((p2 <= 0) OR (p7 <= 0)))) : (X (F (G ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p7)))))) U NOT(X (G (((1 <= p49) OR (1 <= p45) OR (1 <= p47)))))) : (NOT(G (X (X (NOT(G (X ((G (((1 <= p64) OR (1 <= p68) OR (1 <= p71) OR (1 <= p54) OR (1 <= p57) OR (1 <= p61))) AND ((1 <= p48) OR (1 <= p50) OR (1 <= p46)))))))))) OR G (F ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p7)))))) : NOT(X (G (X (G (X (F ((((1 <= p12) AND (1 <= p18)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p11) AND (1 <= p15)) OR ((1 <= p11) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p11) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p13) AND (1 <= p15)) OR ((1 <= p13) AND (1 <= p16)) OR ((1 <= p13) AND (1 <= p17)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p18)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p18)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p18)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p11) AND (1 <= p15)) OR ((1 <= p11) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p15)) OR ((1 <= p11) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p13) AND (1 <= p15)) OR ((1 <= p13) AND (1 <= p16)) OR ((1 <= p13) AND (1 <= p17)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p18)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p18)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p19)))))))))) : (((((1 <= p15) AND (1 <= p25)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p20) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p22)) OR ((1 <= p19) AND (1 <= p22)) OR ((1 <= p18) AND (1 <= p24)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p17) AND (1 <= p23)) OR ((1 <= p16) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p23)) OR ((1 <= p18) AND (1 <= p26))) U F (((1 <= p48) OR (1 <= p50) OR (1 <= p46)))) U ((((((G (((1 <= p48) OR (1 <= p50) OR (1 <= p46))) AND (p64 <= 0)) AND (p68 <= 0)) AND (p71 <= 0)) AND (p54 <= 0)) AND (p57 <= 0)) AND (p61 <= 0))) : NOT(((((1 <= p6) AND (1 <= p72)) OR ((1 <= p6) AND (1 <= p81)) OR ((1 <= p8) AND (1 <= p75)) OR ((1 <= p8) AND (1 <= p73)) OR ((1 <= p4) AND (1 <= p82)) OR ((1 <= p6) AND (1 <= p83)) OR ((1 <= p4) AND (1 <= p80)) OR ((1 <= p6) AND (1 <= p74)) OR ((1 <= p4) AND (1 <= p78)) OR ((1 <= p4) AND (1 <= p76)) OR ((1 <= p8) AND (1 <= p79)) OR ((1 <= p8) AND (1 <= p77))) U F (((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62)))))
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((1 <= p48) OR (1 <= p50) OR (1 <= p46)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((1 <= p48) OR (1 <= p50) OR (1 <= p46)))))
lola: processed formula length: 54
lola: 292 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: 53 markings, 53 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (X (G (((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62))))) OR G (((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62))))) OR F ((((((1 <= p6... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((((1 <= p6) AND (1 <= p72)) OR ((1 <= p6) AND (1 <= p81)) OR ((1 <= p8) AND (1 <= p75)) OR ((1 <= p8) AND (1 <= p73)) OR ((1 <= p4) AND (1 <= p82)) OR ((1 <= p6) AND (1 <= p83)) OR ((1 <= p4) AND (1 <= p80)) OR ((1 <= p6) AND (1 <= p74)) OR ((1 <= p4) AND (1 <= p78)) OR ((1 <= p4) AND (1 <= p76)) OR ((1 <= p8) AND (1 <= p79)) OR ((1 <= p8) AND (1 <= p77))) U (((1 <= p5) AND (1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((((1 <= p6) AND (1 <= p72)) OR ((1 <= p6) AND (1 <= p81)) OR ((1 <= p8) AND (1 <= p75)) OR ((1 <= p8) AND (1 <= p73)) OR ((1 <= p4) AND (1 <= p82)) OR ((1 <= p6) AND (1 <= p83)) OR ((1 <= p4) AND (1 <= p80)) OR ((1 <= p6) AND (1 <= p74)) OR ((1 <= p4) AND (1 <= p78)) OR ((1 <= p4) AND (1 <= p76)) OR ((1 <= p8) AND (1 <= p79)) OR ((1 <= p8) AND (1 <= p77))) U (((1 <= p5) AND (1 <= p... (shortened)
lola: processed formula length: 841
lola: 292 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 52 markings, 52 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (G (((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62))))) OR G (((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (G (((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62))))) OR G (((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62)))))
lola: processed formula length: 380
lola: 292 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: 46 markings, 46 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p49) OR (1 <= p45) OR (1 <= p47) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p20) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p22)) OR ((1 <= p19) AND (1 <= p22)) OR ((1 <= p18) AND (1 <= p24)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p17) AND (1 <= p23)) OR ((1 <= p16) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p23... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p49) OR (1 <= p45) OR (1 <= p47) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p20) AND (1 <= p24)) OR ((1 <= p20) AND (1 <= p22)) OR ((1 <= p19) AND (1 <= p22)) OR ((1 <= p18) AND (1 <= p24)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p17) AND (1 <= p23)) OR ((1 <= p16) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p23... (shortened)
lola: processed formula length: 438
lola: 292 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: 46 markings, 46 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (G (((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62)))) OR G (((1 <= p64) OR (1 <= p68) OR (1 <= p71) OR (1 <= p54) OR (1 <= p57) OR (1 <= p61)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G (((1 <= p65) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p55) OR (1 <= p70) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62)))) OR G (((1 <= p64) OR (1 <= p68) OR (1 <= p71) OR (1 <= p54) OR (1 <= p57) OR (1 <= p61)))))
lola: processed formula length: 286
lola: 292 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: 46 markings, 46 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p7)))))) U (X (F (((p48 <= 0) AND (p50 <= 0) AND (p46 <= 0)))) AND (((p1 <= 0) OR (p5 <= 0)) AND (((p0 <= 0) OR (p3 <= 0)) AND ((p2 <= 0) OR (p7 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (G ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p7)))))) U (X (F (((p48 <= 0) AND (p50 <= 0) AND (p46 <= 0)))) AND (((p1 <= 0) OR (p5 <= 0)) AND (((p0 <= 0) OR (p3 <= 0)) AND ((p2 <= 0) OR (p7 <= 0))))))
lola: processed formula length: 250
lola: 292 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: 90 markings, 101 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((p49 <= 0) AND (p45 <= 0) AND (p47 <= 0)))) OR (X (F (((p49 <= 0) AND (p45 <= 0) AND (p47 <= 0)))) AND F (G ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p7)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p7)))))
lola: processed formula length: 95
lola: 292 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: 152 markings, 166 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p49 <= 0) AND (p45 <= 0) AND (p47 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p49 <= 0) AND (p45 <= 0) AND (p47 <= 0))))
lola: processed formula length: 50
lola: 292 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p12 <= 0) OR (p18 <= 0)) AND ((p12 <= 0) OR (p19 <= 0)) AND ((p11 <= 0) OR (p15 <= 0)) AND ((p11 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p15 <= 0)) AND ((p11 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p13 <= 0) OR (p15 <= 0)) AND ((p13 <= 0) OR (p16 <= 0)) AND ((p13 <= 0) OR (p17 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p14 <= 0) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p12 <= 0) OR (p18 <= 0)) AND ((p12 <= 0) OR (p19 <= 0)) AND ((p11 <= 0) OR (p15 <= 0)) AND ((p11 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p15 <= 0)) AND ((p11 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p13 <= 0) OR (p15 <= 0)) AND ((p13 <= 0) OR (p16 <= 0)) AND ((p13 <= 0) OR (p17 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p14 <= 0) ... (shortened)
lola: processed formula length: 1151
lola: 292 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: 47 markings, 48 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p48) OR (1 <= p50) OR (1 <= p46))) U (G (((1 <= p48) OR (1 <= p50) OR (1 <= p46))) AND ((p64 <= 0) AND ((p68 <= 0) AND ((p71 <= 0) AND ((p54 <= 0) AND ((p57 <= 0) AND (p61 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p48) OR (1 <= p50) OR (1 <= p46))) U (G (((1 <= p48) OR (1 <= p50) OR (1 <= p46))) AND ((p64 <= 0) AND ((p68 <= 0) AND ((p71 <= 0) AND ((p54 <= 0) AND ((p57 <= 0) AND (p61 <= 0))))))))
lola: processed formula length: 199
lola: 292 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 14 markings, 14 edges
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p65 <= 0) AND (p67 <= 0) AND (p66 <= 0) AND (p69 <= 0) AND (p55 <= 0) AND (p70 <= 0) AND (p56 <= 0) AND (p59 <= 0) AND (p58 <= 0) AND (p60 <= 0) AND (p63 <= 0) AND (p62 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p65 <= 0) AND (p67 <= 0) AND (p66 <= 0) AND (p69 <= 0) AND (p55 <= 0) AND (p70 <= 0) AND (p56 <= 0) AND (p59 <= 0) AND (p58 <= 0) AND (p60 <= 0) AND (p63 <= 0) AND (p62 <= 0)))
lola: processed formula length: 181
lola: 292 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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 9 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G ((((((p12 <= 0) OR (p18 <= 0)) AND ((p12 <= 0) OR (p19 <= 0)) AND ((p11 <= 0) OR (p15 <= 0)) AND ((p11 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p15 <= 0)) AND ((p11 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p13 <= 0) OR (p15 <= 0)) AND ((p13 <= 0) OR (p16 <= 0)) AND ((p13 <= 0) OR (p17 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p14 <= 0)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G ((((((p12 <= 0) OR (p18 <= 0)) AND ((p12 <= 0) OR (p19 <= 0)) AND ((p11 <= 0) OR (p15 <= 0)) AND ((p11 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p15 <= 0)) AND ((p11 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p13 <= 0) OR (p15 <= 0)) AND ((p13 <= 0) OR (p16 <= 0)) AND ((p13 <= 0) OR (p17 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p14 <= 0)... (shortened)
lola: processed formula length: 2465
lola: 292 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 10 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((G (((1 <= p64) OR (1 <= p68) OR (1 <= p71) OR (1 <= p54) OR (1 <= p57) OR (1 <= p61))) AND ((1 <= p48) OR (1 <= p50) OR (1 <= p46))))) OR G (F ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p2) AND (1 <= p7)))))
lola: processed formula length: 95
lola: 292 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: 101 markings, 107 edges
lola: ========================================
lola: subprocess 11 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (((1 <= p64) OR (1 <= p68) OR (1 <= p71) OR (1 <= p54) OR (1 <= p57) OR (1 <= p61))) AND ((1 <= p48) OR (1 <= p50) OR (1 <= p46)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (((1 <= p64) OR (1 <= p68) OR (1 <= p71) OR (1 <= p54) OR (1 <= p57) OR (1 <= p61))) AND ((1 <= p48) OR (1 <= p50) OR (1 <= p46)))))
lola: processed formula length: 148
lola: 292 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 16 markings, 17 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((F ((((1 <= p16) AND (1 <= p23)) OR ((1 <= p20) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p24)) OR ((1 <= p18) AND (1 <= p22)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p25)))) AND (((1 <= p16) AND (1 <= p23)) OR ((1 <= p20) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p24)) OR ((1 <= p18) AND (1 <= p22)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p25)) OR (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p6) AND (1 <= p72)) OR (((1 <= p6) AND (1 <= p81)) OR (((1 <= p8) AND (1 <= p75)) OR (((1 <= p8) AND (1 <= p73)) OR (((1 <= p4) AND (1 <= p82)) OR (((1 <= p6) AND (1 <= p83)) OR (((1 <= p4) AND (1 <= p80)) OR (((1 <= p6) AND (1 <= p74)) OR (((1 <= p4) AND (1 <= p78)) OR (((1 <= p4) AND (1 <= p76)) OR (((1 <= p8) AND (1 <= p79)) OR ((1 <= p8) AND (1 <= p77)))))))))))))
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 <= p6) AND (1 <= p72)) OR ((1 <= p6) AND (1 <= p81)) OR ((1 <= p8) AND (1 <= p75)) OR ((1 <= p8) AND (1 <= p73)) OR ((1 <= p4) AND (1 <= p82)) OR ((1 <= p6) AND (1 <= p83)) OR ((1 <= p4) AND (1 <= p80)) OR ((1 <= p6) AND (1 <= p74)) OR ((1 <= p4) AND (1 <= p78)) OR ((1 <= p4) AND (1 <= p76)) OR ((1 <= p8) AND (1 <= p79)) OR ((1 <= p8) AND (1 <= p77)))
lola: processed formula length: 358
lola: 313 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 <= p16) AND (1 <= p23)) OR ((1 <= p20) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p24)) OR ((1 <= p18) AND (1 <= p22)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p25)))) AND (((1 <= p16) AND (1 <= p23)) OR ((1 <= p20) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p24)) OR ((1 <= p18) AND (1 <= p22)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p25)) OR (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((1 <= p6) AND (1 <= p72)) OR (((1 <= p6) AND (1 <= p81)) OR (((1 <= p8) AND (1 <= p75)) OR (((1 <= p8) AND (1 <= p73)) OR (((1 <= p4) AND (1 <= p82)) OR (((1 <= p6) AND (1 <= p83)) OR (((1 <= p4) AND (1 <= p80)) OR (((1 <= p6) AND (1 <= p74)) OR (((1 <= p4) AND (1 <= p78)) OR (((1 <= p4) AND (1 <= p76)) OR (((1 <= p8) AND (1 <= p79)) OR ((1 <= p8) AND (1 <= p77)))))))))))))
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 <= p6) AND (1 <= p72)) OR ((1 <= p6) AND (1 <= p81)) OR ((1 <= p8) AND (1 <= p75)) OR ((1 <= p8) AND (1 <= p73)) OR ((1 <= p4) AND (1 <= p82)) OR ((1 <= p6) AND (1 <= p83)) OR ((1 <= p4) AND (1 <= p80)) OR ((1 <= p6) AND (1 <= p74)) OR ((1 <= p4) AND (1 <= p78)) OR ((1 <= p4) AND (1 <= p76)) OR ((1 <= p8) AND (1 <= p79)) OR ((1 <= p8) AND (1 <= p77)))
lola: processed formula length: 358
lola: 313 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 <= p16) AND (1 <= p23)) OR ((1 <= p20) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p24)) OR ((1 <= p18) AND (1 <= p22)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p25)))) AND (((1 <= p16) AND (1 <= p23)) OR ((1 <= p20) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p24)) OR ((1 <= p18) AND (1 <= p22)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p25)) OR (1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((1 <= p16) AND (1 <= p23)) OR ((1 <= p20) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p24)) OR ((1 <= p18) AND (1 <= p22)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p25)))) AND (((1 <= p16) AND (1 <= p23)) OR ((1 <= p20) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p24)) OR ((1 <= p18) AND (1 <= p22)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p25)) OR (1... (shortened)
lola: processed formula length: 667
lola: 292 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: 18 markings, 19 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 yes no no no no
lola:
preliminary result: no no yes no no no no yes no no no no
lola: memory consumption: 110636 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-COL-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-COL-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-162089151400278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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