Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987883100923.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ERK-PT-100000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987883100923
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.3K Mar 31 14:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 31 14:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 31 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 31 14:36 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.4K Apr 8 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 31 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 31 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 31 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 31 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 31 14:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 31 14:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 6.7K 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 ERK-PT-100000-CTLCardinality-00
FORMULA_NAME ERK-PT-100000-CTLCardinality-01
FORMULA_NAME ERK-PT-100000-CTLCardinality-02
FORMULA_NAME ERK-PT-100000-CTLCardinality-03
FORMULA_NAME ERK-PT-100000-CTLCardinality-04
FORMULA_NAME ERK-PT-100000-CTLCardinality-05
FORMULA_NAME ERK-PT-100000-CTLCardinality-06
FORMULA_NAME ERK-PT-100000-CTLCardinality-07
FORMULA_NAME ERK-PT-100000-CTLCardinality-08
FORMULA_NAME ERK-PT-100000-CTLCardinality-09
FORMULA_NAME ERK-PT-100000-CTLCardinality-10
FORMULA_NAME ERK-PT-100000-CTLCardinality-11
FORMULA_NAME ERK-PT-100000-CTLCardinality-12
FORMULA_NAME ERK-PT-100000-CTLCardinality-13
FORMULA_NAME ERK-PT-100000-CTLCardinality-14
FORMULA_NAME ERK-PT-100000-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591251347132

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

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

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

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

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

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

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

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

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

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

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

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

