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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 4.0K Mar 30 01:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 30 01:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:14 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.4K Apr 8 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 08:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 08:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 26 08:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 26 08:14 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 661K 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-317-CTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-317-CTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-317-CTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-317-CTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-317-CTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-317-CTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-317-CTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-317-CTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-317-CTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-317-CTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-317-CTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-317-CTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-317-CTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-317-CTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-317-CTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-317-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591154475654

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:21:19] [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-03 03:21:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:21:20] [INFO ] Load time of PNML (sax parser for PT used): 457 ms
[2020-06-03 03:21:20] [INFO ] Transformed 2587 places.
[2020-06-03 03:21:20] [INFO ] Transformed 3099 transitions.
[2020-06-03 03:21:20] [INFO ] Found NUPN structural information;
[2020-06-03 03:21:20] [INFO ] Parsed PT model containing 2587 places and 3099 transitions in 573 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 185 ms.
Incomplete random walk after 100000 steps, including 1083 resets, run finished after 997 ms. (steps per millisecond=100 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 3099 rows 2587 cols
[2020-06-03 03:21:21] [INFO ] Computed 4 place invariants in 165 ms
[2020-06-03 03:21:22] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 143 ms returned sat
[2020-06-03 03:21:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:21:41] [INFO ] [Real]Absence check using state equation in 19199 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 03:21:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 117 ms returned sat
[2020-06-03 03:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:22:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:22:01] [INFO ] [Real]Absence check using state equation in 19347 ms returned (error "Failed to check-sat")
[2020-06-03 03:22:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-06-03 03:22:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:22:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:22:21] [INFO ] [Real]Absence check using state equation in 19314 ms returned (error "Failed to check-sat")
[2020-06-03 03:22:22] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-06-03 03:22:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:22:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:22:41] [INFO ] [Real]Absence check using state equation in 19375 ms returned (error "Failed to check-sat")
[2020-06-03 03:22:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 118 ms returned sat
[2020-06-03 03:22:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:23:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:23:02] [INFO ] [Real]Absence check using state equation in 19390 ms returned (error "Failed to check-sat")
[2020-06-03 03:23:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 119 ms returned sat
[2020-06-03 03:23:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:23:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:23:22] [INFO ] [Real]Absence check using state equation in 19417 ms returned unknown
[2020-06-03 03:23:22] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-03 03:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:23:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:23:42] [INFO ] [Real]Absence check using state equation in 19389 ms returned (error "Failed to check-sat")
[2020-06-03 03:23:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-03 03:23:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:24:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:24:02] [INFO ] [Real]Absence check using state equation in 19417 ms returned (error "Failed to check-sat")
[2020-06-03 03:24:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-03 03:24:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:24:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:24:22] [INFO ] [Real]Absence check using state equation in 19448 ms returned (error "Failed to check-sat")
[2020-06-03 03:24:22] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2020-06-03 03:24:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:24:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:24:42] [INFO ] [Real]Absence check using state equation in 19449 ms returned (error "Failed to check-sat")
[2020-06-03 03:24:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-06-03 03:24:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:25:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:25:02] [INFO ] [Real]Absence check using state equation in 19518 ms returned (error "Failed to check-sat")
[2020-06-03 03:25:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-03 03:25:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:25:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:25:22] [INFO ] [Real]Absence check using state equation in 19426 ms returned (error "Failed to check-sat")
[2020-06-03 03:25:22] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 109 ms returned sat
[2020-06-03 03:25:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:25:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:25:42] [INFO ] [Real]Absence check using state equation in 19443 ms returned (error "Failed to check-sat")
[2020-06-03 03:25:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-03 03:25:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:26:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:26:02] [INFO ] [Real]Absence check using state equation in 19467 ms returned (error "Failed to check-sat")
[2020-06-03 03:26:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 117 ms returned sat
[2020-06-03 03:26:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:26:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:26:22] [INFO ] [Real]Absence check using state equation in 19416 ms returned (error "Failed to check-sat")
[2020-06-03 03:26:22] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 120 ms returned sat
[2020-06-03 03:26:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:26:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:26:42] [INFO ] [Real]Absence check using state equation in 19387 ms returned (error "Failed to check-sat")
[2020-06-03 03:26:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 108 ms returned sat
[2020-06-03 03:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:27:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:27:02] [INFO ] [Real]Absence check using state equation in 19397 ms returned (error "Failed to check-sat")
[2020-06-03 03:27:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-03 03:27:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:27:07] [INFO ] [Real]Absence check using state equation in 4208 ms returned unsat
[2020-06-03 03:27:07] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-06-03 03:27:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:27:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:27:27] [INFO ] [Real]Absence check using state equation in 19380 ms returned (error "Failed to check-sat")
[2020-06-03 03:27:27] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-03 03:27:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:27:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:27:47] [INFO ] [Real]Absence check using state equation in 19458 ms returned (error "Failed to check-sat")
[2020-06-03 03:27:47] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 119 ms returned sat
[2020-06-03 03:27:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:28:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:28:07] [INFO ] [Real]Absence check using state equation in 19387 ms returned unknown
[2020-06-03 03:28:07] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-03 03:28:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:28:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:28:27] [INFO ] [Real]Absence check using state equation in 19426 ms returned unknown
[2020-06-03 03:28:27] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-06-03 03:28:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:28:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:28:47] [INFO ] [Real]Absence check using state equation in 19523 ms returned unknown
[2020-06-03 03:28:47] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-03 03:28:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:29:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:29:07] [INFO ] [Real]Absence check using state equation in 19422 ms returned (error "Failed to check-sat")
[2020-06-03 03:29:07] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 109 ms returned sat
[2020-06-03 03:29:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:29:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:29:27] [INFO ] [Real]Absence check using state equation in 19454 ms returned unknown
[2020-06-03 03:29:27] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-06-03 03:29:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:29:32] [INFO ] [Real]Absence check using state equation in 4289 ms returned unsat
[2020-06-03 03:29:32] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-06-03 03:29:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:29:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:29:52] [INFO ] [Real]Absence check using state equation in 19428 ms returned (error "Failed to check-sat")
[2020-06-03 03:29:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-06-03 03:29:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:30:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:30:12] [INFO ] [Real]Absence check using state equation in 19380 ms returned unknown
[2020-06-03 03:30:12] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-03 03:30:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:30:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:30:32] [INFO ] [Real]Absence check using state equation in 19437 ms returned (error "Failed to check-sat")
[2020-06-03 03:30:32] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-06-03 03:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:30:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:30:52] [INFO ] [Real]Absence check using state equation in 19420 ms returned (error "Failed to check-sat")
[2020-06-03 03:30:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-03 03:30:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:31:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:31:12] [INFO ] [Real]Absence check using state equation in 19432 ms returned (error "Failed to check-sat")
[2020-06-03 03:31:12] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-03 03:31:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:31:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:31:32] [INFO ] [Real]Absence check using state equation in 19439 ms returned (error "Failed to check-sat")
[2020-06-03 03:31:32] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-03 03:31:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:31:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:31:52] [INFO ] [Real]Absence check using state equation in 19422 ms returned unknown
[2020-06-03 03:31:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-03 03:31:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:31:57] [INFO ] [Real]Absence check using state equation in 4527 ms returned unsat
[2020-06-03 03:31:58] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-03 03:31:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:32:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:32:17] [INFO ] [Real]Absence check using state equation in 19432 ms returned (error "Failed to check-sat")
[2020-06-03 03:32:18] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-06-03 03:32:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:32:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:32:37] [INFO ] [Real]Absence check using state equation in 19431 ms returned (error "Failed to check-sat")
[2020-06-03 03:32:38] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2020-06-03 03:32:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:32:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:32:57] [INFO ] [Real]Absence check using state equation in 19405 ms returned (error "Failed to check-sat")
[2020-06-03 03:32:58] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-03 03:32:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:33:02] [INFO ] [Real]Absence check using state equation in 4177 ms returned unsat
[2020-06-03 03:33:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 117 ms returned sat
[2020-06-03 03:33:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:33:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:33:22] [INFO ] [Real]Absence check using state equation in 19402 ms returned unknown
[2020-06-03 03:33:23] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-03 03:33:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:33:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:33:42] [INFO ] [Real]Absence check using state equation in 19306 ms returned unknown
[2020-06-03 03:33:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 117 ms returned sat
[2020-06-03 03:33:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:34:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:34:02] [INFO ] [Real]Absence check using state equation in 19406 ms returned unknown
[2020-06-03 03:34:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 148 ms returned sat
[2020-06-03 03:34:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:34:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:34:22] [INFO ] [Real]Absence check using state equation in 19371 ms returned unknown
[2020-06-03 03:34:22] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 126 ms returned sat
[2020-06-03 03:34:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:34:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:34:42] [INFO ] [Real]Absence check using state equation in 19442 ms returned (error "Failed to check-sat")
[2020-06-03 03:34:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-03 03:34:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:35:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:35:02] [INFO ] [Real]Absence check using state equation in 19447 ms returned unknown
[2020-06-03 03:35:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-06-03 03:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:35:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:35:22] [INFO ] [Real]Absence check using state equation in 19508 ms returned (error "Failed to check-sat")
[2020-06-03 03:35:23] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 110 ms returned sat
[2020-06-03 03:35:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:35:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:35:42] [INFO ] [Real]Absence check using state equation in 19403 ms returned (error "Failed to check-sat")
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2020-06-03 03:35:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 03:35:43] [INFO ] Flatten gal took : 440 ms
[2020-06-03 03:35:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 03:35:43] [INFO ] Flatten gal took : 223 ms
FORMULA CloudReconfiguration-PT-317-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 03:35:43] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 8 ms.
[2020-06-03 03:35:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 48 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ CloudReconfiguration-PT-317 @ 3570 seconds

FORMULA CloudReconfiguration-PT-317-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-317-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-317-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-317-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-317-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA CloudReconfiguration-PT-317-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-317-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

FORMULA CloudReconfiguration-PT-317-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3045
rslt: Output for CTLFireability @ CloudReconfiguration-PT-317

{
"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": "Wed Jun 3 03:35:44 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 226
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 7,
"adisj": 3,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 7,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "AF(((((p2273 <= 0)) AND ((p1017 <= 0))) AND (EX(((1 <= p2251))) AND (((1 <= p2193)) AND (((1 <= p1458)) AND (((1 <= p1849)) AND (((p280 <= 0)) AND (((1 <= p2084)) AND ((1 <= p2451))))))))))",
"processed_size": 189,
"rewrites": 58
},
"net":
{
"conflict_clusters": 2448,
"singleton_clusters": 0
},
"result":
{
"edges": 56,
"markings": 56,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 242
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"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": "AX((EG(((p550 <= 0))) OR ((1 <= p1650))))",
"processed_size": 41,
"rewrites": 58
},
"net":
{
"conflict_clusters": 2448,
"singleton_clusters": 0
},
"result":
{
"edges": 55,
"markings": 55,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 261
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "AF((EF((((1 <= p455)) OR ((1 <= p1081)))) OR (AX(((1 <= p572) AND (1 <= p1369))) OR (((1 <= p945)) OR (((1 <= p1905)) OR ((1 <= p572) AND (1 <= p598)))))))",
"processed_size": 156,
"rewrites": 59
},
"net":
{
"conflict_clusters": 2448,
"singleton_clusters": 0
},
"result":
{
"edges": 3744057,
"markings": 1028103,
"produced_by": "CTL model checker",
"value": true
},
"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": 273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 3,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 0,
"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": "(E(((1 <= p624)) U EX(((1 <= p191)))) OR EX(AF(((1 <= p994)))))",
"processed_size": 63,
"rewrites": 60
},
"net":
{
"conflict_clusters": 2448,
"singleton_clusters": 0
},
"result":
{
"edges": 56,
"markings": 56,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 298
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p2195)) OR ((1 <= p2394)) OR ((1 <= p1289)))",
"processed_size": 54,
"rewrites": 58
},
"result":
{
"edges": 39,
"markings": 40,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 328
},
"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": "((p2467 <= 0))",
"processed_size": 14,
"rewrites": 60
},
"result":
{
"edges": 57,
"markings": 57,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 410
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"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": "AG((AF(((p144 <= 0))) OR AF(((p1155 <= 0)))))",
"processed_size": 45,
"rewrites": 59
},
"net":
{
"conflict_clusters": 2448,
"singleton_clusters": 0
},
"result":
{
"edges": 4800255,
"markings": 1036665,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 449
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 2,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E((((1 <= p2292)) AND AF(((1 <= p2426)))) U AF(((1 <= p2559) AND (1 <= p310))))",
"processed_size": 79,
"rewrites": 59
},
"net":
{
"conflict_clusters": 2448,
"singleton_clusters": 0
},
"result":
{
"edges": 57,
"markings": 56,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 524
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 6,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "((1 <= p1635) AND ((p1188 <= 0) OR (((p1204 <= 0)) AND ((p2156 <= 0)))) AND (((1 <= p1425)) OR ((1 <= p2454))) AND (((1 <= p840)) OR ((1 <= p290))) AND (((1 <= p301)) OR ((1 <= p572) AND (1 <= p1915))))",
"processed_size": 206,
"rewrites": 56
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 628
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((((p572 <= 0) OR (p1915 <= 0)) U ((1 <= p1233) AND (1 <= p2209))))",
"processed_size": 70,
"rewrites": 61
},
"result":
{
"edges": 57,
"markings": 57,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 132
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 628
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"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": "(((1 <= p1892)) OR ((1 <= p568)))",
"processed_size": 34,
"rewrites": 59
},
"result":
{
"edges": 3497483,
"markings": 935461,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 14
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 761
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p2068 <= 0)) AND ((p641 <= 0)))",
"processed_size": 34,
"rewrites": 59
},
"result":
{
"edges": 56,
"markings": 56,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1015
},
"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 <= p63))",
"processed_size": 12,
"rewrites": 56
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1522
},
"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 <= p1063))))",
"processed_size": 22,
"rewrites": 57
},
"result":
{
"edges": 82,
"markings": 83,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"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": 3045
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p319) AND (1 <= p695)) OR ((1 <= p1324)))))",
"processed_size": 58,
"rewrites": 57
},
"result":
{
"edges": 70,
"markings": 71,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1522
},
"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": "((p877 <= 0))",
"processed_size": 13,
"rewrites": 59
},
"result":
{
"edges": 57,
"markings": 57,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 13,
"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": 3045
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"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": "EG(AF(((p2210 <= 0))))",
"processed_size": 22,
"rewrites": 58
},
"net":
{
"conflict_clusters": 2448,
"singleton_clusters": 0
},
"result":
{
"edges": 112,
"markings": 56,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 14,
"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": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3045
},
"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 <= p208))))",
"processed_size": 21,
"rewrites": 57
},
"result":
{
"edges": 54,
"markings": 55,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"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": "(((1 <= p1287)) OR ((1 <= p1362)))",
"processed_size": 35,
"rewrites": 56
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": "A (G (((1 <= p756))))",
"processed_size": 21,
"rewrites": 58
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 17,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

{
"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 <= p208))))",
"processed_size": 21,
"rewrites": 57
},
"result":
{
"edges": 54,
"markings": 55,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": "(((p1690 <= 0)) AND ((p1457 <= 0)))",
"processed_size": 35,
"rewrites": 56
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 112032,
"runtime": 525.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F((** AND (E(X(**)) AND (** AND (** AND (** AND (** AND (** AND **))))))))) : E(G(E(F(*)))) : E(((** AND A(F(**))) U A(F(**)))) : A(X((E(G(*)) OR **))) : A(F((E(F(**)) OR (A(X(**)) OR (** OR (** OR **)))))) : (E((** U E(X(**)))) OR E(X(A(F(**))))) : (A((** U **)) OR **) : A(G((A(F(*)) OR A(F(*))))) : (A(F(**)) OR E(G(A(F(**))))) : ((E(F(E(G(**)))) OR (E(F(**)) OR E(F(**)))) AND (** OR (A(G(**)) OR **))) : E(G(E(F(**)))) : A(G(A(F(*)))) : E(X(E(F(**)))) : (E(F(**)) AND (E(F(**)) OR **)) : A(F(**))"
},
"net":
{
"arcs": 6479,
"conflict_clusters": 2448,
"places": 2587,
"places_significant": 2583,
"singleton_clusters": 0,
"transitions": 3099
},
"result":
{
"preliminary_value": "no yes no yes yes no no no yes yes yes no yes yes no ",
"value": "no yes no yes yes no no no yes yes yes no yes 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: 5686/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2587
lola: finding significant places
lola: 2587 places, 3099 transitions, 2583 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: (p2273 <= 1)
lola: LP says that atomic proposition is always true: (p1017 <= 1)
lola: LP says that atomic proposition is always true: (p2251 <= 1)
lola: LP says that atomic proposition is always true: (p2193 <= 1)
lola: LP says that atomic proposition is always true: (p1458 <= 1)
lola: LP says that atomic proposition is always true: (p1849 <= 1)
lola: LP says that atomic proposition is always true: (p280 <= 1)
lola: LP says that atomic proposition is always true: (p2084 <= 1)
lola: LP says that atomic proposition is always true: (p2451 <= 1)
lola: LP says that atomic proposition is always true: (p2068 <= 1)
lola: LP says that atomic proposition is always true: (p641 <= 1)
lola: LP says that atomic proposition is always true: (p2292 <= 1)
lola: LP says that atomic proposition is always true: (p2426 <= 1)
lola: LP says that atomic proposition is always true: (p2559 <= 1)
lola: LP says that atomic proposition is always true: (p310 <= 1)
lola: LP says that atomic proposition is always true: (p550 <= 1)
lola: LP says that atomic proposition is always true: (p1650 <= 1)
lola: LP says that atomic proposition is always true: (p455 <= 1)
lola: LP says that atomic proposition is always true: (p1081 <= 1)
lola: LP says that atomic proposition is always true: (p572 <= 1)
lola: LP says that atomic proposition is always true: (p1369 <= 1)
lola: LP says that atomic proposition is always true: (p945 <= 1)
lola: LP says that atomic proposition is always true: (p1905 <= 1)
lola: LP says that atomic proposition is always true: (p572 <= 1)
lola: LP says that atomic proposition is always true: (p598 <= 1)
lola: LP says that atomic proposition is always true: (p624 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p994 <= 1)
lola: LP says that atomic proposition is always true: (p388 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p572 <= 1)
lola: LP says that atomic proposition is always true: (p1915 <= 1)
lola: LP says that atomic proposition is always true: (p1233 <= 1)
lola: LP says that atomic proposition is always true: (p2209 <= 1)
lola: LP says that atomic proposition is always true: (p1635 <= 1)
lola: LP says that atomic proposition is always true: (p1188 <= 1)
lola: LP says that atomic proposition is always true: (p1204 <= 1)
lola: LP says that atomic proposition is always true: (p2156 <= 1)
lola: LP says that atomic proposition is always true: (p1425 <= 1)
lola: LP says that atomic proposition is always true: (p2454 <= 1)
lola: LP says that atomic proposition is always true: (p840 <= 1)
lola: LP says that atomic proposition is always true: (p290 <= 1)
lola: LP says that atomic proposition is always true: (p301 <= 1)
lola: LP says that atomic proposition is always true: (p572 <= 1)
lola: LP says that atomic proposition is always true: (p1915 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p1155 <= 1)
lola: LP says that atomic proposition is always true: (p877 <= 1)
lola: LP says that atomic proposition is always true: (p2210 <= 1)
lola: LP says that atomic proposition is always true: (p2121 <= 1)
lola: LP says that atomic proposition is always true: (p2024 <= 1)
lola: LP says that atomic proposition is always true: (p208 <= 1)
lola: LP says that atomic proposition is always true: (p1287 <= 1)
lola: LP says that atomic proposition is always true: (p1362 <= 1)
lola: LP says that atomic proposition is always true: (p756 <= 1)
lola: LP says that atomic proposition is always true: (p1690 <= 1)
lola: LP says that atomic proposition is always true: (p1457 <= 1)
lola: LP says that atomic proposition is always true: (p1892 <= 1)
lola: LP says that atomic proposition is always true: (p568 <= 1)
lola: LP says that atomic proposition is always true: (p2467 <= 1)
lola: LP says that atomic proposition is always true: (p2195 <= 1)
lola: LP says that atomic proposition is always true: (p2394 <= 1)
lola: LP says that atomic proposition is always true: (p1289 <= 1)
lola: LP says that atomic proposition is always true: (p319 <= 1)
lola: LP says that atomic proposition is always true: (p695 <= 1)
lola: LP says that atomic proposition is always true: (p1324 <= 1)
lola: LP says that atomic proposition is always true: (p1063 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p278 <= 1)
lola: LP says that atomic proposition is always true: (p2357 <= 1)
lola: LP says that atomic proposition is always true: (p303 <= 1)
lola: LP says that atomic proposition is always true: (p293 <= 1)
lola: LP says that atomic proposition is always true: (p1428 <= 1)
lola: A (F (((((((((((p2273 <= 0)) AND ((p1017 <= 0))) AND E (X (((1 <= p2251))))) AND ((1 <= p2193))) AND ((1 <= p1458))) AND ((1 <= p1849))) AND ((p280 <= 0))) AND ((1 <= p2084))) AND ((1 <= p2451))))) : NOT(A (F (A (G ((((1 <= p2068)) OR ((1 <= p641)))))))) : E (((((1 <= p2292)) AND A (F (((1 <= p2426))))) U A (F (((1 <= p2559) AND (1 <= p310)))))) : A (X ((NOT(A (F (((1 <= p550))))) OR ((1 <= p1650))))) : A (F (((((E (F ((((1 <= p455)) OR ((1 <= p1081))))) OR A (X (((1 <= p572) AND (1 <= p1369))))) OR ((1 <= p945))) OR ((1 <= p1905))) OR ((1 <= p572) AND (1 <= p598))))) : (E ((((1 <= p624)) U E (X (((1 <= p191)))))) OR E (X (A (F (((1 <= p994))))))) : (NOT(A (((((1 <= p388)) OR ((1 <= p156))) U (1 <= 0)))) AND (A ((((p572 <= 0) OR (p1915 <= 0)) U ((1 <= p1233) AND (1 <= p2209)))) OR ((1 <= p1635) AND ((p1188 <= 0) OR (((p1204 <= 0)) AND ((p2156 <= 0)))) AND (((1 <= p1425)) OR ((1 <= p2454))) AND (((1 <= p840)) OR ((1 <= p290))) AND (((1 <= p301)) OR ((1 <= p572) AND (1 <= p1915)))))) : A (G ((NOT(E (G (((1 <= p144))))) OR NOT(E (G (((1 <= p1155)))))))) : (A (F (((1 <= p877)))) OR E (G (A (F (((p2210 <= 0))))))) : (E (F (((E (G (((1 <= p2121)))) OR ((1 <= p2024))) OR ((1 <= p208))))) AND (((((1 <= p1287)) OR ((1 <= p1362))) OR A (G (((1 <= p756))))) OR (((p1690 <= 0)) AND ((p1457 <= 0))))) : E (G (E (F ((((1 <= p1892)) OR ((1 <= p568))))))) : NOT(E (F (E (G (((p2467 <= 0))))))) : E (X (E (F ((((1 <= p2195)) OR ((1 <= p2394)) OR ((1 <= p1289))))))) : (E (F ((((1 <= p319) AND (1 <= p695)) OR ((1 <= p1324))))) AND (E (F (((1 <= p1063)))) OR ((1 <= p63)))) : A (((((p278 <= 0) OR (p2357 <= 0)) OR A (F (((1 <= p303))))) U A (F ((((1 <= p293)) OR ((1 <= p1428)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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: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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:548
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((((p2273 <= 0)) AND ((p1017 <= 0))) AND (E (X (((1 <= p2251)))) AND (((1 <= p2193)) AND (((1 <= p1458)) AND (((1 <= p1849)) AND (((p280 <= 0)) AND (((1 <= p2084)) AND ((1 <= p2451)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(((((p2273 <= 0)) AND ((p1017 <= 0))) AND (EX(((1 <= p2251))) AND (((1 <= p2193)) AND (((1 <= p1458)) AND (((1 <= p1849)) AND (((p280 <= 0)) AND (((1 <= p2084)) AND ((1 <= p2451))))))))))
lola: processed formula length: 189
lola: 58 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: 56 markings, 56 edges
lola: ========================================
lola: subprocess 1 will run for 242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((E (G (((p550 <= 0)))) OR ((1 <= p1650)))))
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(((p550 <= 0))) OR ((1 <= p1650))))
lola: processed formula length: 41
lola: 58 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: 55 markings, 55 edges
lola: ========================================
lola: subprocess 2 will run for 261 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (F ((((1 <= p455)) OR ((1 <= p1081))))) OR (A (X (((1 <= p572) AND (1 <= p1369)))) OR (((1 <= p945)) OR (((1 <= p1905)) OR ((1 <= p572) AND (1 <= p598))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EF((((1 <= p455)) OR ((1 <= p1081)))) OR (AX(((1 <= p572) AND (1 <= p1369))) OR (((1 <= p945)) OR (((1 <= p1905)) OR ((1 <= p572) AND (1 <= p598)))))))
lola: processed formula length: 156
lola: 59 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: 52449 markings, 171990 edges, 10490 markings/sec, 0 secs
lola: 106373 markings, 337300 edges, 10785 markings/sec, 5 secs
lola: 160428 markings, 509498 edges, 10811 markings/sec, 10 secs
lola: 210585 markings, 680186 edges, 10031 markings/sec, 15 secs
lola: 261605 markings, 851998 edges, 10204 markings/sec, 20 secs
lola: 316822 markings, 1020308 edges, 11043 markings/sec, 25 secs
lola: 368404 markings, 1190347 edges, 10316 markings/sec, 30 secs
lola: 418098 markings, 1360410 edges, 9939 markings/sec, 35 secs
lola: 471380 markings, 1527570 edges, 10656 markings/sec, 40 secs
lola: 512668 markings, 1703877 edges, 8258 markings/sec, 45 secs
lola: 554260 markings, 1876753 edges, 8318 markings/sec, 50 secs
lola: 599143 markings, 2051099 edges, 8977 markings/sec, 55 secs
lola: 634701 markings, 2227352 edges, 7112 markings/sec, 60 secs
lola: 676928 markings, 2398967 edges, 8445 markings/sec, 65 secs
lola: 716478 markings, 2573391 edges, 7910 markings/sec, 70 secs
lola: 762660 markings, 2744506 edges, 9236 markings/sec, 75 secs
lola: 796240 markings, 2919477 edges, 6716 markings/sec, 80 secs
lola: 840307 markings, 3090415 edges, 8813 markings/sec, 85 secs
lola: 878473 markings, 3264142 edges, 7633 markings/sec, 90 secs
lola: 920005 markings, 3434857 edges, 8306 markings/sec, 95 secs
lola: 972552 markings, 3595796 edges, 10509 markings/sec, 100 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1028103 markings, 3744057 edges
lola: ========================================
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((1 <= p624)) U E (X (((1 <= p191)))))) OR E (X (A (F (((1 <= p994)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: (E(((1 <= p624)) U EX(((1 <= p191)))) OR EX(AF(((1 <= p994)))))
lola: processed formula length: 63
lola: 60 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: 56 markings, 56 edges
lola: ========================================
lola: subprocess 4 will run for 298 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((((1 <= p2195)) OR ((1 <= p2394)) OR ((1 <= p1289)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (((1 <= p2195)) OR ((1 <= p2394)) OR ((1 <= p1289)))
lola: processed formula length: 54
lola: 58 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 /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p2195)) OR ((1 <= p2394)) OR ((1 <= p1289)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 40 markings, 39 edges
lola: ========================================
lola: subprocess 5 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((1 <= p2467))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((p2467 <= 0))
lola: processed formula length: 14
lola: 60 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 /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: 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 <= p2467))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p2467 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 57 markings, 57 edges
lola: ========================================
lola: subprocess 6 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p293)) OR ((1 <= p1428)))))
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: (((p293 <= 0)) AND ((p1428 <= 0)))
lola: processed formula length: 34
lola: 59 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 <= p293)) OR ((1 <= p1428)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 57 markings, 57 edges
lola: ========================================
lola: subprocess 7 will run for 410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F (((p144 <= 0)))) OR A (F (((p1155 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((AF(((p144 <= 0))) OR AF(((p1155 <= 0)))))
lola: processed formula length: 45
lola: 59 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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 41740 markings, 170268 edges, 8348 markings/sec, 0 secs
lola: 82595 markings, 339302 edges, 8171 markings/sec, 5 secs
lola: 124311 markings, 509329 edges, 8343 markings/sec, 10 secs
lola: 162350 markings, 679313 edges, 7608 markings/sec, 15 secs
lola: 200185 markings, 847964 edges, 7567 markings/sec, 20 secs
lola: 240118 markings, 1018025 edges, 7987 markings/sec, 25 secs
lola: 281704 markings, 1187188 edges, 8317 markings/sec, 30 secs
lola: 319026 markings, 1356539 edges, 7464 markings/sec, 35 secs
lola: 360128 markings, 1525578 edges, 8220 markings/sec, 40 secs
lola: 398300 markings, 1692953 edges, 7634 markings/sec, 45 secs
lola: 436928 markings, 1858863 edges, 7726 markings/sec, 50 secs
lola: 477014 markings, 2025857 edges, 8017 markings/sec, 55 secs
lola: 509773 markings, 2198713 edges, 6552 markings/sec, 60 secs
lola: 543878 markings, 2370233 edges, 6821 markings/sec, 65 secs
lola: 576674 markings, 2542218 edges, 6559 markings/sec, 70 secs
lola: 611153 markings, 2714023 edges, 6896 markings/sec, 75 secs
lola: 639589 markings, 2887805 edges, 5687 markings/sec, 80 secs
lola: 673085 markings, 3058254 edges, 6699 markings/sec, 85 secs
lola: 705396 markings, 3230876 edges, 6462 markings/sec, 90 secs
lola: 739091 markings, 3402331 edges, 6739 markings/sec, 95 secs
lola: 776757 markings, 3571651 edges, 7533 markings/sec, 100 secs
lola: 802793 markings, 3744329 edges, 5207 markings/sec, 105 secs
lola: 837031 markings, 3914885 edges, 6848 markings/sec, 110 secs
lola: 867379 markings, 4084091 edges, 6070 markings/sec, 115 secs
lola: 900122 markings, 4254215 edges, 6549 markings/sec, 120 secs
lola: 933103 markings, 4423596 edges, 6596 markings/sec, 125 secs
lola: 975109 markings, 4579385 edges, 8401 markings/sec, 130 secs
lola: 1016661 markings, 4733965 edges, 8310 markings/sec, 135 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1036665 markings, 4800255 edges
lola: ========================================
lola: subprocess 8 will run for 449 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((1 <= p2292)) AND A (F (((1 <= p2426))))) U A (F (((1 <= p2559) AND (1 <= p310))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((((1 <= p2292)) AND AF(((1 <= p2426)))) U AF(((1 <= p2559) AND (1 <= p310))))
lola: processed formula length: 79
lola: 59 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 3 significant temporal operators and needs 13 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: 56 markings, 57 edges
lola: ========================================
lola: subprocess 9 will run for 524 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((((p572 <= 0) OR (p1915 <= 0)) U ((1 <= p1233) AND (1 <= p2209)))) OR ((1 <= p1635) AND ((p1188 <= 0) OR (((p1204 <= 0)) AND ((p2156 <= 0)))) AND (((1 <= p1425)) OR ((1 <= p2454))) AND (((1 <= p840)) OR ((1 <= p290))) AND (((1 <= p301)) OR ((1 <= p572) AND (1 <= p1915)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 524 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1635) AND ((p1188 <= 0) OR (((p1204 <= 0)) AND ((p2156 <= 0)))) AND (((1 <= p1425)) OR ((1 <= p2454))) AND (((1 <= p840)) OR ((1 <= p290))) AND (((1 <= p301)) OR ((1 <= p572) AND (1 <= p1915))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1635) AND ((p1188 <= 0) OR (((p1204 <= 0)) AND ((p2156 <= 0)))) AND (((1 <= p1425)) OR ((1 <= p2454))) AND (((1 <= p840)) OR ((1 <= p290))) AND (((1 <= p301)) OR ((1 <= p572) AND (1 <= p1915))))
lola: processed formula length: 206
lola: 56 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 11 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 628 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p572 <= 0) OR (p1915 <= 0)) U ((1 <= p1233) AND (1 <= p2209))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((p572 <= 0) OR (p1915 <= 0)) U ((1 <= p1233) AND (1 <= p2209))))
lola: processed formula length: 70
lola: 61 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl 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: ((p572 <= 0) OR (p1915 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 57 markings, 57 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 628 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((((1 <= p1892)) OR ((1 <= p568)))))))
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 <= p1892)) OR ((1 <= p568)))
lola: processed formula length: 34
lola: 59 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 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((1 <= p1892)) OR ((1 <= p568)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p1892 <= 0)) AND ((p568 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-10-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-10-1.sara.
lola: state equation: write sara problem file to CTLFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-10-0.sara.
sara: error: :12033: 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: :12033: 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 || 53324 markings, 175055 edges, 10665 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 111317 markings, 350225 edges, 11599 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 165381 markings, 527744 edges, 10813 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 216737 markings, 703559 edges, 10271 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 271722 markings, 878240 edges, 10997 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 322437 markings, 1053778 edges, 10143 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 378419 markings, 1227980 edges, 11196 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 431360 markings, 1402318 edges, 10588 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 484096 markings, 1576790 edges, 10547 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 523916 markings, 1756539 edges, 7964 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 567028 markings, 1934471 edges, 8622 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 615384 markings, 2113440 edges, 9671 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 650543 markings, 2292992 edges, 7032 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 692184 markings, 2471001 edges, 8328 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 735327 markings, 2648712 edges, 8629 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 778267 markings, 2826154 edges, 8588 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 818797 markings, 3003887 edges, 8106 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 860612 markings, 3181767 edges, 8363 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 901092 markings, 3359006 edges, 8096 markings/sec, 90 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 935461 markings, 3497483 edges
lola: ========================================
lola: subprocess 11 will run for 761 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((((p2068 <= 0)) AND ((p641 <= 0)))))))
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: (((p2068 <= 0)) AND ((p641 <= 0)))
lola: processed formula length: 34
lola: 59 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 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 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: (((p2068 <= 0)) AND ((p641 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p2068)) OR ((1 <= p641)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 56 markings, 56 edges
lola: ========================================
lola: subprocess 12 will run for 1015 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= p319) AND (1 <= p695)) OR ((1 <= p1324))))) AND (E (F (((1 <= p1063)))) OR ((1 <= p63))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1015 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p63))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p63))
lola: processed formula length: 12
lola: 56 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1522 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p1063))))
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 <= p1063))))
lola: processed formula length: 22
lola: 57 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 <= p1063))
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: 83 markings, 82 edges
lola: ========================================
lola: subprocess 14 will run for 3045 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p319) AND (1 <= p695)) OR ((1 <= p1324)))))
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 <= p319) AND (1 <= p695)) OR ((1 <= p1324)))))
lola: processed formula length: 58
lola: 57 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 <= p319) AND (1 <= p695)) OR ((1 <= p1324)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 71 markings, 70 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1522 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p877)))) OR E (G (A (F (((p2210 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1522 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p877))))
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: ((p877 <= 0))
lola: processed formula length: 13
lola: 59 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 <= p877))
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: 57 markings, 57 edges
lola: ========================================
lola: subprocess 14 will run for 3045 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((p2210 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF(((p2210 <= 0))))
lola: processed formula length: 22
lola: 58 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 56 markings, 112 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 3045 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (F (E (G (((1 <= p2121)))))) OR (E (F (((1 <= p2024)))) OR E (F (((1 <= p208)))))) AND ((((1 <= p1287)) OR ((1 <= p1362))) OR (A (G (((1 <= p756)))) OR (((p1690 <= 0)) AND ((p1457 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3045 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p208))))
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 <= p208))))
lola: processed formula length: 21
lola: 57 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 <= p208))
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: 55 markings, 54 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 16 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p1287)) OR ((1 <= p1362)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p1287)) OR ((1 <= p1362)))
lola: processed formula length: 35
lola: 56 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p756))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((1 <= p756))))
lola: processed formula length: 21
lola: 58 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: ((p756 <= 0))
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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((E (F (E (G (((1 <= p2121)))))) OR (E (F (((1 <= p2024)))) OR E (F (((1 <= p208)))))) AND ((((1 <= p1287)) OR ((1 <= p1362))) OR (A (G (((1 <= p756)))) OR (((p1690 <= 0)) AND ((p1457 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p208))))
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 <= p208))))
lola: processed formula length: 21
lola: 57 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 <= p208))
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: 55 markings, 54 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((p1690 <= 0)) AND ((p1457 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p1690 <= 0)) AND ((p1457 <= 0)))
lola: processed formula length: 35
lola: 56 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes yes no no no yes yes yes no yes yes no
lola:
preliminary result: no yes no yes yes no no no yes yes yes no yes yes no
lola: memory consumption: 112032 KB
lola: time consumption: 525 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-317"
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-317, 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-158987899700132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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