Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r194-csrt-159033390400740.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is EGFr-PT-02010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033390400740
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 4.0K May 13 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 13 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 13 12:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K May 13 12:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 13 07:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 13 07:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:53 equiv_col
-rw-r--r-- 1 mcc users 6 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw-r--r-- 1 mcc users 59K May 12 20:53 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 EGFr-PT-02010-CTLFireability-00
FORMULA_NAME EGFr-PT-02010-CTLFireability-01
FORMULA_NAME EGFr-PT-02010-CTLFireability-02
FORMULA_NAME EGFr-PT-02010-CTLFireability-03
FORMULA_NAME EGFr-PT-02010-CTLFireability-04
FORMULA_NAME EGFr-PT-02010-CTLFireability-05
FORMULA_NAME EGFr-PT-02010-CTLFireability-06
FORMULA_NAME EGFr-PT-02010-CTLFireability-07
FORMULA_NAME EGFr-PT-02010-CTLFireability-08
FORMULA_NAME EGFr-PT-02010-CTLFireability-09
FORMULA_NAME EGFr-PT-02010-CTLFireability-10
FORMULA_NAME EGFr-PT-02010-CTLFireability-11
FORMULA_NAME EGFr-PT-02010-CTLFireability-12
FORMULA_NAME EGFr-PT-02010-CTLFireability-13
FORMULA_NAME EGFr-PT-02010-CTLFireability-14
FORMULA_NAME EGFr-PT-02010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591239619792

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 03:00:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 03:00:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 03:00:22] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2020-06-04 03:00:22] [INFO ] Transformed 40 places.
[2020-06-04 03:00:22] [INFO ] Transformed 68 transitions.
[2020-06-04 03:00:22] [INFO ] Found NUPN structural information;
[2020-06-04 03:00:22] [INFO ] Parsed PT model containing 40 places and 68 transitions in 110 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Incomplete random walk after 100000 steps, including 4475 resets, run finished after 368 ms. (steps per millisecond=271 ) properties seen :[0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1]
[2020-06-04 03:00:23] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
// Phase 1: matrix 39 rows 40 cols
[2020-06-04 03:00:23] [INFO ] Computed 20 place invariants in 4 ms
[2020-06-04 03:00:23] [INFO ] [Real]Absence check using 20 positive place invariants in 121 ms returned sat
[2020-06-04 03:00:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:23] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2020-06-04 03:00:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-04 03:00:23] [INFO ] [Real]Added 22 Read/Feed constraints in 14 ms returned sat
[2020-06-04 03:00:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:23] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2020-06-04 03:00:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:23] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-04 03:00:23] [INFO ] [Nat]Added 22 Read/Feed constraints in 14 ms returned sat
[2020-06-04 03:00:23] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 8 ms.
[2020-06-04 03:00:23] [INFO ] Added : 26 causal constraints over 6 iterations in 86 ms. Result :sat
[2020-06-04 03:00:24] [INFO ] [Real]Absence check using 20 positive place invariants in 120 ms returned sat
[2020-06-04 03:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:24] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-06-04 03:00:24] [INFO ] [Real]Added 22 Read/Feed constraints in 28 ms returned sat
[2020-06-04 03:00:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:24] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2020-06-04 03:00:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:24] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2020-06-04 03:00:24] [INFO ] [Nat]Added 22 Read/Feed constraints in 6 ms returned sat
[2020-06-04 03:00:24] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 4 ms.
[2020-06-04 03:00:24] [INFO ] Added : 27 causal constraints over 6 iterations in 158 ms. Result :sat
[2020-06-04 03:00:24] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2020-06-04 03:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:24] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-04 03:00:24] [INFO ] [Real]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-06-04 03:00:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:24] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2020-06-04 03:00:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:24] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2020-06-04 03:00:24] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-06-04 03:00:24] [INFO ] Deduced a trap composed of 2 places in 31 ms
[2020-06-04 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2020-06-04 03:00:24] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned unsat
[2020-06-04 03:00:24] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2020-06-04 03:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:24] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2020-06-04 03:00:24] [INFO ] [Real]Added 22 Read/Feed constraints in 9 ms returned sat
[2020-06-04 03:00:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:24] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2020-06-04 03:00:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:24] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2020-06-04 03:00:24] [INFO ] [Nat]Added 22 Read/Feed constraints in 4 ms returned sat
[2020-06-04 03:00:24] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 8 ms.
[2020-06-04 03:00:24] [INFO ] Added : 27 causal constraints over 6 iterations in 39 ms. Result :sat
[2020-06-04 03:00:24] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2020-06-04 03:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:25] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-06-04 03:00:25] [INFO ] [Real]Added 22 Read/Feed constraints in 2 ms returned sat
[2020-06-04 03:00:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 181 ms returned sat
[2020-06-04 03:00:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:25] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2020-06-04 03:00:25] [INFO ] [Nat]Added 22 Read/Feed constraints in 7 ms returned sat
[2020-06-04 03:00:25] [INFO ] Deduced a trap composed of 2 places in 54 ms
[2020-06-04 03:00:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2020-06-04 03:00:25] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 3 ms.
[2020-06-04 03:00:25] [INFO ] Added : 31 causal constraints over 7 iterations in 48 ms. Result :sat
[2020-06-04 03:00:25] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2020-06-04 03:00:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:25] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2020-06-04 03:00:25] [INFO ] [Real]Added 22 Read/Feed constraints in 4 ms returned unsat
[2020-06-04 03:00:25] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2020-06-04 03:00:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:25] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-06-04 03:00:25] [INFO ] [Real]Added 22 Read/Feed constraints in 4 ms returned sat
[2020-06-04 03:00:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2020-06-04 03:00:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:25] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2020-06-04 03:00:25] [INFO ] [Nat]Added 22 Read/Feed constraints in 4 ms returned sat
[2020-06-04 03:00:25] [INFO ] Deduced a trap composed of 2 places in 16 ms
[2020-06-04 03:00:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2020-06-04 03:00:25] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 6 ms.
[2020-06-04 03:00:25] [INFO ] Added : 28 causal constraints over 6 iterations in 61 ms. Result :sat
[2020-06-04 03:00:25] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned unsat
[2020-06-04 03:00:25] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2020-06-04 03:00:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:26] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2020-06-04 03:00:26] [INFO ] [Real]Added 22 Read/Feed constraints in 5 ms returned sat
[2020-06-04 03:00:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:26] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2020-06-04 03:00:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:26] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2020-06-04 03:00:26] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-06-04 03:00:26] [INFO ] Deduced a trap composed of 2 places in 12 ms
[2020-06-04 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2020-06-04 03:00:26] [INFO ] [Real]Absence check using 20 positive place invariants in 29 ms returned sat
[2020-06-04 03:00:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:26] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-06-04 03:00:26] [INFO ] [Real]Added 22 Read/Feed constraints in 26 ms returned sat
[2020-06-04 03:00:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:26] [INFO ] [Nat]Absence check using 20 positive place invariants in 22 ms returned sat
[2020-06-04 03:00:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:26] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2020-06-04 03:00:26] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-06-04 03:00:26] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 5 ms.
[2020-06-04 03:00:26] [INFO ] Added : 26 causal constraints over 6 iterations in 74 ms. Result :sat
[2020-06-04 03:00:26] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2020-06-04 03:00:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:26] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-04 03:00:26] [INFO ] [Real]Added 22 Read/Feed constraints in 2 ms returned sat
[2020-06-04 03:00:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:26] [INFO ] [Nat]Absence check using 20 positive place invariants in 25 ms returned sat
[2020-06-04 03:00:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:26] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2020-06-04 03:00:26] [INFO ] [Nat]Added 22 Read/Feed constraints in 5 ms returned sat
[2020-06-04 03:00:26] [INFO ] Deduced a trap composed of 2 places in 7 ms
[2020-06-04 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 11 ms
[2020-06-04 03:00:26] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned unsat
[2020-06-04 03:00:26] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned unsat
[2020-06-04 03:00:26] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2020-06-04 03:00:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:26] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-04 03:00:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:26] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2020-06-04 03:00:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:26] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2020-06-04 03:00:26] [INFO ] [Nat]Added 22 Read/Feed constraints in 4 ms returned sat
[2020-06-04 03:00:26] [INFO ] Deduced a trap composed of 2 places in 11 ms
[2020-06-04 03:00:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2020-06-04 03:00:26] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 3 ms.
[2020-06-04 03:00:26] [INFO ] Added : 29 causal constraints over 6 iterations in 55 ms. Result :sat
[2020-06-04 03:00:27] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2020-06-04 03:00:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:27] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-06-04 03:00:27] [INFO ] [Real]Added 22 Read/Feed constraints in 2 ms returned unsat
[2020-06-04 03:00:27] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2020-06-04 03:00:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:27] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-06-04 03:00:27] [INFO ] [Real]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-06-04 03:00:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:00:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2020-06-04 03:00:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:00:27] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2020-06-04 03:00:27] [INFO ] [Nat]Added 22 Read/Feed constraints in 2 ms returned sat
[2020-06-04 03:00:27] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 3 ms.
[2020-06-04 03:00:27] [INFO ] Added : 27 causal constraints over 6 iterations in 30 ms. Result :sat
Successfully simplified 9 atomic propositions for a total of 9 simplifications.
[2020-06-04 03:00:27] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-04 03:00:27] [INFO ] Flatten gal took : 59 ms
[2020-06-04 03:00:27] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-04 03:00:27] [INFO ] Flatten gal took : 10 ms
FORMULA EGFr-PT-02010-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 03:00:27] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2020-06-04 03:00:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ EGFr-PT-02010 @ 3570 seconds

