fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r056-oct2-162038334700185
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for CloudOpsManagement-PT-00005by00002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4274.384 3600000.00 12804.00 84.70 FTFFFTFFFFTFFTTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K 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 88K 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.2K Mar 28 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 03:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 22 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26K Mar 22 12:49 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-00005by00002-00
FORMULA_NAME CloudOpsManagement-PT-00005by00002-01
FORMULA_NAME CloudOpsManagement-PT-00005by00002-02
FORMULA_NAME CloudOpsManagement-PT-00005by00002-03
FORMULA_NAME CloudOpsManagement-PT-00005by00002-04
FORMULA_NAME CloudOpsManagement-PT-00005by00002-05
FORMULA_NAME CloudOpsManagement-PT-00005by00002-06
FORMULA_NAME CloudOpsManagement-PT-00005by00002-07
FORMULA_NAME CloudOpsManagement-PT-00005by00002-08
FORMULA_NAME CloudOpsManagement-PT-00005by00002-09
FORMULA_NAME CloudOpsManagement-PT-00005by00002-10
FORMULA_NAME CloudOpsManagement-PT-00005by00002-11
FORMULA_NAME CloudOpsManagement-PT-00005by00002-12
FORMULA_NAME CloudOpsManagement-PT-00005by00002-13
FORMULA_NAME CloudOpsManagement-PT-00005by00002-14
FORMULA_NAME CloudOpsManagement-PT-00005by00002-15

=== Now, execution of the tool begins

