Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r168-smll-158987806700402.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is CloudOpsManagement-PT-00080by00040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-smll-158987806700402
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 4.1K Mar 30 01:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 30 01:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 8 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 8 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 27 08:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 08:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 26 08:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 26 08:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 16K Mar 24 05:37 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-00080by00040-00
FORMULA_NAME CloudOpsManagement-PT-00080by00040-01
FORMULA_NAME CloudOpsManagement-PT-00080by00040-02
FORMULA_NAME CloudOpsManagement-PT-00080by00040-03
FORMULA_NAME CloudOpsManagement-PT-00080by00040-04
FORMULA_NAME CloudOpsManagement-PT-00080by00040-05
FORMULA_NAME CloudOpsManagement-PT-00080by00040-06
FORMULA_NAME CloudOpsManagement-PT-00080by00040-07
FORMULA_NAME CloudOpsManagement-PT-00080by00040-08
FORMULA_NAME CloudOpsManagement-PT-00080by00040-09
FORMULA_NAME CloudOpsManagement-PT-00080by00040-10
FORMULA_NAME CloudOpsManagement-PT-00080by00040-11
FORMULA_NAME CloudOpsManagement-PT-00080by00040-12
FORMULA_NAME CloudOpsManagement-PT-00080by00040-13
FORMULA_NAME CloudOpsManagement-PT-00080by00040-14
FORMULA_NAME CloudOpsManagement-PT-00080by00040-15

=== Now, execution of the tool begins

