Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r132-tall-162075428600381.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is MAPK-PT-02560, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428600381
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 06:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 06:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 07:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 07:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 25K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MAPK-PT-02560-00
FORMULA_NAME MAPK-PT-02560-01
FORMULA_NAME MAPK-PT-02560-02
FORMULA_NAME MAPK-PT-02560-03
FORMULA_NAME MAPK-PT-02560-04
FORMULA_NAME MAPK-PT-02560-05
FORMULA_NAME MAPK-PT-02560-06
FORMULA_NAME MAPK-PT-02560-07
FORMULA_NAME MAPK-PT-02560-08
FORMULA_NAME MAPK-PT-02560-09
FORMULA_NAME MAPK-PT-02560-10
FORMULA_NAME MAPK-PT-02560-11
FORMULA_NAME MAPK-PT-02560-12
FORMULA_NAME MAPK-PT-02560-13
FORMULA_NAME MAPK-PT-02560-14
FORMULA_NAME MAPK-PT-02560-15

=== Now, execution of the tool begins

BK_START 1620936533988

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

FORMULA MAPK-PT-02560-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3143
rslt: Output for LTLCardinality @ MAPK-PT-02560

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((G ((p11 <= 1)) R (G ((p11 <= 1)) R (p17 + 1 <= p6))) AND (2 <= p11)))",
"processed_size": 74,
"rewrites": 88
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 17
},
"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": 334
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((X (X ((G ((p8 <= p18)) AND X ((p8 <= p18))))) AND (1 <= p5))))",
"processed_size": 69,
"rewrites": 88
},
"result":
{
"edges": 6,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 19
},
"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": 372
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((X (X ((p5 <= p20))) OR (p1 + 1 <= p19)))",
"processed_size": 44,
"rewrites": 88
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 418
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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 (F ((1 <= p15)))",
"processed_size": 18,
"rewrites": 88
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 478
},
"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": "(2 <= p11)",
"processed_size": 10,
"rewrites": 88
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 669
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((p11 + 1 <= p6))",
"processed_size": 19,
"rewrites": 88
},
"result":
{
"edges": 4,
"markings": 4,
"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": 558
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 558
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p18 <= p16))",
"processed_size": 16,
"rewrites": 88
},
"result":
{
"edges": 5129,
"markings": 5127,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 669
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": "G (F ((G ((2 <= p1)) OR (X (F ((3 <= p16))) AND (2 <= p1)))))",
"processed_size": 61,
"rewrites": 88
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 837
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((p17 <= 1)))",
"processed_size": 18,
"rewrites": 88
},
"result":
{
"edges": 73015,
"markings": 43548,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1116
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p4) OR (p15 <= 2))))",
"processed_size": 34,
"rewrites": 88
},
"result":
{
"edges": 5122,
"markings": 5122,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1674
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((F ((1 <= p7)) AND ((3 <= p7) OR (1 <= p7)))))",
"processed_size": 52,
"rewrites": 88
},
"result":
{
"edges": 5124,
"markings": 5123,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"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": 3349
},
"child":
[

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

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 2,
"X": 0,
"aconj": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "((3 <= p17) U (F ((1 <= p5)) U (1 <= p5)))",
"processed_size": 42,
"rewrites": 88
},
"result":
{
"edges": 5122,
"markings": 5122,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3308,
"runtime": 427.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G((F(**) AND **))) : F(G(*)) : G(F(**)) : X(((G(*) R (G(*) R *)) AND **)) : X(G(**)) : F(G((X(X((G(**) AND X(**)))) AND *))) : F((X(X(**)) OR **)) : X(F(**)) : ((** U (F(**) U **)) OR (G(**) AND F(**))) : (X(*) OR (G(**) OR (F(**) AND **))) : (X(F(**)) OR G(**)) : G(F((G(*) OR (X(F(**)) AND *)))) : F(G((F(**) AND (** OR **))))"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"preliminary_value": "no no no no unknown no yes yes no no no no no ",
"value": "no no no no unknown no yes yes no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 52/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 30 transitions, 15 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: G (X ((F ((3 <= p11)) AND (p9 <= p13)))) : F (G (NOT(X (X (F (X (X ((2 <= p17))))))))) : X (G (F (((1 <= p4) OR (p15 <= 2))))) : X ((NOT((F (((p15 <= p2) U (2 <= p11))) U (F ((2 <= p11)) U (p6 <= p17)))) AND (2 <= p11))) : X (G ((p6 <= p7))) : F (NOT(F ((NOT(X (X ((G ((p8 <= p18)) AND X ((p8 <= p18)))))) OR (p5 <= 0))))) : F ((X (X ((p5 <= p20))) OR (p1 + 1 <= p19))) : F ((X (F ((p2 <= p1))) U (G (X (G (X ((p9 <= p17))))) U X ((1 <= p15))))) : (G ((3 <= p17)) U ((3 <= p17) U (F ((1 <= p5)) U (1 <= p5)))) : ((NOT(X ((p6 <= p11))) OR G ((2 <= p11))) OR (F ((p16 <= p17)) AND (2 <= p11))) : (X (F (((3 <= p6) U F (((1 <= p18) AND (p18 <= p16)))))) OR G ((p18 <= p16))) : X (NOT(F (G ((G (NOT(X ((3 <= p16)))) U (p1 <= 1)))))) : F (X (G (X (((3 <= p7) U (1 <= p7))))))
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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: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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((3 <= p11)) AND (p9 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((3 <= p11)) AND (p9 <= p13))))
lola: processed formula length: 40
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((G ((p11 <= 1)) R (G ((p11 <= 1)) R (p17 + 1 <= p6))) AND (2 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((G ((p11 <= 1)) R (G ((p11 <= 1)) R (p17 + 1 <= p6))) AND (2 <= p11)))
lola: processed formula length: 74
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 17 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p6 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p6 <= p7)))
lola: processed formula length: 18
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3003973 markings, 5408944 edges, 600795 markings/sec, 0 secs
lola: 5449230 markings, 9811646 edges, 489051 markings/sec, 5 secs
lola: 7582399 markings, 13652447 edges, 426634 markings/sec, 10 secs
lola: 9572094 markings, 17235285 edges, 397939 markings/sec, 15 secs
lola: 11478039 markings, 20664283 edges, 381189 markings/sec, 20 secs
lola: 13314698 markings, 23971642 edges, 367332 markings/sec, 25 secs
lola: 15109847 markings, 27203938 edges, 359030 markings/sec, 30 secs
lola: 16859873 markings, 30352621 edges, 350005 markings/sec, 35 secs
lola: 18753499 markings, 33921731 edges, 378725 markings/sec, 40 secs
lola: 22118685 markings, 42242731 edges, 673037 markings/sec, 45 secs
lola: 25323570 markings, 50207519 edges, 640977 markings/sec, 50 secs
lola: 28532704 markings, 58193215 edges, 641827 markings/sec, 55 secs
lola: 31702664 markings, 66086277 edges, 633992 markings/sec, 60 secs
lola: 34852987 markings, 73932959 edges, 630065 markings/sec, 65 secs
lola: 37984111 markings, 81734353 edges, 626225 markings/sec, 70 secs
lola: 41119278 markings, 89547153 edges, 627033 markings/sec, 75 secs
lola: 44209823 markings, 97252102 edges, 618109 markings/sec, 80 secs
lola: 47288816 markings, 104930194 edges, 615799 markings/sec, 85 secs
lola: 50331669 markings, 112516213 edges, 608571 markings/sec, 90 secs
lola: 53524221 markings, 120476391 edges, 638510 markings/sec, 95 secs
lola: 56678569 markings, 128343137 edges, 630870 markings/sec, 100 secs
lola: 59790155 markings, 136105368 edges, 622317 markings/sec, 105 secs
lola: 62898367 markings, 143857941 edges, 621642 markings/sec, 110 secs
lola: 65964018 markings, 151506740 edges, 613130 markings/sec, 115 secs
lola: 68977500 markings, 159024035 edges, 602696 markings/sec, 120 secs
lola: 72141574 markings, 166918176 edges, 632815 markings/sec, 125 secs
lola: 75214730 markings, 174587258 edges, 614631 markings/sec, 130 secs
lola: 78126510 markings, 181851866 edges, 582356 markings/sec, 135 secs
lola: 80177474 markings, 186980003 edges, 410193 markings/sec, 140 secs
lola: 82528872 markings, 192836493 edges, 470280 markings/sec, 145 secs
lola: 84946952 markings, 198869715 edges, 483616 markings/sec, 150 secs
lola: 86978955 markings, 203942696 edges, 406401 markings/sec, 155 secs
lola: 87523486 markings, 205300293 edges, 108906 markings/sec, 160 secs
lola: 88626085 markings, 208051557 edges, 220520 markings/sec, 165 secs
lola: 90137532 markings, 211823851 edges, 302289 markings/sec, 170 secs
lola: 90626016 markings, 213043951 edges, 97697 markings/sec, 175 secs
lola: 92388394 markings, 217441227 edges, 352476 markings/sec, 180 secs
lola: 94085686 markings, 221678831 edges, 339458 markings/sec, 185 secs
lola: 95852060 markings, 226085953 edges, 353275 markings/sec, 190 secs
lola: 96450380 markings, 227581071 edges, 119664 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (X ((G ((p8 <= p18)) AND X ((p8 <= p18))))) AND (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (X ((G ((p8 <= p18)) AND X ((p8 <= p18))))) AND (1 <= p5))))
lola: processed formula length: 69
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 19 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: add low 29
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X ((p5 <= p20))) OR (p1 + 1 <= p19)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X ((p5 <= p20))) OR (p1 + 1 <= p19)))
lola: processed formula length: 44
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 418 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((1 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((1 <= p15)))
lola: processed formula length: 18
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 6 will run for 478 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p11 + 1 <= p6)) OR (G ((2 <= p11)) OR (F ((p16 <= p17)) AND (2 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 478 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p11)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p11)
lola: processed formula length: 10
lola: 88 rewrites
lola: closed formula file LTLCardinality.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 558 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((2 <= p11))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((2 <= p11))
lola: processed formula length: 14
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5122 markings, 5122 edges
lola: ========================================
lola: subprocess 8 will run for 669 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p11 + 1 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p11 + 1 <= p6))
lola: processed formula length: 19
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 558 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((1 <= p18) AND (p18 <= p16)))) OR G ((p18 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 558 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p18 <= p16))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p18 <= p16))
lola: processed formula length: 16
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5127 markings, 5129 edges
lola: ========================================
lola: subprocess 8 will run for 669 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p18) AND (p18 <= p16))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p18) AND (p18 <= p16))))
lola: processed formula length: 37
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 669 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((2 <= p1)) OR (X (F ((3 <= p16))) AND (2 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((2 <= p1)) OR (X (F ((3 <= p16))) AND (2 <= p1)))))
lola: processed formula length: 61
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 9 will run for 837 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p17 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p17 <= 1)))
lola: processed formula length: 18
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 26
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 43548 markings, 73015 edges
lola: ========================================
lola: subprocess 10 will run for 1116 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p4) OR (p15 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p4) OR (p15 <= 2))))
lola: processed formula length: 34
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5122 markings, 5122 edges
lola: ========================================
lola: subprocess 11 will run for 1674 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p7)) AND ((3 <= p7) OR (1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p7)) AND ((3 <= p7) OR (1 <= p7)))))
lola: processed formula length: 52
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 12
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: 5123 markings, 5124 edges
lola: ========================================
lola: subprocess 12 will run for 3349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((3 <= p17) U (F ((1 <= p5)) U (1 <= p5))) OR (G ((3 <= p17)) AND F ((1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p5))
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: (p5 <= 0)
lola: processed formula length: 9
lola: 90 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 5122 markings, 5122 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((p6 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p6 <= p7)))
lola: processed formula length: 18
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3063412 markings, 5516856 edges, 612682 markings/sec, 0 secs
lola: 5714870 markings, 10289115 edges, 530292 markings/sec, 5 secs
lola: 7955180 markings, 14323552 edges, 448062 markings/sec, 10 secs
lola: 10121492 markings, 18223733 edges, 433262 markings/sec, 15 secs
lola: 12067429 markings, 21726771 edges, 389187 markings/sec, 20 secs
lola: 13983446 markings, 25175160 edges, 383203 markings/sec, 25 secs
lola: 15836803 markings, 28512315 edges, 370671 markings/sec, 30 secs
lola: 17562994 markings, 31619604 edges, 345238 markings/sec, 35 secs
lola: 20228928 markings, 37558468 edges, 533187 markings/sec, 40 secs
lola: 23530627 markings, 45750867 edges, 660340 markings/sec, 45 secs
lola: 26742302 markings, 53736103 edges, 642335 markings/sec, 50 secs
lola: 30020760 markings, 61895836 edges, 655692 markings/sec, 55 secs
lola: 33219885 markings, 69863378 edges, 639825 markings/sec, 60 secs
lola: 36371014 markings, 77713424 edges, 630226 markings/sec, 65 secs
lola: 39559609 markings, 85660743 edges, 637719 markings/sec, 70 secs
lola: 42696449 markings, 93479727 edges, 627368 markings/sec, 75 secs
lola: 45837155 markings, 101309944 edges, 628141 markings/sec, 80 secs
lola: 48849959 markings, 108821268 edges, 602561 markings/sec, 85 secs
lola: 51911364 markings, 116456305 edges, 612281 markings/sec, 90 secs
lola: 55025300 markings, 124222295 edges, 622787 markings/sec, 95 secs
lola: 58135963 markings, 131979445 edges, 622133 markings/sec, 100 secs
lola: 61206358 markings, 139637721 edges, 614079 markings/sec, 105 secs
lola: 64240980 markings, 147209181 edges, 606924 markings/sec, 110 secs
lola: 67257413 markings, 154734257 edges, 603287 markings/sec, 115 secs
lola: 70296336 markings, 162315138 edges, 607785 markings/sec, 120 secs
lola: 73340987 markings, 169911196 edges, 608930 markings/sec, 125 secs
lola: 76369854 markings, 177468122 edges, 605773 markings/sec, 130 secs
lola: 79229676 markings, 184622437 edges, 571964 markings/sec, 135 secs
lola: 80953518 markings, 188910033 edges, 344768 markings/sec, 140 secs
lola: 82321204 markings, 192319500 edges, 273537 markings/sec, 145 secs
lola: 83407375 markings, 195030011 edges, 217234 markings/sec, 150 secs
lola: 85279962 markings, 199704048 edges, 374517 markings/sec, 155 secs
lola: 86937601 markings, 203839197 edges, 331528 markings/sec, 160 secs
lola: 88347073 markings, 207356217 edges, 281894 markings/sec, 165 secs
lola: 90426019 markings, 212543413 edges, 415789 markings/sec, 170 secs
lola: 91649996 markings, 215598630 edges, 244795 markings/sec, 175 secs
lola: 93133825 markings, 219301519 edges, 296766 markings/sec, 180 secs
lola: 94989638 markings, 223932967 edges, 371163 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (((3 <= p17) U (F ((1 <= p5)) U (1 <= p5))) OR (G ((3 <= p17)) AND F ((1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((1 <= p5))
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: (p5 <= 0)
lola: processed formula length: 9
lola: 90 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 5122 markings, 5122 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((3 <= p17) U (F ((1 <= p5)) U (1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((3 <= p17) U (F ((1 <= p5)) U (1 <= p5)))
lola: processed formula length: 42
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 5122 markings, 5122 edges
lola: 5122 markings, 5122 edges, 1024 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no unknown no yes yes no no no no no
lola:
preliminary result: no no no no unknown no yes yes no no no no no
lola: ========================================
lola: memory consumption: 3308 KB
lola: time consumption: 427 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MAPK-PT-02560"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is MAPK-PT-02560, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-162075428600381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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