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.r180-ebro-158987899600028.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 CloudReconfiguration-PT-304, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987899600028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 3.6K Mar 30 01:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 30 01:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 28 16:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 08:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 27 08:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 26 08:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.5K Mar 26 08:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 660K 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 CloudReconfiguration-PT-304-CTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-304-CTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-304-CTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-304-CTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-304-CTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-304-CTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-304-CTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-304-CTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-304-CTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-304-CTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-304-CTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-304-CTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-304-CTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-304-CTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-304-CTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-304-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591130487665

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:41:31] [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-02 20:41:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:41:32] [INFO ] Load time of PNML (sax parser for PT used): 580 ms
[2020-06-02 20:41:32] [INFO ] Transformed 2584 places.
[2020-06-02 20:41:32] [INFO ] Transformed 3094 transitions.
[2020-06-02 20:41:32] [INFO ] Found NUPN structural information;
[2020-06-02 20:41:32] [INFO ] Parsed PT model containing 2584 places and 3094 transitions in 766 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 292 ms.
Incomplete random walk after 100000 steps, including 791 resets, run finished after 733 ms. (steps per millisecond=136 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 3094 rows 2584 cols
[2020-06-02 20:41:33] [INFO ] Computed 4 place invariants in 150 ms
[2020-06-02 20:41:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 139 ms returned sat
[2020-06-02 20:41:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:41:53] [INFO ] [Real]Absence check using state equation in 19238 ms returned (error "Solver has unexpectedly terminated")
[2020-06-02 20:41:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-02 20:41:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:42:13] [INFO ] [Real]Absence check using state equation in 19311 ms returned (error "Solver has unexpectedly terminated")
[2020-06-02 20:42:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-06-02 20:42:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:42:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:42:33] [INFO ] [Real]Absence check using state equation in 19407 ms returned unknown
[2020-06-02 20:42:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-06-02 20:42:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:42:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:42:53] [INFO ] [Real]Absence check using state equation in 19450 ms returned (error "Failed to check-sat")
[2020-06-02 20:42:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-02 20:42:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:43:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:43:13] [INFO ] [Real]Absence check using state equation in 19429 ms returned (error "Failed to check-sat")
[2020-06-02 20:43:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 142 ms returned sat
[2020-06-02 20:43:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:43:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:43:33] [INFO ] [Real]Absence check using state equation in 19358 ms returned (error "Failed to check-sat")
[2020-06-02 20:43:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 117 ms returned sat
[2020-06-02 20:43:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:43:38] [INFO ] [Real]Absence check using state equation in 4445 ms returned unsat
[2020-06-02 20:43:39] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-06-02 20:43:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:43:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:43:58] [INFO ] [Real]Absence check using state equation in 19413 ms returned (error "Failed to check-sat")
[2020-06-02 20:43:59] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-06-02 20:43:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:44:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:44:18] [INFO ] [Real]Absence check using state equation in 19442 ms returned (error "Failed to check-sat")
[2020-06-02 20:44:19] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 141 ms returned sat
[2020-06-02 20:44:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:44:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:44:38] [INFO ] [Real]Absence check using state equation in 19364 ms returned unknown
[2020-06-02 20:44:39] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-02 20:44:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:44:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:44:58] [INFO ] [Real]Absence check using state equation in 19559 ms returned (error "Failed to check-sat")
[2020-06-02 20:44:59] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2020-06-02 20:44:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:45:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:45:18] [INFO ] [Real]Absence check using state equation in 19450 ms returned (error "Failed to check-sat")
[2020-06-02 20:45:19] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2020-06-02 20:45:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:45:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:45:38] [INFO ] [Real]Absence check using state equation in 19479 ms returned (error "Failed to check-sat")
[2020-06-02 20:45:39] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-06-02 20:45:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:45:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:45:58] [INFO ] [Real]Absence check using state equation in 19444 ms returned (error "Failed to check-sat")
[2020-06-02 20:45:59] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-02 20:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:46:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:46:18] [INFO ] [Real]Absence check using state equation in 19427 ms returned unknown
[2020-06-02 20:46:19] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 111 ms returned sat
[2020-06-02 20:46:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:46:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:46:38] [INFO ] [Real]Absence check using state equation in 19422 ms returned (error "Failed to check-sat")
[2020-06-02 20:46:39] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-06-02 20:46:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:46:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:46:58] [INFO ] [Real]Absence check using state equation in 19409 ms returned (error "Failed to check-sat")
[2020-06-02 20:46:59] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-06-02 20:46:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:47:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:47:18] [INFO ] [Real]Absence check using state equation in 19459 ms returned (error "Failed to check-sat")
[2020-06-02 20:47:19] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-02 20:47:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:47:23] [INFO ] [Real]Absence check using state equation in 4224 ms returned unsat
[2020-06-02 20:47:24] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-06-02 20:47:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:47:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:47:43] [INFO ] [Real]Absence check using state equation in 19431 ms returned unknown
[2020-06-02 20:47:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-06-02 20:47:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:48:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:48:03] [INFO ] [Real]Absence check using state equation in 19430 ms returned (error "Failed to check-sat")
[2020-06-02 20:48:04] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-02 20:48:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:48:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:48:23] [INFO ] [Real]Absence check using state equation in 19462 ms returned (error "Failed to check-sat")
[2020-06-02 20:48:24] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-06-02 20:48:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:48:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:48:43] [INFO ] [Real]Absence check using state equation in 19422 ms returned (error "Failed to check-sat")
[2020-06-02 20:48:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 147 ms returned sat
[2020-06-02 20:48:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:49:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:49:03] [INFO ] [Real]Absence check using state equation in 19380 ms returned unknown
[2020-06-02 20:49:04] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 150 ms returned sat
[2020-06-02 20:49:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:49:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:49:23] [INFO ] [Real]Absence check using state equation in 19406 ms returned unknown
[2020-06-02 20:49:24] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-02 20:49:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:49:28] [INFO ] [Real]Absence check using state equation in 4178 ms returned unsat
[2020-06-02 20:49:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-02 20:49:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:49:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= s2049 (- t595 t596))") while checking expression at index 26
[2020-06-02 20:49:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-02 20:49:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:50:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:50:08] [INFO ] [Real]Absence check using state equation in 19354 ms returned (error "Failed to check-sat")
[2020-06-02 20:50:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 118 ms returned sat
[2020-06-02 20:50:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:50:13] [INFO ] [Real]Absence check using state equation in 4428 ms returned unsat
[2020-06-02 20:50:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-02 20:50:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:50:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:50:33] [INFO ] [Real]Absence check using state equation in 19408 ms returned unknown
[2020-06-02 20:50:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-02 20:50:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:50:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:50:53] [INFO ] [Real]Absence check using state equation in 19418 ms returned (error "Failed to check-sat")
[2020-06-02 20:50:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2020-06-02 20:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:51:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:51:13] [INFO ] [Real]Absence check using state equation in 19423 ms returned (error "Failed to check-sat")
[2020-06-02 20:51:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 150 ms returned sat
[2020-06-02 20:51:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:51:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:51:33] [INFO ] [Real]Absence check using state equation in 19405 ms returned (error "Failed to check-sat")
[2020-06-02 20:51:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 148 ms returned sat
[2020-06-02 20:51:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:51:53] [INFO ] [Real]Absence check using state equation in 19368 ms returned (error "Solver has unexpectedly terminated")
[2020-06-02 20:51:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-06-02 20:51:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:52:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:52:13] [INFO ] [Real]Absence check using state equation in 19420 ms returned (error "Failed to check-sat")
[2020-06-02 20:52:16] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 139 ms returned sat
[2020-06-02 20:52:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:52:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:52:33] [INFO ] [Real]Absence check using state equation in 17508 ms returned unknown
[2020-06-02 20:52:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-02 20:52:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:52:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:52:53] [INFO ] [Real]Absence check using state equation in 19414 ms returned unknown
[2020-06-02 20:52:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 129 ms returned sat
[2020-06-02 20:52:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:53:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:53:13] [INFO ] [Real]Absence check using state equation in 19432 ms returned unknown
[2020-06-02 20:53:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-02 20:53:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:53:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:53:33] [INFO ] [Real]Absence check using state equation in 19493 ms returned unknown
[2020-06-02 20:53:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-06-02 20:53:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:53:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:53:53] [INFO ] [Real]Absence check using state equation in 19392 ms returned (error "Failed to check-sat")
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2020-06-02 20:53:54] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-02 20:53:54] [INFO ] Flatten gal took : 474 ms
[2020-06-02 20:53:55] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-02 20:53:55] [INFO ] Flatten gal took : 223 ms
FORMULA CloudReconfiguration-PT-304-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 20:53:55] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 11 ms.
[2020-06-02 20:53:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 50 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ CloudReconfiguration-PT-304 @ 3570 seconds

FORMULA CloudReconfiguration-PT-304-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-304-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-304-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-304-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-304-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-304-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-304-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-304-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-304-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-304-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-304-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-304-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-304-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-304-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3078
rslt: Output for CTLFireability @ CloudReconfiguration-PT-304

{
"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": "Tue Jun 2 20:53:55 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 246
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "NOT DEADLOCK",
"processed_size": 12,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 265
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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 <= p1386))",
"processed_size": 14,
"rewrites": 35
},
"result":
{
"edges": 3827763,
"markings": 1022143,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 278
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AG((A(((1 <= p900)) U ((1 <= p1160))) OR EX(((p1721 <= 0)))))",
"processed_size": 61,
"rewrites": 35
},
"net":
{
"conflict_clusters": 2448,
"singleton_clusters": 0
},
"result":
{
"edges": 256,
"markings": 126,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 303
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p2442 <= 0))",
"processed_size": 14,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 417
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p235 <= 0))",
"processed_size": 13,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 334
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A(AX(((p1276 <= 0))) U ((1 <= p2003)))",
"processed_size": 38,
"rewrites": 34
},
"net":
{
"conflict_clusters": 2448,
"singleton_clusters": 0
},
"result":
{
"edges": 65,
"markings": 65,
"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": 371
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AX(EG(((p623 <= 0))))",
"processed_size": 21,
"rewrites": 34
},
"net":
{
"conflict_clusters": 2448,
"singleton_clusters": 0
},
"result":
{
"edges": 64,
"markings": 64,
"produced_by": "CTL model checker",
"value": true
},
"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": 417
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 477
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "EX(AG(((p572 <= 0) OR (p1647 <= 0))))",
"processed_size": 38,
"rewrites": 34
},
"net":
{
"conflict_clusters": 2448,
"singleton_clusters": 0
},
"result":
{
"edges": 4706985,
"markings": 1337229,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"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": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 457
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A(AX(((1 <= p1778) AND (1 <= p114))) U ((((p749 <= 0)) AND ((p2438 <= 0))) AND EF(((1 <= p1064)))))",
"processed_size": 99,
"rewrites": 35
},
"net":
{
"conflict_clusters": 2448,
"singleton_clusters": 0
},
"result":
{
"edges": 4078297,
"markings": 1116676,
"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": 513
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 513
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p874 <= 0))",
"processed_size": 13,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 615
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (((p2120 <= 0))))",
"processed_size": 22,
"rewrites": 34
},
"result":
{
"edges": 79,
"markings": 80,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 769
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 2,
"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(E(((1 <= p1610)) U ((1 <= p2224))))",
"processed_size": 38,
"rewrites": 34
},
"net":
{
"conflict_clusters": 2448,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 10,
"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": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 615
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (((p1391 <= 0))))",
"processed_size": 22,
"rewrites": 34
},
"result":
{
"edges": 58,
"markings": 59,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 769
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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 (((1 <= p1329))))",
"processed_size": 22,
"rewrites": 33
},
"result":
{
"edges": 95,
"markings": 96,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"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": 1026
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"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": "A (G (((p2566 <= 0) OR (((p858 <= 0)) AND ((p289 <= 0))) OR ((1 <= p442) AND (1 <= p596)))))",
"processed_size": 94,
"rewrites": 34
},
"result":
{
"edges": 65,
"markings": 66,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1539
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p1291 <= 0))",
"processed_size": 14,
"rewrites": 35
},
"result":
{
"edges": 72,
"markings": 72,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3078
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AF((((1 <= p1313)) OR (AG(((1 <= p1612))) OR ((1 <= p671)))))",
"processed_size": 61,
"rewrites": 34
},
"net":
{
"conflict_clusters": 2448,
"singleton_clusters": 0
},
"result":
{
"edges": 130,
"markings": 65,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"error": null,
"memory": 102744,
"runtime": 492.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F((** OR (A(G(**)) OR **)))) : E(F(**)) : A(G(*)) : A(F(**)) : ((A(G(**)) OR (** OR **)) AND ((** OR E(X(**))) AND ((A(X(**)) OR (E(F(**)) AND E(F(**)))) AND (A(G(**)) OR (** OR (** OR (E(X(*)) OR **))))))) : (E(G(E(F(**)))) OR (E(X(A(G(**)))) OR (E(F(**)) AND E(X(**))))) : A(G((A((** U **)) OR E(X(**))))) : NODEADLOCK : A((A(X(**)) U **)) : A(X(E(G(*)))) : A(G(**)) : (A(G((A(F(**)) OR (** OR **)))) OR E(X(A(G(*))))) : A((A(X(**)) U (** AND E(F(**))))) : (A(X(E((** U **)))) OR (** AND A(G(*))))"
},
"net":
{
"arcs": 6459,
"conflict_clusters": 2448,
"places": 2584,
"places_significant": 2580,
"singleton_clusters": 0,
"transitions": 3094
},
"result":
{
"preliminary_value": "no yes no no yes yes no yes no yes no no yes no ",
"value": "no yes no no yes yes no yes no yes no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 5678/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2584
lola: finding significant places
lola: 2584 places, 3094 transitions, 2580 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: (p1313 <= 1)
lola: LP says that atomic proposition is always true: (p1612 <= 1)
lola: LP says that atomic proposition is always true: (p671 <= 1)
lola: LP says that atomic proposition is always true: (p457 <= 1)
lola: LP says that atomic proposition is always true: (p1329 <= 1)
lola: LP says that atomic proposition is always true: (p1391 <= 1)
lola: LP says that atomic proposition is always true: (p1291 <= 1)
lola: LP says that atomic proposition is always true: (p440 <= 1)
lola: LP says that atomic proposition is always true: (p1694 <= 1)
lola: LP says that atomic proposition is always true: (p1776 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p987 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p1909 <= 1)
lola: LP says that atomic proposition is always true: (p2183 <= 1)
lola: LP says that atomic proposition is always true: (p1698 <= 1)
lola: LP says that atomic proposition is always true: (p383 <= 1)
lola: LP says that atomic proposition is always true: (p2442 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p1386 <= 1)
lola: LP says that atomic proposition is always true: (p954 <= 1)
lola: LP says that atomic proposition is always true: (p1419 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p641 <= 1)
lola: LP says that atomic proposition is always true: (p900 <= 1)
lola: LP says that atomic proposition is always true: (p1160 <= 1)
lola: LP says that atomic proposition is always true: (p1721 <= 1)
lola: LP says that atomic proposition is always true: (p1276 <= 1)
lola: LP says that atomic proposition is always true: (p2003 <= 1)
lola: LP says that atomic proposition is always true: (p623 <= 1)
lola: LP says that atomic proposition is always true: (p2566 <= 1)
lola: LP says that atomic proposition is always true: (p858 <= 1)
lola: LP says that atomic proposition is always true: (p289 <= 1)
lola: LP says that atomic proposition is always true: (p442 <= 1)
lola: LP says that atomic proposition is always true: (p596 <= 1)
lola: LP says that atomic proposition is always true: (p1229 <= 1)
lola: LP says that atomic proposition is always true: (p290 <= 1)
lola: LP says that atomic proposition is always true: (p408 <= 1)
lola: LP says that atomic proposition is always true: (p572 <= 1)
lola: LP says that atomic proposition is always true: (p1647 <= 1)
lola: LP says that atomic proposition is always true: (p1778 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p749 <= 1)
lola: LP says that atomic proposition is always true: (p2438 <= 1)
lola: LP says that atomic proposition is always true: (p1064 <= 1)
lola: LP says that atomic proposition is always true: (p1610 <= 1)
lola: LP says that atomic proposition is always true: (p2224 <= 1)
lola: LP says that atomic proposition is always true: (p874 <= 1)
lola: LP says that atomic proposition is always true: (p2120 <= 1)
lola: A (F (((((1 <= p1313)) OR A (G (((1 <= p1612))))) OR ((1 <= p671))))) : A ((((p457 <= 0)) U E (F (((1 <= p1329)))))) : NOT(E (F (A (F (((1 <= p1391))))))) : A (F (((1 <= p1291)))) : (((((A (G (((1 <= p440)))) OR ((p1694 <= 0))) OR ((p1776 <= 0))) AND (((p235 <= 0)) OR E (X (((1 <= p987)))))) AND (A (X (((1 <= p140)))) OR (E (F (((1 <= p1909)))) AND E (F (((1 <= p2183))))))) AND ((((A (G (((1 <= p1698)))) OR ((p383 <= 0))) OR ((p2442 <= 0))) OR NOT(A (X (((1 <= p51)))))) OR ((1 <= p55)))) : ((E (G (E (F (((1 <= p1386)))))) OR E (X (A (G (((p954 <= 0))))))) OR (E (F (((1 <= p1419) AND (1 <= p221)))) AND E (X (((p641 <= 0)))))) : A (G ((A ((((1 <= p900)) U ((1 <= p1160)))) OR E (X (((p1721 <= 0))))))) : E (X ((0 <= 0))) : A ((A (X (((p1276 <= 0)))) U ((1 <= p2003)))) : A (X (NOT(A (F (((1 <= p623))))))) : A (G (((p2566 <= 0) OR (((p858 <= 0)) AND ((p289 <= 0))) OR ((1 <= p442) AND (1 <= p596))))) : (A (G (((A (F (((1 <= p1229)))) OR ((1 <= p290))) OR ((1 <= p408))))) OR E (X (NOT(E (F (((1 <= p572) AND (1 <= p1647)))))))) : A ((A (X (((1 <= p1778) AND (1 <= p114)))) U ((((p749 <= 0)) AND ((p2438 <= 0))) AND E (F (((1 <= p1064))))))) : (A (X (E ((((1 <= p1610)) U ((1 <= p2224)))))) OR (((p874 <= 0)) AND NOT(E (F (((1 <= p2120)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:452
lola: rewrite Frontend/Parser/formula_rewrite.k:455
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
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:254
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 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 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F (((1 <= p1386)))))) OR (E (X (A (G (((p954 <= 0)))))) OR (E (F (((1 <= p1419) AND (1 <= p221)))) AND E (X (((p641 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((1 <= p1386))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: ((1 <= p1386))
lola: processed formula length: 14
lola: 35 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 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: ((1 <= p1386))
lola: state equation task get result unparse finished id 1
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: ((p1386 <= 0))
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 CTLFireability-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-1.sara.
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-0.sara.
sara: error: :11995: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
sara: error: :11995: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || sara is running 0 secs || 54853 markings, 175538 edges, 10971 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 112838 markings, 350157 edges, 11597 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 164579 markings, 528404 edges, 10348 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 215741 markings, 704178 edges, 10232 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 272022 markings, 878928 edges, 11256 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 326792 markings, 1054627 edges, 10954 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 384748 markings, 1229262 edges, 11591 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 438094 markings, 1405504 edges, 10669 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 485723 markings, 1581804 edges, 9526 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 533799 markings, 1758405 edges, 9615 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 573602 markings, 1934828 edges, 7961 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 621274 markings, 2111360 edges, 9534 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 659290 markings, 2291158 edges, 7603 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 699145 markings, 2469287 edges, 7971 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 744604 markings, 2646025 edges, 9092 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 784340 markings, 2821226 edges, 7947 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 827525 markings, 2997016 edges, 8637 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 867926 markings, 3174348 edges, 8080 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 914483 markings, 3352213 edges, 9311 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 954714 markings, 3529930 edges, 8046 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 991289 markings, 3709055 edges, 7315 markings/sec, 100 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 1022143 markings, 3827763 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A ((((1 <= p900)) U ((1 <= p1160)))) OR E (X (((p1721 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((A(((1 <= p900)) U ((1 <= p1160))) OR EX(((p1721 <= 0)))))
lola: processed formula length: 61
lola: 35 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: 126 markings, 256 edges
lola: ========================================
lola: subprocess 3 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G (((1 <= p440)))) OR (((p1694 <= 0)) OR ((p1776 <= 0)))) AND ((((p235 <= 0)) OR E (X (((1 <= p987))))) AND ((A (X (((1 <= p140)))) OR (E (F (((1 <= p1909)))) AND E (F (((1 <= p2183)))))) AND (A (G (((1 <= p1698)))) OR (((p383 <= 0)) OR (((p2442 <= 0)) OR (E (X (((p51 <= 0)))) OR ((1 <= p55)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p2442 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p2442 <= 0))
lola: processed formula length: 14
lola: 32 rewrites
lola: closed formula file CTLFireability.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 4 will run for 334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p2183))))
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 <= p2183))))
lola: processed formula length: 22
lola: 33 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 <= p2183))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 63 markings, 62 edges
lola: ========================================
lola: subprocess 5 will run for 371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p1909))))
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 <= p1909))))
lola: processed formula length: 22
lola: 33 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 <= p1909))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 6 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p235 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p235 <= 0))
lola: processed formula length: 13
lola: 32 rewrites
lola: closed formula file CTLFireability.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 7 will run for 477 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p1694 <= 0)) OR ((p1776 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (((p1694 <= 0)) OR ((p1776 <= 0)))
lola: processed formula length: 34
lola: 33 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (X (((p1276 <= 0)))) U ((1 <= p2003))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(AX(((p1276 <= 0))) U ((1 <= p2003)))
lola: processed formula length: 38
lola: 34 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: 65 markings, 65 edges
lola: ========================================
lola: subprocess 5 will run for 371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (((p623 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EG(((p623 <= 0))))
lola: processed formula length: 21
lola: 34 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 64 markings, 64 edges
lola: ========================================
lola: subprocess 6 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((A (F (((1 <= p1229)))) OR (((1 <= p290)) OR ((1 <= p408)))))) OR E (X (A (G (((p572 <= 0) OR (p1647 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F (((1 <= p1229)))) OR (((1 <= p290)) OR ((1 <= p408))))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((1 <= p1229))) OR (((1 <= p290)) OR ((1 <= p408)))))
lola: processed formula length: 60
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 115 markings, 115 edges
lola: ========================================
lola: subprocess 7 will run for 477 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (((p572 <= 0) OR (p1647 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG(((p572 <= 0) OR (p1647 <= 0))))
lola: processed formula length: 38
lola: 34 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: 54375 markings, 173824 edges, 10875 markings/sec, 0 secs
lola: 112414 markings, 349158 edges, 11608 markings/sec, 5 secs
lola: 164008 markings, 526206 edges, 10319 markings/sec, 10 secs
lola: 214975 markings, 701611 edges, 10193 markings/sec, 15 secs
lola: 270335 markings, 873851 edges, 11072 markings/sec, 20 secs
lola: 324252 markings, 1045605 edges, 10783 markings/sec, 25 secs
lola: 380276 markings, 1217156 edges, 11205 markings/sec, 30 secs
lola: 433611 markings, 1389915 edges, 10667 markings/sec, 35 secs
lola: 480197 markings, 1563673 edges, 9317 markings/sec, 40 secs
lola: 528623 markings, 1737257 edges, 9685 markings/sec, 45 secs
lola: 570272 markings, 1913602 edges, 8330 markings/sec, 50 secs
lola: 614627 markings, 2090908 edges, 8871 markings/sec, 55 secs
lola: 654381 markings, 2268301 edges, 7951 markings/sec, 60 secs
lola: 694616 markings, 2446198 edges, 8047 markings/sec, 65 secs
lola: 737503 markings, 2621320 edges, 8577 markings/sec, 70 secs
lola: 778567 markings, 2797322 edges, 8213 markings/sec, 75 secs
lola: 822107 markings, 2972871 edges, 8708 markings/sec, 80 secs
lola: 860061 markings, 3148435 edges, 7591 markings/sec, 85 secs
lola: 908194 markings, 3323982 edges, 9627 markings/sec, 90 secs
lola: 947939 markings, 3499808 edges, 7949 markings/sec, 95 secs
lola: 983290 markings, 3676191 edges, 7070 markings/sec, 100 secs
lola: 1032562 markings, 3848876 edges, 9854 markings/sec, 105 secs
lola: 1085614 markings, 4005218 edges, 10610 markings/sec, 110 secs
lola: 1146030 markings, 4163864 edges, 12083 markings/sec, 115 secs
lola: 1200636 markings, 4321022 edges, 10921 markings/sec, 120 secs
lola: 1254541 markings, 4475796 edges, 10781 markings/sec, 125 secs
lola: 1303095 markings, 4626084 edges, 9711 markings/sec, 130 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1337229 markings, 4706985 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 457 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (X (((1 <= p1778) AND (1 <= p114)))) U ((((p749 <= 0)) AND ((p2438 <= 0))) AND E (F (((1 <= p1064)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(AX(((1 <= p1778) AND (1 <= p114))) U ((((p749 <= 0)) AND ((p2438 <= 0))) AND EF(((1 <= p1064)))))
lola: processed formula length: 99
lola: 35 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: 52147 markings, 167007 edges, 10429 markings/sec, 0 secs
lola: 106164 markings, 332717 edges, 10803 markings/sec, 5 secs
lola: 155149 markings, 499905 edges, 9797 markings/sec, 10 secs
lola: 203355 markings, 665300 edges, 9641 markings/sec, 15 secs
lola: 255825 markings, 831398 edges, 10494 markings/sec, 20 secs
lola: 310035 markings, 998208 edges, 10842 markings/sec, 25 secs
lola: 360260 markings, 1164498 edges, 10045 markings/sec, 30 secs
lola: 419645 markings, 1330424 edges, 11877 markings/sec, 35 secs
lola: 463762 markings, 1498594 edges, 8823 markings/sec, 40 secs
lola: 511178 markings, 1662376 edges, 9483 markings/sec, 45 secs
lola: 550600 markings, 1828962 edges, 7884 markings/sec, 50 secs
lola: 589683 markings, 1996137 edges, 7817 markings/sec, 55 secs
lola: 629620 markings, 2164360 edges, 7987 markings/sec, 60 secs
lola: 670177 markings, 2332322 edges, 8111 markings/sec, 65 secs
lola: 706104 markings, 2498878 edges, 7185 markings/sec, 70 secs
lola: 749655 markings, 2663723 edges, 8710 markings/sec, 75 secs
lola: 787054 markings, 2831782 edges, 7480 markings/sec, 80 secs
lola: 828215 markings, 2999586 edges, 8232 markings/sec, 85 secs
lola: 865796 markings, 3168017 edges, 7516 markings/sec, 90 secs
lola: 910845 markings, 3335375 edges, 9010 markings/sec, 95 secs
lola: 948888 markings, 3503448 edges, 7609 markings/sec, 100 secs
lola: 982847 markings, 3673732 edges, 6792 markings/sec, 105 secs
lola: 1026809 markings, 3835759 edges, 8792 markings/sec, 110 secs
lola: 1076821 markings, 3983661 edges, 10002 markings/sec, 115 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1116676 markings, 4078297 edges
lola: ========================================
lola: subprocess 8 will run for 513 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E ((((1 <= p1610)) U ((1 <= p2224)))))) OR (((p874 <= 0)) AND A (G (((p2120 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 513 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p874 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p874 <= 0))
lola: processed formula length: 13
lola: 32 rewrites
lola: closed formula file CTLFireability.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 9 will run for 615 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p2120 <= 0))))
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:788
lola: processed formula: A (G (((p2120 <= 0))))
lola: processed formula length: 22
lola: 34 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: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 <= p2120))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 80 markings, 79 edges
lola: ========================================
lola: subprocess 10 will run for 769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E ((((1 <= p1610)) U ((1 <= p2224))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(E(((1 <= p1610)) U ((1 <= p2224))))
lola: processed formula length: 38
lola: 34 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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 615 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p1391 <= 0))))
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:788
lola: processed formula: A (G (((p1391 <= 0))))
lola: processed formula length: 22
lola: 34 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: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 <= p1391))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 59 markings, 58 edges
lola: ========================================
lola: subprocess 10 will run for 769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p1329))))
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 <= p1329))))
lola: processed formula length: 22
lola: 33 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 <= p1329))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 96 markings, 95 edges
lola: ========================================
lola: subprocess 11 will run for 1026 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p2566 <= 0) OR (((p858 <= 0)) AND ((p289 <= 0))) OR ((1 <= p442) AND (1 <= p596)))))
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 (((p2566 <= 0) OR (((p858 <= 0)) AND ((p289 <= 0))) OR ((1 <= p442) AND (1 <= p596)))))
lola: processed formula length: 94
lola: 34 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: ((1 <= p2566) AND (((1 <= p858)) OR ((1 <= p289))) AND ((p442 <= 0) OR (p596 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 66 markings, 65 edges
lola: ========================================
lola: subprocess 12 will run for 1539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p1291))))
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: ((p1291 <= 0))
lola: processed formula length: 14
lola: 35 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 <= p1291))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 72 markings, 72 edges
lola: ========================================
lola: subprocess 13 will run for 3078 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p1313)) OR (A (G (((1 <= p1612)))) OR ((1 <= p671))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((((1 <= p1313)) OR (AG(((1 <= p1612))) OR ((1 <= p671)))))
lola: processed formula length: 61
lola: 34 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: 65 markings, 130 edges
lola: RESULT
lola:
SUMMARY: no yes no no yes yes no yes no yes no no yes no
lola:
preliminary result: no yes no no yes yes no yes no yes no no yes no
lola: ========================================
lola: memory consumption: 102744 KB
lola: time consumption: 492 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="CloudReconfiguration-PT-304"
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 CloudReconfiguration-PT-304, 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 r180-ebro-158987899600028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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