FORMULA EGFr-PT-02010-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-02010-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for CTLFireability @ EGFr-PT-02010

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 03:00:27 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"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": 5,
"visible_transitions": 0
},
"processed": "((1 <= p0) AND (1 <= p2) AND (1 <= p4) AND (1 <= p32) AND (1 <= p36))",
"processed_size": 69,
"rewrites": 52
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p9 <= 0) OR (p26 <= 0))",
"processed_size": 26,
"rewrites": 52
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"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": "((1 <= p4) AND (1 <= p9) AND (1 <= p34) AND (1 <= p36))",
"processed_size": 55,
"rewrites": 55
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 21
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "eventual_occurrence",
"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": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AX(EF(((1 <= p23) AND (1 <= p24))))",
"processed_size": 35,
"rewrites": 54
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 26063,
"markings": 4080,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 4,
"aneg": 0,
"comp": 19,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 19,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "EF((EX((((1 <= p1) AND (1 <= p35)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p4) AND (1 <= p32) AND (1 <= p36)))) AND (((1 <= p13) AND (1 <= p14) AND (1 <= p19) AND (1 <= p24) AND ((p5 <= 0) OR (p35 <= 0))) OR ((1 <= p17) AND (1 <= p20) AND (((1 <= p3) AND (1 <= p10)) OR ((1 <= p9) AND (1 <= p32)))))))",
"processed_size": 303,
"rewrites": 54
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 26923,
"markings": 4200,
"produced_by": "CTL model checker",
"value": false
},
"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": 297
},
"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": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p14 <= 0) OR (p17 <= 0))",
"processed_size": 27,
"rewrites": 52
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"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": "EX(AF(((1 <= p1) AND (1 <= p32) AND (1 <= p19) AND (1 <= p30))))",
"processed_size": 64,
"rewrites": 54
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 25,
"markings": 24,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX(EF(EG(((1 <= p13) AND (1 <= p14)))))",
"processed_size": 39,
"rewrites": 55
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 31902,
"markings": 4199,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "AX((EG((((1 <= p15) AND (1 <= p30)) OR ((1 <= p0) AND (1 <= p26) AND (1 <= p30) AND (1 <= p33)))) OR EF(((1 <= p0) AND (1 <= p2) AND (1 <= p4) AND (1 <= p32) AND (1 <= p36)))))",
"processed_size": 177,
"rewrites": 55
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 26064,
"markings": 4080,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX(AF(((1 <= p15) AND (1 <= p30))))",
"processed_size": 35,
"rewrites": 54
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 25,
"markings": 24,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p17) AND (1 <= p30))",
"processed_size": 27,
"rewrites": 56
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "parallel",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"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": "((p0 <= 0) OR (p26 <= 0) OR (p30 <= 0) OR (p33 <= 0))",
"processed_size": 56,
"rewrites": 55
},
"result":
{
"edges": 21,
"markings": 22,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 30
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E(AF((((1 <= p13) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p26) AND (1 <= p30) AND (1 <= p33)))) U DEADLOCK)",
"processed_size": 108,
"rewrites": 54
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 8700,
"markings": 2034,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 2,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "EG((((((p9 <= 0) OR (p32 <= 0)) AND ((p0 <= 0) OR (p22 <= 0) OR (p27 <= 0) OR (p28 <= 0))) OR ((1 <= p0) AND (1 <= p15))) AND AF(((p0 <= 0) OR (p17 <= 0)))))",
"processed_size": 163,
"rewrites": 54
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 145,
"markings": 50,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 2,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "EG((((p23 <= 0) OR ((1 <= p14) AND (1 <= p19)) OR (p30 <= 0) OR (p1 <= 0) OR (p35 <= 0)) OR AF(((p5 <= 0) OR (p7 <= 0) OR (p38 <= 0)))))",
"processed_size": 142,
"rewrites": 54
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 21,
"markings": 22,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "E((((1 <= p0) AND (1 <= p2) AND (1 <= p4) AND (1 <= p32) AND (1 <= p36)) OR ((1 <= p9) AND (1 <= p26) AND (1 <= p12) AND (1 <= p25))) U AG(((1 <= p15) AND (1 <= p16) AND (1 <= p21))))",
"processed_size": 184,
"rewrites": 54
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 1480,
"markings": 471,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p23) AND (1 <= p29))))",
"processed_size": 35,
"rewrites": 53
},
"result":
{
"edges": 550,
"markings": 228,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"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": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "E (G (((p27 <= 0) OR (p32 <= 0))))",
"processed_size": 35,
"rewrites": 53
},
"result":
{
"edges": 21,
"markings": 22,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 14
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p14) AND (1 <= p19))))",
"processed_size": 35,
"rewrites": 53
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"child":
[

{
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p14) AND (1 <= p19))))",
"processed_size": 35,
"rewrites": 53
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"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"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"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": "A (G (((1 <= p2) AND (1 <= p11) AND (1 <= p34) AND (1 <= p36))))",
"processed_size": 64,
"rewrites": 54
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 56636,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(X(E(F(**)))) AND (A(F(*)) AND (** AND (** OR (A(X(**)) AND (** AND (** AND (** AND (** AND **))))))))) : (A(G(**)) OR E(F(**))) : E(F((E(X(**)) AND **))) : (E(G(*)) AND E(F(**))) : A(F(**)) : (E(X(A(F(**)))) AND **) : E((A(F(**)) U DEADLOCK)) : E(X(E(F(E(G(**)))))) : E((** U A(G(**)))) : E(F(A(G(*)))) : E(G((* AND A(F(*))))) : E(G((* OR A(F(*))))) : A(X((E(G(**)) OR E(F(**))))) : E(X(A(F(**))))"
},
"net":
{
"arcs": 338,
"conflict_clusters": 1,
"places": 40,
"places_significant": 20,
"singleton_clusters": 0,
"transitions": 68
},
"result":
{
"preliminary_value": "no no no yes no no no no no yes yes yes no no ",
"value": "no no no yes no no no no no yes yes yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 108/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 40
lola: finding significant places
lola: 40 places, 68 transitions, 20 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 CTLFireability.xml
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: (((A (X (E (F (((1 <= p23) AND (1 <= p24)))))) AND NOT(E (G (((1 <= p4) AND (1 <= p9) AND (1 <= p34) AND (1 <= p36)))))) AND ((p9 <= 0) OR (p26 <= 0))) AND (A (((1 <= 0) U ((1 <= p0) AND (1 <= p2) AND (1 <= p4) AND (1 <= p32) AND (1 <= p36)))) OR (((((A (X (((1 <= p17) AND (1 <= p30)))) AND ((1 <= p5))) AND ((1 <= p35))) AND ((1 <= p12))) AND ((1 <= p25))) AND ((p15 <= 0) OR (p30 <= 0))))) : (A (G (((1 <= p2) AND (1 <= p11) AND (1 <= p34) AND (1 <= p36)))) OR E (F (((1 <= p14) AND (1 <= p19))))) : E (F ((E (X ((((1 <= p1) AND (1 <= p35)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p4) AND (1 <= p32) AND (1 <= p36))))) AND (((1 <= p13) AND (1 <= p14) AND (1 <= p19) AND (1 <= p24) AND ((p5 <= 0) OR (p35 <= 0))) OR ((1 <= p17) AND (1 <= p20) AND (((1 <= p3) AND (1 <= p10)) OR ((1 <= p9) AND (1 <= p32)))))))) : (NOT(A (F (A (F (((1 <= p27) AND (1 <= p32))))))) AND E ((((1 <= p27) AND ((p1 <= 0) OR (p22 <= 0) OR (p28 <= 0)) AND (1 <= p32)) U E (F (((1 <= p23) AND (1 <= p29))))))) : (A (((1 <= 0) U A (F (((1 <= p0) AND (1 <= p26) AND (1 <= p30) AND (1 <= p33)))))) AND E (((1 <= 0) U (0 <= 0)))) : (E (X (A (F (((1 <= p1) AND (1 <= p32) AND (1 <= p19) AND (1 <= p30)))))) AND ((p14 <= 0) OR (p17 <= 0))) : E ((A (F ((((1 <= p13) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p26) AND (1 <= p30) AND (1 <= p33))))) U A (X ((1 <= 0))))) : E (F (E (X (E (G (((1 <= p13) AND (1 <= p14)))))))) : E (((((1 <= p0) AND (1 <= p2) AND (1 <= p4) AND (1 <= p32) AND (1 <= p36)) OR ((1 <= p9) AND (1 <= p26) AND (1 <= p12) AND (1 <= p25))) U A (G (((1 <= p15) AND (1 <= p16) AND (1 <= p21)))))) : NOT(A (G (E (F (((1 <= p17) AND (1 <= p30))))))) : NOT(A (F ((((((1 <= p9) AND (1 <= p32)) OR ((1 <= p0) AND (1 <= p22) AND (1 <= p27) AND (1 <= p28))) AND ((p0 <= 0) OR (p15 <= 0))) OR E (G (((1 <= p0) AND (1 <= p17)))))))) : NOT(A (F ((((1 <= p23) AND ((p14 <= 0) OR (p19 <= 0)) AND (1 <= p30) AND (1 <= p1) AND (1 <= p35)) AND E (G (((1 <= p5) AND (1 <= p7) AND (1 <= p38)))))))) : A (X ((E (G ((((1 <= p15) AND (1 <= p30)) OR ((1 <= p0) AND (1 <= p26) AND (1 <= p30) AND (1 <= p33))))) OR E (F (((1 <= p0) AND (1 <= p2) AND (1 <= p4) AND (1 <= p32) AND (1 <= p36))))))) : E (X (A (F (((1 <= p15) AND (1 <= p30))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (F (((1 <= p23) AND (1 <= p24)))))) AND (A (F (((p4 <= 0) OR (p9 <= 0) OR (p34 <= 0) OR (p36 <= 0)))) AND (((p9 <= 0) OR (p26 <= 0)) AND (((1 <= p0) AND (1 <= p2) AND (1 <= p4) AND (1 <= p32) AND (1 <= p36)) OR (A (X (((1 <= p17) AND (1 <= p30)))) AND (((1 <= p5)) AND (((1 <= p35)) AND (((1 <= p12)) AND (((1 <= p25)) AND ((p15 <= 0) OR (p30 <= 0)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p0) AND (1 <= p2) AND (1 <= p4) AND (1 <= p32) AND (1 <= p36))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p0) AND (1 <= p2) AND (1 <= p4) AND (1 <= p32) AND (1 <= p36))
lola: processed formula length: 69
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 5 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 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p9 <= 0) OR (p26 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p9 <= 0) OR (p26 <= 0))
lola: processed formula length: 26
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 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 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p4 <= 0) OR (p9 <= 0) OR (p34 <= 0) OR (p36 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p4) AND (1 <= p9) AND (1 <= p34) AND (1 <= p36))
lola: processed formula length: 55
lola: 55 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p4 <= 0) OR (p9 <= 0) OR (p34 <= 0) OR (p36 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((1 <= p23) AND (1 <= p24))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(((1 <= p23) AND (1 <= p24))))
lola: processed formula length: 35
lola: 54 rewrites
lola: closed formula file CTLFireability.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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 4080 markings, 26063 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (X ((((1 <= p1) AND (1 <= p35)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p4) AND (1 <= p32) AND (1 <= p36))))) AND (((1 <= p13) AND (1 <= p14) AND (1 <= p19) AND (1 <= p24) AND ((p5 <= 0) OR (p35 <= 0))) OR ((1 <= p17) AND (1 <= p20) AND (((1 <= p3) AND (1 <= p10)) OR ((1 <= p9) AND (1 <= p32))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((EX((((1 <= p1) AND (1 <= p35)) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p4) AND (1 <= p32) AND (1 <= p36)))) AND (((1 <= p13) AND (1 <= p14) AND (1 <= p19) AND (1 <= p24) AND ((p5 <= 0) OR (p35 <= 0))) OR ((1 <= p17) AND (1 <= p20) AND (((1 <= p3) AND (1 <= p10)) OR ((1 <= p9) AND (1 <= p32)))))))
lola: processed formula length: 303
lola: 54 rewrites
lola: closed formula file CTLFireability.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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 4200 markings, 26923 edges
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (A (F (((1 <= p1) AND (1 <= p32) AND (1 <= p19) AND (1 <= p30)))))) AND ((p14 <= 0) OR (p17 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p14 <= 0) OR (p17 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p14 <= 0) OR (p17 <= 0))
lola: processed formula length: 27
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (((1 <= p1) AND (1 <= p32) AND (1 <= p19) AND (1 <= p30))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AF(((1 <= p1) AND (1 <= p32) AND (1 <= p19) AND (1 <= p30))))
lola: processed formula length: 64
lola: 54 rewrites
lola: closed formula file CTLFireability.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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 24 markings, 25 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (E (G (((1 <= p13) AND (1 <= p14))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(EF(EG(((1 <= p13) AND (1 <= p14)))))
lola: processed formula length: 39
lola: 55 rewrites
lola: closed formula file CTLFireability.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: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 4199 markings, 31902 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((E (G ((((1 <= p15) AND (1 <= p30)) OR ((1 <= p0) AND (1 <= p26) AND (1 <= p30) AND (1 <= p33))))) OR E (F (((1 <= p0) AND (1 <= p2) AND (1 <= p4) AND (1 <= p32) AND (1 <= p36)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((EG((((1 <= p15) AND (1 <= p30)) OR ((1 <= p0) AND (1 <= p26) AND (1 <= p30) AND (1 <= p33)))) OR EF(((1 <= p0) AND (1 <= p2) AND (1 <= p4) AND (1 <= p32) AND (1 <= p36)))))
lola: processed formula length: 177
lola: 55 rewrites
lola: closed formula file CTLFireability.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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 4080 markings, 26064 edges
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (((1 <= p15) AND (1 <= p30))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AF(((1 <= p15) AND (1 <= p30))))
lola: processed formula length: 35
lola: 54 rewrites
lola: closed formula file CTLFireability.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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 24 markings, 25 edges
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p17 <= 0) OR (p30 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: lola: ========================================checking possible invariance

lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: ========================================
lola: processed formula: ((1 <= p17) AND (1 <= p30))
lola: processed formula length: 27
lola: 56 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p17 <= 0) OR (p30 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: SUBRESULT
lola: result: yes
lola: produced by: parallel
lola: The predicate is possibly invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p0) AND (1 <= p26) AND (1 <= p30) AND (1 <= p33))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p0 <= 0) OR (p26 <= 0) OR (p30 <= 0) OR (p33 <= 0))
lola: processed formula length: 56
lola: 55 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p0) AND (1 <= p26) AND (1 <= p30) AND (1 <= p33))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: The predicate does not eventually occur.
lola: 22 markings, 21 edges
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((((1 <= p13) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p26) AND (1 <= p30) AND (1 <= p33))))) U DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AF((((1 <= p13) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p26) AND (1 <= p30) AND (1 <= p33)))) U DEADLOCK)
lola: processed formula length: 108
lola: 54 rewrites
lola: closed formula file CTLFireability.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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2034 markings, 8700 edges
lola: ========================================
lola: subprocess 9 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((((p9 <= 0) OR (p32 <= 0)) AND ((p0 <= 0) OR (p22 <= 0) OR (p27 <= 0) OR (p28 <= 0))) OR ((1 <= p0) AND (1 <= p15))) AND A (F (((p0 <= 0) OR (p17 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((((((p9 <= 0) OR (p32 <= 0)) AND ((p0 <= 0) OR (p22 <= 0) OR (p27 <= 0) OR (p28 <= 0))) OR ((1 <= p0) AND (1 <= p15))) AND AF(((p0 <= 0) OR (p17 <= 0)))))
lola: processed formula length: 163
lola: 54 rewrites
lola: closed formula file CTLFireability.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: 50 markings, 145 edges
lola: ========================================
lola: subprocess 10 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p23 <= 0) OR ((1 <= p14) AND (1 <= p19)) OR (p30 <= 0) OR (p1 <= 0) OR (p35 <= 0)) OR A (F (((p5 <= 0) OR (p7 <= 0) OR (p38 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((((p23 <= 0) OR ((1 <= p14) AND (1 <= p19)) OR (p30 <= 0) OR (p1 <= 0) OR (p35 <= 0)) OR AF(((p5 <= 0) OR (p7 <= 0) OR (p38 <= 0)))))
lola: processed formula length: 142
lola: 54 rewrites
lola: closed formula file CTLFireability.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: 22 markings, 21 edges
lola: ========================================
lola: subprocess 11 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((1 <= p0) AND (1 <= p2) AND (1 <= p4) AND (1 <= p32) AND (1 <= p36)) OR ((1 <= p9) AND (1 <= p26) AND (1 <= p12) AND (1 <= p25))) U A (G (((1 <= p15) AND (1 <= p16) AND (1 <= p21))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((((1 <= p0) AND (1 <= p2) AND (1 <= p4) AND (1 <= p32) AND (1 <= p36)) OR ((1 <= p9) AND (1 <= p26) AND (1 <= p12) AND (1 <= p25))) U AG(((1 <= p15) AND (1 <= p16) AND (1 <= p21))))
lola: processed formula length: 184
lola: 54 rewrites
lola: closed formula file CTLFireability.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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 471 markings, 1480 edges
lola: ========================================
lola: subprocess 12 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((p27 <= 0) OR (p32 <= 0)))) AND E (F (((1 <= p23) AND (1 <= p29)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p23) AND (1 <= p29))))
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 (((1 <= p23) AND (1 <= p29))))
lola: processed formula length: 35
lola: 53 rewrites
lola: closed formula file CTLFireability.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: ((1 <= p23) AND (1 <= p29))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 228 markings, 550 edges
lola: ========================================
lola: subprocess 13 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p27 <= 0) OR (p32 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p27 <= 0) OR (p32 <= 0))))
lola: processed formula length: 35
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p27) AND (1 <= p32))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 22 markings, 21 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((1 <= p2) AND (1 <= p11) AND (1 <= p34) AND (1 <= p36)))) OR E (F (((1 <= p14) AND (1 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p14) AND (1 <= p19))))
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 (((1 <= p14) AND (1 <= p19))))
lola: processed formula length: 35
lola: 53 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 8 markings, 7 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p14) AND (1 <= p19))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
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 (((1 <= p2) AND (1 <= p11) AND (1 <= p34) AND (1 <= p36)))) OR E (F (((1 <= p14) AND (1 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p14) AND (1 <= p19))))
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 (((1 <= p14) AND (1 <= p19))))
lola: processed formula length: 35
lola: 53 rewrites
lola: closed formula file CTLFireability.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: ((1 <= p14) AND (1 <= p19))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 8 markings, 7 edges
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p2) AND (1 <= p11) AND (1 <= p34) AND (1 <= p36))))
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 (((1 <= p2) AND (1 <= p11) AND (1 <= p34) AND (1 <= p36))))
lola: processed formula length: 64
lola: 54 rewrites
lola: closed formula file CTLFireability.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: ((p2 <= 0) OR (p11 <= 0) OR (p34 <= 0) OR (p36 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no no no no yes yes yes no no
lola:
preliminary result: no no no yes no no no no no yes yes yes no no
lola: memory consumption: 56636 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.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="EGFr-PT-02010"
export BK_EXAMINATION="CTLFireability"
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 EGFr-PT-02010, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-csrt-159033390400740"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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