Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r184-oct2-158987928700571.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Kanban-PT-20000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928700571
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.0K Apr 8 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 8 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 7 16:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 7 16:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 6 19:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 6 19:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 6 02:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 6 02:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 14K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591214459449

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:01:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 20:01:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:01:01] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2020-06-03 20:01:01] [INFO ] Transformed 16 places.
[2020-06-03 20:01:01] [INFO ] Transformed 16 transitions.
[2020-06-03 20:01:01] [INFO ] Parsed PT model containing 16 places and 16 transitions in 58 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Incomplete random walk after 100005 steps, including 0 resets, run finished after 48 ms. (steps per millisecond=2083 ) properties seen :[0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0]
// Phase 1: matrix 16 rows 16 cols
[2020-06-03 20:01:01] [INFO ] Computed 5 place invariants in 3 ms
[2020-06-03 20:01:01] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2020-06-03 20:01:01] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-03 20:01:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:01] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2020-06-03 20:01:01] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 18 ms.
[2020-06-03 20:01:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 10 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-06-03 20:01:02] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2020-06-03 20:01:02] [INFO ] Added : 9 causal constraints over 2 iterations in 35 ms. Result :sat
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using 4 positive place invariants in 27 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2020-06-03 20:01:02] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 16 ms.
[2020-06-03 20:01:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-06-03 20:01:02] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 20 ms.
[2020-06-03 20:01:02] [INFO ] Added : 8 causal constraints over 2 iterations in 31 ms. Result :sat
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 6 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-06-03 20:01:02] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:01:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-03 20:01:02] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:01:02] [INFO ] Added : 7 causal constraints over 2 iterations in 24 ms. Result :sat
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-06-03 20:01:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2020-06-03 20:01:02] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 20 ms.
[2020-06-03 20:01:02] [INFO ] Added : 7 causal constraints over 2 iterations in 49 ms. Result :sat
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-03 20:01:02] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:01:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-03 20:01:02] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:01:02] [INFO ] Added : 11 causal constraints over 3 iterations in 19 ms. Result :sat
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-06-03 20:01:02] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:01:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-03 20:01:02] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:01:02] [INFO ] Added : 13 causal constraints over 4 iterations in 12 ms. Result :sat
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2020-06-03 20:01:02] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2020-06-03 20:01:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2020-06-03 20:01:02] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:01:02] [INFO ] Added : 13 causal constraints over 4 iterations in 24 ms. Result :sat
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-03 20:01:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-03 20:01:02] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:01:02] [INFO ] Added : 7 causal constraints over 2 iterations in 6 ms. Result :sat
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-03 20:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:02] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-03 20:01:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:01:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-03 20:01:03] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:01:03] [INFO ] Added : 8 causal constraints over 2 iterations in 5 ms. Result :sat
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 12 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-03 20:01:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-03 20:01:03] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:01:03] [INFO ] Added : 7 causal constraints over 2 iterations in 6 ms. Result :sat
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-03 20:01:03] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:01:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-06-03 20:01:03] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:01:03] [INFO ] Added : 10 causal constraints over 3 iterations in 8 ms. Result :sat
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 25 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2020-06-03 20:01:03] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2020-06-03 20:01:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 13 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-03 20:01:03] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:01:03] [INFO ] Added : 14 causal constraints over 4 iterations in 8 ms. Result :sat
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-03 20:01:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-03 20:01:03] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:01:03] [INFO ] Added : 7 causal constraints over 2 iterations in 5 ms. Result :sat
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-03 20:01:03] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:01:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-03 20:01:03] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:01:03] [INFO ] Added : 14 causal constraints over 4 iterations in 27 ms. Result :sat
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2020-06-03 20:01:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-03 20:01:03] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:01:03] [INFO ] Added : 7 causal constraints over 2 iterations in 5 ms. Result :sat
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2020-06-03 20:01:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2020-06-03 20:01:03] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:01:03] [INFO ] Added : 13 causal constraints over 4 iterations in 10 ms. Result :sat
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 12 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:03] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2020-06-03 20:01:03] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:01:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 20:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:01:03] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-06-03 20:01:03] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 20:01:03] [INFO ] Added : 9 causal constraints over 2 iterations in 6 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-03 20:01:03] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 20:01:03] [INFO ] Flatten gal took : 20 ms
[2020-06-03 20:01:03] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 20:01:03] [INFO ] Flatten gal took : 4 ms
FORMULA Kanban-PT-20000-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 20:01:03] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-03 20:01:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ Kanban-PT-20000 @ 3570 seconds

