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.r094-tall-162048902600297.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 ERK-PT-100000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902600297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K 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.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 10:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 23 10:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 18:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 18:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 6.7K 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 ERK-PT-100000-00
FORMULA_NAME ERK-PT-100000-01
FORMULA_NAME ERK-PT-100000-02
FORMULA_NAME ERK-PT-100000-03
FORMULA_NAME ERK-PT-100000-04
FORMULA_NAME ERK-PT-100000-05
FORMULA_NAME ERK-PT-100000-06
FORMULA_NAME ERK-PT-100000-07
FORMULA_NAME ERK-PT-100000-08
FORMULA_NAME ERK-PT-100000-09
FORMULA_NAME ERK-PT-100000-10
FORMULA_NAME ERK-PT-100000-11
FORMULA_NAME ERK-PT-100000-12
FORMULA_NAME ERK-PT-100000-13
FORMULA_NAME ERK-PT-100000-14
FORMULA_NAME ERK-PT-100000-15

=== Now, execution of the tool begins

BK_START 1620767341034

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-11 21:09:06] [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-11 21:09:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 21:09:06] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2021-05-11 21:09:06] [INFO ] Transformed 11 places.
[2021-05-11 21:09:06] [INFO ] Transformed 11 transitions.
[2021-05-11 21:09:06] [INFO ] Parsed PT model containing 11 places and 11 transitions in 62 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=2272 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 11 rows 11 cols
[2021-05-11 21:09:07] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 2 ms.
[2021-05-11 21:09:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 3 ms.
[2021-05-11 21:09:07] [INFO ] Added : 3 causal constraints over 2 iterations in 16 ms. Result :sat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-11 21:09:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:07] [INFO ] Added : 4 causal constraints over 2 iterations in 7 ms. Result :sat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:07] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 2 ms.
[2021-05-11 21:09:07] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:07] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-11 21:09:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 5 ms.
[2021-05-11 21:09:07] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 5 ms.
[2021-05-11 21:09:07] [INFO ] Added : 3 causal constraints over 2 iterations in 10 ms. Result :sat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-11 21:09:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 2 ms.
[2021-05-11 21:09:07] [INFO ] Added : 4 causal constraints over 2 iterations in 8 ms. Result :sat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:07] [INFO ] Added : 4 causal constraints over 2 iterations in 5 ms. Result :sat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 2 ms.
[2021-05-11 21:09:07] [INFO ] Added : 4 causal constraints over 2 iterations in 6 ms. Result :sat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 6 ms.
[2021-05-11 21:09:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:07] [INFO ] Added : 3 causal constraints over 2 iterations in 6 ms. Result :sat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:07] [INFO ] Added : 4 causal constraints over 2 iterations in 5 ms. Result :sat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 0 ms.
[2021-05-11 21:09:07] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-11 21:09:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:07] [INFO ] Added : 4 causal constraints over 2 iterations in 8 ms. Result :sat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-11 21:09:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:07] [INFO ] Added : 4 causal constraints over 2 iterations in 4 ms. Result :sat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:07] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:07] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 2 ms.
[2021-05-11 21:09:07] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:07] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-11 21:09:07] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:07] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-11 21:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:07] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-11 21:09:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 21:09:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-11 21:09:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:08] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:08] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:08] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-11 21:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-11 21:09:08] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 0 ms.
[2021-05-11 21:09:08] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-11 21:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:08] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:08] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned unsat
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-11 21:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-11 21:09:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 21:09:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 349 ms returned sat
[2021-05-11 21:09:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:08] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:08] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:08] [INFO ] Added : 4 causal constraints over 2 iterations in 4 ms. Result :sat
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2021-05-11 21:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-11 21:09:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 21:09:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 20 ms returned sat
[2021-05-11 21:09:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:08] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:08] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:08] [INFO ] Added : 6 causal constraints over 2 iterations in 33 ms. Result :sat
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-11 21:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-11 21:09:08] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:08] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-11 21:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-11 21:09:08] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 2 ms.
[2021-05-11 21:09:08] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-11 21:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:08] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 21:09:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-11 21:09:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:08] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-11 21:09:08] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:08] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-11 21:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-11 21:09:08] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:08] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2021-05-11 21:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-11 21:09:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 21:09:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-11 21:09:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:08] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-11 21:09:08] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:08] [INFO ] Added : 3 causal constraints over 2 iterations in 4 ms. Result :sat
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-11 21:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-11 21:09:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 21:09:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-11 21:09:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:08] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-11 21:09:08] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:08] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned sat
[2021-05-11 21:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:08] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-11 21:09:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 21:09:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-11 21:09:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 21:09:08] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-11 21:09:08] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 21:09:08] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
[2021-05-11 21:09:08] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-11 21:09:08] [INFO ] Flatten gal took : 28 ms
FORMULA ERK-PT-100000-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 21:09:08] [INFO ] Flatten gal took : 3 ms
[2021-05-11 21:09:09] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-11 21:09:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ERK-PT-100000 @ 3570 seconds

