Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r132-tall-162075428500302.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 LamportFastMutEx-COL-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428500302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 103K 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.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 06:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 07:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 07:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 40K 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 LamportFastMutEx-COL-4-00
FORMULA_NAME LamportFastMutEx-COL-4-01
FORMULA_NAME LamportFastMutEx-COL-4-02
FORMULA_NAME LamportFastMutEx-COL-4-03
FORMULA_NAME LamportFastMutEx-COL-4-04
FORMULA_NAME LamportFastMutEx-COL-4-05
FORMULA_NAME LamportFastMutEx-COL-4-06
FORMULA_NAME LamportFastMutEx-COL-4-07
FORMULA_NAME LamportFastMutEx-COL-4-08
FORMULA_NAME LamportFastMutEx-COL-4-09
FORMULA_NAME LamportFastMutEx-COL-4-10
FORMULA_NAME LamportFastMutEx-COL-4-11
FORMULA_NAME LamportFastMutEx-COL-4-12
FORMULA_NAME LamportFastMutEx-COL-4-13
FORMULA_NAME LamportFastMutEx-COL-4-14
FORMULA_NAME LamportFastMutEx-COL-4-15

=== Now, execution of the tool begins

BK_START 1620929113019

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 18:05:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 18:05:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 18:05:16] [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-13 18:05:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 568 ms
[2021-05-13 18:05:17] [INFO ] sort/places :
pid * pid->P-wait,P-done,
pid * bool->P-b,
pid->P-start_1,x,y,P-setx_3,P-setbi_5,P-ify0_4,P-sety_9,P-ifxi_10,P-setbi_11,P-fordo_12,P-await_13,P-ifyi_15,P-awaity,P-CS_21,P-setbi_24,

[2021-05-13 18:05:17] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 135 PT places and 285.0 transition bindings in 29 ms.
[2021-05-13 18:05:17] [INFO ] Computed order based on color domains.
[2021-05-13 18:05:17] [INFO ] Unfolded HLPN to a Petri net with 135 places and 230 transitions in 13 ms.
[2021-05-13 18:05:17] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 50 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 412 ms. (steps per millisecond=242 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-05-13 18:05:17] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2021-05-13 18:05:17] [INFO ] Computed 26 place invariants in 6 ms
[2021-05-13 18:05:17] [INFO ] [Real]Absence check using 26 positive place invariants in 19 ms returned sat
[2021-05-13 18:05:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:05:17] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2021-05-13 18:05:17] [INFO ] State equation strengthened by 48 read => feed constraints.
[2021-05-13 18:05:17] [INFO ] [Real]Added 48 Read/Feed constraints in 10 ms returned sat
[2021-05-13 18:05:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:05:17] [INFO ] [Nat]Absence check using 26 positive place invariants in 17 ms returned sat
[2021-05-13 18:05:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:05:17] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2021-05-13 18:05:17] [INFO ] [Nat]Added 48 Read/Feed constraints in 6 ms returned sat
[2021-05-13 18:05:17] [INFO ] Deduced a trap composed of 21 places in 56 ms
[2021-05-13 18:05:17] [INFO ] Deduced a trap composed of 11 places in 50 ms
[2021-05-13 18:05:18] [INFO ] Deduced a trap composed of 14 places in 43 ms
[2021-05-13 18:05:18] [INFO ] Deduced a trap composed of 8 places in 24 ms
[2021-05-13 18:05:18] [INFO ] Deduced a trap composed of 8 places in 15 ms
[2021-05-13 18:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 227 ms
[2021-05-13 18:05:18] [INFO ] [Real]Absence check using 26 positive place invariants in 8 ms returned sat
[2021-05-13 18:05:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:05:18] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-13 18:05:18] [INFO ] [Real]Added 48 Read/Feed constraints in 6 ms returned sat
[2021-05-13 18:05:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:05:18] [INFO ] [Nat]Absence check using 26 positive place invariants in 9 ms returned sat
[2021-05-13 18:05:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:05:18] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-13 18:05:18] [INFO ] [Nat]Added 48 Read/Feed constraints in 6 ms returned sat
[2021-05-13 18:05:18] [INFO ] Deduced a trap composed of 13 places in 39 ms
[2021-05-13 18:05:18] [INFO ] Deduced a trap composed of 8 places in 34 ms
[2021-05-13 18:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 88 ms
[2021-05-13 18:05:18] [INFO ] [Real]Absence check using 26 positive place invariants in 7 ms returned sat
[2021-05-13 18:05:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:05:18] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-13 18:05:18] [INFO ] [Real]Added 48 Read/Feed constraints in 5 ms returned sat
[2021-05-13 18:05:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:05:18] [INFO ] [Nat]Absence check using 26 positive place invariants in 9 ms returned sat
[2021-05-13 18:05:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:05:18] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-13 18:05:18] [INFO ] [Nat]Added 48 Read/Feed constraints in 6 ms returned sat
[2021-05-13 18:05:18] [INFO ] Deduced a trap composed of 8 places in 11 ms
[2021-05-13 18:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 16 ms
[2021-05-13 18:05:18] [INFO ] [Real]Absence check using 26 positive place invariants in 15 ms returned sat
[2021-05-13 18:05:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:05:18] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-13 18:05:18] [INFO ] [Real]Added 48 Read/Feed constraints in 5 ms returned sat
[2021-05-13 18:05:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:05:18] [INFO ] [Nat]Absence check using 26 positive place invariants in 9 ms returned sat
[2021-05-13 18:05:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:05:18] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-13 18:05:18] [INFO ] [Nat]Added 48 Read/Feed constraints in 5 ms returned sat
[2021-05-13 18:05:18] [INFO ] Deduced a trap composed of 8 places in 36 ms
[2021-05-13 18:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2021-05-13 18:05:18] [INFO ] [Real]Absence check using 26 positive place invariants in 9 ms returned sat
[2021-05-13 18:05:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:05:18] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2021-05-13 18:05:18] [INFO ] [Real]Added 48 Read/Feed constraints in 6 ms returned sat
[2021-05-13 18:05:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:05:18] [INFO ] [Nat]Absence check using 26 positive place invariants in 11 ms returned sat
[2021-05-13 18:05:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:05:18] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2021-05-13 18:05:18] [INFO ] [Nat]Added 48 Read/Feed constraints in 6 ms returned sat
[2021-05-13 18:05:18] [INFO ] Deduced a trap composed of 13 places in 37 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 10 places in 49 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 9 places in 36 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 9 places in 39 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 17 places in 37 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 15 places in 32 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 14 places in 30 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 14 places in 35 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 19 places in 35 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 13 places in 29 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 17 places in 34 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 9 places in 34 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 32 places in 32 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 14 places in 51 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 26 places in 36 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 6 places in 18 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 6 places in 33 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 9 places in 12 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 17 places in 33 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 21 places in 34 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 31 places in 54 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 21 places in 39 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 21 places in 30 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 9 places in 35 ms
[2021-05-13 18:05:19] [INFO ] Deduced a trap composed of 30 places in 37 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 19 places in 36 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 13 places in 40 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 22 places in 38 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 16 places in 34 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 23 places in 36 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 9 places in 29 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 14 places in 28 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 17 places in 29 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 20 places in 32 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 9 places in 11 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 18 places in 32 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 23 places in 34 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 19 places in 29 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 23 places in 36 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 14 places in 30 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 15 places in 38 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 19 places in 36 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 13 places in 37 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 18 places in 28 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 13 places in 29 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 14 places in 37 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 25 places in 38 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 19 places in 36 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 24 places in 38 ms
[2021-05-13 18:05:20] [INFO ] Deduced a trap composed of 22 places in 37 ms
[2021-05-13 18:05:21] [INFO ] Deduced a trap composed of 19 places in 36 ms
[2021-05-13 18:05:21] [INFO ] Deduced a trap composed of 13 places in 39 ms
[2021-05-13 18:05:21] [INFO ] Deduced a trap composed of 13 places in 37 ms
[2021-05-13 18:05:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 53 trap constraints in 2164 ms
[2021-05-13 18:05:21] [INFO ] [Real]Absence check using 26 positive place invariants in 8 ms returned sat
[2021-05-13 18:05:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:05:21] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-13 18:05:21] [INFO ] [Real]Added 48 Read/Feed constraints in 6 ms returned sat
[2021-05-13 18:05:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:05:21] [INFO ] [Nat]Absence check using 26 positive place invariants in 9 ms returned sat
[2021-05-13 18:05:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:05:21] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-13 18:05:21] [INFO ] [Nat]Added 48 Read/Feed constraints in 5 ms returned sat
[2021-05-13 18:05:21] [INFO ] Deduced a trap composed of 9 places in 41 ms
[2021-05-13 18:05:21] [INFO ] Deduced a trap composed of 29 places in 42 ms
[2021-05-13 18:05:21] [INFO ] Deduced a trap composed of 8 places in 43 ms
[2021-05-13 18:05:21] [INFO ] Deduced a trap composed of 30 places in 46 ms
[2021-05-13 18:05:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 196 ms
[2021-05-13 18:05:21] [INFO ] Computed and/alt/rep : 176/848/140 causal constraints in 14 ms.
[2021-05-13 18:05:21] [INFO ] Added : 125 causal constraints over 26 iterations in 312 ms. Result :sat
[2021-05-13 18:05:21] [INFO ] Deduced a trap composed of 9 places in 22 ms
[2021-05-13 18:05:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2021-05-13 18:05:21] [INFO ] [Real]Absence check using 26 positive place invariants in 14 ms returned sat
[2021-05-13 18:05:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:05:21] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-13 18:05:21] [INFO ] [Real]Added 48 Read/Feed constraints in 5 ms returned sat
[2021-05-13 18:05:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:05:21] [INFO ] [Nat]Absence check using 26 positive place invariants in 9 ms returned sat
[2021-05-13 18:05:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:05:21] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2021-05-13 18:05:22] [INFO ] [Nat]Added 48 Read/Feed constraints in 8 ms returned sat
[2021-05-13 18:05:22] [INFO ] Deduced a trap composed of 12 places in 37 ms
[2021-05-13 18:05:22] [INFO ] Deduced a trap composed of 13 places in 40 ms
[2021-05-13 18:05:22] [INFO ] Deduced a trap composed of 22 places in 40 ms
[2021-05-13 18:05:22] [INFO ] Deduced a trap composed of 30 places in 54 ms
[2021-05-13 18:05:22] [INFO ] Deduced a trap composed of 10 places in 37 ms
[2021-05-13 18:05:22] [INFO ] Deduced a trap composed of 9 places in 30 ms
[2021-05-13 18:05:22] [INFO ] Deduced a trap composed of 27 places in 34 ms
[2021-05-13 18:05:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 311 ms
[2021-05-13 18:05:22] [INFO ] Computed and/alt/rep : 176/848/140 causal constraints in 8 ms.
[2021-05-13 18:05:22] [INFO ] Added : 124 causal constraints over 26 iterations in 272 ms. Result :sat
[2021-05-13 18:05:22] [INFO ] Deduced a trap composed of 9 places in 13 ms
[2021-05-13 18:05:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2021-05-13 18:05:22] [INFO ] [Real]Absence check using 26 positive place invariants in 8 ms returned sat
[2021-05-13 18:05:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:05:22] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-13 18:05:22] [INFO ] [Real]Added 48 Read/Feed constraints in 5 ms returned sat
[2021-05-13 18:05:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:05:22] [INFO ] [Nat]Absence check using 26 positive place invariants in 9 ms returned sat
[2021-05-13 18:05:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:05:22] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2021-05-13 18:05:22] [INFO ] [Nat]Added 48 Read/Feed constraints in 6 ms returned sat
[2021-05-13 18:05:22] [INFO ] Deduced a trap composed of 8 places in 36 ms
[2021-05-13 18:05:22] [INFO ] Deduced a trap composed of 22 places in 33 ms
[2021-05-13 18:05:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 84 ms
[2021-05-13 18:05:22] [INFO ] Computed and/alt/rep : 176/848/140 causal constraints in 12 ms.
[2021-05-13 18:05:23] [INFO ] Added : 134 causal constraints over 28 iterations in 299 ms. Result :sat
[2021-05-13 18:05:23] [INFO ] Deduced a trap composed of 26 places in 35 ms
[2021-05-13 18:05:23] [INFO ] Deduced a trap composed of 12 places in 35 ms
[2021-05-13 18:05:23] [INFO ] Deduced a trap composed of 13 places in 35 ms
[2021-05-13 18:05:23] [INFO ] Deduced a trap composed of 10 places in 39 ms
[2021-05-13 18:05:23] [INFO ] Deduced a trap composed of 17 places in 36 ms
[2021-05-13 18:05:23] [INFO ] Deduced a trap composed of 8 places in 33 ms
[2021-05-13 18:05:23] [INFO ] Deduced a trap composed of 26 places in 34 ms
[2021-05-13 18:05:23] [INFO ] Deduced a trap composed of 15 places in 37 ms
[2021-05-13 18:05:23] [INFO ] Deduced a trap composed of 26 places in 35 ms
[2021-05-13 18:05:23] [INFO ] Deduced a trap composed of 22 places in 35 ms
[2021-05-13 18:05:23] [INFO ] Deduced a trap composed of 13 places in 38 ms
[2021-05-13 18:05:23] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 544 ms
[2021-05-13 18:05:23] [INFO ] [Real]Absence check using 26 positive place invariants in 8 ms returned sat
[2021-05-13 18:05:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:05:23] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-13 18:05:23] [INFO ] [Real]Added 48 Read/Feed constraints in 6 ms returned sat
[2021-05-13 18:05:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:05:23] [INFO ] [Nat]Absence check using 26 positive place invariants in 10 ms returned sat
[2021-05-13 18:05:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:05:23] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-13 18:05:23] [INFO ] [Nat]Added 48 Read/Feed constraints in 7 ms returned sat
[2021-05-13 18:05:23] [INFO ] Deduced a trap composed of 26 places in 38 ms
[2021-05-13 18:05:23] [INFO ] Deduced a trap composed of 29 places in 39 ms
[2021-05-13 18:05:24] [INFO ] Deduced a trap composed of 8 places in 41 ms
[2021-05-13 18:05:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 137 ms
[2021-05-13 18:05:24] [INFO ] Computed and/alt/rep : 176/848/140 causal constraints in 11 ms.
[2021-05-13 18:05:24] [INFO ] Added : 116 causal constraints over 24 iterations in 247 ms. Result :sat
[2021-05-13 18:05:24] [INFO ] Deduced a trap composed of 32 places in 39 ms
[2021-05-13 18:05:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2021-05-13 18:05:24] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-13 18:05:24] [INFO ] Flatten gal took : 55 ms
FORMULA LamportFastMutEx-COL-4-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 18:05:24] [INFO ] Applying decomposition
[2021-05-13 18:05:24] [INFO ] Flatten gal took : 23 ms
[2021-05-13 18:05:24] [INFO ] Decomposing Gal with order
[2021-05-13 18:05:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 18:05:24] [INFO ] Removed a total of 231 redundant transitions.
[2021-05-13 18:05:24] [INFO ] Flatten gal took : 58 ms
[2021-05-13 18:05:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 5 ms.
[2021-05-13 18:05:24] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2021-05-13 18:05:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ LamportFastMutEx-COL-4 @ 3570 seconds

FORMULA LamportFastMutEx-COL-4-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3563
rslt: Output for LTLFireability @ LamportFastMutEx-COL-4

{
"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": "Thu May 13 18:05:25 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 25,
"adisj": 18,
"aneg": 0,
"comp": 96,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 96,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "X (G ((((((1 <= p14) AND (1 <= p42)) OR ((1 <= p18) AND (1 <= p44)) OR ((1 <= p16) AND (1 <= p43)) OR ((1 <= p15) AND (1 <= p42)) OR ((1 <= p21) AND (1 <= p45)) OR ((1 <= p20) AND (1 <= p45)) OR ((1 <= p17) AND (1 <= p43)) OR ((1 <= p19) AND (1 <= p44))) U (((p10 <= 0) OR (p31 <= 0)) AND ((p10 <= 0) OR (p32 <= 0)) AND ((p10 <= 0) OR (p33 <= 0)) AND ((p13 <= 0) OR (p31 <= 0)) AND ((p13 <= 0) OR (p30 <= 0)) AND ((p11 <= 0) OR (p32 <= 0)) AND ((p11 <= 0) OR (p33 <= 0)) AND ((p11 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p33 <= 0)) AND ((p11 <= 0) OR (p31 <= 0)) AND ((p13 <= 0) OR (p32 <= 0)) AND ((p12 <= 0) OR (p33 <= 0)) AND ((p12 <= 0) OR (p30 <= 0)) AND ((p12 <= 0) OR (p32 <= 0)) AND ((p10 <= 0) OR (p30 <= 0)) AND ((p12 <= 0) OR (p31 <= 0)))) AND F ((((1 <= p18) AND (1 <= p56) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p64) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p63) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p59) AND (1 <= p68)) OR ((1 <= p16) AND (1 <= p55) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p61) AND (1 <= p68)) OR ((1 <= p20) AND (1 <= p53) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p57) AND (1 <= p67)) OR ((1 <= p20) AND (1 <= p65) AND (1 <= p69)) OR ((1 <= p14) AND (1 <= p54) AND (1 <= p67)) OR ((1 <= p14) AND (1 <= p58) AND (1 <= p68)) OR ((1 <= p14) AND (1 <= p50) AND (1 <= p66)) OR ((1 <= p14) AND (1 <= p62) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p51) AND (1 <= p66)) OR ((1 <= p18) AND (1 <= p60) AND (1 <= p68)))))))",
"processed_size": 1535,
"rewrites": 551
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 20,
"adisj": 0,
"aneg": 0,
"comp": 56,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 56,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 32,
"visible_transitions": 0
},
"processed": "(((1 <= p18) AND (1 <= p56) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p64) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p63) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p59) AND (1 <= p68)) OR ((1 <= p16) AND (1 <= p55) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p61) AND (1 <= p68)) OR ((1 <= p20) AND (1 <= p53) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p57) AND (1 <= p67)) OR ((1 <= p20) AND (1 <= p65) AND (1 <= p69)) OR ((1 <= p14) AND (1 <= p54) AND (1 <= p67)) OR ((1 <= p14) AND (1 <= p58) AND (1 <= p68)) OR ((1 <= p14) AND (1 <= p50) AND (1 <= p66)) OR ((1 <= p14) AND (1 <= p62) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p51) AND (1 <= p66)) OR ((1 <= p18) AND (1 <= p60) AND (1 <= p68)) OR ((1 <= p15) AND (1 <= p42)) OR ((1 <= p21) AND (1 <= p45)) OR ((1 <= p17) AND (1 <= p43)) OR ((1 <= p19) AND (1 <= p44)))",
"processed_size": 858,
"rewrites": 588
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 16,
"adisj": 1,
"aneg": 0,
"comp": 32,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X (F ((((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p87)) OR ((1 <= p9) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p87)))))",
"processed_size": 513,
"rewrites": 551
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 36,
"adisj": 2,
"aneg": 2,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "G ((G ((((p5 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p40 <= 0)) AND ((p8 <= 0) OR (p41 <= 0)))) OR (((p6 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p38 <= 0)) AND ((p4 <= 0) OR (p39 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p40 <= 0)) AND ((p5 <= 0) OR (p41 <= 0)) AND ((p5 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p41 <= 0)) AND ((p10 <= 0) OR (p31 <= 0)) AND ((p10 <= 0) OR (p32 <= 0)) AND ((p10 <= 0) OR (p33 <= 0)) AND ((p13 <= 0) OR (p31 <= 0)) AND ((p13 <= 0) OR (p30 <= 0)) AND ((p11 <= 0) OR (p32 <= 0)) AND ((p11 <= 0) OR (p33 <= 0)) AND ((p11 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p33 <= 0)) AND ((p11 <= 0) OR (p31 <= 0)) AND ((p13 <= 0) OR (p32 <= 0)) AND ((p12 <= 0) OR (p33 <= 0)) AND ((p12 <= 0) OR (p30 <= 0)) AND ((p12 <= 0) OR (p32 <= 0)) AND ((p10 <= 0) OR (p30 <= 0)) AND ((p12 <= 0) OR (p31 <= 0)))))",
"processed_size": 1140,
"rewrites": 551
},
"result":
{
"edges": 230,
"markings": 176,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 16,
"aneg": 0,
"comp": 32,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X ((((p6 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p38 <= 0)) AND ((p4 <= 0) OR (p39 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p40 <= 0)) AND ((p5 <= 0) OR (p41 <= 0)) AND ((p5 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p41 <= 0))))",
"processed_size": 497,
"rewrites": 551
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 17,
"adisj": 17,
"aneg": 1,
"comp": 64,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 64,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "X ((X (G ((((p11 <= 0) OR (p86 <= 0)) AND ((p11 <= 0) OR (p88 <= 0)) AND ((p9 <= 0) OR (p89 <= 0)) AND ((p9 <= 0) OR (p88 <= 0)) AND ((p11 <= 0) OR (p89 <= 0)) AND ((p12 <= 0) OR (p89 <= 0)) AND ((p12 <= 0) OR (p87 <= 0)) AND ((p12 <= 0) OR (p86 <= 0)) AND ((p10 <= 0) OR (p89 <= 0)) AND ((p10 <= 0) OR (p87 <= 0)) AND ((p10 <= 0) OR (p88 <= 0)) AND ((p13 <= 0) OR (p88 <= 0)) AND ((p9 <= 0) OR (p87 <= 0)) AND ((p9 <= 0) OR (p86 <= 0)) AND ((p13 <= 0) OR (p86 <= 0)) AND ((p13 <= 0) OR (p87 <= 0))))) OR (((p6 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p38 <= 0)) AND ((p4 <= 0) OR (p39 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p40 <= 0)) AND ((p5 <= 0) OR (p41 <= 0)) AND ((p5 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p41 <= 0)))))",
"processed_size": 1016,
"rewrites": 551
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"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": 0,
"U": 0,
"X": 1,
"aconj": 24,
"adisj": 1,
"aneg": 0,
"comp": 48,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 0,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "F ((X ((((1 <= p12) AND (1 <= p97)) OR ((1 <= p12) AND (1 <= p95)) OR ((1 <= p12) AND (1 <= p96)) OR ((1 <= p12) AND (1 <= p94)) OR ((1 <= p11) AND (1 <= p94)) OR ((1 <= p11) AND (1 <= p95)) OR ((1 <= p11) AND (1 <= p96)) OR ((1 <= p11) AND (1 <= p97)) OR ((1 <= p13) AND (1 <= p94)) OR ((1 <= p13) AND (1 <= p95)) OR ((1 <= p13) AND (1 <= p96)) OR ((1 <= p13) AND (1 <= p97)) OR ((1 <= p9) AND (1 <= p94)) OR ((1 <= p9) AND (1 <= p95)) OR ((1 <= p9) AND (1 <= p96)) OR ((1 <= p9) AND (1 <= p97)) OR ((1 <= p10) AND (1 <= p95)) OR ((1 <= p10) AND (1 <= p96)) OR ((1 <= p10) AND (1 <= p94)) OR ((1 <= p10) AND (1 <= p97)))) OR (((1 <= p5) AND (1 <= p38)) OR (((1 <= p6) AND (1 <= p39)) OR (((1 <= p7) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p41)))))))",
"processed_size": 769,
"rewrites": 551
},
"result":
{
"edges": 1419660,
"markings": 316320,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 40,
"adisj": 3,
"aneg": 1,
"comp": 92,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 92,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 41,
"visible_transitions": 0
},
"processed": "(X (F ((G ((((1 <= p20) AND (1 <= p29)) OR ((1 <= p16) AND (1 <= p27)) OR ((1 <= p15) AND (1 <= p26)) OR ((1 <= p21) AND (1 <= p29)) OR ((1 <= p14) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p28)))) OR (((p20 <= 0) OR (p29 <= 0)) AND ((p16 <= 0) OR (p27 <= 0)) AND ((p15 <= 0) OR (p26 <= 0)) AND ((p21 <= 0) OR (p29 <= 0)) AND ((p14 <= 0) OR (p26 <= 0)) AND ((p18 <= 0) OR (p28 <= 0)) AND ((p17 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p28 <= 0)) AND ((p67 <= 0) OR (p74 <= 0) OR (p75 <= 0) OR (p76 <= 0) OR (p77 <= 0)) AND ((p68 <= 0) OR (p78 <= 0) OR (p79 <= 0) OR (p80 <= 0) OR (p81 <= 0)) AND ((p69 <= 0) OR (p82 <= 0) OR (p83 <= 0) OR (p84 <= 0) OR (p85 <= 0)) AND ((p66 <= 0) OR (p70 <= 0) OR (p71 <= 0) OR (p72 <= 0) OR (p73 <= 0)))))) U (((1 <= p4) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p24)) OR ((1 <= p5) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p24)) OR ((1 <= p6) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p24)) OR ((1 <= p8) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p23)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p25))))",
"processed_size": 1454,
"rewrites": 551
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((p9 <= 0) OR (p32 <= 0)) AND ((p9 <= 0) OR (p33 <= 0)) AND ((p9 <= 0) OR (p30 <= 0)) AND ((p9 <= 0) OR (p31 <= 0)))",
"processed_size": 121,
"rewrites": 553
},
"result":
{
"edges": 32,
"markings": 16,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 72
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 4,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((((p9 <= 0) OR (p91 <= 0)) AND ((p9 <= 0) OR (p92 <= 0)) AND ((p9 <= 0) OR (p93 <= 0)) AND ((p9 <= 0) OR (p90 <= 0)))))",
"processed_size": 129,
"rewrites": 551
},
"result":
{
"edges": 288,
"markings": 234,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 16,
"adisj": 1,
"aneg": 0,
"comp": 32,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "G (F ((((1 <= p6) AND (1 <= p41)) OR ((1 <= p8) AND (1 <= p38)) OR ((1 <= p4) AND (1 <= p39)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p8) AND (1 <= p39)) OR ((1 <= p6) AND (1 <= p38)) OR ((1 <= p8) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p38)) OR ((1 <= p6) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p38)) OR ((1 <= p7) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p41)) OR ((1 <= p5) AND (1 <= p39)) OR ((1 <= p7) AND (1 <= p41)))))",
"processed_size": 501,
"rewrites": 551
},
"result":
{
"edges": 16,
"markings": 16,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 44,
"adisj": 3,
"aneg": 3,
"comp": 100,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 100,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 29,
"visible_transitions": 0
},
"processed": "G (F (((((p4 <= 0) OR (p22 <= 0)) AND ((p5 <= 0) OR (p24 <= 0)) AND ((p5 <= 0) OR (p25 <= 0)) AND ((p5 <= 0) OR (p22 <= 0)) AND ((p5 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p22 <= 0)) AND ((p6 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p24 <= 0)) AND ((p6 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p24 <= 0)) AND ((p7 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p22 <= 0)) AND ((p7 <= 0) OR (p23 <= 0)) AND ((p8 <= 0) OR (p23 <= 0)) AND ((p8 <= 0) OR (p24 <= 0)) AND ((p8 <= 0) OR (p25 <= 0)) AND ((p8 <= 0) OR (p22 <= 0)) AND ((p4 <= 0) OR (p23 <= 0)) AND ((p4 <= 0) OR (p24 <= 0)) AND ((p4 <= 0) OR (p25 <= 0))) AND G (((((p67 <= 0) OR (p74 <= 0) OR (p75 <= 0) OR (p76 <= 0) OR (p77 <= 0)) AND ((p68 <= 0) OR (p78 <= 0) OR (p79 <= 0) OR (p80 <= 0) OR (p81 <= 0)) AND ((p69 <= 0) OR (p82 <= 0) OR (p83 <= 0) OR (p84 <= 0) OR (p85 <= 0)) AND ((p66 <= 0) OR (p70 <= 0) OR (p71 <= 0) OR (p72 <= 0) OR (p73 <= 0))) R (((p4 <= 0) OR (p22 <= 0)) AND ((p5 <= 0) OR (p24 <= 0)) AND ((p5 <= 0) OR (p25 <= 0)) AND ((p5 <= 0) OR (p22 <= 0)) AND ((p5 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p22 <= 0)) AND ((p6 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p24 <= 0)) AND ((p6 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p24 <= 0)) AND ((p7 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p22 <= 0)) AND ((p7 <= 0) OR (p23 <= 0)) AND ((p8 <= 0) OR (p23 <= 0)) AND ((p8 <= 0) OR (p24 <= 0)) AND ((p8 <= 0) OR (p25 <= 0)) AND ((p8 <= 0) OR (p22 <= 0)) AND ((p4 <= 0) OR (p23 <= 0)) AND ((p4 <= 0) OR (p24 <= 0)) AND ((p4 <= 0) OR (p25 <= 0))))))))",
"processed_size": 1563,
"rewrites": 551
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 21,
"adisj": 5,
"aneg": 0,
"comp": 60,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 60,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 29,
"visible_transitions": 0
},
"processed": "F ((G (F ((((p67 <= 0) OR (p74 <= 0) OR (p75 <= 0) OR (p76 <= 0) OR (p77 <= 0)) AND ((p68 <= 0) OR (p78 <= 0) OR (p79 <= 0) OR (p80 <= 0) OR (p81 <= 0)) AND ((p69 <= 0) OR (p82 <= 0) OR (p83 <= 0) OR (p84 <= 0) OR (p85 <= 0)) AND ((p66 <= 0) OR (p70 <= 0) OR (p71 <= 0) OR (p72 <= 0) OR (p73 <= 0))))) OR G ((((1 <= p4) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p24)) OR ((1 <= p5) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p24)) OR ((1 <= p6) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p24)) OR ((1 <= p8) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p23)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p25))))))",
"processed_size": 944,
"rewrites": 551
},
"result":
{
"edges": 76276,
"markings": 27991,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3563
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 24,
"aneg": 0,
"comp": 48,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "(((p5 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p40 <= 0)) AND ((p8 <= 0) OR (p41 <= 0)) AND ((p12 <= 0) OR (p97 <= 0)) AND ((p12 <= 0) OR (p95 <= 0)) AND ((p12 <= 0) OR (p96 <= 0)) AND ((p12 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p95 <= 0)) AND ((p11 <= 0) OR (p96 <= 0)) AND ((p11 <= 0) OR (p97 <= 0)) AND ((p13 <= 0) OR (p94 <= 0)) AND ((p13 <= 0) OR (p95 <= 0)) AND ((p13 <= 0) OR (p96 <= 0)) AND ((p13 <= 0) OR (p97 <= 0)) AND ((p9 <= 0) OR (p94 <= 0)) AND ((p9 <= 0) OR (p95 <= 0)) AND ((p9 <= 0) OR (p96 <= 0)) AND ((p9 <= 0) OR (p97 <= 0)) AND ((p10 <= 0) OR (p95 <= 0)) AND ((p10 <= 0) OR (p96 <= 0)) AND ((p10 <= 0) OR (p94 <= 0)) AND ((p10 <= 0) OR (p97 <= 0)))",
"processed_size": 757,
"rewrites": 596
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 24,
"adisj": 2,
"aneg": 2,
"comp": 60,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 60,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 29,
"visible_transitions": 0
},
"processed": "((((p12 <= 0) OR (p97 <= 0)) AND ((p12 <= 0) OR (p95 <= 0)) AND ((p12 <= 0) OR (p96 <= 0)) AND ((p12 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p95 <= 0)) AND ((p11 <= 0) OR (p96 <= 0)) AND ((p11 <= 0) OR (p97 <= 0)) AND ((p13 <= 0) OR (p94 <= 0)) AND ((p13 <= 0) OR (p95 <= 0)) AND ((p13 <= 0) OR (p96 <= 0)) AND ((p13 <= 0) OR (p97 <= 0)) AND ((p9 <= 0) OR (p94 <= 0)) AND ((p9 <= 0) OR (p95 <= 0)) AND ((p9 <= 0) OR (p96 <= 0)) AND ((p9 <= 0) OR (p97 <= 0)) AND ((p10 <= 0) OR (p95 <= 0)) AND ((p10 <= 0) OR (p96 <= 0)) AND ((p10 <= 0) OR (p94 <= 0)) AND ((p10 <= 0) OR (p97 <= 0))) R (((p67 <= 0) OR (p74 <= 0) OR (p75 <= 0) OR (p76 <= 0) OR (p77 <= 0)) AND ((p68 <= 0) OR (p78 <= 0) OR (p79 <= 0) OR (p80 <= 0) OR (p81 <= 0)) AND ((p69 <= 0) OR (p82 <= 0) OR (p83 <= 0) OR (p84 <= 0) OR (p85 <= 0)) AND ((p66 <= 0) OR (p70 <= 0) OR (p71 <= 0) OR (p72 <= 0) OR (p73 <= 0))))",
"processed_size": 943,
"rewrites": 551
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 24,
"aneg": 0,
"comp": 48,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "(((p5 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p40 <= 0)) AND ((p8 <= 0) OR (p41 <= 0)) AND ((p12 <= 0) OR (p97 <= 0)) AND ((p12 <= 0) OR (p95 <= 0)) AND ((p12 <= 0) OR (p96 <= 0)) AND ((p12 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p95 <= 0)) AND ((p11 <= 0) OR (p96 <= 0)) AND ((p11 <= 0) OR (p97 <= 0)) AND ((p13 <= 0) OR (p94 <= 0)) AND ((p13 <= 0) OR (p95 <= 0)) AND ((p13 <= 0) OR (p96 <= 0)) AND ((p13 <= 0) OR (p97 <= 0)) AND ((p9 <= 0) OR (p94 <= 0)) AND ((p9 <= 0) OR (p95 <= 0)) AND ((p9 <= 0) OR (p96 <= 0)) AND ((p9 <= 0) OR (p97 <= 0)) AND ((p10 <= 0) OR (p95 <= 0)) AND ((p10 <= 0) OR (p96 <= 0)) AND ((p10 <= 0) OR (p94 <= 0)) AND ((p10 <= 0) OR (p97 <= 0)))",
"processed_size": 757,
"rewrites": 596
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 20,
"adisj": 1,
"aneg": 1,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "F (G ((((p12 <= 0) OR (p97 <= 0)) AND ((p12 <= 0) OR (p95 <= 0)) AND ((p12 <= 0) OR (p96 <= 0)) AND ((p12 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p95 <= 0)) AND ((p11 <= 0) OR (p96 <= 0)) AND ((p11 <= 0) OR (p97 <= 0)) AND ((p13 <= 0) OR (p94 <= 0)) AND ((p13 <= 0) OR (p95 <= 0)) AND ((p13 <= 0) OR (p96 <= 0)) AND ((p13 <= 0) OR (p97 <= 0)) AND ((p9 <= 0) OR (p94 <= 0)) AND ((p9 <= 0) OR (p95 <= 0)) AND ((p9 <= 0) OR (p96 <= 0)) AND ((p9 <= 0) OR (p97 <= 0)) AND ((p10 <= 0) OR (p95 <= 0)) AND ((p10 <= 0) OR (p96 <= 0)) AND ((p10 <= 0) OR (p94 <= 0)) AND ((p10 <= 0) OR (p97 <= 0)))))",
"processed_size": 641,
"rewrites": 551
},
"result":
{
"edges": 243,
"markings": 182,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 179144,
"runtime": 7.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G(((** U **) AND F(**)))) : F(**) : (X(F(**)) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))))))))))))) : G(F((* AND G((* R *))))) : F((G(F(**)) OR G(**))) : (X(**) OR (G((G(*) OR *)) AND X(F(**)))) : G(F(**)) : (F(G(*)) AND ((* R *) AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND **))))))))))))))))))))))))) : F(G(**)) : X((X(G(*)) OR **)) : F((X(**) OR (** OR (** OR (** OR **))))) : (X(F((G(**) OR *))) U **)"
},
"net":
{
"arcs": 768,
"conflict_clusters": 7,
"places": 102,
"places_significant": 76,
"singleton_clusters": 0,
"transitions": 180
},
"result":
{
"preliminary_value": "no yes no no no yes no no no yes yes yes ",
"value": "no yes no no no yes no no no yes yes yes "
},
"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: 282/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 102
lola: finding significant places
lola: 102 places, 180 transitions, 76 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: G (X ((((((1 <= p14) AND (1 <= p42)) OR ((1 <= p18) AND (1 <= p44)) OR ((1 <= p16) AND (1 <= p43)) OR ((1 <= p15) AND (1 <= p42)) OR ((1 <= p21) AND (1 <= p45)) OR ((1 <= p20) AND (1 <= p45)) OR ((1 <= p17) AND (1 <= p43)) OR ((1 <= p19) AND (1 <= p44))) U (((p10 <= 0) OR (p31 <= 0)) AND ((p10 <= 0) OR (p32 <= 0)) AND ((p10 <= 0) OR (p33 <= 0)) AND ((p13 <= 0) OR (p31 <= 0)) AND ((p13 <= 0) OR (p30 <= 0)) AND ((p11 <= 0) OR (p32 <= 0)) AND ((p11 <= 0) OR (p33 <= 0)) AND ((p11 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p33 <= 0)) AND ((p11 <= 0) OR (p31 <= 0)) AND ((p13 <= 0) OR (p32 <= 0)) AND ((p12 <= 0) OR (p33 <= 0)) AND ((p12 <= 0) OR (p30 <= 0)) AND ((p12 <= 0) OR (p32 <= 0)) AND ((p10 <= 0) OR (p30 <= 0)) AND ((p12 <= 0) OR (p31 <= 0)))) AND F (((((1 <= p10) AND (1 <= p31)) OR ((1 <= p10) AND (1 <= p32)) OR ((1 <= p10) AND (1 <= p33)) OR ((1 <= p13) AND (1 <= p31)) OR ((1 <= p13) AND (1 <= p30)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p11) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p30)) OR ((1 <= p13) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p31)) OR ((1 <= p13) AND (1 <= p32)) OR ((1 <= p12) AND (1 <= p33)) OR ((1 <= p12) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p32)) OR ((1 <= p10) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p31))) U F ((((1 <= p18) AND (1 <= p56) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p64) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p63) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p59) AND (1 <= p68)) OR ((1 <= p16) AND (1 <= p55) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p61) AND (1 <= p68)) OR ((1 <= p20) AND (1 <= p53) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p57) AND (1 <= p67)) OR ((1 <= p20) AND (1 <= p65) AND (1 <= p69)) OR ((1 <= p14) AND (1 <= p54) AND (1 <= p67)) OR ((1 <= p14) AND (1 <= p58) AND (1 <= p68)) OR ((1 <= p14) AND (1 <= p50) AND (1 <= p66)) OR ((1 <= p14) AND (1 <= p62) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p51) AND (1 <= p66)) OR ((1 <= p18) AND (1 <= p60) AND (1 <= p68))))))))) : F ((((1 <= p9) AND (1 <= p32)) OR ((1 <= p9) AND (1 <= p33)) OR ((1 <= p9) AND (1 <= p30)) OR ((1 <= p9) AND (1 <= p31)))) : ((((((((((((((((((((F (X ((((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p87)) OR ((1 <= p9) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p87))))) OR ((1 <= p18) AND (1 <= p56) AND (1 <= p67))) OR ((1 <= p18) AND (1 <= p64) AND (1 <= p69))) OR ((1 <= p16) AND (1 <= p63) AND (1 <= p69))) OR ((1 <= p16) AND (1 <= p59) AND (1 <= p68))) OR ((1 <= p16) AND (1 <= p55) AND (1 <= p67))) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p66))) OR ((1 <= p20) AND (1 <= p61) AND (1 <= p68))) OR ((1 <= p20) AND (1 <= p53) AND (1 <= p66))) OR ((1 <= p20) AND (1 <= p57) AND (1 <= p67))) OR ((1 <= p20) AND (1 <= p65) AND (1 <= p69))) OR ((1 <= p14) AND (1 <= p54) AND (1 <= p67))) OR ((1 <= p14) AND (1 <= p58) AND (1 <= p68))) OR ((1 <= p14) AND (1 <= p50) AND (1 <= p66))) OR ((1 <= p14) AND (1 <= p62) AND (1 <= p69))) OR ((1 <= p16) AND (1 <= p51) AND (1 <= p66))) OR ((1 <= p18) AND (1 <= p60) AND (1 <= p68))) OR ((1 <= p15) AND (1 <= p42))) OR ((1 <= p21) AND (1 <= p45))) OR ((1 <= p17) AND (1 <= p43))) OR ((1 <= p19) AND (1 <= p44))) : G (F (X ((NOT(X ((((1 <= p4) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p24)) OR ((1 <= p5) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p24)) OR ((1 <= p6) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p24)) OR ((1 <= p8) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p23)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p25))))) AND X (G (NOT(((((1 <= p67) AND (1 <= p74) AND (1 <= p75) AND (1 <= p76) AND (1 <= p77)) OR ((1 <= p68) AND (1 <= p78) AND (1 <= p79) AND (1 <= p80) AND (1 <= p81)) OR ((1 <= p69) AND (1 <= p82) AND (1 <= p83) AND (1 <= p84) AND (1 <= p85)) OR ((1 <= p66) AND (1 <= p70) AND (1 <= p71) AND (1 <= p72) AND (1 <= p73))) U (((1 <= p4) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p24)) OR ((1 <= p5) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p24)) OR ((1 <= p6) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p24)) OR ((1 <= p8) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p23)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p25))))))))))) : F ((((F ((((1 <= p9) AND (1 <= p32)) OR ((1 <= p9) AND (1 <= p33)) OR ((1 <= p9) AND (1 <= p30)) OR ((1 <= p9) AND (1 <= p31)))) OR (((p9 <= 0) OR (p91 <= 0)) AND ((p9 <= 0) OR (p92 <= 0)) AND ((p9 <= 0) OR (p93 <= 0)) AND ((p9 <= 0) OR (p90 <= 0)))) U G (F (X ((((p67 <= 0) OR (p74 <= 0) OR (p75 <= 0) OR (p76 <= 0) OR (p77 <= 0)) AND ((p68 <= 0) OR (p78 <= 0) OR (p79 <= 0) OR (p80 <= 0) OR (p81 <= 0)) AND ((p69 <= 0) OR (p82 <= 0) OR (p83 <= 0) OR (p84 <= 0) OR (p85 <= 0)) AND ((p66 <= 0) OR (p70 <= 0) OR (p71 <= 0) OR (p72 <= 0) OR (p73 <= 0))))))) OR G ((((1 <= p4) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p24)) OR ((1 <= p5) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p24)) OR ((1 <= p6) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p24)) OR ((1 <= p8) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p23)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p25)))))) : (NOT(F ((((((1 <= p5) AND (1 <= p38)) OR ((1 <= p6) AND (1 <= p39)) OR ((1 <= p7) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p41))) U F ((((1 <= p5) AND (1 <= p38)) OR ((1 <= p6) AND (1 <= p39)) OR ((1 <= p7) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p41))))) AND (((1 <= p6) AND (1 <= p41)) OR ((1 <= p8) AND (1 <= p38)) OR ((1 <= p4) AND (1 <= p39)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p8) AND (1 <= p39)) OR ((1 <= p6) AND (1 <= p38)) OR ((1 <= p8) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p38)) OR ((1 <= p6) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p38)) OR ((1 <= p7) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p41)) OR ((1 <= p5) AND (1 <= p39)) OR ((1 <= p7) AND (1 <= p41)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p10) AND (1 <= p32)) OR ((1 <= p10) AND (1 <= p33)) OR ((1 <= p13) AND (1 <= p31)) OR ((1 <= p13) AND (1 <= p30)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p11) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p30)) OR ((1 <= p13) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p31)) OR ((1 <= p13) AND (1 <= p32)) OR ((1 <= p12) AND (1 <= p33)) OR ((1 <= p12) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p32)) OR ((1 <= p10) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p31)))))) U X ((((p6 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p38 <= 0)) AND ((p4 <= 0) OR (p39 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p40 <= 0)) AND ((p5 <= 0) OR (p41 <= 0)) AND ((p5 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p41 <= 0))))) : G (X (F ((((1 <= p6) AND (1 <= p41)) OR ((1 <= p8) AND (1 <= p38)) OR ((1 <= p4) AND (1 <= p39)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p8) AND (1 <= p39)) OR ((1 <= p6) AND (1 <= p38)) OR ((1 <= p8) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p38)) OR ((1 <= p6) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p38)) OR ((1 <= p7) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p41)) OR ((1 <= p5) AND (1 <= p39)) OR ((1 <= p7) AND (1 <= p41)))))) : (((((((((((((((((((((((((NOT(G (X (X (F ((((1 <= p12) AND (1 <= p97)) OR ((1 <= p12) AND (1 <= p95)) OR ((1 <= p12) AND (1 <= p96)) OR ((1 <= p12) AND (1 <= p94)) OR ((1 <= p11) AND (1 <= p94)) OR ((1 <= p11) AND (1 <= p95)) OR ((1 <= p11) AND (1 <= p96)) OR ((1 <= p11) AND (1 <= p97)) OR ((1 <= p13) AND (1 <= p94)) OR ((1 <= p13) AND (1 <= p95)) OR ((1 <= p13) AND (1 <= p96)) OR ((1 <= p13) AND (1 <= p97)) OR ((1 <= p9) AND (1 <= p94)) OR ((1 <= p9) AND (1 <= p95)) OR ((1 <= p9) AND (1 <= p96)) OR ((1 <= p9) AND (1 <= p97)) OR ((1 <= p10) AND (1 <= p95)) OR ((1 <= p10) AND (1 <= p96)) OR ((1 <= p10) AND (1 <= p94)) OR ((1 <= p10) AND (1 <= p97)))))))) AND NOT(((((1 <= p12) AND (1 <= p97)) OR ((1 <= p12) AND (1 <= p95)) OR ((1 <= p12) AND (1 <= p96)) OR ((1 <= p12) AND (1 <= p94)) OR ((1 <= p11) AND (1 <= p94)) OR ((1 <= p11) AND (1 <= p95)) OR ((1 <= p11) AND (1 <= p96)) OR ((1 <= p11) AND (1 <= p97)) OR ((1 <= p13) AND (1 <= p94)) OR ((1 <= p13) AND (1 <= p95)) OR ((1 <= p13) AND (1 <= p96)) OR ((1 <= p13) AND (1 <= p97)) OR ((1 <= p9) AND (1 <= p94)) OR ((1 <= p9) AND (1 <= p95)) OR ((1 <= p9) AND (1 <= p96)) OR ((1 <= p9) AND (1 <= p97)) OR ((1 <= p10) AND (1 <= p95)) OR ((1 <= p10) AND (1 <= p96)) OR ((1 <= p10) AND (1 <= p94)) OR ((1 <= p10) AND (1 <= p97))) U (((1 <= p67) AND (1 <= p74) AND (1 <= p75) AND (1 <= p76) AND (1 <= p77)) OR ((1 <= p68) AND (1 <= p78) AND (1 <= p79) AND (1 <= p80) AND (1 <= p81)) OR ((1 <= p69) AND (1 <= p82) AND (1 <= p83) AND (1 <= p84) AND (1 <= p85)) OR ((1 <= p66) AND (1 <= p70) AND (1 <= p71) AND (1 <= p72) AND (1 <= p73)))))) AND ((p5 <= 0) OR (p38 <= 0))) AND ((p6 <= 0) OR (p39 <= 0))) AND ((p7 <= 0) OR (p40 <= 0))) AND ((p8 <= 0) OR (p41 <= 0))) AND ((p12 <= 0) OR (p97 <= 0))) AND ((p12 <= 0) OR (p95 <= 0))) AND ((p12 <= 0) OR (p96 <= 0))) AND ((p12 <= 0) OR (p94 <= 0))) AND ((p11 <= 0) OR (p94 <= 0))) AND ((p11 <= 0) OR (p95 <= 0))) AND ((p11 <= 0) OR (p96 <= 0))) AND ((p11 <= 0) OR (p97 <= 0))) AND ((p13 <= 0) OR (p94 <= 0))) AND ((p13 <= 0) OR (p95 <= 0))) AND ((p13 <= 0) OR (p96 <= 0))) AND ((p13 <= 0) OR (p97 <= 0))) AND ((p9 <= 0) OR (p94 <= 0))) AND ((p9 <= 0) OR (p95 <= 0))) AND ((p9 <= 0) OR (p96 <= 0))) AND ((p9 <= 0) OR (p97 <= 0))) AND ((p10 <= 0) OR (p95 <= 0))) AND ((p10 <= 0) OR (p96 <= 0))) AND ((p10 <= 0) OR (p94 <= 0))) AND ((p10 <= 0) OR (p97 <= 0))) : F (X (G ((((p9 <= 0) OR (p91 <= 0)) AND ((p9 <= 0) OR (p92 <= 0)) AND ((p9 <= 0) OR (p93 <= 0)) AND ((p9 <= 0) OR (p90 <= 0)))))) : X ((NOT(F (X ((((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p87)) OR ((1 <= p9) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p87)))))) OR (((p6 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p38 <= 0)) AND ((p4 <= 0) OR (p39 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p40 <= 0)) AND ((p5 <= 0) OR (p41 <= 0)) AND ((p5 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p41 <= 0))))) : F (((((X ((((1 <= p12) AND (1 <= p97)) OR ((1 <= p12) AND (1 <= p95)) OR ((1 <= p12) AND (1 <= p96)) OR ((1 <= p12) AND (1 <= p94)) OR ((1 <= p11) AND (1 <= p94)) OR ((1 <= p11) AND (1 <= p95)) OR ((1 <= p11) AND (1 <= p96)) OR ((1 <= p11) AND (1 <= p97)) OR ((1 <= p13) AND (1 <= p94)) OR ((1 <= p13) AND (1 <= p95)) OR ((1 <= p13) AND (1 <= p96)) OR ((1 <= p13) AND (1 <= p97)) OR ((1 <= p9) AND (1 <= p94)) OR ((1 <= p9) AND (1 <= p95)) OR ((1 <= p9) AND (1 <= p96)) OR ((1 <= p9) AND (1 <= p97)) OR ((1 <= p10) AND (1 <= p95)) OR ((1 <= p10) AND (1 <= p96)) OR ((1 <= p10) AND (1 <= p94)) OR ((1 <= p10) AND (1 <= p97)))) OR ((1 <= p5) AND (1 <= p38))) OR ((1 <= p6) AND (1 <= p39))) OR ((1 <= p7) AND (1 <= p40))) OR ((1 <= p8) AND (1 <= p41)))) : (NOT(G (X ((NOT(G ((((1 <= p20) AND (1 <= p29)) OR ((1 <= p16) AND (1 <= p27)) OR ((1 <= p15) AND (1 <= p26)) OR ((1 <= p21) AND (1 <= p29)) OR ((1 <= p14) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p28))))) AND (((1 <= p20) AND (1 <= p29)) OR ((1 <= p16) AND (1 <= p27)) OR ((1 <= p15) AND (1 <= p26)) OR ((1 <= p21) AND (1 <= p29)) OR ((1 <= p14) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p28)) OR ((1 <= p67) AND (1 <= p74) AND (1 <= p75) AND (1 <= p76) AND (1 <= p77)) OR ((1 <= p68) AND (1 <= p78) AND (1 <= p79) AND (1 <= p80) AND (1 <= p81)) OR ((1 <= p69) AND (1 <= p82) AND (1 <= p83) AND (1 <= p84) AND (1 <= p85)) OR ((1 <= p66) AND (1 <= p70) AND (1 <= p71) AND (1 <= p72) AND (1 <= p73))))))) U (((1 <= p4) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p24)) OR ((1 <= p5) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p24)) OR ((1 <= p6) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p24)) OR ((1 <= p8) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p23)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p25))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k: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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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: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: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: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: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: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: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: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: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: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: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: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: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: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: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: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: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: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: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: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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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 (G ((((((1 <= p14) AND (1 <= p42)) OR ((1 <= p18) AND (1 <= p44)) OR ((1 <= p16) AND (1 <= p43)) OR ((1 <= p15) AND (1 <= p42)) OR ((1 <= p21) AND (1 <= p45)) OR ((1 <= p20) AND (1 <= p45)) OR ((1 <= p17) AND (1 <= p43)) OR ((1 <= p19) AND (1 <= p44))) U (((p10 <= 0) OR (p31 <= 0)) AND ((p10 <= 0) OR (p32 <= 0)) AND ((p10 <= 0) OR (p33 <= 0)) AND ((p13 <= 0) OR (p31 <= 0)) AND ((p13 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((((1 <= p14) AND (1 <= p42)) OR ((1 <= p18) AND (1 <= p44)) OR ((1 <= p16) AND (1 <= p43)) OR ((1 <= p15) AND (1 <= p42)) OR ((1 <= p21) AND (1 <= p45)) OR ((1 <= p20) AND (1 <= p45)) OR ((1 <= p17) AND (1 <= p43)) OR ((1 <= p19) AND (1 <= p44))) U (((p10 <= 0) OR (p31 <= 0)) AND ((p10 <= 0) OR (p32 <= 0)) AND ((p10 <= 0) OR (p33 <= 0)) AND ((p13 <= 0) OR (p31 <= 0)) AND ((p13 <... (shortened)
lola: processed formula length: 1535
lola: 551 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 9 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9)... (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: (((1 <= p18) AND (1 <= p56) AND (1 <= p67)) OR (((1 <= p18) AND (1 <= p64) AND (1 <= p69)) OR (((1 <= p16) AND (1 <= p63) AND (1 <= p69)) OR (((1 <= p16) AND (1 <= p59) AND (1 <= p68)) OR (((1 <= p16) AND (1 <= p55) AND (1 <= p67)) OR (((1 <= p18) AND (1 <= p52) AND (1 <= p66)) OR (((1 <= p20) AND (1 <= p61) AND (1 <= p68)) OR (((1 <= p20) AND (1 <= p53) AND (1 <= p66)) OR (((1 <= p20) AND (1 <= p... (shortened)
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: 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 <= p18) AND (1 <= p56) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p64) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p63) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p59) AND (1 <= p68)) OR ((1 <= p16) AND (1 <= p55) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p61) AND (1 <= p68)) OR ((1 <= p20) AND (1 <= p53) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p57) AND ... (shortened)
lola: processed formula length: 858
lola: 588 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 56 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9) ... (shortened)
lola: processed formula length: 513
lola: 551 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 9 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 ((((p6 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p38 <= 0)) AND ((p4 <= 0) OR (p39 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p40 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((((p5 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p40 <= 0)) AND ((p8 <= 0) OR (p41 <= 0)))) OR (((p6 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p38 <= 0)) AND ((p4 <= 0) OR (p39 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((((p5 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p40 <= 0)) AND ((p8 <= 0) OR (p41 <= 0)))) OR (((p6 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p38 <= 0)) AND ((p4 <= 0) OR (p39 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p3... (shortened)
lola: processed formula length: 1140
lola: 551 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: 176 markings, 230 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p6 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p38 <= 0)) AND ((p4 <= 0) OR (p39 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p40 <= 0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p6 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p38 <= 0)) AND ((p4 <= 0) OR (p39 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p40 <= 0... (shortened)
lola: processed formula length: 497
lola: 551 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((((p11 <= 0) OR (p86 <= 0)) AND ((p11 <= 0) OR (p88 <= 0)) AND ((p9 <= 0) OR (p89 <= 0)) AND ((p9 <= 0) OR (p88 <= 0)) AND ((p11 <= 0) OR (p89 <= 0)) AND ((p12 <= 0) OR (p89 <= 0)) AND ((p12 <= 0) OR (p87 <= 0)) AND ((p12 <= 0) OR (p86 <= 0)) AND ((p10 <= 0) OR (p89 <= 0)) AND ((p10 <= 0) OR (p87 <= 0)) AND ((p10 <= 0) OR (p88 <= 0)) AND ((p13 <= 0) OR (p88 <= 0)) AND ((p9 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((((p11 <= 0) OR (p86 <= 0)) AND ((p11 <= 0) OR (p88 <= 0)) AND ((p9 <= 0) OR (p89 <= 0)) AND ((p9 <= 0) OR (p88 <= 0)) AND ((p11 <= 0) OR (p89 <= 0)) AND ((p12 <= 0) OR (p89 <= 0)) AND ((p12 <= 0) OR (p87 <= 0)) AND ((p12 <= 0) OR (p86 <= 0)) AND ((p10 <= 0) OR (p89 <= 0)) AND ((p10 <= 0) OR (p87 <= 0)) AND ((p10 <= 0) OR (p88 <= 0)) AND ((p13 <= 0) OR (p88 <= 0)) AND ((p9 <=... (shortened)
lola: processed formula length: 1016
lola: 551 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((((1 <= p12) AND (1 <= p97)) OR ((1 <= p12) AND (1 <= p95)) OR ((1 <= p12) AND (1 <= p96)) OR ((1 <= p12) AND (1 <= p94)) OR ((1 <= p11) AND (1 <= p94)) OR ((1 <= p11) AND (1 <= p95)) OR ((1 <= p11) AND (1 <= p96)) OR ((1 <= p11) AND (1 <= p97)) OR ((1 <= p13) AND (1 <= p94)) OR ((1 <= p13) AND (1 <= p95)) OR ((1 <= p13) AND (1 <= p96)) OR ((1 <= p13) AND (1 <= p97)) OR ((1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((((1 <= p12) AND (1 <= p97)) OR ((1 <= p12) AND (1 <= p95)) OR ((1 <= p12) AND (1 <= p96)) OR ((1 <= p12) AND (1 <= p94)) OR ((1 <= p11) AND (1 <= p94)) OR ((1 <= p11) AND (1 <= p95)) OR ((1 <= p11) AND (1 <= p96)) OR ((1 <= p11) AND (1 <= p97)) OR ((1 <= p13) AND (1 <= p94)) OR ((1 <= p13) AND (1 <= p95)) OR ((1 <= p13) AND (1 <= p96)) OR ((1 <= p13) AND (1 <= p97)) OR ((1 <= p... (shortened)
lola: processed formula length: 769
lola: 551 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: 316320 markings, 1419660 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((G ((((1 <= p20) AND (1 <= p29)) OR ((1 <= p16) AND (1 <= p27)) OR ((1 <= p15) AND (1 <= p26)) OR ((1 <= p21) AND (1 <= p29)) OR ((1 <= p14) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p28)))) OR (((p20 <= 0) OR (p29 <= 0)) AND ((p16 <= 0) OR (p27 <= 0)) AND ((p15 <= 0) OR (p26 <= 0)) AND ((p21 <= 0) OR (p29 <= 0)) AND ((... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (F ((G ((((1 <= p20) AND (1 <= p29)) OR ((1 <= p16) AND (1 <= p27)) OR ((1 <= p15) AND (1 <= p26)) OR ((1 <= p21) AND (1 <= p29)) OR ((1 <= p14) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p28)))) OR (((p20 <= 0) OR (p29 <= 0)) AND ((p16 <= 0) OR (p27 <= 0)) AND ((p15 <= 0) OR (p26 <= 0)) AND ((p21 <= 0) OR (p29 <= 0)) AND ((... (shortened)
lola: processed formula length: 1454
lola: 551 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 6 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p9) AND (1 <= p32)) OR ((1 <= p9) AND (1 <= p33)) OR ((1 <= p9) AND (1 <= p30)) OR ((1 <= p9) AND (1 <= p31))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p9 <= 0) OR (p32 <= 0)) AND ((p9 <= 0) OR (p33 <= 0)) AND ((p9 <= 0) OR (p30 <= 0)) AND ((p9 <= 0) OR (p31 <= 0)))
lola: processed formula length: 121
lola: 553 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 16 markings, 32 edges
lola: ========================================
lola: subprocess 7 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p9 <= 0) OR (p91 <= 0)) AND ((p9 <= 0) OR (p92 <= 0)) AND ((p9 <= 0) OR (p93 <= 0)) AND ((p9 <= 0) OR (p90 <= 0)))))
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 ((((p9 <= 0) OR (p91 <= 0)) AND ((p9 <= 0) OR (p92 <= 0)) AND ((p9 <= 0) OR (p93 <= 0)) AND ((p9 <= 0) OR (p90 <= 0)))))
lola: processed formula length: 129
lola: 551 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 1
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: 234 markings, 288 edges
lola: ========================================
lola: subprocess 8 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p6) AND (1 <= p41)) OR ((1 <= p8) AND (1 <= p38)) OR ((1 <= p4) AND (1 <= p39)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p8) AND (1 <= p39)) OR ((1 <= p6) AND (1 <= p38)) OR ((1 <= p8) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p38)) OR ((1 <= p6) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p38)) OR ((1 <= p7) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= ... (shortened)
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 <= p6) AND (1 <= p41)) OR ((1 <= p8) AND (1 <= p38)) OR ((1 <= p4) AND (1 <= p39)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p8) AND (1 <= p39)) OR ((1 <= p6) AND (1 <= p38)) OR ((1 <= p8) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p38)) OR ((1 <= p6) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p38)) OR ((1 <= p7) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= ... (shortened)
lola: processed formula length: 501
lola: 551 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: 16 markings, 16 edges
lola: ========================================
lola: subprocess 9 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((((p4 <= 0) OR (p22 <= 0)) AND ((p5 <= 0) OR (p24 <= 0)) AND ((p5 <= 0) OR (p25 <= 0)) AND ((p5 <= 0) OR (p22 <= 0)) AND ((p5 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p22 <= 0)) AND ((p6 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p24 <= 0)) AND ((p6 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p24 <= 0)) AND ((p7 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p22 <= 0)) AND ((p7 <= 0) OR (p23 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((((p4 <= 0) OR (p22 <= 0)) AND ((p5 <= 0) OR (p24 <= 0)) AND ((p5 <= 0) OR (p25 <= 0)) AND ((p5 <= 0) OR (p22 <= 0)) AND ((p5 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p22 <= 0)) AND ((p6 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p24 <= 0)) AND ((p6 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p24 <= 0)) AND ((p7 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p22 <= 0)) AND ((p7 <= 0) OR (p23 ... (shortened)
lola: processed formula length: 1563
lola: 551 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 10 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F ((((p67 <= 0) OR (p74 <= 0) OR (p75 <= 0) OR (p76 <= 0) OR (p77 <= 0)) AND ((p68 <= 0) OR (p78 <= 0) OR (p79 <= 0) OR (p80 <= 0) OR (p81 <= 0)) AND ((p69 <= 0) OR (p82 <= 0) OR (p83 <= 0) OR (p84 <= 0) OR (p85 <= 0)) AND ((p66 <= 0) OR (p70 <= 0) OR (p71 <= 0) OR (p72 <= 0) OR (p73 <= 0))))) OR G ((((1 <= p4) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p24)) OR ((1 <= p5) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F ((((p67 <= 0) OR (p74 <= 0) OR (p75 <= 0) OR (p76 <= 0) OR (p77 <= 0)) AND ((p68 <= 0) OR (p78 <= 0) OR (p79 <= 0) OR (p80 <= 0) OR (p81 <= 0)) AND ((p69 <= 0) OR (p82 <= 0) OR (p83 <= 0) OR (p84 <= 0) OR (p85 <= 0)) AND ((p66 <= 0) OR (p70 <= 0) OR (p71 <= 0) OR (p72 <= 0) OR (p73 <= 0))))) OR G ((((1 <= p4) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p24)) OR ((1 <= p5) AN... (shortened)
lola: processed formula length: 944
lola: 551 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: 27991 markings, 76276 edges
lola: ========================================
lola: subprocess 11 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((((p12 <= 0) OR (p97 <= 0)) AND ((p12 <= 0) OR (p95 <= 0)) AND ((p12 <= 0) OR (p96 <= 0)) AND ((p12 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p95 <= 0)) AND ((p11 <= 0) OR (p96 <= 0)) AND ((p11 <= 0) OR (p97 <= 0)) AND ((p13 <= 0) OR (p94 <= 0)) AND ((p13 <= 0) OR (p95 <= 0)) AND ((p13 <= 0) OR (p96 <= 0)) AND ((p13 <= 0) OR (p97 <= 0)) AND ((p9 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p5 <= 0) OR (p38 <= 0)) AND (((p6 <= 0) OR (p39 <= 0)) AND (((p7 <= 0) OR (p40 <= 0)) AND (((p8 <= 0) OR (p41 <= 0)) AND (((p12 <= 0) OR (p97 <= 0)) AND (((p12 <= 0) OR (p95 <= 0)) AND (((p12 <= 0) OR (p96 <= 0)) AND (((p12 <= 0) OR (p94 <= 0)) AND (((p11 <= 0) OR (p94 <= 0)) AND (((p11 <= 0) OR (p95 <= 0)) AND (((p11 <= 0) OR (p96 <= 0)) AND (((p11 <= 0) OR (p97 <= 0)) AND (((p13 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: (((p5 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p40 <= 0)) AND ((p8 <= 0) OR (p41 <= 0)) AND ((p12 <= 0) OR (p97 <= 0)) AND ((p12 <= 0) OR (p95 <= 0)) AND ((p12 <= 0) OR (p96 <= 0)) AND ((p12 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p95 <= 0)) AND ((p11 <= 0) OR (p96 <= 0)) AND ((p11 <= 0) OR (p97 <= 0)) AND ((p13 <= 0) OR (p9... (shortened)
lola: processed formula length: 757
lola: 596 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 48 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p12 <= 0) OR (p97 <= 0)) AND ((p12 <= 0) OR (p95 <= 0)) AND ((p12 <= 0) OR (p96 <= 0)) AND ((p12 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p95 <= 0)) AND ((p11 <= 0) OR (p96 <= 0)) AND ((p11 <= 0) OR (p97 <= 0)) AND ((p13 <= 0) OR (p94 <= 0)) AND ((p13 <= 0) OR (p95 <= 0)) AND ((p13 <= 0) OR (p96 <= 0)) AND ((p13 <= 0) OR (p97 <= 0)) AND ((p9 <= 0) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p12 <= 0) OR (p97 <= 0)) AND ((p12 <= 0) OR (p95 <= 0)) AND ((p12 <= 0) OR (p96 <= 0)) AND ((p12 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p95 <= 0)) AND ((p11 <= 0) OR (p96 <= 0)) AND ((p11 <= 0) OR (p97 <= 0)) AND ((p13 <= 0) OR (p94 <= 0)) AND ((p13 <= 0) OR (p95 <= 0)) AND ((p13 <= 0) OR (p96 <= 0)) AND ((p13 <= 0) OR (p97 <= 0)) AND ((p9 <= 0) OR ... (shortened)
lola: processed formula length: 943
lola: 551 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F (G ((((p12 <= 0) OR (p97 <= 0)) AND ((p12 <= 0) OR (p95 <= 0)) AND ((p12 <= 0) OR (p96 <= 0)) AND ((p12 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p95 <= 0)) AND ((p11 <= 0) OR (p96 <= 0)) AND ((p11 <= 0) OR (p97 <= 0)) AND ((p13 <= 0) OR (p94 <= 0)) AND ((p13 <= 0) OR (p95 <= 0)) AND ((p13 <= 0) OR (p96 <= 0)) AND ((p13 <= 0) OR (p97 <= 0)) AND ((p9 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((p5 <= 0) OR (p38 <= 0)) AND (((p6 <= 0) OR (p39 <= 0)) AND (((p7 <= 0) OR (p40 <= 0)) AND (((p8 <= 0) OR (p41 <= 0)) AND (((p12 <= 0) OR (p97 <= 0)) AND (((p12 <= 0) OR (p95 <= 0)) AND (((p12 <= 0) OR (p96 <= 0)) AND (((p12 <= 0) OR (p94 <= 0)) AND (((p11 <= 0) OR (p94 <= 0)) AND (((p11 <= 0) OR (p95 <= 0)) AND (((p11 <= 0) OR (p96 <= 0)) AND (((p11 <= 0) OR (p97 <= 0)) AND (((p13 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: (((p5 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p40 <= 0)) AND ((p8 <= 0) OR (p41 <= 0)) AND ((p12 <= 0) OR (p97 <= 0)) AND ((p12 <= 0) OR (p95 <= 0)) AND ((p12 <= 0) OR (p96 <= 0)) AND ((p12 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p95 <= 0)) AND ((p11 <= 0) OR (p96 <= 0)) AND ((p11 <= 0) OR (p97 <= 0)) AND ((p13 <= 0) OR (p9... (shortened)
lola: processed formula length: 757
lola: 596 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 48 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((((p12 <= 0) OR (p97 <= 0)) AND ((p12 <= 0) OR (p95 <= 0)) AND ((p12 <= 0) OR (p96 <= 0)) AND ((p12 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p95 <= 0)) AND ((p11 <= 0) OR (p96 <= 0)) AND ((p11 <= 0) OR (p97 <= 0)) AND ((p13 <= 0) OR (p94 <= 0)) AND ((p13 <= 0) OR (p95 <= 0)) AND ((p13 <= 0) OR (p96 <= 0)) AND ((p13 <= 0) OR (p97 <= 0)) AND ((p9 <= 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 (p97 <= 0)) AND ((p12 <= 0) OR (p95 <= 0)) AND ((p12 <= 0) OR (p96 <= 0)) AND ((p12 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p94 <= 0)) AND ((p11 <= 0) OR (p95 <= 0)) AND ((p11 <= 0) OR (p96 <= 0)) AND ((p11 <= 0) OR (p97 <= 0)) AND ((p13 <= 0) OR (p94 <= 0)) AND ((p13 <= 0) OR (p95 <= 0)) AND ((p13 <= 0) OR (p96 <= 0)) AND ((p13 <= 0) OR (p97 <= 0)) AND ((p9 <= 0... (shortened)
lola: processed formula length: 641
lola: 551 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: 182 markings, 243 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no yes no no no yes yes yes
lola:
preliminary result: no yes no no no yes no no no yes yes yes
lola: memory consumption: 179144 KB
lola: time consumption: 7 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="LamportFastMutEx-COL-4"
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 LamportFastMutEx-COL-4, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-162075428500302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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