FORMULA Kanban-PT-20000-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-CTLCardinality-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1922
rslt: Output for CTLCardinality @ Kanban-PT-20000

{
"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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 20:01:04 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "E (G (((p11 <= 1) OR (p9 + 1 <= p12))))",
"processed_size": 40,
"rewrites": 15
},
"result":
{
"edges": 20002,
"markings": 20002,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 299
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p4 <= p14)",
"processed_size": 11,
"rewrites": 16
},
"result":
{
"edges": 19999,
"markings": 20000,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 299
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p9 <= p6)",
"processed_size": 10,
"rewrites": 16
},
"result":
{
"edges": 39999,
"markings": 40000,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 329
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AX(EF(((1 <= p10) AND (2 <= p14))))",
"processed_size": 35,
"rewrites": 16
},
"net":
{
"conflict_clusters": 12,
"singleton_clusters": 0
},
"result":
{
"edges": 120008,
"markings": 120007,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 365
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((3 <= p10)))",
"processed_size": 18,
"rewrites": 15
},
"result":
{
"edges": 21,
"markings": 22,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 411
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"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": "E (F ((p4 + 1 <= p6)))",
"processed_size": 22,
"rewrites": 15
},
"result":
{
"edges": 20001,
"markings": 20002,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 470
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": "A (G ((p12 <= p13)))",
"processed_size": 20,
"rewrites": 16
},
"result":
{
"edges": 60003,
"markings": 50004,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 548
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"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": "A (G (((3 <= p0) OR (2 <= p12))))",
"processed_size": 34,
"rewrites": 16
},
"result":
{
"edges": 79991,
"markings": 79992,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 658
},
"formula":
{
"count":
{
"A": 1,
"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": "A (G ((p14 <= p4)))",
"processed_size": 19,
"rewrites": 16
},
"result":
{
"edges": 20004,
"markings": 20005,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 950
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p5 + 1 <= p12) AND (p0 + 1 <= p5))",
"processed_size": 36,
"rewrites": 18
},
"result":
{
"edges": 130005,
"markings": 110004,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1425
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "AF((EF((p0 <= p2)) AND ((p2 <= 0) OR (1 <= p12))))",
"processed_size": 51,
"rewrites": 16
},
"net":
{
"conflict_clusters": 12,
"singleton_clusters": 0
},
"result":
{
"edges": 80000,
"markings": 80000,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2851
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p14 <= p11)",
"processed_size": 12,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"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": "E (F ((p4 <= p7)))",
"processed_size": 18,
"rewrites": 15
},
"result":
{
"edges": 20000,
"markings": 20001,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3408,
"runtime": 1647.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F((E(F(**)) AND **))) : (E(F(**)) OR (A(G(*)) AND **)) : E(F((A(G(**)) AND A(X(**))))) : (E(X(E(F(**)))) AND E(G(**))) : E(F(*)) : A(G(A(F(**)))) : A(G(**)) : A(G(**)) : E(F(**)) : E(X(E(F(**)))) : E(F(A(G(*)))) : A(X(E(F(**)))) : A(G(**))"
},
"net":
{
"arcs": 40,
"conflict_clusters": 12,
"places": 16,
"places_significant": 11,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "yes yes unknown yes yes no no no yes yes unknown yes no ",
"value": "yes yes unknown yes yes no no no yes yes 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: 32/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 16 transitions, 11 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 CTLCardinality.xml
lola: A (F ((E (F ((p0 <= p2))) AND ((p2 <= 0) OR (1 <= p12))))) : (E (F (E (F ((p4 <= p7))))) OR (NOT(E (F ((2 <= p1)))) AND (p14 <= p11))) : E (F ((A (G ((3 <= p8))) AND A (X ((p6 <= p14)))))) : (E (X (E (F ((p4 <= p14))))) AND E (G (((p11 <= 1) OR (p9 + 1 <= p12))))) : NOT(A (G ((p6 <= p4)))) : A (G (A (F (((p12 <= p5) OR (p5 <= p0)))))) : A (G ((p12 <= p13))) : A (G (((3 <= p0) OR (2 <= p12)))) : E ((((p10 <= p15) AND ((3 <= p3) OR (1 <= p8))) U E (F ((3 <= p10))))) : E (F (E (X ((p9 <= p6))))) : NOT(A (G (E (F ((p14 <= p8)))))) : A (X (E (F (((1 <= p10) AND (2 <= p14)))))) : A (G ((p14 <= p4)))
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((3 <= p8))) AND A (X ((p6 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AG((3 <= p8)) AND AX((p6 <= p14))))
lola: processed formula length: 39
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2906135 markings, 8506157 edges, 581227 markings/sec, 0 secs
lola: 5327707 markings, 15766128 edges, 484314 markings/sec, 5 secs
lola: 7459745 markings, 22158163 edges, 426408 markings/sec, 10 secs
lola: 9463456 markings, 28167271 edges, 400742 markings/sec, 15 secs
lola: 11389516 markings, 33942664 edges, 385212 markings/sec, 20 secs
lola: 13373186 markings, 39891210 edges, 396734 markings/sec, 25 secs
lola: 15349820 markings, 45819728 edges, 395327 markings/sec, 30 secs
lola: 17281357 markings, 51614706 edges, 386307 markings/sec, 35 secs
lola: 19161461 markings, 57252450 edges, 376021 markings/sec, 40 secs
lola: 21022713 markings, 62832097 edges, 372250 markings/sec, 45 secs
lola: 22874500 markings, 68387149 edges, 370357 markings/sec, 50 secs
lola: 24696392 markings, 73852247 edges, 364378 markings/sec, 55 secs
lola: 26464258 markings, 79153502 edges, 353573 markings/sec, 60 secs
lola: 28249473 markings, 84507865 edges, 357043 markings/sec, 65 secs
lola: 30012286 markings, 89794097 edges, 352563 markings/sec, 70 secs
lola: 31702593 markings, 94863296 edges, 338061 markings/sec, 75 secs
lola: 33248389 markings, 99503150 edges, 309159 markings/sec, 80 secs
lola: 34833952 markings, 104256519 edges, 317113 markings/sec, 85 secs
lola: 36382521 markings, 108902163 edges, 309714 markings/sec, 90 secs
lola: 37950372 markings, 113606605 edges, 313570 markings/sec, 95 secs
lola: 39505306 markings, 118268107 edges, 310987 markings/sec, 100 secs
lola: 41024614 markings, 122823161 edges, 303862 markings/sec, 105 secs
lola: 42511029 markings, 127287275 edges, 297283 markings/sec, 110 secs
lola: 43994570 markings, 131735124 edges, 296708 markings/sec, 115 secs
lola: 45495414 markings, 136236192 edges, 300169 markings/sec, 120 secs
lola: 46989168 markings, 140719608 edges, 298751 markings/sec, 125 secs
lola: 48504970 markings, 145265742 edges, 303160 markings/sec, 130 secs
lola: 49999336 markings, 149746801 edges, 298873 markings/sec, 135 secs
lola: 51488770 markings, 154212590 edges, 297887 markings/sec, 140 secs
lola: 52962257 markings, 158635976 edges, 294697 markings/sec, 145 secs
lola: 54445685 markings, 163078580 edges, 296686 markings/sec, 150 secs
lola: 55923209 markings, 167513586 edges, 295505 markings/sec, 155 secs
lola: 57375044 markings, 171872088 edges, 290367 markings/sec, 160 secs
lola: 58824315 markings, 176214614 edges, 289854 markings/sec, 165 secs
lola: 60267747 markings, 180547573 edges, 288686 markings/sec, 170 secs
lola: 61709966 markings, 184870104 edges, 288444 markings/sec, 175 secs
lola: 63152139 markings, 189198166 edges, 288435 markings/sec, 180 secs
lola: 64594541 markings, 193521884 edges, 288480 markings/sec, 185 secs
lola: 66026482 markings, 197815327 edges, 286388 markings/sec, 190 secs
lola: 67458706 markings, 202113471 edges, 286445 markings/sec, 195 secs
lola: 68888451 markings, 206405589 edges, 285949 markings/sec, 200 secs
lola: 70317649 markings, 210693854 edges, 285840 markings/sec, 205 secs
lola: 71746846 markings, 214980519 edges, 285839 markings/sec, 210 secs
lola: 73174187 markings, 219262388 edges, 285468 markings/sec, 215 secs
lola: 74598095 markings, 223533658 edges, 284782 markings/sec, 220 secs
lola: 76016074 markings, 227784841 edges, 283596 markings/sec, 225 secs
lola: 77439025 markings, 232051292 edges, 284590 markings/sec, 230 secs
lola: 78860255 markings, 236315225 edges, 284246 markings/sec, 235 secs
lola: 80283976 markings, 240585150 edges, 284744 markings/sec, 240 secs
lola: 81702863 markings, 244841011 edges, 283777 markings/sec, 245 secs
lola: 83132360 markings, 249126785 edges, 285899 markings/sec, 250 secs
lola: 84559047 markings, 253407224 edges, 285337 markings/sec, 255 secs
lola: 85987190 markings, 257693843 edges, 285629 markings/sec, 260 secs
lola: 87411377 markings, 261964772 edges, 284837 markings/sec, 265 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 12556180 KB
lola: time consumption: 277 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((p4 <= p14))))) AND E (G (((p11 <= 1) OR (p9 + 1 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p11 <= 1) OR (p9 + 1 <= p12))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p11 <= 1) OR (p9 + 1 <= p12))))
lola: processed formula length: 40
lola: 15 rewrites
lola: closed formula file CTLCardinality.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p11) AND (p12 <= p9))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 20002 markings, 20002 edges
lola: ========================================
lola: subprocess 2 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((p4 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (p4 <= p14)
lola: processed formula length: 11
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 20000 markings, 19999 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((p9 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (p9 <= p6)
lola: processed formula length: 10
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p9 <= p6)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 40000 markings, 39999 edges
lola: subprocess 3 will run for 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((1 <= p10) AND (2 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(((1 <= p10) AND (2 <= p14))))
lola: processed formula length: 35
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 120007 markings, 120008 edges
lola: ========================================
lola: subprocess 4 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= p10)))
lola: processed formula length: 18
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p10)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: ========================================
lola: subprocess 5 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p4 + 1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p4 + 1 <= p6)))
lola: processed formula length: 22
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p4 + 1 <= p6)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20002 markings, 20001 edges
lola: ========================================
lola: subprocess 6 will run for 470 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p12 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p12 <= p13)))
lola: processed formula length: 20
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p13 + 1 <= p12)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 50004 markings, 60003 edges
lola: ========================================
lola: subprocess 7 will run for 548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p0) OR (2 <= p12))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((3 <= p0) OR (2 <= p12))))
lola: processed formula length: 34
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p0 <= 2) AND (p12 <= 1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 79992 markings, 79991 edges
lola: ========================================
lola: subprocess 8 will run for 658 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p14 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p14 <= p4)))
lola: processed formula length: 19
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20005 markings, 20004 edges
lola: ========================================
lola: subprocess 9 will run for 823 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p8 + 1 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p14 <= p8)
lola: processed formula length: 11
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p14 <= p8)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-9-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p8 + 1 <= p14)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3427033 markings, 8018459 edges, 685407 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6186871 markings, 14916141 edges, 551968 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 8841261 markings, 21612856 edges, 530878 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 11468939 markings, 28272368 edges, 525536 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 14030876 markings, 34806110 edges, 512387 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 16517650 markings, 41183366 edges, 497355 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 18986556 markings, 47507363 edges, 493781 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 21424490 markings, 53800369 edges, 487587 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 23830738 markings, 60027077 edges, 481250 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 26230921 markings, 66239579 edges, 480037 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 28605454 markings, 72396906 edges, 474907 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 30973330 markings, 78524530 edges, 473575 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 33324356 markings, 84622268 edges, 470205 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 35681656 markings, 90740536 edges, 471460 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 38018722 markings, 96831877 edges, 467413 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 40364964 markings, 102927965 edges, 469248 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 42654287 markings, 108942491 edges, 457865 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 44937512 markings, 114935668 edges, 456645 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 47230469 markings, 120931992 edges, 458591 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 49505820 markings, 126912768 edges, 455070 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 51786402 markings, 132880482 edges, 456116 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 54054731 markings, 138801432 edges, 453666 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 56269331 markings, 144657895 edges, 442920 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 58501774 markings, 150546604 edges, 446489 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 60741566 markings, 156450622 edges, 447958 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 62991458 markings, 162381609 edges, 449978 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 65227435 markings, 168283205 edges, 447195 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 67442560 markings, 174143577 edges, 443025 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 69664812 markings, 180004007 edges, 444450 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 71873156 markings, 185844972 edges, 441669 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 74075622 markings, 191684269 edges, 440493 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 76278565 markings, 197535415 edges, 440589 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 78476197 markings, 203344452 edges, 439526 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 80674458 markings, 209164632 edges, 439652 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 82866887 markings, 214956633 edges, 438486 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 85066341 markings, 220747093 edges, 439891 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 87266285 markings, 226527661 edges, 439989 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 89425373 markings, 232276611 edges, 431818 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 91597531 markings, 238005698 edges, 434432 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 93765381 markings, 243751143 edges, 433570 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 95935602 markings, 249443302 edges, 434044 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 98070685 markings, 255120684 edges, 427017 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 100215747 markings, 260812613 edges, 429012 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 102353412 markings, 266509972 edges, 427533 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 104485383 markings, 272189435 edges, 426394 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 106611226 markings, 277867142 edges, 425169 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 108725133 markings, 283527126 edges, 422781 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 110870087 markings, 289211219 edges, 428991 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 113014427 markings, 294883977 edges, 428868 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 115154510 markings, 300564315 edges, 428017 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 117275683 markings, 306216201 edges, 424235 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 119407985 markings, 311889518 edges, 426460 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 121475992 markings, 317436967 edges, 413601 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 123564026 markings, 323006928 edges, 417607 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 125635133 markings, 328568991 edges, 414221 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 127715266 markings, 334127908 edges, 416027 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 129807356 markings, 339701047 edges, 418418 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 131885705 markings, 345258136 edges, 415670 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 133893275 markings, 350616051 edges, 401514 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 135949260 markings, 356125741 edges, 411197 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 138039310 markings, 361676226 edges, 418010 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 140082090 markings, 367184597 edges, 408556 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 142151355 markings, 372729234 edges, 413853 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 144238869 markings, 378284812 edges, 417503 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 146315191 markings, 383817684 edges, 415264 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 148366026 markings, 389311654 edges, 410167 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 150453028 markings, 394860740 edges, 417400 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 152516620 markings, 400352680 edges, 412718 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 154513303 markings, 405721811 edges, 399337 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 156524930 markings, 411099023 edges, 402325 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 158569645 markings, 416521332 edges, 408943 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 160549786 markings, 421824264 edges, 396028 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 162536589 markings, 427164431 edges, 397361 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 164505329 markings, 432487008 edges, 393748 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 166502397 markings, 437836815 edges, 399414 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 168471997 markings, 443097563 edges, 393920 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 170438112 markings, 448367848 edges, 393223 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 172390230 markings, 453610706 edges, 390424 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 174359261 markings, 458886392 edges, 393806 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 176330046 markings, 464157177 edges, 394157 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 178289411 markings, 469439673 edges, 391873 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 180262408 markings, 474744235 edges, 394599 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 182208038 markings, 479979430 edges, 389126 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 184191024 markings, 485275628 edges, 396597 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 186146347 markings, 490505021 edges, 391065 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 188026578 markings, 495559605 edges, 376046 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 189968913 markings, 500767684 edges, 388467 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 190814920 markings, 503018544 edges, 169201 markings/sec, 435 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 950 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((p12 <= p5) OR (p5 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p5 + 1 <= p12) AND (p0 + 1 <= p5))
lola: processed formula length: 36
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p5 + 1 <= p12) AND (p0 + 1 <= p5))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p12 <= p5) OR (p5 <= p0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-10-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-10-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-10-1.sara.
sara: try reading problem file CTLCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 110004 markings, 130005 edges
lola: ========================================
lola: subprocess 11 will run for 1425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (F ((p0 <= p2))) AND ((p2 <= 0) OR (1 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EF((p0 <= p2)) AND ((p2 <= 0) OR (1 <= p12))))
lola: processed formula length: 51
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 80000 markings, 80000 edges
lola: ========================================
lola: subprocess 12 will run for 2851 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((p4 <= p7))) OR (A (G ((p1 <= 1))) AND (p14 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 2851 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p14 <= p11)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p14 <= p11)
lola: processed formula length: 12
lola: 14 rewrites
lola: closed formula file CTLCardinality.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: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p4 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p4 <= p7)))
lola: processed formula length: 18
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p4 <= p7)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20001 markings, 20000 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((3 <= p8))) AND A (X ((p6 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AG((3 <= p8)) AND AX((p6 <= p14))))
lola: processed formula length: 39
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2946516 markings, 8627679 edges, 589303 markings/sec, 0 secs
lola: 5303650 markings, 15695064 edges, 471427 markings/sec, 5 secs
lola: 7362222 markings, 21866903 edges, 411714 markings/sec, 10 secs
lola: 9238999 markings, 27496058 edges, 375355 markings/sec, 15 secs
lola: 11000287 markings, 32775325 edges, 352258 markings/sec, 20 secs
lola: 12696492 markings, 37861645 edges, 339241 markings/sec, 25 secs
lola: 14347008 markings, 42813192 edges, 330103 markings/sec, 30 secs
lola: 15962303 markings, 47655689 edges, 323059 markings/sec, 35 secs
lola: 17547967 markings, 52413502 edges, 317133 markings/sec, 40 secs
lola: 19114087 markings, 57109586 edges, 313224 markings/sec, 45 secs
lola: 20669792 markings, 61774105 edges, 311141 markings/sec, 50 secs
lola: 22227807 markings, 66449901 edges, 311603 markings/sec, 55 secs
lola: 23789844 markings, 71134928 edges, 312407 markings/sec, 60 secs
lola: 25337382 markings, 75774726 edges, 309508 markings/sec, 65 secs
lola: 26874983 markings, 80385444 edges, 307520 markings/sec, 70 secs
lola: 28414569 markings, 85006021 edges, 307917 markings/sec, 75 secs
lola: 29954935 markings, 89623428 edges, 308073 markings/sec, 80 secs
lola: 31483302 markings, 94209973 edges, 305673 markings/sec, 85 secs
lola: 33005706 markings, 98773144 edges, 304481 markings/sec, 90 secs
lola: 34519640 markings, 103312818 edges, 302787 markings/sec, 95 secs
lola: 36010712 markings, 107786523 edges, 298214 markings/sec, 100 secs
lola: 37518645 markings, 112308133 edges, 301587 markings/sec, 105 secs
lola: 39015039 markings, 116801126 edges, 299279 markings/sec, 110 secs
lola: 40512173 markings, 121289200 edges, 299427 markings/sec, 115 secs
lola: 41995320 markings, 125738903 edges, 296629 markings/sec, 120 secs
lola: 43486970 markings, 130210565 edges, 298330 markings/sec, 125 secs
lola: 44979953 markings, 134688906 edges, 298597 markings/sec, 130 secs
lola: 46468653 markings, 139155565 edges, 297740 markings/sec, 135 secs
lola: 47957867 markings, 143618791 edges, 297843 markings/sec, 140 secs
lola: 49442699 markings, 148075382 edges, 296966 markings/sec, 145 secs
lola: 50926983 markings, 152526025 edges, 296857 markings/sec, 150 secs
lola: 52409805 markings, 156976540 edges, 296564 markings/sec, 155 secs
lola: 53887715 markings, 161404692 edges, 295582 markings/sec, 160 secs
lola: 55361985 markings, 165827172 edges, 294854 markings/sec, 165 secs
lola: 56824439 markings, 170214006 edges, 292491 markings/sec, 170 secs
lola: 58284279 markings, 174598588 edges, 291968 markings/sec, 175 secs
lola: 59706847 markings, 178863447 edges, 284514 markings/sec, 180 secs
lola: 61167519 markings, 183247819 edges, 292134 markings/sec, 185 secs
lola: 62632183 markings, 187636425 edges, 292933 markings/sec, 190 secs
lola: 64086192 markings, 192000808 edges, 290802 markings/sec, 195 secs
lola: 65537631 markings, 196352405 edges, 290288 markings/sec, 200 secs
lola: 66983286 markings, 200688452 edges, 289131 markings/sec, 205 secs
lola: 68425266 markings, 205016492 edges, 288396 markings/sec, 210 secs
lola: 69866199 markings, 209339308 edges, 288187 markings/sec, 215 secs
lola: 71306313 markings, 213657372 edges, 288023 markings/sec, 220 secs
lola: 72747457 markings, 217981793 edges, 288229 markings/sec, 225 secs
lola: 74186538 markings, 222298315 edges, 287816 markings/sec, 230 secs
lola: 75623354 markings, 226604942 edges, 287363 markings/sec, 235 secs
lola: 77059528 markings, 230910577 edges, 287235 markings/sec, 240 secs
lola: 78493641 markings, 235217485 edges, 286823 markings/sec, 245 secs
lola: 79923134 markings, 239499222 edges, 285899 markings/sec, 250 secs
lola: 81358363 markings, 243805575 edges, 287046 markings/sec, 255 secs
lola: 82791917 markings, 248110603 edges, 286711 markings/sec, 260 secs
lola: 84219978 markings, 252392251 edges, 285612 markings/sec, 265 secs
lola: 85658198 markings, 256703111 edges, 287644 markings/sec, 270 secs
lola: 87090457 markings, 260998226 edges, 286452 markings/sec, 275 secs
lola: 88522446 markings, 265299395 edges, 286398 markings/sec, 280 secs
lola: 89956678 markings, 269600611 edges, 286846 markings/sec, 285 secs
lola: 91385729 markings, 273883937 edges, 285810 markings/sec, 290 secs
lola: 92807900 markings, 278148118 edges, 284434 markings/sec, 295 secs
lola: 94225737 markings, 282409402 edges, 283567 markings/sec, 300 secs
lola: 95646030 markings, 286669619 edges, 284059 markings/sec, 305 secs
lola: 97065903 markings, 290919988 edges, 283975 markings/sec, 310 secs
lola: 98480902 markings, 295170978 edges, 283000 markings/sec, 315 secs
lola: 99900084 markings, 299420752 edges, 283836 markings/sec, 320 secs
lola: 101312087 markings, 303665701 edges, 282401 markings/sec, 325 secs
lola: 102728326 markings, 307910067 edges, 283248 markings/sec, 330 secs
lola: 104144141 markings, 312159476 edges, 283163 markings/sec, 335 secs
lola: 105556002 markings, 316395525 edges, 282372 markings/sec, 340 secs
lola: 106964685 markings, 320613657 edges, 281737 markings/sec, 345 secs
lola: 108369678 markings, 324832196 edges, 280999 markings/sec, 350 secs
lola: 109773053 markings, 329035829 edges, 280675 markings/sec, 355 secs
lola: 111180428 markings, 333257783 edges, 281475 markings/sec, 360 secs
lola: 112582195 markings, 337470139 edges, 280353 markings/sec, 365 secs
lola: 113983840 markings, 341673726 edges, 280329 markings/sec, 370 secs
lola: 115355196 markings, 345818829 edges, 274271 markings/sec, 375 secs
lola: 116731130 markings, 349916084 edges, 275187 markings/sec, 380 secs
lola: 118082709 markings, 353964811 edges, 270316 markings/sec, 385 secs
lola: 119428381 markings, 358004821 edges, 269134 markings/sec, 390 secs
lola: 120762209 markings, 362007218 edges, 266766 markings/sec, 395 secs
lola: 122105274 markings, 366035531 edges, 268613 markings/sec, 400 secs
lola: 123435358 markings, 370023139 edges, 266017 markings/sec, 405 secs
lola: 124764032 markings, 374013009 edges, 265735 markings/sec, 410 secs
lola: 126095317 markings, 377997114 edges, 266257 markings/sec, 415 secs
lola: 127414294 markings, 381961446 edges, 263795 markings/sec, 420 secs
lola: 128738238 markings, 385928217 edges, 264789 markings/sec, 425 secs
lola: 130051301 markings, 389863557 edges, 262613 markings/sec, 430 secs
lola: 131366433 markings, 393817961 edges, 263026 markings/sec, 435 secs
lola: 132680575 markings, 397754109 edges, 262828 markings/sec, 440 secs
lola: 133990399 markings, 401688121 edges, 261965 markings/sec, 445 secs
lola: 135290951 markings, 405586857 edges, 260110 markings/sec, 450 secs
lola: 136559159 markings, 409387821 edges, 253642 markings/sec, 455 secs
lola: 137861878 markings, 413295891 edges, 260544 markings/sec, 460 secs
lola: 139160193 markings, 417187562 edges, 259663 markings/sec, 465 secs
lola: 140455682 markings, 421074879 edges, 259098 markings/sec, 470 secs
lola: 141748358 markings, 424958777 edges, 258535 markings/sec, 475 secs
lola: 143030715 markings, 428800753 edges, 256471 markings/sec, 480 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p8 + 1 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p14 <= p8)
lola: processed formula length: 11
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p8 + 1 <= p14)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p14 <= p8)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-14-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-14-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-14-1.sara.
sara: try reading problem file CTLCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3386995 markings, 7916833 edges, 677399 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6168643 markings, 14869579 edges, 556330 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 8811578 markings, 21545060 edges, 528587 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 11409363 markings, 28121523 edges, 519557 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 13921140 markings, 34520069 edges, 502355 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 16400363 markings, 40884682 edges, 495845 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 18861575 markings, 47186626 edges, 492242 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 21275688 markings, 53422283 edges, 482823 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 23663854 markings, 59603136 edges, 477633 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 26050843 markings, 65777376 edges, 477398 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 28419268 markings, 71917754 edges, 473685 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 30784248 markings, 78029627 edges, 472996 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 33135253 markings, 84119724 edges, 470201 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 35455416 markings, 90161004 edges, 464033 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 37768229 markings, 96192261 edges, 462563 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 40083879 markings, 102200292 edges, 463130 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 42362670 markings, 108175149 edges, 455758 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 44626224 markings, 114118063 edges, 452711 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 46910114 markings, 120073391 edges, 456778 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 49140819 markings, 125972713 edges, 446141 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 51406613 markings, 131879027 edges, 453159 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 53664000 markings, 137766894 edges, 451477 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 55877929 markings, 143617162 edges, 442786 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 58086976 markings, 149457841 edges, 441809 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 60319044 markings, 155327906 edges, 446414 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 62531847 markings, 161170253 edges, 442561 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 64746281 markings, 167000312 edges, 442887 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 66933337 markings, 172788150 edges, 437411 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 69125457 markings, 178578813 edges, 438424 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 71309594 markings, 184362085 edges, 436827 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 73498235 markings, 190143794 edges, 437728 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 75667491 markings, 195919261 edges, 433851 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 77832676 markings, 201676698 edges, 433037 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 80035456 markings, 207461142 edges, 440556 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 82198867 markings, 213198350 edges, 432682 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 84373419 markings, 218936763 edges, 434910 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 86561194 markings, 224679647 edges, 437555 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 88721692 markings, 230408807 edges, 432100 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 90879412 markings, 236105478 edges, 431544 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 93038236 markings, 241812223 edges, 431765 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 95175393 markings, 247464249 edges, 427431 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 97331697 markings, 253136643 edges, 431261 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 99450780 markings, 258801491 edges, 423817 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 101596521 markings, 264474719 edges, 429148 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 103705090 markings, 270116702 edges, 421714 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 105819050 markings, 275772547 edges, 422792 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 107936600 markings, 281411570 edges, 423510 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 110073357 markings, 287079774 edges, 427351 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 112211018 markings, 292729737 edges, 427532 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 114336902 markings, 298372071 edges, 425177 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 116426672 markings, 303976148 edges, 417954 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 118540639 markings, 309594459 edges, 422793 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 120633311 markings, 315177399 edges, 418534 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 122722996 markings, 320756735 edges, 417937 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 124784204 markings, 326298609 edges, 412242 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 126871996 markings, 331871939 edges, 417558 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 128962327 markings, 337452487 edges, 418066 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 131051865 markings, 343017095 edges, 417908 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 133135835 markings, 348579466 edges, 416794 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 135203683 markings, 354122915 edges, 413570 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 137266234 markings, 359648799 edges, 412510 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 139341189 markings, 365183965 edges, 414991 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 141379488 markings, 370688151 edges, 407660 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 143472025 markings, 376249681 edges, 418507 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 145554995 markings, 381793425 edges, 416594 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 147618948 markings, 387321650 edges, 412791 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 149692101 markings, 392845488 edges, 414631 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 151772967 markings, 398372341 edges, 416173 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 153747980 markings, 403650596 edges, 395003 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 155722247 markings, 408958414 edges, 394853 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 157709795 markings, 414230300 edges, 397510 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 159679239 markings, 419495257 edges, 393889 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 161646313 markings, 424753958 edges, 393415 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 163586800 markings, 430018687 edges, 388097 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 165578405 markings, 435341861 edges, 398321 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 167549222 markings, 440623157 edges, 394163 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 169519136 markings, 445917723 edges, 393983 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 171496470 markings, 451196170 edges, 395467 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 173434572 markings, 456410860 edges, 387620 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 175384681 markings, 461648517 edges, 390022 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 177341970 markings, 466876959 edges, 391458 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 179275577 markings, 472101223 edges, 386721 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 181222332 markings, 477318619 edges, 389351 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 183113963 markings, 482409868 edges, 378326 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 184939776 markings, 487273395 edges, 365163 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 186882712 markings, 492500454 edges, 388587 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 188823415 markings, 497700814 edges, 388141 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 190561713 markings, 502348378 edges, 347660 markings/sec, 435 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes yes unknown yes yes no no no yes yes unknown yes no
lola:
preliminary result: yes yes unknown yes yes no no no yes yes unknown yes no
lola: memory consumption: 3408 KB
lola: time consumption: 1647 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.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="Kanban-PT-20000"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is Kanban-PT-20000, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-oct2-158987928700571"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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