BK_START 1620902041732

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 10:34:03] [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:34:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 10:34:03] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-13 10:34:03] [INFO ] Transformed 27 places.
[2021-05-13 10:34:03] [INFO ] Transformed 29 transitions.
[2021-05-13 10:34:03] [INFO ] Parsed PT model containing 27 places and 29 transitions in 56 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 84 ms. (steps per millisecond=1190 ) properties seen :[1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0]
// Phase 1: matrix 29 rows 27 cols
[2021-05-13 10:34:03] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-13 10:34:03] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2021-05-13 10:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:03] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-13 10:34:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-13 10:34:03] [INFO ] [Real]Added 3 Read/Feed constraints in 14 ms returned sat
[2021-05-13 10:34:03] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2021-05-13 10:34:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:34:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2021-05-13 10:34:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:03] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-13 10:34:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:34:03] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2021-05-13 10:34:03] [INFO ] Added : 25 causal constraints over 6 iterations in 34 ms. Result :sat
[2021-05-13 10:34:03] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-13 10:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:03] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-13 10:34:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:34:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:34:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:03] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:34:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:34:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:34:04] [INFO ] Added : 25 causal constraints over 6 iterations in 19 ms. Result :sat
[2021-05-13 10:34:04] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:04] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:34:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:34:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:04] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:34:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2021-05-13 10:34:04] [INFO ] Added : 25 causal constraints over 5 iterations in 20 ms. Result :sat
[2021-05-13 10:34:04] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:34:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:34:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:04] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:34:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:34:04] [INFO ] Added : 25 causal constraints over 5 iterations in 19 ms. Result :sat
[2021-05-13 10:34:04] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
[2021-05-13 10:34:04] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:04] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:34:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:34:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:34:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:04] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:34:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 10:34:04] [INFO ] Added : 25 causal constraints over 6 iterations in 19 ms. Result :sat
[2021-05-13 10:34:04] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:34:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:34:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 67 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:04] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-13 10:34:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2021-05-13 10:34:04] [INFO ] Added : 25 causal constraints over 6 iterations in 44 ms. Result :sat
[2021-05-13 10:34:04] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:04] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Real]Added 3 Read/Feed constraints in 17 ms returned sat
[2021-05-13 10:34:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 30 ms.
[2021-05-13 10:34:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:34:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:04] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:34:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 10 ms.
[2021-05-13 10:34:04] [INFO ] Added : 25 causal constraints over 6 iterations in 32 ms. Result :sat
[2021-05-13 10:34:04] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2021-05-13 10:34:04] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:04] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-13 10:34:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:34:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:04] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:34:04] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2021-05-13 10:34:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2021-05-13 10:34:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:34:04] [INFO ] Added : 26 causal constraints over 6 iterations in 32 ms. Result :sat
[2021-05-13 10:34:04] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:04] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:34:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:34:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:34:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:04] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:34:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:34:04] [INFO ] Added : 25 causal constraints over 6 iterations in 18 ms. Result :sat
[2021-05-13 10:34:04] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
[2021-05-13 10:34:04] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned unsat
[2021-05-13 10:34:04] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:04] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:34:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:34:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:34:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:04] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 10:34:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:34:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:34:04] [INFO ] Added : 25 causal constraints over 6 iterations in 41 ms. Result :sat
[2021-05-13 10:34:04] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2021-05-13 10:34:04] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
[2021-05-13 10:34:05] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2021-05-13 10:34:05] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:34:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:05] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:34:05] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:34:05] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:34:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:34:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:34:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:05] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 10:34:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:34:05] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:34:05] [INFO ] Added : 25 causal constraints over 6 iterations in 37 ms. Result :sat
[2021-05-13 10:34:05] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
[2021-05-13 10:34:05] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-13 10:34:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:05] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-13 10:34:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:34:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:34:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:05] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:34:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:34:05] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:34:05] [INFO ] Added : 25 causal constraints over 6 iterations in 15 ms. Result :sat
[2021-05-13 10:34:05] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:34:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:05] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:34:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:34:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:34:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:34:05] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:34:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 11 ms returned sat
[2021-05-13 10:34:05] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 6 ms.
[2021-05-13 10:34:05] [INFO ] Added : 25 causal constraints over 5 iterations in 37 ms. Result :sat
Successfully simplified 8 atomic propositions for a total of 10 simplifications.
[2021-05-13 10:34:05] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-13 10:34:05] [INFO ] Flatten gal took : 24 ms
FORMULA CloudOpsManagement-PT-00005by00002-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00005by00002-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00005by00002-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00005by00002-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00005by00002-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00005by00002-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 10:34:05] [INFO ] Flatten gal took : 5 ms
[2021-05-13 10:34:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CloudOpsManagement-PT-00005by00002-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 10:34:05] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 9 ms.
[2021-05-13 10:34:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ CloudOpsManagement-PT-00005by00002 @ 3570 seconds

FORMULA CloudOpsManagement-PT-00005by00002-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00005by00002-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00005by00002-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00005by00002-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00005by00002-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00005by00002-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00005by00002-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00005by00002-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00005by00002-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ CloudOpsManagement-PT-00005by00002

{
"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:34:05 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "X (F ((G (F ((2 <= p1))) OR X ((1 <= p14)))))",
"processed_size": 45,
"rewrites": 37
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 445
},
"child":
[

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": 3,
"visible_transitions": 0
},
"processed": "G ((G ((2 <= p14)) OR (p8 + 1 <= p16)))",
"processed_size": 39,
"rewrites": 37
},
"result":
{
"edges": 2481,
"markings": 1315,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((2 <= p14))",
"processed_size": 14,
"rewrites": 37
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"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": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((X ((p14 <= p1)) OR (2 <= p15))))",
"processed_size": 39,
"rewrites": 37
},
"result":
{
"edges": 28,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p7 <= 2)",
"processed_size": 9,
"rewrites": 39
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"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": "F (G ((F ((p8 <= 2)) OR (p8 + 1 <= p22))))",
"processed_size": 42,
"rewrites": 37
},
"result":
{
"edges": 225,
"markings": 118,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p14 <= 0)",
"processed_size": 10,
"rewrites": 39
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p14 <= 0)",
"processed_size": 10,
"rewrites": 39
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p6) U (3 <= p7))",
"processed_size": 23,
"rewrites": 37
},
"result":
{
"edges": 7,
"markings": 7,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 20480,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(F((G(F(**)) OR X(**)))) : (X((X(F(*)) R *)) AND (** U **)) : F(**) : X(F((F(*) OR (** U X(**))))) : (X(**) OR (G((G(**) OR **)) AND X(F(**)))) : G(F((X(**) OR **))) : ((** U **) OR F(**)) : F((G(**) AND (G(*) OR F(**)))) : F(G((F(*) OR *)))"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "no yes no yes no no no no no ",
"value": "no yes no yes 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 LTLCardinality.xml
lola: F (X (((p1 <= 1) U F ((G (F ((2 <= p1))) OR X ((1 <= p14))))))) : (NOT((X (G (X ((p13 <= p15)))) U X ((p9 + 1 <= p22)))) AND ((2 <= p9) U (p22 <= p9))) : (F ((G ((p11 <= p6)) U (p11 <= p6))) U F ((3 <= p7))) : F (X (F ((NOT(G ((p25 <= 1))) OR ((p25 + 1 <= p0) U X ((p15 <= p8))))))) : (G ((G ((2 <= p14)) OR (p8 + 1 <= p16))) U X ((2 <= p14))) : G (F ((X ((p14 <= p1)) OR (2 <= p15)))) : (((1 <= p6) U (3 <= p7)) OR F ((1 <= p14))) : F ((G ((1 <= p15)) AND (NOT(((0 <= 0) U (1 <= p15))) OR F ((p6 <= p2))))) : F (G (X (X (F (G ((NOT(G (X ((3 <= p8)))) OR NOT(X ((p22 <= p8))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:410
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (F ((2 <= p1))) OR X ((1 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (F ((2 <= p1))) OR X ((1 <= p14)))))
lola: processed formula length: 45
lola: 37 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (F ((p15 + 1 <= p13))) R (p22 <= p9))) AND ((2 <= p9) U (p22 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p9) U (p22 <= p9))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((2 <= p9) U (p22 <= p9))
lola: processed formula length: 25
lola: 37 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((p15 + 1 <= p13))) R (p22 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((p15 + 1 <= p13))) R (p22 <= p9)))
lola: processed formula length: 44
lola: 37 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: 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: 45737 markings, 230644 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((2 <= p25)) OR ((p25 + 1 <= p0) U X ((p15 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((2 <= p25)) OR ((p25 + 1 <= p0) U X ((p15 <= p8))))))
lola: processed formula length: 63
lola: 37 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: 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 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((2 <= p14)) OR (G ((G ((2 <= p14)) OR (p8 + 1 <= p16))) AND X (F ((2 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((2 <= p14)) OR (p8 + 1 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((2 <= p14)) OR (p8 + 1 <= p16)))
lola: processed formula length: 39
lola: 37 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: 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: 1315 markings, 2481 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((2 <= p14))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((2 <= p14))
lola: processed formula length: 14
lola: 37 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: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X ((p14 <= p1)) OR (2 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X ((p14 <= p1)) OR (2 <= p15))))
lola: processed formula length: 39
lola: 37 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: 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: 22 markings, 28 edges
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((3 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p7 <= 2)
lola: processed formula length: 9
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 6 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p8 <= 2)) OR (p8 + 1 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p8 <= 2)) OR (p8 + 1 <= p22))))
lola: processed formula length: 42
lola: 37 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: 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 26
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: 118 markings, 225 edges
lola: ========================================
lola: subprocess 7 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((1 <= p15)) AND (G ((p15 <= 0)) OR F ((p6 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((1 <= p15)) AND (G ((p15 <= 0)) OR F ((p6 <= p2)))))
lola: processed formula length: 59
lola: 37 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p6) U (3 <= p7)) OR F ((1 <= p14)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p14))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p14 <= 0)
lola: processed formula length: 10
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 19 markings, 19 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((1 <= p6) U (3 <= p7)) OR F ((1 <= p14)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((1 <= p14))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p14 <= 0)
lola: processed formula length: 10
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 19 markings, 19 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((1 <= p6) U (3 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p6) U (3 <= p7))
lola: processed formula length: 23
lola: 37 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: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes no no no no no
lola:
preliminary result: no yes no yes no no no no no
lola: memory consumption: 20480 KB
lola: time consumption: 3 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-00005by00002"
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-00005by00002, 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-162038334700185"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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