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-162038334700213.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-00640by00320, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334700213
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 21K 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 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K 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.1K Mar 28 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 17K Mar 23 03:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 22 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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.0K 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-00640by00320-00
FORMULA_NAME CloudOpsManagement-PT-00640by00320-01
FORMULA_NAME CloudOpsManagement-PT-00640by00320-02
FORMULA_NAME CloudOpsManagement-PT-00640by00320-03
FORMULA_NAME CloudOpsManagement-PT-00640by00320-04
FORMULA_NAME CloudOpsManagement-PT-00640by00320-05
FORMULA_NAME CloudOpsManagement-PT-00640by00320-06
FORMULA_NAME CloudOpsManagement-PT-00640by00320-07
FORMULA_NAME CloudOpsManagement-PT-00640by00320-08
FORMULA_NAME CloudOpsManagement-PT-00640by00320-09
FORMULA_NAME CloudOpsManagement-PT-00640by00320-10
FORMULA_NAME CloudOpsManagement-PT-00640by00320-11
FORMULA_NAME CloudOpsManagement-PT-00640by00320-12
FORMULA_NAME CloudOpsManagement-PT-00640by00320-13
FORMULA_NAME CloudOpsManagement-PT-00640by00320-14
FORMULA_NAME CloudOpsManagement-PT-00640by00320-15

=== Now, execution of the tool begins

BK_START 1620902966220

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 10:49:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 10:49:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 10:49:27] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2021-05-13 10:49:27] [INFO ] Transformed 27 places.
[2021-05-13 10:49:27] [INFO ] Transformed 29 transitions.
[2021-05-13 10:49:27] [INFO ] Parsed PT model containing 27 places and 29 transitions in 50 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100013 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=2325 ) properties seen :[0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1]
// Phase 1: matrix 29 rows 27 cols
[2021-05-13 10:49:27] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-13 10:49:27] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2021-05-13 10:49:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-13 10:49:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-13 10:49:28] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:49:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 11 ms.
[2021-05-13 10:49:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:49:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:49:28] [INFO ] Added : 25 causal constraints over 6 iterations in 28 ms. Result :sat
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-13 10:49:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-13 10:49:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:49:28] [INFO ] Added : 22 causal constraints over 5 iterations in 34 ms. Result :sat
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned unsat
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-13 10:49:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:49:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2021-05-13 10:49:28] [INFO ] Added : 25 causal constraints over 5 iterations in 26 ms. Result :sat
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 10:49:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:49:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:49:28] [INFO ] Added : 25 causal constraints over 6 iterations in 20 ms. Result :sat
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-13 10:49:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:49:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 10:49:28] [INFO ] Added : 25 causal constraints over 5 iterations in 17 ms. Result :sat
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:49:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-13 10:49:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:49:28] [INFO ] Added : 25 causal constraints over 6 iterations in 17 ms. Result :sat
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:49:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:49:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:49:28] [INFO ] Added : 25 causal constraints over 6 iterations in 16 ms. Result :sat
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:49:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:49:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:49:28] [INFO ] Added : 25 causal constraints over 6 iterations in 16 ms. Result :sat
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:49:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:49:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:49:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:49:28] [INFO ] Added : 25 causal constraints over 6 iterations in 20 ms. Result :sat
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:49:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:49:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:49:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:49:28] [INFO ] Added : 25 causal constraints over 6 iterations in 19 ms. Result :sat
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:49:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:49:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:49:28] [INFO ] Added : 25 causal constraints over 5 iterations in 24 ms. Result :sat
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:49:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:49:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:49:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:49:28] [INFO ] Added : 25 causal constraints over 5 iterations in 22 ms. Result :sat
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 10:49:29] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:49:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:49:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:49:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:49:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:29] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:49:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:49:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:49:29] [INFO ] Added : 25 causal constraints over 6 iterations in 15 ms. Result :sat
[2021-05-13 10:49:29] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2021-05-13 10:49:29] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:49:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:49:29] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:49:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 10:49:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:49:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:49:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:29] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:49:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:49:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:49:29] [INFO ] Added : 25 causal constraints over 6 iterations in 20 ms. Result :sat
[2021-05-13 10:49:29] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:49:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:49:29] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:49:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:49:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:49:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:49:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:29] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:49:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:49:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:49:29] [INFO ] Added : 25 causal constraints over 6 iterations in 16 ms. Result :sat
[2021-05-13 10:49:29] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:49:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:29] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-13 10:49:29] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:49:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:49:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:49:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:49:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:29] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-13 10:49:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:49:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:49:29] [INFO ] Added : 25 causal constraints over 6 iterations in 23 ms. Result :sat
[2021-05-13 10:49:29] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:49:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:49:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:49:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:49:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:49:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:49:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:49:29] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 10:49:29] [INFO ] Added : 25 causal constraints over 6 iterations in 20 ms. Result :sat
Successfully simplified 4 atomic propositions for a total of 6 simplifications.
[2021-05-13 10:49:29] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-13 10:49:29] [INFO ] Flatten gal took : 23 ms
FORMULA CloudOpsManagement-PT-00640by00320-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00640by00320-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00640by00320-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00640by00320-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00640by00320-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 10:49:29] [INFO ] Flatten gal took : 5 ms
[2021-05-13 10:49:29] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-13 10:49:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ CloudOpsManagement-PT-00640by00320 @ 3570 seconds

