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.r094-tall-162048902500206.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 DoubleExponent-PT-003, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902500206
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 50K 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 DoubleExponent-PT-003-00
FORMULA_NAME DoubleExponent-PT-003-01
FORMULA_NAME DoubleExponent-PT-003-02
FORMULA_NAME DoubleExponent-PT-003-03
FORMULA_NAME DoubleExponent-PT-003-04
FORMULA_NAME DoubleExponent-PT-003-05
FORMULA_NAME DoubleExponent-PT-003-06
FORMULA_NAME DoubleExponent-PT-003-07
FORMULA_NAME DoubleExponent-PT-003-08
FORMULA_NAME DoubleExponent-PT-003-09
FORMULA_NAME DoubleExponent-PT-003-10
FORMULA_NAME DoubleExponent-PT-003-11
FORMULA_NAME DoubleExponent-PT-003-12
FORMULA_NAME DoubleExponent-PT-003-13
FORMULA_NAME DoubleExponent-PT-003-14
FORMULA_NAME DoubleExponent-PT-003-15

=== Now, execution of the tool begins

BK_START 1620745920675

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-11 15:12:02] [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-11 15:12:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 15:12:02] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2021-05-11 15:12:02] [INFO ] Transformed 163 places.
[2021-05-11 15:12:02] [INFO ] Transformed 148 transitions.
[2021-05-11 15:12:02] [INFO ] Parsed PT model containing 163 places and 148 transitions in 82 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3334 resets, run finished after 312 ms. (steps per millisecond=320 ) properties seen :[0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1]
// Phase 1: matrix 148 rows 163 cols
[2021-05-11 15:12:02] [INFO ] Computed 19 place invariants in 14 ms
[2021-05-11 15:12:02] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2021-05-11 15:12:02] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2021-05-11 15:12:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:02] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2021-05-11 15:12:03] [INFO ] Deduced a trap composed of 49 places in 74 ms
[2021-05-11 15:12:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2021-05-11 15:12:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 17 ms returned sat
[2021-05-11 15:12:03] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:03] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2021-05-11 15:12:03] [INFO ] Deduced a trap composed of 49 places in 46 ms
[2021-05-11 15:12:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2021-05-11 15:12:03] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2021-05-11 15:12:03] [INFO ] Added : 145 causal constraints over 29 iterations in 373 ms. Result :sat
[2021-05-11 15:12:03] [INFO ] Deduced a trap composed of 29 places in 50 ms
[2021-05-11 15:12:03] [INFO ] Deduced a trap composed of 25 places in 53 ms
[2021-05-11 15:12:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2021-05-11 15:12:03] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:03] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:03] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2021-05-11 15:12:04] [INFO ] Deduced a trap composed of 42 places in 30 ms
[2021-05-11 15:12:04] [INFO ] Deduced a trap composed of 29 places in 28 ms
[2021-05-11 15:12:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 84 ms
[2021-05-11 15:12:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-11 15:12:04] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-11 15:12:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:04] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2021-05-11 15:12:04] [INFO ] Deduced a trap composed of 42 places in 36 ms
[2021-05-11 15:12:04] [INFO ] Deduced a trap composed of 35 places in 27 ms
[2021-05-11 15:12:04] [INFO ] Deduced a trap composed of 29 places in 32 ms
[2021-05-11 15:12:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 121 ms
[2021-05-11 15:12:04] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 10 ms.
[2021-05-11 15:12:04] [INFO ] Added : 142 causal constraints over 29 iterations in 385 ms. Result :sat
[2021-05-11 15:12:04] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:04] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:04] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2021-05-11 15:12:04] [INFO ] Deduced a trap composed of 43 places in 29 ms
[2021-05-11 15:12:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2021-05-11 15:12:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-11 15:12:04] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2021-05-11 15:12:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:05] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2021-05-11 15:12:05] [INFO ] Deduced a trap composed of 43 places in 26 ms
[2021-05-11 15:12:05] [INFO ] Deduced a trap composed of 42 places in 18 ms
[2021-05-11 15:12:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 67 ms
[2021-05-11 15:12:05] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 9 ms.
[2021-05-11 15:12:05] [INFO ] Added : 141 causal constraints over 29 iterations in 340 ms. Result :sat
[2021-05-11 15:12:05] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-11 15:12:05] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:05] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2021-05-11 15:12:05] [INFO ] Deduced a trap composed of 42 places in 19 ms
[2021-05-11 15:12:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2021-05-11 15:12:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-11 15:12:05] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:05] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2021-05-11 15:12:05] [INFO ] Deduced a trap composed of 42 places in 18 ms
[2021-05-11 15:12:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2021-05-11 15:12:05] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2021-05-11 15:12:06] [INFO ] Added : 143 causal constraints over 29 iterations in 299 ms. Result :sat
[2021-05-11 15:12:06] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:06] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:06] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2021-05-11 15:12:06] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2021-05-11 15:12:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2021-05-11 15:12:06] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:06] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2021-05-11 15:12:06] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2021-05-11 15:12:06] [INFO ] Added : 143 causal constraints over 29 iterations in 385 ms. Result :sat
[2021-05-11 15:12:06] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2021-05-11 15:12:07] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2021-05-11 15:12:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:07] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2021-05-11 15:12:07] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 9 ms.
[2021-05-11 15:12:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-11 15:12:07] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:07] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2021-05-11 15:12:07] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2021-05-11 15:12:07] [INFO ] Added : 145 causal constraints over 29 iterations in 388 ms. Result :sat
[2021-05-11 15:12:07] [INFO ] Deduced a trap composed of 24 places in 44 ms
[2021-05-11 15:12:07] [INFO ] Deduced a trap composed of 25 places in 47 ms
[2021-05-11 15:12:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2021-05-11 15:12:07] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
[2021-05-11 15:12:07] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2021-05-11 15:12:07] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:07] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:07] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2021-05-11 15:12:07] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2021-05-11 15:12:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-11 15:12:08] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:08] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2021-05-11 15:12:08] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2021-05-11 15:12:08] [INFO ] Added : 145 causal constraints over 29 iterations in 346 ms. Result :sat
[2021-05-11 15:12:08] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:08] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-11 15:12:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:08] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2021-05-11 15:12:08] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 7 ms.
[2021-05-11 15:12:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-11 15:12:08] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:08] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2021-05-11 15:12:08] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2021-05-11 15:12:09] [INFO ] Added : 141 causal constraints over 29 iterations in 322 ms. Result :sat
[2021-05-11 15:12:09] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:09] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:09] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2021-05-11 15:12:09] [INFO ] Deduced a trap composed of 40 places in 48 ms
[2021-05-11 15:12:09] [INFO ] Deduced a trap composed of 16 places in 43 ms
[2021-05-11 15:12:09] [INFO ] Deduced a trap composed of 48 places in 26 ms
[2021-05-11 15:12:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 140 ms
[2021-05-11 15:12:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-11 15:12:09] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:09] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2021-05-11 15:12:09] [INFO ] Deduced a trap composed of 40 places in 41 ms
[2021-05-11 15:12:09] [INFO ] Deduced a trap composed of 16 places in 41 ms
[2021-05-11 15:12:09] [INFO ] Deduced a trap composed of 48 places in 27 ms
[2021-05-11 15:12:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 130 ms
[2021-05-11 15:12:09] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 7 ms.
[2021-05-11 15:12:10] [INFO ] Added : 145 causal constraints over 30 iterations in 334 ms. Result :sat
[2021-05-11 15:12:10] [INFO ] Deduced a trap composed of 50 places in 26 ms
[2021-05-11 15:12:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2021-05-11 15:12:10] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:10] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:10] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2021-05-11 15:12:10] [INFO ] Deduced a trap composed of 18 places in 46 ms
[2021-05-11 15:12:10] [INFO ] Deduced a trap composed of 42 places in 40 ms
[2021-05-11 15:12:10] [INFO ] Deduced a trap composed of 57 places in 41 ms
[2021-05-11 15:12:10] [INFO ] Deduced a trap composed of 74 places in 46 ms
[2021-05-11 15:12:10] [INFO ] Deduced a trap composed of 65 places in 40 ms
[2021-05-11 15:12:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 251 ms
[2021-05-11 15:12:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2021-05-11 15:12:10] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 11 ms returned sat
[2021-05-11 15:12:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:10] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2021-05-11 15:12:10] [INFO ] Deduced a trap composed of 18 places in 45 ms
[2021-05-11 15:12:10] [INFO ] Deduced a trap composed of 42 places in 42 ms
[2021-05-11 15:12:10] [INFO ] Deduced a trap composed of 72 places in 41 ms
[2021-05-11 15:12:10] [INFO ] Deduced a trap composed of 61 places in 47 ms
[2021-05-11 15:12:10] [INFO ] Deduced a trap composed of 62 places in 41 ms
[2021-05-11 15:12:10] [INFO ] Deduced a trap composed of 43 places in 47 ms
[2021-05-11 15:12:10] [INFO ] Deduced a trap composed of 71 places in 44 ms
[2021-05-11 15:12:10] [INFO ] Deduced a trap composed of 65 places in 37 ms
[2021-05-11 15:12:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 399 ms
[2021-05-11 15:12:10] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 7 ms.
[2021-05-11 15:12:11] [INFO ] Added : 145 causal constraints over 29 iterations in 331 ms. Result :sat
[2021-05-11 15:12:11] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:11] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:11] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2021-05-11 15:12:11] [INFO ] Deduced a trap composed of 43 places in 27 ms
[2021-05-11 15:12:11] [INFO ] Deduced a trap composed of 45 places in 41 ms
[2021-05-11 15:12:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 84 ms
[2021-05-11 15:12:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-11 15:12:11] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:11] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2021-05-11 15:12:11] [INFO ] Deduced a trap composed of 43 places in 27 ms
[2021-05-11 15:12:11] [INFO ] Deduced a trap composed of 45 places in 26 ms
[2021-05-11 15:12:11] [INFO ] Deduced a trap composed of 36 places in 48 ms
[2021-05-11 15:12:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 123 ms
[2021-05-11 15:12:11] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 7 ms.
[2021-05-11 15:12:12] [INFO ] Added : 140 causal constraints over 28 iterations in 351 ms. Result :sat
[2021-05-11 15:12:12] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:12] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-11 15:12:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:12] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2021-05-11 15:12:12] [INFO ] Deduced a trap composed of 25 places in 53 ms
[2021-05-11 15:12:12] [INFO ] Deduced a trap composed of 21 places in 58 ms
[2021-05-11 15:12:12] [INFO ] Deduced a trap composed of 51 places in 50 ms
[2021-05-11 15:12:12] [INFO ] Deduced a trap composed of 58 places in 51 ms
[2021-05-11 15:12:12] [INFO ] Deduced a trap composed of 66 places in 51 ms
[2021-05-11 15:12:12] [INFO ] Deduced a trap composed of 31 places in 32 ms
[2021-05-11 15:12:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 339 ms
[2021-05-11 15:12:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-11 15:12:12] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:12] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2021-05-11 15:12:12] [INFO ] Deduced a trap composed of 25 places in 45 ms
[2021-05-11 15:12:12] [INFO ] Deduced a trap composed of 21 places in 44 ms
[2021-05-11 15:12:12] [INFO ] Deduced a trap composed of 51 places in 44 ms
[2021-05-11 15:12:12] [INFO ] Deduced a trap composed of 58 places in 43 ms
[2021-05-11 15:12:13] [INFO ] Deduced a trap composed of 66 places in 45 ms
[2021-05-11 15:12:13] [INFO ] Deduced a trap composed of 31 places in 29 ms
[2021-05-11 15:12:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 289 ms
[2021-05-11 15:12:13] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 7 ms.
[2021-05-11 15:12:13] [INFO ] Added : 145 causal constraints over 29 iterations in 362 ms. Result :sat
[2021-05-11 15:12:13] [INFO ] Deduced a trap composed of 25 places in 43 ms
[2021-05-11 15:12:13] [INFO ] Deduced a trap composed of 75 places in 42 ms
[2021-05-11 15:12:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2021-05-11 15:12:13] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:13] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:13] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2021-05-11 15:12:13] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 7 ms.
[2021-05-11 15:12:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-11 15:12:13] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:13] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2021-05-11 15:12:13] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2021-05-11 15:12:14] [INFO ] Added : 144 causal constraints over 29 iterations in 350 ms. Result :sat
[2021-05-11 15:12:14] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:14] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:14] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2021-05-11 15:12:14] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 7 ms.
[2021-05-11 15:12:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2021-05-11 15:12:14] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-11 15:12:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:14] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2021-05-11 15:12:14] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 10 ms.
[2021-05-11 15:12:14] [INFO ] Added : 143 causal constraints over 29 iterations in 340 ms. Result :sat
[2021-05-11 15:12:14] [INFO ] Deduced a trap composed of 29 places in 24 ms
[2021-05-11 15:12:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2021-05-11 15:12:14] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:14] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-11 15:12:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:15] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2021-05-11 15:12:15] [INFO ] Deduced a trap composed of 43 places in 27 ms
[2021-05-11 15:12:15] [INFO ] Deduced a trap composed of 45 places in 25 ms
[2021-05-11 15:12:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 69 ms
[2021-05-11 15:12:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-11 15:12:15] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:15] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2021-05-11 15:12:15] [INFO ] Deduced a trap composed of 43 places in 31 ms
[2021-05-11 15:12:15] [INFO ] Deduced a trap composed of 45 places in 29 ms
[2021-05-11 15:12:15] [INFO ] Deduced a trap composed of 36 places in 55 ms
[2021-05-11 15:12:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 137 ms
[2021-05-11 15:12:15] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 7 ms.
[2021-05-11 15:12:15] [INFO ] Added : 108 causal constraints over 22 iterations in 236 ms. Result :sat
[2021-05-11 15:12:15] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:15] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:15] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2021-05-11 15:12:15] [INFO ] Deduced a trap composed of 67 places in 45 ms
[2021-05-11 15:12:15] [INFO ] Deduced a trap composed of 48 places in 43 ms
[2021-05-11 15:12:15] [INFO ] Deduced a trap composed of 42 places in 45 ms
[2021-05-11 15:12:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 155 ms
[2021-05-11 15:12:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2021-05-11 15:12:15] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:16] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2021-05-11 15:12:16] [INFO ] Deduced a trap composed of 67 places in 44 ms
[2021-05-11 15:12:16] [INFO ] Deduced a trap composed of 29 places in 50 ms
[2021-05-11 15:12:16] [INFO ] Deduced a trap composed of 42 places in 50 ms
[2021-05-11 15:12:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 165 ms
[2021-05-11 15:12:16] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 7 ms.
[2021-05-11 15:12:16] [INFO ] Added : 143 causal constraints over 30 iterations in 345 ms. Result :sat
[2021-05-11 15:12:16] [INFO ] Deduced a trap composed of 25 places in 41 ms
[2021-05-11 15:12:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2021-05-11 15:12:16] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:16] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:16] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2021-05-11 15:12:16] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 9 ms.
[2021-05-11 15:12:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-11 15:12:16] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-11 15:12:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:16] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2021-05-11 15:12:16] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 19 ms.
[2021-05-11 15:12:17] [INFO ] Added : 143 causal constraints over 29 iterations in 331 ms. Result :sat
[2021-05-11 15:12:17] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:17] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:17] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2021-05-11 15:12:17] [INFO ] Deduced a trap composed of 45 places in 45 ms
[2021-05-11 15:12:17] [INFO ] Deduced a trap composed of 64 places in 44 ms
[2021-05-11 15:12:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2021-05-11 15:12:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2021-05-11 15:12:17] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:17] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2021-05-11 15:12:17] [INFO ] Deduced a trap composed of 45 places in 44 ms
[2021-05-11 15:12:17] [INFO ] Deduced a trap composed of 64 places in 43 ms
[2021-05-11 15:12:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2021-05-11 15:12:17] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 7 ms.
[2021-05-11 15:12:17] [INFO ] Added : 100 causal constraints over 20 iterations in 202 ms. Result :sat
[2021-05-11 15:12:18] [INFO ] Deduced a trap composed of 29 places in 46 ms
[2021-05-11 15:12:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2021-05-11 15:12:18] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-11 15:12:18] [INFO ] Flatten gal took : 57 ms
FORMULA DoubleExponent-PT-003-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 15:12:18] [INFO ] Flatten gal took : 16 ms
[2021-05-11 15:12:18] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2021-05-11 15:12:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DoubleExponent-PT-003 @ 3570 seconds

