Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r056-oct2-162038334700210.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is CloudOpsManagement-PT-00320by00160, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334700210
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 23K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 153K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 110K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Mar 28 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 03:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 12:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 13 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 17K 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 CloudOpsManagement-PT-00320by00160-00
FORMULA_NAME CloudOpsManagement-PT-00320by00160-01
FORMULA_NAME CloudOpsManagement-PT-00320by00160-02
FORMULA_NAME CloudOpsManagement-PT-00320by00160-03
FORMULA_NAME CloudOpsManagement-PT-00320by00160-04
FORMULA_NAME CloudOpsManagement-PT-00320by00160-05
FORMULA_NAME CloudOpsManagement-PT-00320by00160-06
FORMULA_NAME CloudOpsManagement-PT-00320by00160-07
FORMULA_NAME CloudOpsManagement-PT-00320by00160-08
FORMULA_NAME CloudOpsManagement-PT-00320by00160-09
FORMULA_NAME CloudOpsManagement-PT-00320by00160-10
FORMULA_NAME CloudOpsManagement-PT-00320by00160-11
FORMULA_NAME CloudOpsManagement-PT-00320by00160-12
FORMULA_NAME CloudOpsManagement-PT-00320by00160-13
FORMULA_NAME CloudOpsManagement-PT-00320by00160-14
FORMULA_NAME CloudOpsManagement-PT-00320by00160-15

=== Now, execution of the tool begins