FORMULA CloudOpsManagement-PT-00640by00320-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00640by00320-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00640by00320-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00640by00320-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00640by00320-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00640by00320-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00640by00320-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00640by00320-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00640by00320-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00640by00320-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00640by00320-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3365
rslt: Output for LTLCardinality @ CloudOpsManagement-PT-00640by00320

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 10:49:29 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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": "X (G ((p26 <= p3)))",
"processed_size": 19,
"rewrites": 71
},
"result":
{
"edges": 325,
"markings": 325,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((F ((1 <= p6)) OR X ((1 <= p6))))",
"processed_size": 36,
"rewrites": 71
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((X ((p20 <= p8)) OR F (G ((p6 <= p2)))))",
"processed_size": 43,
"rewrites": 71
},
"result":
{
"edges": 8559006,
"markings": 5671029,
"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": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((X ((p20 <= 2)) OR (p0 <= 0)) U (X (G ((p0 <= 0))) AND (1 <= p0)))",
"processed_size": 67,
"rewrites": 71
},
"result":
{
"edges": 326,
"markings": 326,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 577
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "F (G ((X ((p17 <= p12)) AND (1 <= p14))))",
"processed_size": 41,
"rewrites": 71
},
"result":
{
"edges": 327,
"markings": 326,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 692
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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 (F ((F ((p26 <= p10)) AND X (X (G ((p7 <= 1)))))))",
"processed_size": 52,
"rewrites": 71
},
"result":
{
"edges": 325,
"markings": 325,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 865
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "F (G ((p15 <= 1)))",
"processed_size": 18,
"rewrites": 71
},
"result":
{
"edges": 6304,
"markings": 5555,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1154
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "((p24 <= p20) U G ((p20 + 1 <= p24)))",
"processed_size": 37,
"rewrites": 71
},
"result":
{
"edges": 1927,
"markings": 1926,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1731
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 (((p8 <= p3)))",
"processed_size": 16,
"rewrites": 71
},
"result":
{
"edges": 1925,
"markings": 1925,
"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": 3462
},
"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 ((3 <= p7)) AND (p10 <= 1)))",
"processed_size": 34,
"rewrites": 71
},
"result":
{
"edges": 325,
"markings": 325,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3408,
"runtime": 205.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(**) : F((F(**) AND **)) : (** U G(**)) : F(G(*)) : X(G(*)) : X((F(*) OR X(**))) : G((X(**) OR F(G(**)))) : ((X(*) OR **) U (X(G(*)) AND **)) : (X(**) R (G(F((X(*) AND *))) OR *)) : F(G((X(**) AND **))) : G(F((F(**) AND X(X(G(*))))))"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "no no no no no yes no no unknown no no ",
"value": "no no no no no yes no no unknown 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 LTLCardinality.xml
lola: G (((p8 <= p3))) : F (((F ((3 <= p7)) AND (p13 <= p21)) U F ((F ((3 <= p7)) AND (p10 <= 1))))) : ((p24 <= p20) U G ((p20 + 1 <= p24))) : G (F (NOT(X (F (X (F ((2 <= p15)))))))) : NOT(F (X ((p3 + 1 <= p26)))) : (NOT(X (G ((p6 <= 0)))) OR X (X ((1 <= p6)))) : G ((X ((p20 <= p8)) OR NOT(G (F (X (NOT(G ((p6 <= p2))))))))) : ((NOT(X ((3 <= p20))) OR (p0 <= 0)) U (NOT(F (((1 <= 0) U X ((1 <= p0))))) AND (1 <= p0))) : NOT((NOT(X ((p16 <= p24))) U (F (G ((X ((1 <= p9)) OR (1 <= p12)))) AND (p23 <= p15)))) : X ((((0 <= 0) U ((p17 <= p12) U F ((p17 <= p12)))) U F (G ((X ((p17 <= p12)) AND (1 <= p14)))))) : NOT(G (F (G ((NOT(((p25 <= p7) U F ((p26 <= p10)))) OR X (F (X ((2 <= p7)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p26 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p26 <= p3)))
lola: processed formula length: 19
lola: 71 rewrites
lola: closed formula file LTLCardinality.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: 325 markings, 325 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((1 <= p6)) OR X ((1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((1 <= p6)) OR X ((1 <= p6))))
lola: processed formula length: 36
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((p20 <= p8)) OR F (G ((p6 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((p20 <= p8)) OR F (G ((p6 <= p2)))))
lola: processed formula length: 43
lola: 71 rewrites
lola: closed formula file LTLCardinality.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: 5315004 markings, 8022915 edges, 1063001 markings/sec, 0 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: 5671029 markings, 8559006 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X ((p20 <= 2)) OR (p0 <= 0)) U (X (G ((p0 <= 0))) AND (1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X ((p20 <= 2)) OR (p0 <= 0)) U (X (G ((p0 <= 0))) AND (1 <= p0)))
lola: processed formula length: 67
lola: 71 rewrites
lola: closed formula file LTLCardinality.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: 326 markings, 326 edges
lola: ========================================
lola: subprocess 4 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p16 <= p24)) R (G (F ((X ((p9 <= 0)) AND (p12 <= 0)))) OR (p15 + 1 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((p16 <= p24)) R (G (F ((X ((p9 <= 0)) AND (p12 <= 0)))) OR (p15 + 1 <= p23)))
lola: processed formula length: 81
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4899790 markings, 7387660 edges, 979958 markings/sec, 0 secs
lola: 9723273 markings, 14644772 edges, 964697 markings/sec, 5 secs
lola: 14489509 markings, 21812347 edges, 953247 markings/sec, 10 secs
lola: 19133867 markings, 28794829 edges, 928872 markings/sec, 15 secs
lola: 23936813 markings, 36014792 edges, 960589 markings/sec, 20 secs
lola: 29189481 markings, 43910209 edges, 1050534 markings/sec, 25 secs
lola: 34300481 markings, 51592560 edges, 1022200 markings/sec, 30 secs
lola: 39368282 markings, 59210307 edges, 1013560 markings/sec, 35 secs
lola: 44315727 markings, 66646844 edges, 989489 markings/sec, 40 secs
lola: 49343404 markings, 74204078 edges, 1005535 markings/sec, 45 secs
lola: 54331496 markings, 81701773 edges, 997618 markings/sec, 50 secs
lola: 59292672 markings, 89159023 edges, 992235 markings/sec, 55 secs
lola: 64345900 markings, 96754653 edges, 1010646 markings/sec, 60 secs
lola: 69322105 markings, 104234506 edges, 995241 markings/sec, 65 secs
lola: 73817644 markings, 110993049 edges, 899108 markings/sec, 70 secs
lola: 77784341 markings, 116956227 edges, 793339 markings/sec, 75 secs
lola: 81600095 markings, 122689839 edges, 763151 markings/sec, 80 secs
lola: 85659264 markings, 128791936 edges, 811834 markings/sec, 85 secs
lola: 89870318 markings, 135120999 edges, 842211 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 577 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X ((p17 <= p12)) AND (1 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((p17 <= p12)) AND (1 <= p14))))
lola: processed formula length: 41
lola: 71 rewrites
lola: closed formula file LTLCardinality.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: 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: 326 markings, 327 edges
lola: ========================================
lola: subprocess 6 will run for 692 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F ((p26 <= p10)) AND X (X (G ((p7 <= 1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((p26 <= p10)) AND X (X (G ((p7 <= 1)))))))
lola: processed formula length: 52
lola: 71 rewrites
lola: closed formula file LTLCardinality.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: 325 markings, 325 edges
lola: ========================================
lola: subprocess 7 will run for 865 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p15 <= 1)))
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 ((p15 <= 1)))
lola: processed formula length: 18
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 3
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: 5555 markings, 6304 edges
lola: ========================================
lola: subprocess 8 will run for 1154 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p24 <= p20) U G ((p20 + 1 <= p24)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p24 <= p20) U G ((p20 + 1 <= p24)))
lola: processed formula length: 37
lola: 71 rewrites
lola: closed formula file LTLCardinality.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: add low 3
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: 1926 markings, 1927 edges
lola: ========================================
lola: subprocess 9 will run for 1731 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p8 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p8 <= p3)))
lola: processed formula length: 16
lola: 71 rewrites
lola: closed formula file LTLCardinality.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: 1925 markings, 1925 edges
lola: ========================================
lola: subprocess 10 will run for 3462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((3 <= p7)) AND (p10 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((3 <= p7)) AND (p10 <= 1)))
lola: processed formula length: 34
lola: 71 rewrites
lola: closed formula file LTLCardinality.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: 325 markings, 325 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (X ((p16 <= p24)) R (G (F ((X ((p9 <= 0)) AND (p12 <= 0)))) OR (p15 + 1 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((p16 <= p24)) R (G (F ((X ((p9 <= 0)) AND (p12 <= 0)))) OR (p15 + 1 <= p23)))
lola: processed formula length: 81
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4894289 markings, 7379354 edges, 978858 markings/sec, 0 secs
lola: 9671690 markings, 14567183 edges, 955480 markings/sec, 5 secs
lola: 14384027 markings, 21653749 edges, 942467 markings/sec, 10 secs
lola: 19071806 markings, 28701489 edges, 937556 markings/sec, 15 secs
lola: 24008477 markings, 36122533 edges, 987334 markings/sec, 20 secs
lola: 29324970 markings, 44113763 edges, 1063299 markings/sec, 25 secs
lola: 34484726 markings, 51869514 edges, 1031951 markings/sec, 30 secs
lola: 39581734 markings, 59531057 edges, 1019402 markings/sec, 35 secs
lola: 44538667 markings, 66981916 edges, 991387 markings/sec, 40 secs
lola: 49584201 markings, 74566004 edges, 1009107 markings/sec, 45 secs
lola: 54501166 markings, 81956901 edges, 983393 markings/sec, 50 secs
lola: 59385636 markings, 89298701 edges, 976894 markings/sec, 55 secs
lola: 64398951 markings, 96834339 edges, 1002663 markings/sec, 60 secs
lola: 69364169 markings, 104297678 edges, 993044 markings/sec, 65 secs
lola: 74106087 markings, 111426210 edges, 948384 markings/sec, 70 secs
lola: 78236058 markings, 117635368 edges, 825994 markings/sec, 75 secs
lola: 82369083 markings, 123846016 edges, 826605 markings/sec, 80 secs
lola: 86361923 markings, 129849487 edges, 798568 markings/sec, 85 secs
lola: 90522736 markings, 136115553 edges, 832163 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no yes no no unknown no no
lola:
preliminary result: no no no no no yes no no unknown no no
lola: memory consumption: 3408 KB
lola: time consumption: 205 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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-00640by00320"
export BK_EXAMINATION="LTLCardinality"
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-00640by00320, examination is LTLCardinality"
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-162038334700213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudOpsManagement-PT-00640by00320.tgz
mv CloudOpsManagement-PT-00640by00320 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;