FORMULA DoubleExponent-PT-003-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3561
rslt: Output for LTLFireability @ DoubleExponent-PT-003

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

{
"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": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p142)",
"processed_size": 11,
"rewrites": 45
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 2,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(X ((X (F ((1 <= p130))) U ((1 <= p115) AND (1 <= p136)))) U (X (F (((1 <= p45) AND (1 <= p141)))) AND ((1 <= p45) AND (1 <= p141))))",
"processed_size": 133,
"rewrites": 43
},
"result":
{
"edges": 64,
"markings": 50,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 4,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (X (X ((F ((X (F (((1 <= p66) AND (1 <= p151)))) AND ((1 <= p6) AND (1 <= p94)))) OR ((p23 <= 0) OR (p111 <= 0))))))",
"processed_size": 118,
"rewrites": 43
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((X ((G ((p135 <= 0)) R (p110 <= 0))) OR G ((p135 <= 0))))",
"processed_size": 60,
"rewrites": 43
},
"result":
{
"edges": 188,
"markings": 177,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 4,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((X (F (((p11 <= 0) OR (p19 <= 0)))) AND (G ((F ((1 <= p127)) AND (1 <= p127))) AND ((1 <= p127) AND (1 <= p154)))))",
"processed_size": 119,
"rewrites": 43
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((p76 <= 0)))",
"processed_size": 18,
"rewrites": 43
},
"result":
{
"edges": 2639247,
"markings": 2385076,
"produced_by": "LTL model checker",
"value": true
},
"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": 1780
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((F ((p92 <= 0)) AND (1 <= p124)))",
"processed_size": 36,
"rewrites": 43
},
"result":
{
"edges": 29,
"markings": 29,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 3561
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3561
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p115) AND (1 <= p136))",
"processed_size": 29,
"rewrites": 43
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (((((1 <= p115) AND (1 <= p123)) U ((1 <= p115) AND (1 <= p136))) OR F (G (((1 <= p115) AND (1 <= p136))))))",
"processed_size": 110,
"rewrites": 43
},
"result":
{
"edges": 29,
"markings": 29,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 28796,
"runtime": 9.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G((X(*) AND *)) OR (F(**) AND X(**))) : X(((** U **) OR (X(G(*)) AND (** AND **)))) : (F(**) AND (G(((** U **) OR F(G(**)))) OR **)) : X(G(((F(**) AND (** AND **)) OR **))) : X(((** U **) OR F((** OR X(G(**)))))) : (X((X(F(**)) U **)) U (X(F(**)) AND (** AND **))) : X(X(X((F((X(F(**)) AND (** AND **))) OR (** OR **))))) : F((F(**) AND **)) : X((X((G(*) R *)) OR G(*))) : F((X(F(*)) AND (G((F(**) AND **)) AND (** AND **)))) : G(F(**))"
},
"net":
{
"arcs": 417,
"conflict_clusters": 109,
"places": 163,
"places_significant": 144,
"singleton_clusters": 0,
"transitions": 148
},
"result":
{
"preliminary_value": "no no no no no no yes no no no yes ",
"value": "no no no no no no yes no no no 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: 311/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5216
lola: finding significant places
lola: 163 places, 148 transitions, 144 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: (NOT(F ((X (((1 <= p10) AND (1 <= p17))) OR (1 <= p142)))) OR (F ((p142 <= 0)) AND X ((1 <= p96)))) : X (((((1 <= p54) AND (1 <= p68)) U (1 <= p51)) OR ((NOT(F (X (((1 <= p66) AND (1 <= p151))))) AND (1 <= p66)) AND (1 <= p151)))) : (F (((1 <= p106) AND (1 <= p113))) AND (G (((((1 <= p115) AND (1 <= p123)) U ((1 <= p115) AND (1 <= p136))) OR F (G (((1 <= p115) AND (1 <= p136)))))) OR ((1 <= p115) AND (1 <= p136)))) : G ((X (((F (((1 <= p154) U (1 <= p108))) AND (1 <= p75)) AND (1 <= p108))) OR X ((1 <= p108)))) : (X (((1 <= p18) U (1 <= p105))) OR F ((X ((1 <= p18)) OR X (X (G ((1 <= p99))))))) : ((X (X (F ((1 <= p130)))) U X (((1 <= p115) AND (1 <= p136)))) U ((F (X (((1 <= p45) AND (1 <= p141)))) AND (1 <= p45)) AND (1 <= p141))) : X (X (X (((F (((F (X (((1 <= p66) AND (1 <= p151)))) AND (1 <= p6)) AND (1 <= p94))) OR (p23 <= 0)) OR (p111 <= 0))))) : F ((X (X ((1 <= p33))) U (F ((p92 <= 0)) AND (1 <= p124)))) : (NOT(X (X ((F ((1 <= p135)) U (1 <= p110))))) OR NOT(X (F ((G (X ((1 <= p135))) U (1 <= p135)))))) : F ((((NOT(X (G (((1 <= p11) AND (1 <= p19))))) AND G ((F ((1 <= p127)) AND (1 <= p127)))) AND (1 <= p127)) AND (1 <= p154))) : G (F ((((1 <= p129) AND (1 <= p138)) U (p76 <= 0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:528
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((X (((p10 <= 0) OR (p17 <= 0))) AND (p142 <= 0))) OR (F ((p142 <= 0)) AND X ((1 <= p96))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p142 <= 0))
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: (1 <= p142)
lola: processed formula length: 11
lola: 45 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((1 <= p96))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((1 <= p96))
lola: processed formula length: 14
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((p10 <= 0) OR (p17 <= 0))) AND (p142 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((p10 <= 0) OR (p17 <= 0))) AND (p142 <= 0)))
lola: processed formula length: 53
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 331 markings, 349 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p54) AND (1 <= p68)) U (1 <= p51)) OR (X (G (((p66 <= 0) OR (p151 <= 0)))) AND ((1 <= p66) AND (1 <= p151)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p54) AND (1 <= p68)) U (1 <= p51)) OR (X (G (((p66 <= 0) OR (p151 <= 0)))) AND ((1 <= p66) AND (1 <= p151)))))
lola: processed formula length: 123
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((F ((1 <= p108)) AND ((1 <= p75) AND (1 <= p108))) OR (1 <= p108))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((F ((1 <= p108)) AND ((1 <= p75) AND (1 <= p108))) OR (1 <= p108))))
lola: processed formula length: 75
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 28 markings, 28 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p18) U (1 <= p105)) OR F (((1 <= p18) OR X (G ((1 <= p99)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p18) U (1 <= p105)) OR F (((1 <= p18) OR X (G ((1 <= p99)))))))
lola: processed formula length: 74
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (F ((1 <= p130))) U ((1 <= p115) AND (1 <= p136)))) U (X (F (((1 <= p45) AND (1 <= p141)))) AND ((1 <= p45) AND (1 <= p141))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((X (F ((1 <= p130))) U ((1 <= p115) AND (1 <= p136)))) U (X (F (((1 <= p45) AND (1 <= p141)))) AND ((1 <= p45) AND (1 <= p141))))
lola: processed formula length: 133
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 50 markings, 64 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X ((F ((X (F (((1 <= p66) AND (1 <= p151)))) AND ((1 <= p6) AND (1 <= p94)))) OR ((p23 <= 0) OR (p111 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X ((F ((X (F (((1 <= p66) AND (1 <= p151)))) AND ((1 <= p6) AND (1 <= p94)))) OR ((p23 <= 0) OR (p111 <= 0))))))
lola: processed formula length: 118
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((G ((p135 <= 0)) R (p110 <= 0))) OR G ((p135 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((G ((p135 <= 0)) R (p110 <= 0))) OR G ((p135 <= 0))))
lola: processed formula length: 60
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 177 markings, 188 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F (((p11 <= 0) OR (p19 <= 0)))) AND (G ((F ((1 <= p127)) AND (1 <= p127))) AND ((1 <= p127) AND (1 <= p154)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F (((p11 <= 0) OR (p19 <= 0)))) AND (G ((F ((1 <= p127)) AND (1 <= p127))) AND ((1 <= p127) AND (1 <= p154)))))
lola: processed formula length: 119
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 26 edges
lola: ========================================
lola: subprocess 8 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p76 <= 0)))
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 ((p76 <= 0)))
lola: processed formula length: 18
lola: 43 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: 1808015 markings, 2000147 edges, 361603 markings/sec, 0 secs
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: 2385076 markings, 2639247 edges
lola: ========================================
lola: subprocess 9 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((p92 <= 0)) AND (1 <= p124)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((p92 <= 0)) AND (1 <= p124)))
lola: processed formula length: 36
lola: 43 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: 29 markings, 29 edges
lola: ========================================
lola: subprocess 10 will run for 3561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p106) AND (1 <= p113))) AND (G (((((1 <= p115) AND (1 <= p123)) U ((1 <= p115) AND (1 <= p136))) OR F (G (((1 <= p115) AND (1 <= p136)))))) OR ((1 <= p115) AND (1 <= p136))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p115) AND (1 <= p136))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p115) AND (1 <= p136))
lola: processed formula length: 29
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((((1 <= p115) AND (1 <= p123)) U ((1 <= p115) AND (1 <= p136))) OR F (G (((1 <= p115) AND (1 <= p136))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((((1 <= p115) AND (1 <= p123)) U ((1 <= p115) AND (1 <= p136))) OR F (G (((1 <= p115) AND (1 <= p136))))))
lola: processed formula length: 110
lola: 43 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 29 markings, 29 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no yes no no no yes
lola:
preliminary result: no no no no no no yes no no no yes
lola: memory consumption: 28796 KB
lola: time consumption: 9 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="DoubleExponent-PT-003"
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 DoubleExponent-PT-003, 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 r094-tall-162048902500206"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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