BK_START 1591334358327

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 05:19:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 05:19:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 05:19:21] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2020-06-05 05:19:21] [INFO ] Transformed 27 places.
[2020-06-05 05:19:21] [INFO ] Transformed 29 transitions.
[2020-06-05 05:19:21] [INFO ] Parsed PT model containing 27 places and 29 transitions in 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100022 steps, including 0 resets, run finished after 113 ms. (steps per millisecond=885 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1]
// Phase 1: matrix 29 rows 27 cols
[2020-06-05 05:19:21] [INFO ] Computed 11 place invariants in 5 ms
[2020-06-05 05:19:21] [INFO ] [Real]Absence check using 11 positive place invariants in 22 ms returned sat
[2020-06-05 05:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:21] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-06-05 05:19:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2020-06-05 05:19:21] [INFO ] [Real]Added 3 Read/Feed constraints in 10 ms returned sat
[2020-06-05 05:19:21] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 7 ms.
[2020-06-05 05:19:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:19:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-06-05 05:19:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:21] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2020-06-05 05:19:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 6 ms returned sat
[2020-06-05 05:19:21] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 6 ms.
[2020-06-05 05:19:21] [INFO ] Added : 25 causal constraints over 6 iterations in 61 ms. Result :sat
[2020-06-05 05:19:21] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 05:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:21] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-06-05 05:19:21] [INFO ] [Real]Added 3 Read/Feed constraints in 3 ms returned sat
[2020-06-05 05:19:21] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 7 ms.
[2020-06-05 05:19:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:19:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-05 05:19:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:22] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 05:19:22] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 8 ms.
[2020-06-05 05:19:22] [INFO ] Added : 25 causal constraints over 6 iterations in 60 ms. Result :sat
[2020-06-05 05:19:22] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:22] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 05:19:22] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 9 ms.
[2020-06-05 05:19:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:19:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:22] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 05:19:22] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 7 ms.
[2020-06-05 05:19:22] [INFO ] Added : 25 causal constraints over 6 iterations in 46 ms. Result :sat
[2020-06-05 05:19:22] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:22] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 05:19:22] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 7 ms.
[2020-06-05 05:19:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:19:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:22] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2020-06-05 05:19:22] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 6 ms.
[2020-06-05 05:19:22] [INFO ] Added : 25 causal constraints over 6 iterations in 40 ms. Result :sat
[2020-06-05 05:19:22] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:22] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 05:19:22] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 05:19:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:19:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:22] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2020-06-05 05:19:22] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 05:19:22] [INFO ] Added : 25 causal constraints over 6 iterations in 41 ms. Result :sat
[2020-06-05 05:19:22] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:22] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 05:19:22] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 05:19:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:19:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:22] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 05:19:22] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 05:19:22] [INFO ] Added : 25 causal constraints over 6 iterations in 40 ms. Result :sat
[2020-06-05 05:19:22] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:22] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 05:19:22] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 05:19:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:19:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:22] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2020-06-05 05:19:22] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 05:19:22] [INFO ] Added : 25 causal constraints over 6 iterations in 43 ms. Result :sat
[2020-06-05 05:19:22] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:22] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 05:19:22] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 05:19:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:19:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:22] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2020-06-05 05:19:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 05:19:22] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 05:19:23] [INFO ] Added : 25 causal constraints over 6 iterations in 39 ms. Result :sat
[2020-06-05 05:19:23] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 05:19:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:23] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-06-05 05:19:23] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 05:19:23] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 05:19:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:19:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-05 05:19:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:23] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-05 05:19:23] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 05:19:23] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 05:19:23] [INFO ] Added : 25 causal constraints over 6 iterations in 60 ms. Result :sat
[2020-06-05 05:19:23] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 05:19:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:23] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-06-05 05:19:23] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 05:19:23] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 05:19:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:19:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-05 05:19:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:23] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-05 05:19:23] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2020-06-05 05:19:23] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 11 ms.
[2020-06-05 05:19:23] [INFO ] Added : 25 causal constraints over 6 iterations in 56 ms. Result :sat
[2020-06-05 05:19:23] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 05:19:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:23] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-06-05 05:19:23] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 05:19:23] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 8 ms.
[2020-06-05 05:19:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:19:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-05 05:19:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:23] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2020-06-05 05:19:23] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2020-06-05 05:19:23] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 05:19:23] [INFO ] Added : 25 causal constraints over 6 iterations in 61 ms. Result :sat
[2020-06-05 05:19:23] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 05:19:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:23] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-06-05 05:19:23] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 05:19:23] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 05:19:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:19:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 24 ms returned sat
[2020-06-05 05:19:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:23] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-05 05:19:23] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 05:19:23] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 05:19:23] [INFO ] Added : 25 causal constraints over 6 iterations in 45 ms. Result :sat
[2020-06-05 05:19:23] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 05:19:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:23] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-06-05 05:19:23] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 05:19:23] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 05:19:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:19:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-05 05:19:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:23] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-05 05:19:23] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2020-06-05 05:19:23] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 7 ms.
[2020-06-05 05:19:23] [INFO ] Added : 25 causal constraints over 5 iterations in 45 ms. Result :sat
[2020-06-05 05:19:24] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 05:19:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:24] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-06-05 05:19:24] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 05:19:24] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 05:19:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:19:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-05 05:19:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:19:24] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-05 05:19:24] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 05:19:24] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 05:19:24] [INFO ] Added : 25 causal constraints over 5 iterations in 41 ms. Result :sat
[2020-06-05 05:19:24] [INFO ] Flatten gal took : 54 ms
[2020-06-05 05:19:24] [INFO ] Flatten gal took : 17 ms
[2020-06-05 05:19:24] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2020-06-05 05:19:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CloudOpsManagement-PT-00080by00040 @ 3570 seconds