FORMULA ERK-PT-100000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-100000-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2613
rslt: Output for LTLCardinality @ ERK-PT-100000

{
"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": "Tue May 11 21:09:09 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 363
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((G (F ((p1 <= p5))) AND X (G ((p4 + 1 <= p9)))))",
"processed_size": 51,
"rewrites": 69
},
"result":
{
"edges": 200005,
"markings": 200005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 409
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 409
},
"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 <= p0)",
"processed_size": 9,
"rewrites": 69
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 467
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((p10 <= p4))",
"processed_size": 15,
"rewrites": 69
},
"result":
{
"edges": 200005,
"markings": 200005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 467
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "X (F ((F (G ((p9 + 1 <= p5))) OR (p9 + 1 <= p5))))",
"processed_size": 50,
"rewrites": 69
},
"result":
{
"edges": 200006,
"markings": 200005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 545
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((X ((p3 <= p5)) AND (p3 + 1 <= p0))))",
"processed_size": 43,
"rewrites": 69
},
"result":
{
"edges": 200005,
"markings": 200005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 654
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F ((X (F ((p6 <= 2))) OR (p0 <= 1))) OR X (G ((p5 <= p6)))))",
"processed_size": 64,
"rewrites": 69
},
"result":
{
"edges": 9,
"markings": 8,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1636
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "(F ((1 <= p1)) U G ((p4 + 1 <= p6)))",
"processed_size": 36,
"rewrites": 69
},
"result":
{
"edges": 200010,
"markings": 200007,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3272
},
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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 (F ((p3 <= p8)))",
"processed_size": 18,
"rewrites": 69
},
"result":
{
"edges": 300005,
"markings": 300005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3468,
"runtime": 957.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X((F(*) AND (G(*) AND X(*))))) : F((G(F(**)) AND X(G(*)))) : (X(**) AND **) : X(F((F(G(*)) OR *))) : X(G((X(**) AND **))) : F(G(**)) : (F(**) U G(*)) : (G(F(**)) OR G(F(**))) : X((F((X(F(**)) OR **)) OR X(G(**)))) : F((X(F((G(*) OR ((* R *) AND *)))) AND (G(F(*)) OR **)))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 7,
"places": 11,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "unknown no no no no no no unknown yes no ",
"value": "unknown no no no no no no unknown yes 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: 22/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 352
lola: finding significant places
lola: 11 places, 11 transitions, 6 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: NOT(X (X (((G ((p3 + 1 <= p10)) OR F ((p7 <= p5))) OR X ((3 <= p6)))))) : NOT(G ((F (NOT(F ((p1 <= p5)))) OR F (((X ((2 <= p1)) OR (3 <= p5)) U X ((p9 <= p4))))))) : (X ((p10 <= p4)) AND (1 <= p0)) : F (X (NOT(G ((F (G (F ((p5 <= p9)))) AND (p5 <= p9)))))) : G (X ((X ((p3 <= p5)) AND (p3 + 1 <= p0)))) : F (G (X (X ((p8 <= p5))))) : (((0 <= 0) U (1 <= p1)) U NOT(F ((p6 <= p4)))) : (X (F (G (F ((p3 <= p8))))) OR G (F ((3 <= p0)))) : X ((F ((NOT(G (NOT(F (X ((p6 <= 2)))))) OR (p0 <= 1))) OR X (G ((p5 <= p6))))) : F ((NOT(X (G ((((3 <= p7) U (1 <= p7)) U (3 <= p6))))) AND (NOT(F (G ((3 <= p6)))) OR (p0 <= 1))))
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k: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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F ((p10 <= p3)) AND (G ((p5 + 1 <= p7)) AND X ((p6 <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((p10 <= p3)) AND (G ((p5 + 1 <= p7)) AND X ((p6 <= 2))))))
lola: processed formula length: 68
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2997118 markings, 7187699 edges, 599424 markings/sec, 0 secs
lola: 5677414 markings, 13886241 edges, 536059 markings/sec, 5 secs
lola: 8328931 markings, 20512703 edges, 530303 markings/sec, 10 secs
lola: 11681263 markings, 28892647 edges, 670466 markings/sec, 15 secs
lola: 14353636 markings, 35571408 edges, 534475 markings/sec, 20 secs
lola: 16970403 markings, 42112352 edges, 523353 markings/sec, 25 secs
lola: 19570186 markings, 48610740 edges, 519957 markings/sec, 30 secs
lola: 22199401 markings, 55183727 edges, 525843 markings/sec, 35 secs
lola: 24824420 markings, 61745159 edges, 525004 markings/sec, 40 secs
lola: 27420971 markings, 68236098 edges, 519310 markings/sec, 45 secs
lola: 30016760 markings, 74725359 edges, 519158 markings/sec, 50 secs
lola: 32613444 markings, 81215271 edges, 519337 markings/sec, 55 secs
lola: 35204689 markings, 87693822 edges, 518249 markings/sec, 60 secs
lola: 37777759 markings, 94123361 edges, 514614 markings/sec, 65 secs
lola: 40338325 markings, 100526678 edges, 512113 markings/sec, 70 secs
lola: 42899603 markings, 106929351 edges, 512256 markings/sec, 75 secs
lola: 45469513 markings, 113351985 edges, 513982 markings/sec, 80 secs
lola: 48035431 markings, 119766545 edges, 513184 markings/sec, 85 secs
lola: 50590175 markings, 126153406 edges, 510949 markings/sec, 90 secs
lola: 53132657 markings, 132509684 edges, 508496 markings/sec, 95 secs
lola: 55690514 markings, 138901658 edges, 511571 markings/sec, 100 secs
lola: 58243535 markings, 145284986 edges, 510604 markings/sec, 105 secs
lola: 60797685 markings, 151670469 edges, 510830 markings/sec, 110 secs
lola: 63360051 markings, 158074921 edges, 512473 markings/sec, 115 secs
lola: 65918233 markings, 164469818 edges, 511636 markings/sec, 120 secs
lola: 68476998 markings, 170863662 edges, 511753 markings/sec, 125 secs
lola: 71018171 markings, 177218936 edges, 508235 markings/sec, 130 secs
lola: 73564797 markings, 183584788 edges, 509325 markings/sec, 135 secs
lola: 77118739 markings, 192469058 edges, 710788 markings/sec, 140 secs
lola: 79666655 markings, 198839056 edges, 509583 markings/sec, 145 secs
lola: 82218545 markings, 205218358 edges, 510378 markings/sec, 150 secs
lola: 85729208 markings, 213992492 edges, 702133 markings/sec, 155 secs
lola: 88277438 markings, 220361143 edges, 509646 markings/sec, 160 secs
lola: 90440602 markings, 225772955 edges, 432633 markings/sec, 165 secs
lola: 91970074 markings, 229594967 edges, 305894 markings/sec, 170 secs
lola: 93110533 markings, 232443984 edges, 228092 markings/sec, 175 secs
lola: 94533320 markings, 236003830 edges, 284557 markings/sec, 180 secs
lola: 95595849 markings, 238656207 edges, 212506 markings/sec, 185 secs
lola: 97697453 markings, 243909851 edges, 420321 markings/sec, 190 secs
lola: 97877834 markings, 244362053 edges, 36076 markings/sec, 195 secs
lola: 97877834 markings, 244362053 edges, 0 markings/sec, 200 secs
lola: 99051804 markings, 247298921 edges, 234794 markings/sec, 205 secs
lola: 100331113 markings, 250497229 edges, 255862 markings/sec, 210 secs
lola: 101411031 markings, 253196072 edges, 215984 markings/sec, 215 secs
lola: 102643402 markings, 256277451 edges, 246474 markings/sec, 220 secs
lola: 104916071 markings, 261955239 edges, 454534 markings/sec, 225 secs
lola: 105434317 markings, 263253752 edges, 103649 markings/sec, 230 secs
lola: 107717368 markings, 268957721 edges, 456610 markings/sec, 235 secs
lola: 108955104 markings, 272055730 edges, 247547 markings/sec, 240 secs
lola: 110045243 markings, 274779485 edges, 218028 markings/sec, 245 secs
lola: 111551818 markings, 278546157 edges, 301315 markings/sec, 250 secs
lola: 112974915 markings, 282104861 edges, 284619 markings/sec, 255 secs
lola: 113381519 markings, 283119965 edges, 81321 markings/sec, 260 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F ((p1 <= p5))) AND X (G ((p4 + 1 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F ((p1 <= p5))) AND X (G ((p4 + 1 <= p9)))))
lola: processed formula length: 51
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 200005 markings, 200005 edges
lola: ========================================
lola: subprocess 2 will run for 409 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p10 <= p4)) AND (1 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 409 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p0)
lola: processed formula length: 9
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p10 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p10 <= p4))
lola: processed formula length: 15
lola: 69 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: 200005 markings, 200005 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (G ((p9 + 1 <= p5))) OR (p9 + 1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (G ((p9 + 1 <= p5))) OR (p9 + 1 <= p5))))
lola: processed formula length: 50
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: add low 1
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: 200005 markings, 200006 edges
lola: ========================================
lola: subprocess 4 will run for 545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((p3 <= p5)) AND (p3 + 1 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((p3 <= p5)) AND (p3 + 1 <= p0))))
lola: processed formula length: 43
lola: 69 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: 200005 markings, 200005 edges
lola: ========================================
lola: subprocess 5 will run for 654 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((X (F ((p6 <= 2))) OR (p0 <= 1))) OR X (G ((p5 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((X (F ((p6 <= 2))) OR (p0 <= 1))) OR X (G ((p5 <= p6)))))
lola: processed formula length: 64
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 8 markings, 9 edges
lola: ========================================
lola: subprocess 6 will run for 818 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F ((G ((p6 <= 2)) OR (((p7 <= 2) R (p7 <= 0)) AND (p6 <= 2))))) AND (G (F ((p6 <= 2))) OR (p0 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F ((G ((p6 <= 2)) OR (((p7 <= 2) R (p7 <= 0)) AND (p6 <= 2))))) AND (G (F ((p6 <= 2))) OR (p0 <= 1))))
lola: processed formula length: 109
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 16 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: 200421 markings, 201412 edges
lola: ========================================
lola: subprocess 7 will run for 1090 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p8 <= p5)))
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 ((p8 <= p5)))
lola: processed formula length: 18
lola: 69 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: 300006 markings, 300007 edges
lola: ========================================
lola: subprocess 8 will run for 1636 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p1)) U G ((p4 + 1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((1 <= p1)) U G ((p4 + 1 <= p6)))
lola: processed formula length: 36
lola: 69 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: 200007 markings, 200010 edges
lola: ========================================
lola: subprocess 9 will run for 3272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((p3 <= p8))) OR G (F ((3 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((3 <= p0)))
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 ((3 <= p0)))
lola: processed formula length: 17
lola: 69 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: 5118458 markings, 7988563 edges, 1023692 markings/sec, 0 secs
lola: 10071810 markings, 15832174 edges, 990670 markings/sec, 5 secs
lola: 16319239 markings, 25724452 edges, 1249486 markings/sec, 10 secs
lola: 21097431 markings, 33290167 edges, 955638 markings/sec, 15 secs
lola: 25902984 markings, 40898908 edges, 961111 markings/sec, 20 secs
lola: 30641095 markings, 48401751 edges, 947622 markings/sec, 25 secs
lola: 35366017 markings, 55883391 edges, 944984 markings/sec, 30 secs
lola: 40022680 markings, 63256305 edges, 931333 markings/sec, 35 secs
lola: 44751810 markings, 70744821 edges, 945826 markings/sec, 40 secs
lola: 49505927 markings, 78271667 edges, 950823 markings/sec, 45 secs
lola: 54178764 markings, 85671026 edges, 934567 markings/sec, 50 secs
lola: 58844624 markings, 93058412 edges, 933172 markings/sec, 55 secs
lola: 63475648 markings, 100389676 edges, 926205 markings/sec, 60 secs
lola: 68032290 markings, 107605270 edges, 911328 markings/sec, 65 secs
lola: 74522620 markings, 117882546 edges, 1298066 markings/sec, 70 secs
lola: 79131703 markings, 125180449 edges, 921817 markings/sec, 75 secs
lola: 83585136 markings, 132231469 edges, 890687 markings/sec, 80 secs
lola: 88123001 markings, 139417701 edges, 907573 markings/sec, 85 secs
lola: 92623777 markings, 146541836 edges, 900155 markings/sec, 90 secs
lola: 97049894 markings, 153551799 edges, 885223 markings/sec, 95 secs
lola: 101442389 markings, 160506032 edges, 878499 markings/sec, 100 secs
lola: 106037192 markings, 167782339 edges, 918961 markings/sec, 105 secs
lola: 110570341 markings, 174959565 edges, 906630 markings/sec, 110 secs
lola: 113410585 markings, 179456122 edges, 568049 markings/sec, 115 secs
lola: 114048943 markings, 180466775 edges, 127672 markings/sec, 120 secs
lola: 117957628 markings, 186656429 edges, 781737 markings/sec, 125 secs
lola: 118148176 markings, 186956754 edges, 38110 markings/sec, 130 secs
lola: 118985265 markings, 188281500 edges, 167418 markings/sec, 135 secs
lola: 122330897 markings, 193578821 edges, 669126 markings/sec, 140 secs
lola: 122330897 markings, 193578821 edges, 0 markings/sec, 145 secs
lola: 124308908 markings, 196712447 edges, 395602 markings/sec, 150 secs
lola: 126760028 markings, 200592532 edges, 490224 markings/sec, 155 secs
lola: 126760028 markings, 200592532 edges, 0 markings/sec, 160 secs
lola: 130072030 markings, 205838050 edges, 662400 markings/sec, 165 secs
lola: 131021992 markings, 207342249 edges, 189992 markings/sec, 170 secs
lola: 134351615 markings, 212612603 edges, 665925 markings/sec, 175 secs
lola: 135824231 markings, 214946111 edges, 294523 markings/sec, 180 secs
lola: 138111033 markings, 218565426 edges, 457360 markings/sec, 185 secs
lola: 138122977 markings, 218583341 edges, 2389 markings/sec, 190 secs
lola: 138123053 markings, 218583455 edges, 15 markings/sec, 195 secs
lola: 138199137 markings, 218704362 edges, 15217 markings/sec, 200 secs
lola: 138199302 markings, 218704612 edges, 33 markings/sec, 205 secs
lola: 138199461 markings, 218704848 edges, 32 markings/sec, 210 secs
lola: 138205215 markings, 218713479 edges, 1151 markings/sec, 215 secs
lola: Child process aborted or communication problem between parent and child process
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 (X ((F ((p10 <= p3)) AND (G ((p5 + 1 <= p7)) AND X ((p6 <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((p10 <= p3)) AND (G ((p5 + 1 <= p7)) AND X ((p6 <= 2))))))
lola: processed formula length: 68
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3007813 markings, 7214250 edges, 601563 markings/sec, 0 secs
lola: 5684661 markings, 13903610 edges, 535370 markings/sec, 5 secs
lola: 8319577 markings, 20490346 edges, 526983 markings/sec, 10 secs
lola: 10939338 markings, 27037168 edges, 523952 markings/sec, 15 secs
lola: 13553777 markings, 33572671 edges, 522888 markings/sec, 20 secs
lola: 16155826 markings, 40077468 edges, 520410 markings/sec, 25 secs
lola: 18737278 markings, 46530242 edges, 516290 markings/sec, 30 secs
lola: 21324239 markings, 52995010 edges, 517392 markings/sec, 35 secs
lola: 23939089 markings, 59532012 edges, 522970 markings/sec, 40 secs
lola: 26558484 markings, 66078492 edges, 523879 markings/sec, 45 secs
lola: 29141035 markings, 72535443 edges, 516510 markings/sec, 50 secs
lola: 31713495 markings, 78965842 edges, 514492 markings/sec, 55 secs
lola: 34307264 markings, 85448541 edges, 518754 markings/sec, 60 secs
lola: 36904823 markings, 91943571 edges, 519512 markings/sec, 65 secs
lola: 39465354 markings, 98342739 edges, 512106 markings/sec, 70 secs
lola: 42002697 markings, 104687338 edges, 507469 markings/sec, 75 secs
lola: 44535569 markings, 111018908 edges, 506574 markings/sec, 80 secs
lola: 47073460 markings, 117362550 edges, 507578 markings/sec, 85 secs
lola: 49621675 markings, 123729957 edges, 509643 markings/sec, 90 secs
lola: 52167129 markings, 130093869 edges, 509091 markings/sec, 95 secs
lola: 54708754 markings, 136446065 edges, 508325 markings/sec, 100 secs
lola: 57283856 markings, 142886100 edges, 515020 markings/sec, 105 secs
lola: 59866576 markings, 149342592 edges, 516544 markings/sec, 110 secs
lola: 62453154 markings, 155805785 edges, 517316 markings/sec, 115 secs
lola: 65035762 markings, 162261739 edges, 516522 markings/sec, 120 secs
lola: 67609610 markings, 168698033 edges, 514770 markings/sec, 125 secs
lola: 70185475 markings, 175136650 edges, 515173 markings/sec, 130 secs
lola: 72726313 markings, 181487993 edges, 508168 markings/sec, 135 secs
lola: 75272592 markings, 187854991 edges, 509256 markings/sec, 140 secs
lola: 77803327 markings, 194179896 edges, 506147 markings/sec, 145 secs
lola: 80329555 markings, 200496931 edges, 505246 markings/sec, 150 secs
lola: 82851104 markings, 206798342 edges, 504310 markings/sec, 155 secs
lola: 85398991 markings, 213168207 edges, 509577 markings/sec, 160 secs
lola: 87955061 markings, 219557049 edges, 511214 markings/sec, 165 secs
lola: 90511383 markings, 225947372 edges, 511264 markings/sec, 170 secs
lola: 92940647 markings, 232020628 edges, 485853 markings/sec, 175 secs
lola: 94087803 markings, 234889744 edges, 229431 markings/sec, 180 secs
lola: 96060295 markings, 239818165 edges, 394498 markings/sec, 185 secs
lola: 97711608 markings, 243946469 edges, 330263 markings/sec, 190 secs
lola: 99549085 markings, 248541814 edges, 367495 markings/sec, 195 secs
lola: 100974205 markings, 252104035 edges, 285024 markings/sec, 200 secs
lola: 102551869 markings, 256045176 edges, 315533 markings/sec, 205 secs
lola: 104584918 markings, 261127624 edges, 406610 markings/sec, 210 secs
lola: 106323618 markings, 265476783 edges, 347740 markings/sec, 215 secs
lola: 107657022 markings, 268807796 edges, 266681 markings/sec, 220 secs
lola: 109467128 markings, 273332181 edges, 362021 markings/sec, 225 secs
lola: 110990935 markings, 277143369 edges, 304761 markings/sec, 230 secs
lola: 112711607 markings, 281443460 edges, 344134 markings/sec, 235 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (G (F ((p3 <= p8))) OR G (F ((3 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (F ((3 <= p0)))
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 ((3 <= p0)))
lola: processed formula length: 17
lola: 69 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: 5092862 markings, 7948152 edges, 1018572 markings/sec, 0 secs
lola: 9979592 markings, 15686318 edges, 977346 markings/sec, 5 secs
lola: 14866488 markings, 23423857 edges, 977379 markings/sec, 10 secs
lola: 19738600 markings, 31138626 edges, 974422 markings/sec, 15 secs
lola: 24546290 markings, 38750325 edges, 961538 markings/sec, 20 secs
lola: 29353123 markings, 46362211 edges, 961367 markings/sec, 25 secs
lola: 34104125 markings, 53885307 edges, 950200 markings/sec, 30 secs
lola: 38820470 markings, 61352729 edges, 943269 markings/sec, 35 secs
lola: 43484677 markings, 68737012 edges, 932841 markings/sec, 40 secs
lola: 48196745 markings, 76199116 edges, 942414 markings/sec, 45 secs
lola: 52836193 markings, 83543548 edges, 927890 markings/sec, 50 secs
lola: 57454109 markings, 90855386 edges, 923583 markings/sec, 55 secs
lola: 62032410 markings, 98106052 edges, 915660 markings/sec, 60 secs
lola: 66575714 markings, 105300177 edges, 908661 markings/sec, 65 secs
lola: 71193756 markings, 112610119 edges, 923608 markings/sec, 70 secs
lola: 75791893 markings, 119892959 edges, 919627 markings/sec, 75 secs
lola: 80324597 markings, 127069118 edges, 906541 markings/sec, 80 secs
lola: 84828877 markings, 134200870 edges, 900856 markings/sec, 85 secs
lola: 89362155 markings, 141379755 edges, 906656 markings/sec, 90 secs
lola: 93902154 markings, 148565685 edges, 908000 markings/sec, 95 secs
lola: 98440014 markings, 155751062 edges, 907572 markings/sec, 100 secs
lola: 103081396 markings, 163101132 edges, 928276 markings/sec, 105 secs
lola: 107798529 markings, 170568836 edges, 943427 markings/sec, 110 secs
lola: 112411018 markings, 177874728 edges, 922498 markings/sec, 115 secs
lola: 115338234 markings, 182507711 edges, 585443 markings/sec, 120 secs
lola: 118790726 markings, 187976807 edges, 690498 markings/sec, 125 secs
lola: 120611841 markings, 190858621 edges, 364223 markings/sec, 130 secs
lola: 122554797 markings, 193934139 edges, 388591 markings/sec, 135 secs
lola: 126438263 markings, 200087170 edges, 776693 markings/sec, 140 secs
lola: 129436389 markings, 204831207 edges, 599625 markings/sec, 145 secs
lola: 131309982 markings, 207795812 edges, 374719 markings/sec, 150 secs
lola: 133731135 markings, 211631888 edges, 484231 markings/sec, 155 secs
lola: 136052247 markings, 215306154 edges, 464222 markings/sec, 160 secs
lola: 138155158 markings, 218635422 edges, 420582 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G (F ((p3 <= p8)))
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 ((p3 <= p8)))
lola: processed formula length: 18
lola: 69 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: 300005 markings, 300005 edges
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no no no no no no unknown yes no
lola:
preliminary result: unknown no no no no no no unknown yes no
lola: memory consumption: 3468 KB
lola: time consumption: 957 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="ERK-PT-100000"
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 ERK-PT-100000, 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 r094-tall-162048902600297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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