FORMULA ERK-PT-100000-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2556
rslt: Output for CTLCardinality @ ERK-PT-100000

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=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": "Thu Jun 4 06:15:52 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p1 <= 2) AND (p0 <= 1))",
"processed_size": 25,
"rewrites": 10
},
"result":
{
"edges": 99999,
"markings": 100000,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EF(AX((p8 + 1 <= p6)))",
"processed_size": 22,
"rewrites": 9
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 200028,
"markings": 200017,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 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": 4,
"visible_transitions": 0
},
"processed": "((p7 + 1 <= p4) AND (p0 + 1 <= p2))",
"processed_size": 35,
"rewrites": 10
},
"result":
{
"edges": 100001,
"markings": 100002,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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 ((p8 <= p5)))",
"processed_size": 18,
"rewrites": 8
},
"result":
{
"edges": 100000,
"markings": 100001,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"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": 445
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((p2 <= p8) OR (3 <= p3))))",
"processed_size": 34,
"rewrites": 9
},
"result":
{
"edges": 100001,
"markings": 100002,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((p6 <= p1) AND (p0 <= p3))))",
"processed_size": 35,
"rewrites": 8
},
"result":
{
"edges": 100000,
"markings": 100001,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 650
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AF(E((3 <= p7) U (p8 <= p2)))",
"processed_size": 29,
"rewrites": 9
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 200000,
"markings": 200000,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 813
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((3 <= p2) OR (p0 <= p5))",
"processed_size": 26,
"rewrites": 7
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1084
},
"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 ((p10 <= p9)))",
"processed_size": 19,
"rewrites": 8
},
"result":
{
"edges": 500000,
"markings": 500001,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"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": 8,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1626
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (((p4 <= p9) U ((3 <= p4) AND (p3 <= p6))))",
"processed_size": 45,
"rewrites": 10
},
"result":
{
"edges": 200000,
"markings": 100001,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

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

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

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

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

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

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p8)",
"processed_size": 9,
"rewrites": 7
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"child":
[

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

{
"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 ((p1 <= 1)))",
"processed_size": 17,
"rewrites": 8
},
"result":
{
"edges": 99999,
"markings": 100000,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3176,
"runtime": 1014.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(A(G(**)))) : E(F(**)) : A(G(E(F(**)))) : (** OR E((** U **))) : E(F(**)) : E(F(A(X(**)))) : A(G(**)) : (** AND (E((** U **)) AND **)) : (** OR E(F(**))) : A(X(A(G(**)))) : A(F(E((** U **)))) : (E(F(**)) AND (A(F(**)) OR (** OR A(G(**)))))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 7,
"places": 11,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "no yes unknown no yes yes no unknown yes no yes yes ",
"value": "no yes unknown no yes yes no unknown yes no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 22/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 352
lola: finding significant places
lola: 11 places, 11 transitions, 6 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: A (X (A (G (((3 <= p1) OR (2 <= p0)))))) : E (F ((p8 <= p5))) : A (G (E (F ((p9 <= p1))))) : ((3 <= p5) OR E (((p4 <= p9) U ((3 <= p4) AND (p3 <= p6))))) : E (F (((p6 <= p1) AND (p0 <= p3)))) : E (F (A (X ((p8 + 1 <= p6))))) : A (G (((p2 <= p8) OR (3 <= p3)))) : (((1 <= p8) AND E (((p6 <= p7) U (p1 <= p5)))) AND (3 <= p8)) : (E (((1 <= 0) U ((3 <= p2) OR (p0 <= p5)))) OR E (F ((p10 <= p9)))) : A (G (A (X (((p4 <= p7) OR (p2 <= p0)))))) : A (F (E (((3 <= p7) U (p8 <= p2))))) : (E (((0 <= 0) U (p1 <= 1))) AND ((A (F ((p7 <= p8))) OR (3 <= p7)) OR A (G (((p1 <= p2) OR (2 <= p6))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((3 <= p1) OR (2 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p1 <= 2) AND (p0 <= 1))
lola: processed formula length: 25
lola: 10 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: 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: ((p1 <= 2) AND (p0 <= 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-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 100000 markings, 99999 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((p8 + 1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((p8 + 1 <= p6)))
lola: processed formula length: 22
lola: 9 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 200017 markings, 200028 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((p4 <= p7) OR (p2 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p7 + 1 <= p4) AND (p0 + 1 <= p2))
lola: processed formula length: 35
lola: 10 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: 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: ((p7 + 1 <= p4) AND (p0 + 1 <= p2))
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-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 100002 markings, 100001 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p8 <= p5)))
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 ((p8 <= p5)))
lola: processed formula length: 18
lola: 8 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: (p8 <= p5)
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-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 100001 markings, 100000 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p2 <= p8) OR (3 <= p3))))
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 (((p2 <= p8) OR (3 <= p3))))
lola: processed formula length: 34
lola: 9 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: ((p8 + 1 <= p2) AND (p3 <= 2))
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-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-4-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 100002 markings, 100001 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p6 <= p1) AND (p0 <= p3))))
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 (((p6 <= p1) AND (p0 <= p3))))
lola: processed formula length: 35
lola: 8 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: ((p6 <= p1) AND (p0 <= p3))
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-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-5-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 100001 markings, 100000 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p9 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (p9 <= p1)
lola: processed formula length: 10
lola: 10 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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p1 + 1 <= p9)
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: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p9 <= p1)
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-6-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-6-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-0.sara.
sara: try reading problem file CTLCardinality-6-1.sara.

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3586136 markings, 8659155 edges, 717227 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 7416577 markings, 18233021 edges, 766088 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 11187267 markings, 27657547 edges, 754138 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 14921806 markings, 36991468 edges, 746908 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 18637806 markings, 46279804 edges, 743200 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 22337581 markings, 55527752 edges, 739955 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 26028857 markings, 64755411 edges, 738255 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 29696835 markings, 73923605 edges, 733596 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 33357806 markings, 83075970 edges, 732194 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 37020311 markings, 92229697 edges, 732501 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 40656653 markings, 101322206 edges, 727268 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 43806863 markings, 109197021 edges, 630042 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 47412259 markings, 118207396 edges, 721079 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 51006765 markings, 127192776 edges, 718901 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 54595495 markings, 136165347 edges, 717746 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 57805907 markings, 144189302 edges, 642082 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 61071723 markings, 152352248 edges, 653163 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 64313352 markings, 160455996 edges, 648326 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 67835738 markings, 169261330 edges, 704477 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 71335046 markings, 178009428 edges, 699862 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 74833302 markings, 186753498 edges, 699651 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 78209703 markings, 195196072 edges, 675280 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 81675864 markings, 203861651 edges, 693232 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 84770831 markings, 211597088 edges, 618993 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 87927558 markings, 219488904 edges, 631345 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 91182325 markings, 227626859 edges, 650953 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 94679774 markings, 236366091 edges, 699490 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 98214784 markings, 245204688 edges, 707002 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 101761977 markings, 254071726 edges, 709439 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 105311698 markings, 262947449 edges, 709944 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 108845487 markings, 271780504 edges, 706758 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 112308597 markings, 280435850 edges, 692622 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 115358535 markings, 288060855 edges, 609988 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 118410666 markings, 295693742 edges, 610426 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 121489572 markings, 303387074 edges, 615781 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 125002247 markings, 312172011 edges, 702535 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 128499100 markings, 320909022 edges, 699371 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 131973755 markings, 329597357 edges, 694931 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 135093645 markings, 337397777 edges, 623978 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 138131222 markings, 344991783 edges, 607515 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 141345022 markings, 353026274 edges, 642760 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 144606922 markings, 361175930 edges, 652380 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 147753256 markings, 369042436 edges, 629267 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 150858041 markings, 376805614 edges, 620957 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 153890674 markings, 384385816 edges, 606527 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 157224110 markings, 392717343 edges, 666687 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 160052613 markings, 399790854 edges, 565701 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 162653947 markings, 406293543 edges, 520267 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 165240959 markings, 412759662 edges, 517402 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 168154115 markings, 420043674 edges, 582631 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 170230953 markings, 425237068 edges, 415368 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 172650732 markings, 431281511 edges, 483956 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 175239909 markings, 437756961 edges, 517835 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 178122467 markings, 444962731 edges, 576512 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 181196196 markings, 452649885 edges, 614746 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 183860674 markings, 459306225 edges, 532896 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 186034596 markings, 464740352 edges, 434784 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 188315092 markings, 470446507 edges, 456099 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 189990137 markings, 474633097 edges, 335009 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 192441693 markings, 480757425 edges, 490311 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 194759819 markings, 486557275 edges, 463625 markings/sec, 300 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 650 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (((3 <= p7) U (p8 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(E((3 <= p7) U (p8 <= p2)))
lola: processed formula length: 29
lola: 9 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: 200000 markings, 200000 edges
lola: ========================================
lola: subprocess 8 will run for 813 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((3 <= p2) OR (p0 <= p5)) OR E (F ((p10 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 813 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p2) OR (p0 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p2) OR (p0 <= p5))
lola: processed formula length: 26
lola: 7 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 1084 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p10 <= p9)))
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 ((p10 <= p9)))
lola: processed formula length: 19
lola: 8 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: (p10 <= p9)
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.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 500001 markings, 500000 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 1084 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p5) OR E (((p4 <= p9) U ((3 <= p4) AND (p3 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1084 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p5)
lola: processed formula length: 9
lola: 7 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 1626 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p4 <= p9) U ((3 <= p4) AND (p3 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((p4 <= p9) U ((3 <= p4) AND (p3 <= p6))))
lola: processed formula length: 45
lola: 10 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
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 <= p4) AND (p3 <= p6))
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-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-10-0.sara.

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 100001 markings, 200000 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 1626 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p8) AND (E (((p6 <= p7) U (p1 <= p5))) AND (3 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1626 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p8)
lola: processed formula length: 9
lola: 7 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: subprocess 11 will run for 3253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p8)
lola: processed formula length: 9
lola: 7 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 11 will run for 3253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((p1 <= 1))) AND (A (F ((p7 <= p8))) OR ((3 <= p7) OR A (G (((p1 <= p2) OR (2 <= p6)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p7)
lola: processed formula length: 9
lola: 7 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p9 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (p9 <= p1)
lola: processed formula length: 10
lola: 10 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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: state equation task get result unparse finished++ id 0
lola: formula 1: (p9 <= p1)
lola: state equation task get result unparse finished id 1
lola: formula 0: (p1 + 1 <= p9)
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: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-12-1.sara
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-1.sara.
sara: try reading problem file CTLCardinality-12-0.sara.

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3976889 markings, 9636230 edges, 795378 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 7524699 markings, 18503395 edges, 709562 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 11225104 markings, 27752490 edges, 740081 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 14711971 markings, 36468330 edges, 697373 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 18061923 markings, 44841429 edges, 669990 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 21521581 markings, 53489963 edges, 691932 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 25145873 markings, 62549278 edges, 724858 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 28764038 markings, 71593882 edges, 723633 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 32352580 markings, 80563433 edges, 717708 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 35950067 markings, 89555043 edges, 719497 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 39524342 markings, 98489459 edges, 714855 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 42897218 markings, 106922196 edges, 674575 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 46515935 markings, 115968869 edges, 723743 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 49726175 markings, 123994209 edges, 642048 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 53320026 markings, 132977086 edges, 718770 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 56931705 markings, 142003227 edges, 722336 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 60544623 markings, 151035756 edges, 722584 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 64156165 markings, 160064489 edges, 722308 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 67756606 markings, 169065060 edges, 720088 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 71342592 markings, 178030275 edges, 717197 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 74923174 markings, 186979888 edges, 716116 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 78508483 markings, 195942063 edges, 717062 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 82073303 markings, 204855078 edges, 712964 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 85634877 markings, 213755742 edges, 712315 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 89189845 markings, 222645763 edges, 710994 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 92732195 markings, 231500326 edges, 708470 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 96302493 markings, 240423750 edges, 714060 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 99875358 markings, 249355902 edges, 714573 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 103410102 markings, 258192098 edges, 706949 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 106913489 markings, 266949861 edges, 700677 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 110185190 markings, 275130268 edges, 654340 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 113670774 markings, 283842476 edges, 697117 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 117173686 markings, 292601080 edges, 700582 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 120674638 markings, 301349199 edges, 700190 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 124157817 markings, 310059646 edges, 696636 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 127651245 markings, 318793452 edges, 698686 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 131148575 markings, 327534537 edges, 699466 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 134625473 markings, 336225409 edges, 695380 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 138108252 markings, 344934619 edges, 696556 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 141609704 markings, 353687619 edges, 700290 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 145122751 markings, 362469385 edges, 702609 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 148627919 markings, 371228361 edges, 701034 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 152126884 markings, 379975767 edges, 699793 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 155609950 markings, 388685630 edges, 696613 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 158971074 markings, 397089110 edges, 672225 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 161092087 markings, 402389928 edges, 424203 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 163860478 markings, 409306607 edges, 553678 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 166796964 markings, 416650383 edges, 587297 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 169343917 markings, 423020336 edges, 509391 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 171289236 markings, 427878717 edges, 389064 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 173904808 markings, 434419689 edges, 523114 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 176376759 markings, 440597544 edges, 494390 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 178770710 markings, 446580465 edges, 478790 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 181703077 markings, 453914676 edges, 586473 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 184318732 markings, 460449811 edges, 523131 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 186814791 markings, 466693232 edges, 499212 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 189192943 markings, 472640699 edges, 475630 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 191531421 markings, 478483728 edges, 467696 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 194626551 markings, 486221869 edges, 619026 markings/sec, 290 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((1 <= p8) AND (E (((p6 <= p7) U (p1 <= p5))) AND (3 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (3 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p8)
lola: processed formula length: 9
lola: 7 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: ========================================
lola: ...considering subproblem: (1 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p8)
lola: processed formula length: 9
lola: 7 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: ========================================
lola: ...considering subproblem: E (((p6 <= p7) U (p1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((p6 <= p7) U (p1 <= p5)))
lola: processed formula length: 29
lola: 10 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
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: (p1 <= p5)
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-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-15-0.sara.
lola: sara is running 0 secs || 3638588 markings, 8790606 edges, 727718 markings/sec, 0 secs
lola: sara is running 5 secs || 6867178 markings, 16859124 edges, 645718 markings/sec, 5 secs
lola: sara is running 10 secs || 10282805 markings, 25396976 edges, 683125 markings/sec, 10 secs
lola: sara is running 15 secs || 13693395 markings, 33921853 edges, 682118 markings/sec, 15 secs
lola: sara is running 20 secs || 17087818 markings, 42407121 edges, 678885 markings/sec, 20 secs
lola: sara is running 25 secs || 20464015 markings, 50846277 edges, 675239 markings/sec, 25 secs
lola: sara is running 30 secs || 23652943 markings, 58816263 edges, 637786 markings/sec, 30 secs
lola: sara is running 35 secs || 26407486 markings, 65702489 edges, 550909 markings/sec, 35 secs
lola: sara is running 40 secs || 29767724 markings, 74102340 edges, 672048 markings/sec, 40 secs
lola: sara is running 45 secs || 33129701 markings, 82506687 edges, 672395 markings/sec, 45 secs
lola: sara is running 50 secs || 36456710 markings, 90822825 edges, 665402 markings/sec, 50 secs
lola: sara is running 55 secs || 39656285 markings, 98821379 edges, 639915 markings/sec, 55 secs
lola: sara is running 60 secs || 42715644 markings, 106468901 edges, 611872 markings/sec, 60 secs
lola: sara is running 65 secs || 45850725 markings, 114306327 edges, 627016 markings/sec, 65 secs
lola: sara is running 70 secs || 49034187 markings, 122262018 edges, 636692 markings/sec, 70 secs
lola: sara is running 75 secs || 52345881 markings, 130540935 edges, 662339 markings/sec, 75 secs
lola: sara is running 80 secs || 55553657 markings, 138558120 edges, 641555 markings/sec, 80 secs
lola: sara is running 85 secs || 58791821 markings, 146656364 edges, 647633 markings/sec, 85 secs
lola: sara is running 90 secs || 62141495 markings, 155028478 edges, 669935 markings/sec, 90 secs
lola: sara is running 95 secs || 65476882 markings, 163367236 edges, 667077 markings/sec, 95 secs
lola: sara is running 100 secs || 68789158 markings, 171645093 edges, 662455 markings/sec, 100 secs
lola: sara is running 105 secs || 71883134 markings, 179381680 edges, 618795 markings/sec, 105 secs
lola: sara is running 110 secs || 75168622 markings, 187595068 edges, 657098 markings/sec, 110 secs
lola: sara is running 115 secs || 78468056 markings, 195839854 edges, 659887 markings/sec, 115 secs
lola: sara is running 120 secs || 81748398 markings, 204043126 edges, 656068 markings/sec, 120 secs
lola: sara is running 125 secs || 85027882 markings, 212239348 edges, 655897 markings/sec, 125 secs
lola: sara is running 130 secs || 88306637 markings, 220438306 edges, 655751 markings/sec, 130 secs
lola: sara is running 135 secs || 91214722 markings, 227704964 edges, 581617 markings/sec, 135 secs
lola: sara is running 140 secs || 94496058 markings, 235909890 edges, 656267 markings/sec, 140 secs
lola: sara is running 145 secs || 97401561 markings, 243170225 edges, 581101 markings/sec, 145 secs
lola: sara is running 150 secs || 100689920 markings, 251394376 edges, 657672 markings/sec, 150 secs
lola: sara is running 155 secs || 104003598 markings, 259677453 edges, 662736 markings/sec, 155 secs
lola: sara is running 160 secs || 107304199 markings, 267925464 edges, 660120 markings/sec, 160 secs
lola: sara is running 165 secs || 110610255 markings, 276192765 edges, 661211 markings/sec, 165 secs
lola: sara is running 170 secs || 113909853 markings, 284442443 edges, 659920 markings/sec, 170 secs
lola: sara is running 175 secs || 117049043 markings, 292288302 edges, 627838 markings/sec, 175 secs
lola: sara is running 180 secs || 120276703 markings, 300353938 edges, 645532 markings/sec, 180 secs
lola: sara is running 185 secs || 123530239 markings, 308491323 edges, 650707 markings/sec, 185 secs
lola: sara is running 190 secs || 126795458 markings, 316654484 edges, 653044 markings/sec, 190 secs
lola: sara is running 195 secs || 130027128 markings, 324729918 edges, 646334 markings/sec, 195 secs
lola: sara is running 200 secs || 133264183 markings, 332824053 edges, 647411 markings/sec, 200 secs
lola: sara is running 205 secs || 136532902 markings, 340993339 edges, 653744 markings/sec, 205 secs
lola: sara is running 210 secs || 139799699 markings, 349160619 edges, 653359 markings/sec, 210 secs
lola: sara is running 215 secs || 143081949 markings, 357366893 edges, 656450 markings/sec, 215 secs
lola: sara is running 220 secs || 146346167 markings, 365524216 edges, 652844 markings/sec, 220 secs
lola: sara is running 225 secs || 149399045 markings, 373158453 edges, 610576 markings/sec, 225 secs
lola: sara is running 230 secs || 152654847 markings, 381297110 edges, 651160 markings/sec, 230 secs
lola: sara is running 235 secs || 155709037 markings, 388933005 edges, 610838 markings/sec, 235 secs
lola: sara is running 240 secs || 158944780 markings, 397022831 edges, 647149 markings/sec, 240 secs
lola: sara is running 245 secs || 162077701 markings, 404851196 edges, 626584 markings/sec, 245 secs
lola: sara is running 250 secs || 165325930 markings, 412971553 edges, 649646 markings/sec, 250 secs
lola: sara is running 255 secs || 168583742 markings, 421117510 edges, 651562 markings/sec, 255 secs
lola: sara is running 260 secs || 171839704 markings, 429255144 edges, 651192 markings/sec, 260 secs
lola: sara is running 265 secs || 175089551 markings, 437383128 edges, 649969 markings/sec, 265 secs
lola: sara is running 270 secs || 177885294 markings, 444368386 edges, 559149 markings/sec, 270 secs
lola: sara is running 275 secs || 180976175 markings, 452097443 edges, 618176 markings/sec, 275 secs
lola: sara is running 280 secs || 183867437 markings, 459326514 edges, 578252 markings/sec, 280 secs
lola: sara is running 285 secs || 186915302 markings, 466945622 edges, 609573 markings/sec, 285 secs
lola: sara is running 290 secs || 190172089 markings, 475082471 edges, 651357 markings/sec, 290 secs
lola: sara is running 295 secs || 193418431 markings, 483201631 edges, 649268 markings/sec, 295 secs
lola: sara is running 300 secs || 196472454 markings, 490835924 edges, 610805 markings/sec, 300 secs
lola: sara is running 305 secs || 199208061 markings, 497671070 edges, 547121 markings/sec, 305 secs
lola: sara is running 310 secs || 201597027 markings, 503649161 edges, 477793 markings/sec, 310 secs
lola: sara is running 315 secs || 203747602 markings, 509019215 edges, 430115 markings/sec, 315 secs
lola: sara is running 320 secs || 206775986 markings, 516593234 edges, 605677 markings/sec, 320 secs
lola: sara is running 325 secs || 208297521 markings, 520399290 edges, 304307 markings/sec, 325 secs
lola: sara is running 330 secs || 210932275 markings, 526985389 edges, 526951 markings/sec, 330 secs
lola: sara is running 335 secs || 212955295 markings, 532039123 edges, 404604 markings/sec, 335 secs
lola: sara is running 340 secs || 215914531 markings, 539438192 edges, 591847 markings/sec, 340 secs
lola: sara is running 345 secs || 218743279 markings, 546509539 edges, 565750 markings/sec, 345 secs
lola: sara is running 350 secs || 221652461 markings, 553783208 edges, 581836 markings/sec, 350 secs
lola: sara is running 355 secs || 224584632 markings, 561116236 edges, 586434 markings/sec, 355 secs
lola: sara is running 360 secs || 227634229 markings, 568733960 edges, 609919 markings/sec, 360 secs
lola: sara is running 365 secs || 230426559 markings, 575716594 edges, 558466 markings/sec, 365 secs
lola: sara is running 370 secs || 233110097 markings, 582427806 edges, 536708 markings/sec, 370 secs
lola: sara is running 375 secs || 236056329 markings, 589792989 edges, 589246 markings/sec, 375 secs
lola: sara is running 380 secs || 239066934 markings, 597318185 edges, 602121 markings/sec, 380 secs
lola: sara is running 385 secs || 241768243 markings, 604073438 edges, 540262 markings/sec, 385 secs
lola: sara is running 390 secs || 243814418 markings, 609183781 edges, 409235 markings/sec, 390 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F ((p1 <= 1))) AND (A (F ((p7 <= p8))) OR ((3 <= p7) OR A (G (((p1 <= p2) OR (2 <= p6)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (3 <= p7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p7)
lola: processed formula length: 9
lola: 7 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: ========================================
lola: ...considering subproblem: E (F ((p1 <= 1)))
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 ((p1 <= 1)))
lola: processed formula length: 17
lola: 8 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: (p1 <= 1)
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-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 100000 markings, 99999 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes unknown no yes yes no unknown yes no yes yes
lola:
preliminary result: no yes unknown no yes yes no unknown yes no yes yes
lola: memory consumption: 3176 KB
lola: time consumption: 1014 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="ERK-PT-100000"
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 ERK-PT-100000, 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 r178-tajo-158987883100923"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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