FORMULA CloudOpsManagement-PT-00080by00040-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3080
rslt: Output for LTLFireability @ CloudOpsManagement-PT-00080by00040

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p6 <= 0) OR (p26 <= 0))",
"processed_size": 25,
"rewrites": 79
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((X (X (G (((1 <= p6) AND (1 <= p26))))) AND ((1 <= p6) AND (1 <= p26)))))",
"processed_size": 79,
"rewrites": 78
},
"result":
{
"edges": 4390233,
"markings": 2878591,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 6,
"G": 3,
"U": 0,
"X": 2,
"aconj": 10,
"adisj": 0,
"aneg": 1,
"comp": 21,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 21,
"taut": 0,
"tconj": 5,
"tdisj": 5,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((F ((((1 <= p3) AND (1 <= p4)) OR (G ((F (((1 <= p3) AND (1 <= p4))) AND (((1 <= p6) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p4))))) AND F (((1 <= p3) AND (1 <= p4)))))) AND (X (X (F ((p22 <= 0)))) OR (((1 <= p3) AND (1 <= p4)) OR (G ((F (((1 <= p3) AND (1 <= p4))) AND (((1 <= p6) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p4))))) AND F (((1 <= p3) AND (1 <= p4))))))))",
"processed_size": 371,
"rewrites": 78
},
"result":
{
"edges": 45,
"markings": 45,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 15
},
"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": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "G ((X (F (((p21 <= 0)))) OR (1 <= p14)))",
"processed_size": 40,
"rewrites": 78
},
"result":
{
"edges": 86,
"markings": 86,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((X (G ((1 <= p18))) AND F ((1 <= p22))))",
"processed_size": 43,
"rewrites": 78
},
"result":
{
"edges": 45,
"markings": 45,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (((1 <= p10) AND (1 <= p25))) AND ((p14 <= 0) OR G (((1 <= p22) AND (1 <= p22))))))",
"processed_size": 89,
"rewrites": 78
},
"result":
{
"edges": 23,
"markings": 21,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 5,
"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": 5,
"visible_transitions": 0
},
"processed": "G (F ((G (((p13 <= 0) OR (p17 <= 0) OR (p21 <= 0))) OR ((1 <= p10) AND (1 <= p25)))))",
"processed_size": 87,
"rewrites": 78
},
"result":
{
"edges": 47,
"markings": 46,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p17 <= 0))",
"processed_size": 12,
"rewrites": 80
},
"result":
{
"edges": 245,
"markings": 245,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((1 <= p15))",
"processed_size": 14,
"rewrites": 78
},
"result":
{
"edges": 45,
"markings": 45,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"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": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((X ((((p3 <= 0) OR (p4 <= 0)) OR X (((p21 <= 0))))) OR ((1 <= p14) OR ((1 <= p13)))))",
"processed_size": 89,
"rewrites": 78
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((X (X (G (((p22 <= 0) AND (p7 <= 0))))) AND ((1 <= p10) AND (1 <= p25))))",
"processed_size": 76,
"rewrites": 78
},
"result":
{
"edges": 91378,
"markings": 59551,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"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": 508
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 660
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((F ((1 <= p18)) AND (X (G ((1 <= p20))) OR (1 <= p18))))",
"processed_size": 59,
"rewrites": 78
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 11,
"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": 825
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"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": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((X (G ((1 <= p14))) AND G ((1 <= p12))))",
"processed_size": 43,
"rewrites": 78
},
"result":
{
"edges": 45,
"markings": 45,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 12,
"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": 1100
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p15) AND (F ((p15 <= 0)) OR G ((1 <= p15))))))",
"processed_size": 59,
"rewrites": 78
},
"result":
{
"edges": 247,
"markings": 246,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 13,
"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": 1651
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 4,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((1 <= p0) AND (1 <= p26)) U (((1 <= p12) OR (G ((1 <= p14)) AND F ((1 <= p12)))) AND (G (((1 <= p0) AND (1 <= p26))) AND ((1 <= p0) AND (1 <= p26)))))",
"processed_size": 152,
"rewrites": 78
},
"result":
{
"edges": 5449111,
"markings": 2312917,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 22
},
"compoundnumber": 14,
"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": 3296
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G (((1 <= p6) AND (1 <= p26))) AND (p2 <= 0)))",
"processed_size": 50,
"rewrites": 78
},
"result":
{
"edges": 2347,
"markings": 1219,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3252,
"runtime": 490.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(F((X(X(G(**))) AND (** AND **)))) OR (** OR **)) : G((F((** OR (G((F(**) AND (** OR **))) AND F(**)))) AND (X(X(F(*))) OR (** OR (G((F(**) AND (** OR **))) AND F(**)))))) : (F((G(**) AND **)) OR (G(F(*)) AND F((G(**) AND **)))) : G((X(F(*)) OR **)) : X((X(G(**)) AND F(**))) : X((X(**) AND (** OR G((* AND *))))) : (X((** U **)) AND G(F((G(*) OR **)))) : (X(**) OR (F(**) OR (X(G(**)) AND **))) : F((X((** OR X(**))) OR (** OR **))) : G((X(X(G(**))) AND (** AND **))) : (X(F(**)) OR **) : (** U ((** OR (G(**) AND F(**))) AND (G(**) AND (** AND **)))) : F(G((X(*) OR (G(F(**)) OR **)))) : F(G((* AND (F(*) OR G(*))))) : F((F(**) AND (X(G(**)) OR **))) : X((X(G(**)) AND 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 yes no no no unknown no no no ",
"value": "no no no no no yes no no yes no no no unknown no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 56/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 29 transitions, 16 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p19)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: LP says that atomic proposition is always true: (1 <= p16)
lola: ((F (X (((G (X (X (((1 <= p6) AND (1 <= p26))))) AND (1 <= p6)) AND (1 <= p26)))) OR (p6 <= 0)) OR (p26 <= 0)) : G ((NOT(X (X (G ((1 <= p22))))) U (G ((((1 <= p6) AND (1 <= p26)) U ((1 <= p3) AND (1 <= p4)))) U ((1 <= p3) AND (1 <= p4))))) : (X (NOT(F (G (((p6 <= 0) OR (p26 <= 0) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p21))))))) U F ((G (((1 <= p6) AND (1 <= p26))) AND (p2 <= 0)))) : G ((NOT(X (G (((1 <= p21))))) OR (1 <= p14))) : X ((X (G ((1 <= p18))) AND F ((1 <= p22)))) : X ((X (((1 <= p10) AND (1 <= p25))) AND ((p14 <= 0) OR (NOT(F ((p22 <= 0))) AND NOT(((1 <= p22) U (p22 <= 0))))))) : ((X (((1 <= p8) AND (1 <= p9))) U X (((1 <= p10) AND (1 <= p25)))) AND G (F ((NOT(F (((1 <= p13) AND (1 <= p17) AND (1 <= p21)))) OR ((1 <= p10) AND (1 <= p25)))))) : ((X ((1 <= p15)) OR F (((1 <= p17)))) OR (G (X ((1 <= p3))) AND (1 <= p3))) : F ((((X (((p3 <= 0) OR (p4 <= 0))) OR X (X (((p21 <= 0))))) OR (1 <= p14)) OR ((1 <= p13)))) : G (((X (X (G (((p22 <= 0) AND (p7 <= 0))))) AND (1 <= p10)) AND (1 <= p25))) : (F (X (((1 <= p13) AND (1 <= p17) AND (1 <= p21)))) OR (1 <= p3)) : (((1 <= p0) AND (1 <= p26)) U ((((G ((1 <= p14)) U (1 <= p12)) AND G (((1 <= p0) AND (1 <= p26)))) AND (1 <= p0)) AND (1 <= p26))) : F (G (X (X (F (G (((NOT(X (((1 <= p3) AND (1 <= p4)))) OR G (F (((1 <= p3) AND (1 <= p4))))) OR (1 <= p11)))))))) : G (F (X (F (X (F (G (NOT(X (X ((G ((1 <= p15)) U (p15 <= 0)))))))))))) : F (((G (X (((1 <= p20) AND (1 <= p22)))) U F ((1 <= p18))) AND (G (X ((1 <= p20))) OR (1 <= p18)))) : (X (G (X ((1 <= p14)))) AND G (NOT(X ((p12 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:419
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:410
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((X (X (G (((1 <= p6) AND (1 <= p26))))) AND ((1 <= p6) AND (1 <= p26))))) OR ((p6 <= 0) OR (p26 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p6 <= 0) OR (p26 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((p6 <= 0) OR (p26 <= 0))
lola: processed formula length: 25
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (X (G (((1 <= p6) AND (1 <= p26))))) AND ((1 <= p6) AND (1 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (X (G (((1 <= p6) AND (1 <= p26))))) AND ((1 <= p6) AND (1 <= p26)))))
lola: processed formula length: 79
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2777308 markings, 4235812 edges, 555462 markings/sec, 0 secs
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: 2878591 markings, 4390233 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((((1 <= p3) AND (1 <= p4)) OR (G ((F (((1 <= p3) AND (1 <= p4))) AND (((1 <= p6) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p4))))) AND F (((1 <= p3) AND (1 <= p4)))))) AND (X (X (F ((p22 <= 0)))) OR (((1 <= p3) AND (1 <= p4)) OR (G ((F (((1 <= p3) AND (1 <= p4))) AND (((1 <= p6) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p4))))) AND F (((1 <= p3) AND (1 <= p4))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((((1 <= p3) AND (1 <= p4)) OR (G ((F (((1 <= p3) AND (1 <= p4))) AND (((1 <= p6) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p4))))) AND F (((1 <= p3) AND (1 <= p4)))))) AND (X (X (F ((p22 <= 0)))) OR (((1 <= p3) AND (1 <= p4)) OR (G ((F (((1 <= p3) AND (1 <= p4))) AND (((1 <= p6) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p4))))) AND F (((1 <= p3) AND (1 <= p4))))))))
lola: processed formula length: 371
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 15 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: 45 markings, 45 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (F (((p21 <= 0)))) OR (1 <= p14)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F (((p21 <= 0)))) OR (1 <= p14)))
lola: processed formula length: 40
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 86 markings, 86 edges
lola: ========================================
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((1 <= p18))) AND F ((1 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((1 <= p18))) AND F ((1 <= p22))))
lola: processed formula length: 43
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 45 edges
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (((1 <= p10) AND (1 <= p25))) AND ((p14 <= 0) OR G (((1 <= p22) AND (1 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (((1 <= p10) AND (1 <= p25))) AND ((p14 <= 0) OR G (((1 <= p22) AND (1 <= p22))))))
lola: processed formula length: 89
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 21 markings, 23 edges
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((1 <= p8) AND (1 <= p9)) U ((1 <= p10) AND (1 <= p25)))) AND G (F ((G (((p13 <= 0) OR (p17 <= 0) OR (p21 <= 0))) OR ((1 <= p10) AND (1 <= p25))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((p13 <= 0) OR (p17 <= 0) OR (p21 <= 0))) OR ((1 <= p10) AND (1 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((p13 <= 0) OR (p17 <= 0) OR (p21 <= 0))) OR ((1 <= p10) AND (1 <= p25)))))
lola: processed formula length: 87
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 46 markings, 47 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((1 <= p15)) OR (F (((1 <= p17))) OR (X (G ((1 <= p3))) AND (1 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p3)
lola: processed formula length: 9
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p17)))
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: ((p17 <= 0))
lola: processed formula length: 12
lola: 80 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 245 markings, 245 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((1 <= p15))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((1 <= p15))
lola: processed formula length: 14
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 45 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((((p3 <= 0) OR (p4 <= 0)) OR X (((p21 <= 0))))) OR ((1 <= p14) OR ((1 <= p13)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((((p3 <= 0) OR (p4 <= 0)) OR X (((p21 <= 0))))) OR ((1 <= p14) OR ((1 <= p13)))))
lola: processed formula length: 89
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (X (G (((p22 <= 0) AND (p7 <= 0))))) AND ((1 <= p10) AND (1 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X (G (((p22 <= 0) AND (p7 <= 0))))) AND ((1 <= p10) AND (1 <= p25))))
lola: processed formula length: 76
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 59551 markings, 91378 edges
lola: ========================================
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((1 <= p13) AND (1 <= p17) AND (1 <= p21)))) OR (1 <= p3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p3)
lola: processed formula length: 9
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p13) AND (1 <= p17) AND (1 <= p21))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p13) AND (1 <= p17) AND (1 <= p21))))
lola: processed formula length: 50
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 43 markings, 43 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (((p3 <= 0) OR (p4 <= 0))) OR (G (F (((1 <= p3) AND (1 <= p4)))) OR (1 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (((p3 <= 0) OR (p4 <= 0))) OR (G (F (((1 <= p3) AND (1 <= p4)))) OR (1 <= p11)))))
lola: processed formula length: 92
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3514921 markings, 5360648 edges, 702984 markings/sec, 0 secs
lola: 7073048 markings, 10786572 edges, 711625 markings/sec, 5 secs
lola: 10456223 markings, 15945744 edges, 676635 markings/sec, 10 secs
lola: 13715900 markings, 20916604 edges, 651935 markings/sec, 15 secs
lola: 16919549 markings, 25801997 edges, 640730 markings/sec, 20 secs
lola: 20066051 markings, 30600263 edges, 629300 markings/sec, 25 secs
lola: 23229473 markings, 35424327 edges, 632684 markings/sec, 30 secs
lola: 26383386 markings, 40371689 edges, 630783 markings/sec, 35 secs
lola: 29768620 markings, 45614137 edges, 677047 markings/sec, 40 secs
lola: 33193687 markings, 50929535 edges, 685013 markings/sec, 45 secs
lola: 36540718 markings, 56104860 edges, 669406 markings/sec, 50 secs
lola: 39846185 markings, 61222989 edges, 661093 markings/sec, 55 secs
lola: 43023680 markings, 66136972 edges, 635499 markings/sec, 60 secs
lola: 46283968 markings, 71172550 edges, 652058 markings/sec, 65 secs
lola: 49400195 markings, 75981146 edges, 623245 markings/sec, 70 secs
lola: 52635814 markings, 80980182 edges, 647124 markings/sec, 75 secs
lola: 55848546 markings, 85942887 edges, 642546 markings/sec, 80 secs
lola: 59008845 markings, 90846845 edges, 632060 markings/sec, 85 secs
lola: 62107273 markings, 95633426 edges, 619686 markings/sec, 90 secs
lola: 65313541 markings, 100604072 edges, 641254 markings/sec, 95 secs
lola: 68393679 markings, 105378444 edges, 616028 markings/sec, 100 secs
lola: 71630828 markings, 110414210 edges, 647430 markings/sec, 105 secs
lola: 74869479 markings, 115461252 edges, 647730 markings/sec, 110 secs
lola: 76636347 markings, 118224958 edges, 353374 markings/sec, 115 secs
lola: 76778571 markings, 118452764 edges, 28445 markings/sec, 120 secs
lola: 78893067 markings, 121771304 edges, 422899 markings/sec, 125 secs
lola: 80945025 markings, 125037934 edges, 410392 markings/sec, 130 secs
lola: 83797934 markings, 129613386 edges, 570582 markings/sec, 135 secs
lola: 85353011 markings, 132285434 edges, 311015 markings/sec, 140 secs
lola: 85440000 markings, 132429394 edges, 17398 markings/sec, 145 secs
lola: 87122331 markings, 135208381 edges, 336466 markings/sec, 150 secs
lola: 87383757 markings, 135652823 edges, 52285 markings/sec, 155 secs
lola: 89572305 markings, 139248131 edges, 437710 markings/sec, 160 secs
lola: 89838350 markings, 139698136 edges, 53209 markings/sec, 165 secs
lola: 89838350 markings, 139698136 edges, 0 markings/sec, 170 secs
lola: 91416996 markings, 142306861 edges, 315729 markings/sec, 175 secs
lola: 93614081 markings, 145913703 edges, 439417 markings/sec, 180 secs
lola: 94004699 markings, 146557255 edges, 78124 markings/sec, 185 secs
lola: 94059366 markings, 146641861 edges, 10933 markings/sec, 190 secs
lola: 94059472 markings, 146642019 edges, 21 markings/sec, 195 secs
lola: 94059511 markings, 146642081 edges, 8 markings/sec, 200 secs
lola: 94059545 markings, 146642137 edges, 7 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 660 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((1 <= p18)) AND (X (G ((1 <= p20))) OR (1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((1 <= p18)) AND (X (G ((1 <= p20))) OR (1 <= p18))))
lola: processed formula length: 59
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 51 markings, 51 edges
lola: ========================================
lola: subprocess 12 will run for 825 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((1 <= p14))) AND G ((1 <= p12))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((1 <= p14))) AND G ((1 <= p12))))
lola: processed formula length: 43
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 45 edges
lola: ========================================
lola: subprocess 13 will run for 1100 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p15) AND (F ((p15 <= 0)) OR G ((1 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p15) AND (F ((p15 <= 0)) OR G ((1 <= p15))))))
lola: processed formula length: 59
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 246 markings, 247 edges
lola: ========================================
lola: subprocess 14 will run for 1651 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p0) AND (1 <= p26)) U (((1 <= p12) OR (G ((1 <= p14)) AND F ((1 <= p12)))) AND (G (((1 <= p0) AND (1 <= p26))) AND ((1 <= p0) AND (1 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p0) AND (1 <= p26)) U (((1 <= p12) OR (G ((1 <= p14)) AND F ((1 <= p12)))) AND (G (((1 <= p0) AND (1 <= p26))) AND ((1 <= p0) AND (1 <= p26)))))
lola: processed formula length: 152
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 22 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: 1982649 markings, 4694994 edges, 396530 markings/sec, 0 secs
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: 2312917 markings, 5449111 edges
lola: ========================================
lola: subprocess 15 will run for 3296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G (((1 <= p6) AND (1 <= p26))) AND (p2 <= 0))) OR (G (F (((1 <= p6) AND (1 <= p26) AND ((p13 <= 0) OR (p17 <= 0) OR (p21 <= 0))))) AND F ((G (((1 <= p6) AND (1 <= p26))) AND (p2 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((1 <= p6) AND (1 <= p26))) AND (p2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((1 <= p6) AND (1 <= p26))) AND (p2 <= 0)))
lola: processed formula length: 50
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1219 markings, 2347 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((X (((p3 <= 0) OR (p4 <= 0))) OR (G (F (((1 <= p3) AND (1 <= p4)))) OR (1 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (((p3 <= 0) OR (p4 <= 0))) OR (G (F (((1 <= p3) AND (1 <= p4)))) OR (1 <= p11)))))
lola: processed formula length: 92
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3691236 markings, 5629513 edges, 738247 markings/sec, 0 secs
lola: 7111479 markings, 10845210 edges, 684049 markings/sec, 5 secs
lola: 10503700 markings, 16018147 edges, 678444 markings/sec, 10 secs
lola: 13769704 markings, 20998637 edges, 653201 markings/sec, 15 secs
lola: 16952792 markings, 25852681 edges, 636618 markings/sec, 20 secs
lola: 20111409 markings, 30669428 edges, 631723 markings/sec, 25 secs
lola: 23330598 markings, 35578516 edges, 643838 markings/sec, 30 secs
lola: 26562750 markings, 40650821 edges, 646430 markings/sec, 35 secs
lola: 30134768 markings, 46184240 edges, 714404 markings/sec, 40 secs
lola: 33567714 markings, 51506996 edges, 686589 markings/sec, 45 secs
lola: 36858014 markings, 56595339 edges, 658060 markings/sec, 50 secs
lola: 40231766 markings, 61824203 edges, 674750 markings/sec, 55 secs
lola: 43574572 markings, 66985004 edges, 668561 markings/sec, 60 secs
lola: 46894166 markings, 72111778 edges, 663919 markings/sec, 65 secs
lola: 50080994 markings, 77035934 edges, 637366 markings/sec, 70 secs
lola: 53340506 markings, 82073729 edges, 651902 markings/sec, 75 secs
lola: 56560797 markings, 87059442 edges, 644058 markings/sec, 80 secs
lola: 59812783 markings, 92080785 edges, 650397 markings/sec, 85 secs
lola: 62936675 markings, 96914787 edges, 624778 markings/sec, 90 secs
lola: 66182805 markings, 101952901 edges, 649226 markings/sec, 95 secs
lola: 69314013 markings, 106811407 edges, 626242 markings/sec, 100 secs
lola: 72593711 markings, 111912365 edges, 655940 markings/sec, 105 secs
lola: 75713571 markings, 116781821 edges, 623972 markings/sec, 110 secs
lola: 77669000 markings, 119839552 edges, 391086 markings/sec, 115 secs
lola: 80173373 markings, 123797109 edges, 500875 markings/sec, 120 secs
lola: 83023287 markings, 128331112 edges, 569983 markings/sec, 125 secs
lola: 83188332 markings, 128604058 edges, 33009 markings/sec, 130 secs
lola: 85139421 markings, 131931813 edges, 390218 markings/sec, 135 secs
lola: 86528611 markings, 134248014 edges, 277838 markings/sec, 140 secs
lola: 87090853 markings, 135151283 edges, 112448 markings/sec, 145 secs
lola: 89461236 markings, 139061188 edges, 474077 markings/sec, 150 secs
lola: 89513512 markings, 139144987 edges, 10455 markings/sec, 155 secs
lola: 92331557 markings, 143803233 edges, 563609 markings/sec, 160 secs
lola: 92369625 markings, 143862206 edges, 7614 markings/sec, 165 secs
lola: 94022498 markings, 146584842 edges, 330575 markings/sec, 170 secs
lola: 94022535 markings, 146584889 edges, 7 markings/sec, 175 secs
lola: 94107134 markings, 146715773 edges, 16920 markings/sec, 180 secs
lola: 94107232 markings, 146715930 edges, 20 markings/sec, 185 secs
lola: 94107311 markings, 146716051 edges, 16 markings/sec, 190 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 yes no no no unknown no no no
lola:
preliminary result: no no no no no yes no no yes no no no unknown no no no
lola: memory consumption: 3252 KB
lola: time consumption: 490 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudOpsManagement-PT-00080by00040"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is CloudOpsManagement-PT-00080by00040, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-smll-158987806700402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudOpsManagement-PT-00080by00040.tgz
mv CloudOpsManagement-PT-00080by00040 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;