BK_START 1620902925464

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 10:48:47] [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 10:48:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 10:48:47] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2021-05-13 10:48:47] [INFO ] Transformed 27 places.
[2021-05-13 10:48:47] [INFO ] Transformed 29 transitions.
[2021-05-13 10:48:47] [INFO ] Parsed PT model containing 27 places and 29 transitions in 58 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100171 steps, including 0 resets, run finished after 75 ms. (steps per millisecond=1335 ) properties seen :[0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0]
// Phase 1: matrix 29 rows 27 cols
[2021-05-13 10:48:47] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-13 10:48:47] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2021-05-13 10:48:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:47] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-13 10:48:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-13 10:48:47] [INFO ] [Real]Added 3 Read/Feed constraints in 8 ms returned sat
[2021-05-13 10:48:48] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 6 ms.
[2021-05-13 10:48:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:48:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:48] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:48:48] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2021-05-13 10:48:48] [INFO ] Added : 25 causal constraints over 6 iterations in 71 ms. Result :sat
[2021-05-13 10:48:48] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:48] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Real]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-13 10:48:48] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:48:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:48:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:48] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:48:48] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:48:48] [INFO ] Added : 25 causal constraints over 6 iterations in 25 ms. Result :sat
[2021-05-13 10:48:48] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:48] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:48:48] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:48:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:48:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:48] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:48:48] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 10:48:48] [INFO ] Added : 25 causal constraints over 6 iterations in 22 ms. Result :sat
[2021-05-13 10:48:48] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:48] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:48:48] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2021-05-13 10:48:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:48:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:48] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:48:48] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2021-05-13 10:48:48] [INFO ] Added : 25 causal constraints over 6 iterations in 21 ms. Result :sat
[2021-05-13 10:48:48] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:48] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:48:48] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:48:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:48:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:48] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:48:48] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:48:48] [INFO ] Added : 25 causal constraints over 6 iterations in 63 ms. Result :sat
[2021-05-13 10:48:48] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:48] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:48:48] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:48:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:48:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 22 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:48] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 16 ms returned sat
[2021-05-13 10:48:48] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2021-05-13 10:48:48] [INFO ] Added : 25 causal constraints over 6 iterations in 26 ms. Result :sat
[2021-05-13 10:48:48] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:48] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:48:48] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:48:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:48:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:48] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:48:48] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:48:48] [INFO ] Added : 25 causal constraints over 6 iterations in 22 ms. Result :sat
[2021-05-13 10:48:48] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:48] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-13 10:48:48] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:48:48] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 10:48:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:48:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 32 ms returned sat
[2021-05-13 10:48:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:49] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2021-05-13 10:48:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:48:49] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 10:48:49] [INFO ] Added : 25 causal constraints over 6 iterations in 210 ms. Result :sat
[2021-05-13 10:48:49] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:49] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:48:49] [INFO ] [Real]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-13 10:48:49] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:48:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:48:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:48:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:49] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:48:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:48:49] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2021-05-13 10:48:49] [INFO ] Added : 25 causal constraints over 6 iterations in 64 ms. Result :sat
[2021-05-13 10:48:49] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:49] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:48:49] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:48:49] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:48:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:48:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:48:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:49] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-13 10:48:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:48:49] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:48:49] [INFO ] Added : 25 causal constraints over 6 iterations in 19 ms. Result :sat
[2021-05-13 10:48:49] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:49] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:48:49] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:48:49] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:48:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:48:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:48:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:49] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:48:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:48:49] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:48:49] [INFO ] Added : 25 causal constraints over 6 iterations in 31 ms. Result :sat
[2021-05-13 10:48:49] [INFO ] [Real]Absence check using 11 positive place invariants in 42 ms returned sat
[2021-05-13 10:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:49] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:48:49] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:48:49] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:48:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:48:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2021-05-13 10:48:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:49] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:48:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:48:49] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:48:49] [INFO ] Added : 25 causal constraints over 6 iterations in 17 ms. Result :sat
[2021-05-13 10:48:49] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:49] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:48:49] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:48:49] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:48:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:48:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:48:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:49] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:48:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:48:49] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:48:50] [INFO ] Added : 25 causal constraints over 6 iterations in 136 ms. Result :sat
[2021-05-13 10:48:50] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:48:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:50] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-13 10:48:50] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:48:50] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:48:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:48:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-13 10:48:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:50] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 10:48:50] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:48:50] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 10 ms.
[2021-05-13 10:48:50] [INFO ] Added : 25 causal constraints over 6 iterations in 26 ms. Result :sat
[2021-05-13 10:48:50] [INFO ] [Real]Absence check using 11 positive place invariants in 48 ms returned sat
[2021-05-13 10:48:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:50] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2021-05-13 10:48:50] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:48:50] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:48:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:48:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:48:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:48:50] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2021-05-13 10:48:50] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:48:50] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:48:50] [INFO ] Added : 25 causal constraints over 6 iterations in 180 ms. Result :sat
[2021-05-13 10:48:50] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-13 10:48:50] [INFO ] Flatten gal took : 32 ms
FORMULA CloudOpsManagement-PT-00320by00160-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00320by00160-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00320by00160-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00320by00160-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00320by00160-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 10:48:50] [INFO ] Flatten gal took : 6 ms
[2021-05-13 10:48:50] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 17 ms.
[2021-05-13 10:48:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CloudOpsManagement-PT-00320by00160 @ 3570 seconds

FORMULA CloudOpsManagement-PT-00320by00160-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00320by00160-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2800
rslt: Output for LTLFireability @ CloudOpsManagement-PT-00320by00160

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F (((p11 <= 0) OR (p12 <= 0) OR (p25 <= 0) OR (1 <= p22))))",
"processed_size": 65,
"rewrites": 80
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 356
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "((1 <= p11) AND (1 <= p12) AND (1 <= p25))",
"processed_size": 42,
"rewrites": 83
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p5) AND (1 <= p7) AND (1 <= p26))",
"processed_size": 40,
"rewrites": 80
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((p21 <= 0)) R X (((1 <= p5) AND (1 <= p7) AND (1 <= p26))))",
"processed_size": 61,
"rewrites": 80
},
"result":
{
"edges": 165,
"markings": 165,
"produced_by": "LTL model checker",
"value": false
},
"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": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 3,
"aneg": 1,
"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 (X (((p8 <= 0) OR (p9 <= 0)))) AND (F (((p14 <= 0) AND ((p0 <= 0) OR (p26 <= 0)))) AND ((p8 <= 0) OR (p9 <= 0)))))",
"processed_size": 123,
"rewrites": 80
},
"result":
{
"edges": 165,
"markings": 165,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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 (((G ((1 <= p7)) OR (1 <= p12)) R X (F ((1 <= p7)))))))",
"processed_size": 63,
"rewrites": 80
},
"result":
{
"edges": 165,
"markings": 165,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": "G (((1 <= p8) AND (1 <= p9)))",
"processed_size": 29,
"rewrites": 80
},
"result":
{
"edges": 965,
"markings": 965,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 4,
"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": 3,
"visible_transitions": 0
},
"processed": "X (((X (((p8 <= 0) OR (p9 <= 0))) AND (((p8 <= 0) OR (p9 <= 0)) AND (1 <= p14))) R ((p8 <= 0) OR (p9 <= 0))))",
"processed_size": 112,
"rewrites": 80
},
"result":
{
"edges": 165,
"markings": 165,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(((1 <= p13) AND (1 <= p17) AND (1 <= p21)) U (((p14 <= 0) AND X ((G (((1 <= p5) AND (1 <= p7) AND (1 <= p26))) OR ((1 <= p10) AND (1 <= p25))))) U ((1 <= p5) AND (1 <= p7) AND (1 <= p26))))",
"processed_size": 190,
"rewrites": 80
},
"result":
{
"edges": 323,
"markings": 323,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 5,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p8 <= 0) OR (p25 <= 0)) R (F (G (((p3 <= 0) OR (p4 <= 0)))) AND G (((X (((p1 <= 0) OR (p2 <= 0))) AND ((p8 <= 0) OR (p25 <= 0))) OR ((1 <= p3) AND (1 <= p4))))))",
"processed_size": 168,
"rewrites": 80
},
"result":
{
"edges": 4279344,
"markings": 2835356,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 1,
"G": 1,
"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": "G (F (((1 <= p8) AND (1 <= p25))))",
"processed_size": 34,
"rewrites": 80
},
"result":
{
"edges": 2710,
"markings": 1438,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": 8,
"visible_transitions": 0
},
"processed": "F (G (((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0) OR ((1 <= p3) AND (1 <= p4)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p21)))))",
"processed_size": 125,
"rewrites": 80
},
"result":
{
"edges": 19501127,
"markings": 11128487,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3157
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(F ((1 <= p18)) U (((p8 <= 0) OR (p9 <= 0)) R ((1 <= p8) AND (1 <= p9))))",
"processed_size": 74,
"rewrites": 80
},
"result":
{
"edges": 965,
"markings": 965,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3528,
"runtime": 770.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(**) U (* R *)) : G(F((G(*) OR **))) : F(G(**)) : X(F(*)) : G(F(**)) : ((* R X(*)) OR (** OR (F(**) AND (** AND (** AND **))))) : X((X(X(**)) AND (F(*) AND **))) : X(X(G(((G(**) OR *) R X(F(*)))))) : (X(((X(*) AND (* AND *)) R *)) OR G(**)) : (** U ((** AND X((G(**) OR **))) U **)) : (* R (F(G(*)) AND G(((X(*) AND *) OR *))))"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "no unknown no yes no no no no no no no ",
"value": "no unknown no yes no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 56/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 29 transitions, 16 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (1 <= p16)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: (F ((1 <= p18)) U NOT((((1 <= p8) AND (1 <= p9)) U ((p8 <= 0) OR (p9 <= 0))))) : NOT(G (F ((G (F ((p11 <= 0))) AND NOT(F ((1 <= p22))))))) : G (X ((((p13 <= 0) OR (p17 <= 0) OR (p21 <= 0)) U F (G (((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0) OR ((1 <= p3) AND (1 <= p4)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p21)))))))) : F ((X (G (X (NOT(F (((1 <= p13))))))) U NOT(X (((1 <= p11) AND (1 <= p12) AND (1 <= p25) AND (p22 <= 0)))))) : G (F (X (X (((1 <= p8) AND (1 <= p25)))))) : ((NOT((((1 <= p21)) U X (((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0))))) OR ((1 <= p5) AND (1 <= p7) AND (1 <= p26))) OR (((F (((1 <= p5) AND (1 <= p7) AND (1 <= p26))) AND (1 <= p11)) AND (1 <= p12)) AND (1 <= p25))) : X (((X (X (((p8 <= 0) OR (p9 <= 0)))) AND NOT(G (((1 <= p14) OR ((1 <= p0) AND (1 <= p26)))))) AND ((p8 <= 0) OR (p9 <= 0)))) : G (X (NOT((X ((NOT(G ((1 <= p7))) AND (p12 <= 0))) U X (X (G ((p7 <= 0)))))))) : (X (NOT((((X (((1 <= p8) AND (1 <= p9))) OR ((1 <= p8) AND (1 <= p9))) OR (p14 <= 0)) U ((1 <= p8) AND (1 <= p9))))) OR G (((1 <= p8) AND (1 <= p9)))) : (((1 <= p13) AND (1 <= p17) AND (1 <= p21)) U (((p14 <= 0) AND (G (X (((1 <= p5) AND (1 <= p7) AND (1 <= p26)))) OR X (((1 <= p10) AND (1 <= p25))))) U ((1 <= p5) AND (1 <= p7) AND (1 <= p26)))) : NOT((((1 <= p8) AND (1 <= p25)) U (G (F (((1 <= p3) AND (1 <= p4)))) OR F (((X (((1 <= p1) AND (1 <= p2))) OR ((1 <= p8) AND (1 <= p25))) AND ((p3 <= 0) OR (p4 <= 0)))))))
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:254
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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: 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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p11 <= 0) OR (p12 <= 0) OR (p25 <= 0) OR (1 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p11 <= 0) OR (p12 <= 0) OR (p25 <= 0) OR (1 <= p22))))
lola: processed formula length: 65
lola: 80 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p21 <= 0)) R X (((1 <= p5) AND (1 <= p7) AND (1 <= p26)))) OR (((1 <= p5) AND (1 <= p7) AND (1 <= p26)) OR (F (((1 <= p5) AND (1 <= p7) AND (1 <= p26))) AND ((1 <= p11) AND ((1 <= p12) AND (1 <= p25))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p11) AND ((1 <= p12) AND (1 <= p25)))
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: processed formula: ((1 <= p11) AND (1 <= p12) AND (1 <= p25))
lola: processed formula length: 42
lola: 83 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 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 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p5) AND (1 <= p7) AND (1 <= p26))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p5) AND (1 <= p7) AND (1 <= p26))
lola: processed formula length: 40
lola: 80 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 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 3 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p21 <= 0)) R X (((1 <= p5) AND (1 <= p7) AND (1 <= p26))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p21 <= 0)) R X (((1 <= p5) AND (1 <= p7) AND (1 <= p26))))
lola: processed formula length: 61
lola: 80 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: 165 markings, 165 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (((p8 <= 0) OR (p9 <= 0)))) AND (F (((p14 <= 0) AND ((p0 <= 0) OR (p26 <= 0)))) AND ((p8 <= 0) OR (p9 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (((p8 <= 0) OR (p9 <= 0)))) AND (F (((p14 <= 0) AND ((p0 <= 0) OR (p26 <= 0)))) AND ((p8 <= 0) OR (p9 <= 0)))))
lola: processed formula length: 123
lola: 80 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 165 markings, 165 edges
lola: ========================================
lola: subprocess 3 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((G ((1 <= p7)) OR (1 <= p12)) R X (F ((1 <= p7)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((G ((1 <= p7)) OR (1 <= p12)) R X (F ((1 <= p7)))))))
lola: processed formula length: 63
lola: 80 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: 165 markings, 165 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((X (((p8 <= 0) OR (p9 <= 0))) AND (((p8 <= 0) OR (p9 <= 0)) AND (1 <= p14))) R ((p8 <= 0) OR (p9 <= 0)))) OR G (((1 <= p8) AND (1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p8) AND (1 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p8) AND (1 <= p9)))
lola: processed formula length: 29
lola: 80 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: 965 markings, 965 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (((p8 <= 0) OR (p9 <= 0))) AND (((p8 <= 0) OR (p9 <= 0)) AND (1 <= p14))) R ((p8 <= 0) OR (p9 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (((p8 <= 0) OR (p9 <= 0))) AND (((p8 <= 0) OR (p9 <= 0)) AND (1 <= p14))) R ((p8 <= 0) OR (p9 <= 0))))
lola: processed formula length: 112
lola: 80 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: 165 markings, 165 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p13) AND (1 <= p17) AND (1 <= p21)) U (((p14 <= 0) AND X ((G (((1 <= p5) AND (1 <= p7) AND (1 <= p26))) OR ((1 <= p10) AND (1 <= p25))))) U ((1 <= p5) AND (1 <= p7) AND (1 <= p26))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p13) AND (1 <= p17) AND (1 <= p21)) U (((p14 <= 0) AND X ((G (((1 <= p5) AND (1 <= p7) AND (1 <= p26))) OR ((1 <= p10) AND (1 <= p25))))) U ((1 <= p5) AND (1 <= p7) AND (1 <= p26))))
lola: processed formula length: 190
lola: 80 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 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: 323 markings, 323 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p8 <= 0) OR (p25 <= 0)) R (F (G (((p3 <= 0) OR (p4 <= 0)))) AND G (((X (((p1 <= 0) OR (p2 <= 0))) AND ((p8 <= 0) OR (p25 <= 0))) OR ((1 <= p3) AND (1 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p8 <= 0) OR (p25 <= 0)) R (F (G (((p3 <= 0) OR (p4 <= 0)))) AND G (((X (((p1 <= 0) OR (p2 <= 0))) AND ((p8 <= 0) OR (p25 <= 0))) OR ((1 <= p3) AND (1 <= p4))))))
lola: processed formula length: 168
lola: 80 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2835356 markings, 4279344 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p8) AND (1 <= p25))))
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 <= p8) AND (1 <= p25))))
lola: processed formula length: 34
lola: 80 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: 1438 markings, 2710 edges
lola: ========================================
lola: subprocess 8 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0) OR ((1 <= p3) AND (1 <= p4)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p21)))))
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 (((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0) OR ((1 <= p3) AND (1 <= p4)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p21)))))
lola: processed formula length: 125
lola: 80 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: 4531763 markings, 7941817 edges, 906353 markings/sec, 0 secs
lola: 9124903 markings, 15987994 edges, 918628 markings/sec, 5 secs
lola: add low 25
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: 11128487 markings, 19501127 edges
lola: ========================================
lola: subprocess 9 will run for 1776 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((1 <= p11)) OR (1 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((1 <= p11)) OR (1 <= p22))))
lola: processed formula length: 38
lola: 80 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 3783320 markings, 8532690 edges, 756664 markings/sec, 0 secs
lola: 6636983 markings, 15839310 edges, 570733 markings/sec, 5 secs
lola: 9257550 markings, 22608184 edges, 524113 markings/sec, 10 secs
lola: 11827946 markings, 29813183 edges, 514079 markings/sec, 15 secs
lola: 14281027 markings, 36735100 edges, 490616 markings/sec, 20 secs
lola: 16613056 markings, 43344511 edges, 466406 markings/sec, 25 secs
lola: 19022804 markings, 50185958 edges, 481950 markings/sec, 30 secs
lola: 21305343 markings, 56717291 edges, 456508 markings/sec, 35 secs
lola: 23514185 markings, 63012964 edges, 441768 markings/sec, 40 secs
lola: 25680666 markings, 69213198 edges, 433296 markings/sec, 45 secs
lola: 27987904 markings, 75825745 edges, 461448 markings/sec, 50 secs
lola: 30233724 markings, 82245848 edges, 449164 markings/sec, 55 secs
lola: 32486102 markings, 88632039 edges, 450476 markings/sec, 60 secs
lola: 34750243 markings, 95117420 edges, 452828 markings/sec, 65 secs
lola: 36834284 markings, 101098239 edges, 416808 markings/sec, 70 secs
lola: 38960290 markings, 107173336 edges, 425201 markings/sec, 75 secs
lola: 41062880 markings, 113192316 edges, 420518 markings/sec, 80 secs
lola: 43158488 markings, 119186795 edges, 419122 markings/sec, 85 secs
lola: 45337316 markings, 125408525 edges, 435766 markings/sec, 90 secs
lola: 47418637 markings, 131378386 edges, 416264 markings/sec, 95 secs
lola: 49489292 markings, 137299333 edges, 414131 markings/sec, 100 secs
lola: 51685915 markings, 143548885 edges, 439325 markings/sec, 105 secs
lola: 53857719 markings, 149749007 edges, 434361 markings/sec, 110 secs
lola: 55993820 markings, 155853281 edges, 427220 markings/sec, 115 secs
lola: 58133100 markings, 161930377 edges, 427856 markings/sec, 120 secs
lola: 60101478 markings, 167520399 edges, 393676 markings/sec, 125 secs
lola: 61976706 markings, 172856758 edges, 375046 markings/sec, 130 secs
lola: 63777787 markings, 177993740 edges, 360216 markings/sec, 135 secs
lola: 65568127 markings, 183111145 edges, 358068 markings/sec, 140 secs
lola: 67373469 markings, 188263302 edges, 361068 markings/sec, 145 secs
lola: 69053348 markings, 193066596 edges, 335976 markings/sec, 150 secs
lola: 70745213 markings, 197904326 edges, 338373 markings/sec, 155 secs
lola: 72439455 markings, 202748915 edges, 338848 markings/sec, 160 secs
lola: 74093883 markings, 207480532 edges, 330886 markings/sec, 165 secs
lola: 75740417 markings, 212188953 edges, 329307 markings/sec, 170 secs
lola: 77419544 markings, 216990892 edges, 335825 markings/sec, 175 secs
lola: 79064587 markings, 221693550 edges, 329009 markings/sec, 180 secs
lola: 80650194 markings, 226241304 edges, 317121 markings/sec, 185 secs
lola: 82365847 markings, 231148358 edges, 343131 markings/sec, 190 secs
lola: 84094357 markings, 236090423 edges, 345702 markings/sec, 195 secs
lola: 85680000 markings, 240637629 edges, 317129 markings/sec, 200 secs
lola: 87441439 markings, 245676508 edges, 352288 markings/sec, 205 secs
lola: 89157295 markings, 250580523 edges, 343171 markings/sec, 210 secs
lola: 90836394 markings, 255399340 edges, 335820 markings/sec, 215 secs
lola: 92761148 markings, 260904306 edges, 384951 markings/sec, 220 secs
lola: 94363287 markings, 265499785 edges, 320428 markings/sec, 225 secs
lola: 96165067 markings, 270653184 edges, 360356 markings/sec, 230 secs
lola: 97758098 markings, 275222593 edges, 318606 markings/sec, 235 secs
lola: 99567670 markings, 280398198 edges, 361914 markings/sec, 240 secs
lola: 101108754 markings, 284819319 edges, 308217 markings/sec, 245 secs
lola: 102984478 markings, 290183609 edges, 375145 markings/sec, 250 secs
lola: 104578262 markings, 294756233 edges, 318757 markings/sec, 255 secs
lola: 106449819 markings, 300107493 edges, 374311 markings/sec, 260 secs
lola: 108075743 markings, 304774463 edges, 325185 markings/sec, 265 secs
lola: 109957783 markings, 310153331 edges, 376408 markings/sec, 270 secs
lola: 111727590 markings, 315233748 edges, 353961 markings/sec, 275 secs
lola: 113468954 markings, 320224204 edges, 348273 markings/sec, 280 secs
lola: 115348516 markings, 325604287 edges, 375912 markings/sec, 285 secs
lola: 116894803 markings, 330041413 edges, 309257 markings/sec, 290 secs
lola: 118603064 markings, 334923660 edges, 341652 markings/sec, 295 secs
lola: 120276522 markings, 339726092 edges, 334692 markings/sec, 300 secs
lola: 121747548 markings, 343945333 edges, 294205 markings/sec, 305 secs
lola: 123223537 markings, 348159763 edges, 295198 markings/sec, 310 secs
lola: 124649431 markings, 352254106 edges, 285179 markings/sec, 315 secs
lola: 126192482 markings, 356681578 edges, 308610 markings/sec, 320 secs
lola: 127861405 markings, 361447313 edges, 333785 markings/sec, 325 secs
lola: 129602389 markings, 366446342 edges, 348197 markings/sec, 330 secs
lola: 131093753 markings, 370725771 edges, 298273 markings/sec, 335 secs
lola: 132645749 markings, 375157370 edges, 310399 markings/sec, 340 secs
lola: 134238818 markings, 379730573 edges, 318614 markings/sec, 345 secs
lola: 135372363 markings, 382984977 edges, 226709 markings/sec, 350 secs
lola: 136915101 markings, 387409672 edges, 308548 markings/sec, 355 secs
lola: 137313226 markings, 388549074 edges, 79625 markings/sec, 360 secs
lola: 139062038 markings, 393551018 edges, 349762 markings/sec, 365 secs
lola: 140716453 markings, 398301454 edges, 330883 markings/sec, 370 secs
lola: 142293475 markings, 402825180 edges, 315404 markings/sec, 375 secs
lola: 144102479 markings, 407996151 edges, 361801 markings/sec, 380 secs
lola: 145875077 markings, 413086485 edges, 354520 markings/sec, 385 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 3157 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p18)) U (((p8 <= 0) OR (p9 <= 0)) R ((1 <= p8) AND (1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((1 <= p18)) U (((p8 <= 0) OR (p9 <= 0)) R ((1 <= p8) AND (1 <= p9))))
lola: processed formula length: 74
lola: 80 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 965 markings, 965 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((G ((1 <= p11)) OR (1 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((1 <= p11)) OR (1 <= p22))))
lola: processed formula length: 38
lola: 80 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 3858850 markings, 8728029 edges, 771770 markings/sec, 0 secs
lola: 6987154 markings, 16736256 edges, 625661 markings/sec, 5 secs
lola: 9970141 markings, 24589981 edges, 596597 markings/sec, 10 secs
lola: 12683633 markings, 32266914 edges, 542698 markings/sec, 15 secs
lola: 15349265 markings, 39748099 edges, 533126 markings/sec, 20 secs
lola: 17897469 markings, 46981481 edges, 509641 markings/sec, 25 secs
lola: 20362651 markings, 54017625 edges, 493036 markings/sec, 30 secs
lola: 22672813 markings, 60630539 edges, 462032 markings/sec, 35 secs
lola: 25027894 markings, 67341561 edges, 471016 markings/sec, 40 secs
lola: 27481971 markings, 74375290 edges, 490815 markings/sec, 45 secs
lola: 29903760 markings, 81299065 edges, 484358 markings/sec, 50 secs
lola: 32315768 markings, 88143490 edges, 482402 markings/sec, 55 secs
lola: 34650593 markings, 94831533 edges, 466965 markings/sec, 60 secs
lola: 36829967 markings, 101085852 edges, 435875 markings/sec, 65 secs
lola: 39092692 markings, 107552748 edges, 452545 markings/sec, 70 secs
lola: 41363885 markings, 114055890 edges, 454239 markings/sec, 75 secs
lola: 43703700 markings, 120748952 edges, 467963 markings/sec, 80 secs
lola: 45989366 markings, 127273985 edges, 457133 markings/sec, 85 secs
lola: 48186077 markings, 133580431 edges, 439342 markings/sec, 90 secs
lola: 50528042 markings, 140264299 edges, 468393 markings/sec, 95 secs
lola: 52835585 markings, 146843034 edges, 461509 markings/sec, 100 secs
lola: 55196659 markings, 153574821 edges, 472215 markings/sec, 105 secs
lola: 57495447 markings, 160139991 edges, 459758 markings/sec, 110 secs
lola: 59714718 markings, 166422300 edges, 443854 markings/sec, 115 secs
lola: 61870941 markings, 172553317 edges, 431245 markings/sec, 120 secs
lola: 63957873 markings, 178510227 edges, 417386 markings/sec, 125 secs
lola: 66023768 markings, 184406506 edges, 413179 markings/sec, 130 secs
lola: 67979670 markings, 190000021 edges, 391180 markings/sec, 135 secs
lola: 70091334 markings, 196029426 edges, 422333 markings/sec, 140 secs
lola: 72150630 markings, 201921315 edges, 411859 markings/sec, 145 secs
lola: 74133362 markings, 207593399 edges, 396546 markings/sec, 150 secs
lola: 76113490 markings, 213258457 edges, 396026 markings/sec, 155 secs
lola: 78085159 markings, 218899728 edges, 394334 markings/sec, 160 secs
lola: 80084730 markings, 224620654 edges, 399914 markings/sec, 165 secs
lola: 82059206 markings, 230268753 edges, 394895 markings/sec, 170 secs
lola: 84032825 markings, 235913518 edges, 394724 markings/sec, 175 secs
lola: 85971110 markings, 241470011 edges, 387657 markings/sec, 180 secs
lola: 87992273 markings, 247256577 edges, 404233 markings/sec, 185 secs
lola: 90000436 markings, 253001437 edges, 401633 markings/sec, 190 secs
lola: 91915497 markings, 258483882 edges, 383012 markings/sec, 195 secs
lola: 93870976 markings, 264089006 edges, 391096 markings/sec, 200 secs
lola: 95907205 markings, 269913152 edges, 407246 markings/sec, 205 secs
lola: 97780273 markings, 275285885 edges, 374614 markings/sec, 210 secs
lola: 99748550 markings, 280917835 edges, 393655 markings/sec, 215 secs
lola: 101640026 markings, 286339888 edges, 378295 markings/sec, 220 secs
lola: 103653747 markings, 292104374 edges, 402744 markings/sec, 225 secs
lola: 105547308 markings, 297528158 edges, 378712 markings/sec, 230 secs
lola: 107540171 markings, 303237312 edges, 398573 markings/sec, 235 secs
lola: 109412227 markings, 308601276 edges, 374411 markings/sec, 240 secs
lola: 111417236 markings, 314343174 edges, 401002 markings/sec, 245 secs
lola: 113234401 markings, 319554046 edges, 363433 markings/sec, 250 secs
lola: 115260382 markings, 325351136 edges, 405196 markings/sec, 255 secs
lola: 117099452 markings, 330627493 edges, 367814 markings/sec, 260 secs
lola: 119041206 markings, 336180843 edges, 388351 markings/sec, 265 secs
lola: 120822971 markings, 341293789 edges, 356353 markings/sec, 270 secs
lola: 122489438 markings, 346067625 edges, 333293 markings/sec, 275 secs
lola: 124106970 markings, 350696660 edges, 323506 markings/sec, 280 secs
lola: 125730983 markings, 355357958 edges, 324803 markings/sec, 285 secs
lola: 127401605 markings, 360137835 edges, 334124 markings/sec, 290 secs
lola: 129041886 markings, 364837669 edges, 328056 markings/sec, 295 secs
lola: 130826940 markings, 369960296 edges, 357011 markings/sec, 300 secs
lola: 132561915 markings, 374921502 edges, 346995 markings/sec, 305 secs
lola: 134387456 markings, 380157341 edges, 365108 markings/sec, 310 secs
lola: 135930940 markings, 384587147 edges, 308697 markings/sec, 315 secs
lola: 137234499 markings, 388323797 edges, 260712 markings/sec, 320 secs
lola: 138946225 markings, 393218471 edges, 342345 markings/sec, 325 secs
lola: 140615747 markings, 398012518 edges, 333904 markings/sec, 330 secs
lola: 142158843 markings, 402439359 edges, 308619 markings/sec, 335 secs
lola: 143727989 markings, 406920028 edges, 313829 markings/sec, 340 secs
lola: 145328665 markings, 411517488 edges, 320135 markings/sec, 345 secs
lola: 146914570 markings, 416070044 edges, 317181 markings/sec, 350 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown no yes no no no no no no no
lola:
preliminary result: no unknown no yes no no no no no no no
lola: memory consumption: 3528 KB
lola: time consumption: 770 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="CloudOpsManagement-PT-00320by00160"
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 CloudOpsManagement-PT-00320by00160, 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 r056-oct2-162038334700210"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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