Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r035-tajo-162038167700086.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-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 gold2020
Input is BusinessProcesses-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-tajo-162038167700086
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 63K May 5 16:51 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 BusinessProcesses-PT-03-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620904316607

[2021-05-13 11:11:59] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 11:11:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 11:11:59] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2021-05-13 11:11:59] [INFO ] Transformed 274 places.
[2021-05-13 11:11:59] [INFO ] Transformed 237 transitions.
[2021-05-13 11:11:59] [INFO ] Found NUPN structural information;
[2021-05-13 11:11:59] [INFO ] Parsed PT model containing 274 places and 237 transitions in 138 ms.
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 48 ms.
Incomplete random walk after 100000 steps, including 1187 resets, run finished after 345 ms. (steps per millisecond=289 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 236 rows 273 cols
[2021-05-13 11:11:59] [INFO ] Computed 43 place invariants in 21 ms
[2021-05-13 11:12:00] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2021-05-13 11:12:00] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-13 11:12:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:00] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 9 places in 198 ms
[2021-05-13 11:12:00] [INFO ] Deduced a trap composed of 14 places in 139 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 12 places in 236 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 73 places in 179 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 31 places in 125 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 35 places in 204 ms
[2021-05-13 11:12:01] [INFO ] Deduced a trap composed of 72 places in 177 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 13 places in 127 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 12 places in 111 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 19 places in 119 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 35 places in 76 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 34 places in 74 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 35 places in 68 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 31 places in 1018 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 42 places in 1985 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 43 places in 69 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 8 places in 67 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 38 places in 479 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 39 places in 75 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 37 places in 60 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 37 places in 55 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 21 places in 173 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 34 places in 74 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 35 places in 45 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 28 places in 43 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 43 places in 43 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 46 places in 40 ms
[2021-05-13 11:12:07] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 6677 ms
[2021-05-13 11:12:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:07] [INFO ] [Nat]Absence check using 31 positive place invariants in 35 ms returned sat
[2021-05-13 11:12:07] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-13 11:12:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:07] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 9 places in 116 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 14 places in 161 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 12 places in 208 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 73 places in 388 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 13 places in 255 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 12 places in 481 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 38 places in 150 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 19 places in 68 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 36 places in 83 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 30 places in 59 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 37 places in 55 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 35 places in 82 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 29 places in 145 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 34 places in 87 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 42 places in 80 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 27 places in 50 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 43 places in 81 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 8 places in 64 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 38 places in 53 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 39 places in 47 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 37 places in 41 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 34 places in 40 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 35 places in 43 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 43 places in 55 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 46 places in 53 ms
[2021-05-13 11:12:10] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3309 ms
[2021-05-13 11:12:10] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 19 ms.
[2021-05-13 11:12:11] [INFO ] Added : 144 causal constraints over 29 iterations in 627 ms. Result :sat
[2021-05-13 11:12:11] [INFO ] [Real]Absence check using 31 positive place invariants in 23 ms returned sat
[2021-05-13 11:12:11] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-13 11:12:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:11] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 8 places in 151 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 14 places in 99 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 13 places in 95 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 15 places in 87 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 11 places in 476 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 30 places in 130 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 16 places in 111 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 22 places in 96 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 21 places in 78 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 36 places in 100 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 69 places in 465 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 48 places in 244 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 70 places in 94 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 37 places in 93 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 72 places in 113 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 24 places in 114 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 72 places in 86 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 66 places in 86 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 29 places in 102 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 37 places in 82 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 46 places in 89 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 32 places in 88 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 43 places in 84 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 45 places in 88 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 52 places in 84 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 15 places in 85 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 69 places in 100 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 42 places in 82 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 54 places in 107 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 74 places in 90 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 72 places in 79 ms
[2021-05-13 11:12:16] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 4400 ms
[2021-05-13 11:12:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:16] [INFO ] [Nat]Absence check using 31 positive place invariants in 45 ms returned sat
[2021-05-13 11:12:16] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 6 ms returned sat
[2021-05-13 11:12:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:16] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 8 places in 101 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 14 places in 93 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 23 places in 83 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 28 places in 79 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 21 places in 124 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 36 places in 95 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 44 places in 96 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 24 places in 82 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 11 places in 73 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 75 places in 113 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 70 places in 139 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 64 places in 149 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 71 places in 89 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 70 places in 108 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 71 places in 86 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 68 places in 88 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 29 places in 87 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 36 places in 86 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 38 places in 113 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 26 places in 85 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 42 places in 86 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 46 places in 91 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 53 places in 86 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 75 places in 83 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 26 places in 84 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 70 places in 80 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 73 places in 70 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 43 places in 83 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 76 places in 80 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 40 places in 71 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 75 places in 62 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 76 places in 63 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 78 places in 62 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 11 places in 67 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 25 places in 64 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 71 places in 62 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 13 places in 103 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 31 places in 67 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 22 places in 69 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 48 places in 63 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 20 places in 62 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 70 places in 61 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 36 places in 62 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 68 places in 62 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 64 places in 72 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 70 places in 62 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 28 places in 61 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 70 places in 104 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 69 places in 71 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 68 places in 60 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 71 places in 62 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 69 places in 60 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 66 places in 62 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 71 places in 63 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 65 places in 62 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 33 places in 54 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 45 places in 54 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 46 places in 67 ms
[2021-05-13 11:12:21] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 5347 ms
[2021-05-13 11:12:21] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 11 ms.
[2021-05-13 11:12:22] [INFO ] Added : 169 causal constraints over 34 iterations in 673 ms. Result :sat
[2021-05-13 11:12:22] [INFO ] [Real]Absence check using 31 positive place invariants in 30 ms returned sat
[2021-05-13 11:12:22] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 7 ms returned sat
[2021-05-13 11:12:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:22] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 8 places in 123 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 11 places in 101 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 14 places in 96 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 25 places in 103 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 14 places in 96 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 30 places in 95 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 16 places in 90 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 37 places in 66 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 72 places in 78 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 70 places in 72 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 29 places in 54 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 22 places in 89 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 32 places in 90 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 28 places in 63 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 46 places in 57 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 22 places in 78 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 39 places in 117 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 24 places in 82 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 31 places in 57 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 38 places in 60 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 48 places in 70 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 37 places in 58 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 24 places in 67 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 26 places in 55 ms
[2021-05-13 11:12:25] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2380 ms
[2021-05-13 11:12:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:25] [INFO ] [Nat]Absence check using 31 positive place invariants in 57 ms returned sat
[2021-05-13 11:12:25] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 7 ms returned sat
[2021-05-13 11:12:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:25] [INFO ] [Nat]Absence check using state equation in 339 ms returned sat
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 14 places in 68 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 13 places in 65 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 11 places in 55 ms
[2021-05-13 11:12:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 231 ms
[2021-05-13 11:12:25] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 26 ms.
[2021-05-13 11:12:26] [INFO ] Added : 133 causal constraints over 27 iterations in 545 ms. Result :sat
[2021-05-13 11:12:26] [INFO ] [Real]Absence check using 31 positive place invariants in 29 ms returned sat
[2021-05-13 11:12:26] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 7 ms returned sat
[2021-05-13 11:12:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:26] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 11 places in 113 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 8 places in 128 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 16 places in 78 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 15 places in 60 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 28 places in 59 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 44 places in 59 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 25 places in 74 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 34 places in 58 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 45 places in 78 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 26 places in 66 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 17 places in 62 ms
[2021-05-13 11:12:27] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1092 ms
[2021-05-13 11:12:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:28] [INFO ] [Nat]Absence check using 31 positive place invariants in 78 ms returned sat
[2021-05-13 11:12:28] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 11 ms returned sat
[2021-05-13 11:12:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:28] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 12 places in 137 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 22 places in 121 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 8 places in 112 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 14 places in 98 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 10 places in 124 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 26 places in 80 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 34 places in 82 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 32 places in 103 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 24 places in 76 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 28 places in 98 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 70 places in 74 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 68 places in 74 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 17 places in 50 ms
[2021-05-13 11:12:29] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1469 ms
[2021-05-13 11:12:29] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 18 ms.
[2021-05-13 11:12:30] [INFO ] Added : 97 causal constraints over 20 iterations in 334 ms. Result :sat
[2021-05-13 11:12:30] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2021-05-13 11:12:30] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-13 11:12:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:30] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 15 places in 111 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 11 places in 94 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 24 places in 88 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 70 places in 87 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 9 places in 86 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 22 places in 82 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 15 places in 83 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 29 places in 85 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 33 places in 77 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 13 places in 67 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 39 places in 63 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 12 places in 83 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 33 places in 68 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 71 places in 66 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 37 places in 68 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 33 places in 64 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 34 places in 63 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 32 places in 64 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 76 places in 64 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 38 places in 103 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 69 places in 82 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 20 places in 68 ms
[2021-05-13 11:12:32] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1999 ms
[2021-05-13 11:12:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:32] [INFO ] [Nat]Absence check using 31 positive place invariants in 27 ms returned sat
[2021-05-13 11:12:32] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-13 11:12:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:32] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 15 places in 153 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 11 places in 87 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 24 places in 85 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 70 places in 88 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 9 places in 86 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 22 places in 84 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 15 places in 81 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 76 places in 80 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 22 places in 75 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 12 places in 76 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 33 places in 44 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 20 places in 42 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 13 places in 39 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 31 places in 30 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 39 places in 34 ms
[2021-05-13 11:12:34] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1302 ms
[2021-05-13 11:12:34] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 17 ms.
[2021-05-13 11:12:34] [INFO ] Added : 175 causal constraints over 35 iterations in 681 ms. Result :sat
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 73 places in 122 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 70 places in 91 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 67 places in 111 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 73 places in 116 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 69 places in 107 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 71 places in 106 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 72 places in 89 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 72 places in 82 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 70 places in 117 ms
[2021-05-13 11:12:36] [INFO ] Deduced a trap composed of 72 places in 113 ms
[2021-05-13 11:12:36] [INFO ] Deduced a trap composed of 74 places in 109 ms
[2021-05-13 11:12:36] [INFO ] Deduced a trap composed of 74 places in 104 ms
[2021-05-13 11:12:36] [INFO ] Deduced a trap composed of 79 places in 102 ms
[2021-05-13 11:12:36] [INFO ] Deduced a trap composed of 69 places in 105 ms
[2021-05-13 11:12:36] [INFO ] Deduced a trap composed of 72 places in 95 ms
[2021-05-13 11:12:36] [INFO ] Deduced a trap composed of 72 places in 98 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 70 places in 87 ms
[2021-05-13 11:12:37] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2416 ms
[2021-05-13 11:12:37] [INFO ] [Real]Absence check using 31 positive place invariants in 27 ms returned sat
[2021-05-13 11:12:37] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 6 ms returned sat
[2021-05-13 11:12:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:37] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 8 places in 115 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 30 places in 89 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 11 places in 116 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 15 places in 89 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 30 places in 87 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 35 places in 84 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 15 places in 83 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 48 places in 82 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 48 places in 76 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 52 places in 74 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 51 places in 76 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 71 places in 77 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 33 places in 76 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 51 places in 101 ms
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 23 places in 102 ms
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 12 places in 39 ms
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 37 places in 34 ms
[2021-05-13 11:12:39] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1616 ms
[2021-05-13 11:12:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:39] [INFO ] [Nat]Absence check using 31 positive place invariants in 36 ms returned sat
[2021-05-13 11:12:39] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-13 11:12:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:39] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 8 places in 109 ms
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 30 places in 91 ms
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 12 places in 86 ms
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 13 places in 82 ms
[2021-05-13 11:12:39] [INFO ] Deduced a trap composed of 15 places in 84 ms
[2021-05-13 11:12:40] [INFO ] Deduced a trap composed of 11 places in 84 ms
[2021-05-13 11:12:40] [INFO ] Deduced a trap composed of 22 places in 81 ms
[2021-05-13 11:12:40] [INFO ] Deduced a trap composed of 69 places in 78 ms
[2021-05-13 11:12:40] [INFO ] Deduced a trap composed of 14 places in 95 ms
[2021-05-13 11:12:40] [INFO ] Deduced a trap composed of 16 places in 81 ms
[2021-05-13 11:12:40] [INFO ] Deduced a trap composed of 28 places in 109 ms
[2021-05-13 11:12:40] [INFO ] Deduced a trap composed of 24 places in 89 ms
[2021-05-13 11:12:40] [INFO ] Deduced a trap composed of 72 places in 102 ms
[2021-05-13 11:12:40] [INFO ] Deduced a trap composed of 73 places in 83 ms
[2021-05-13 11:12:40] [INFO ] Deduced a trap composed of 72 places in 79 ms
[2021-05-13 11:12:41] [INFO ] Deduced a trap composed of 32 places in 79 ms
[2021-05-13 11:12:41] [INFO ] Deduced a trap composed of 23 places in 75 ms
[2021-05-13 11:12:41] [INFO ] Deduced a trap composed of 37 places in 60 ms
[2021-05-13 11:12:41] [INFO ] Deduced a trap composed of 46 places in 50 ms
[2021-05-13 11:12:41] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1836 ms
[2021-05-13 11:12:41] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 16 ms.
[2021-05-13 11:12:41] [INFO ] Added : 155 causal constraints over 31 iterations in 555 ms. Result :sat
[2021-05-13 11:12:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-13 11:12:42] [INFO ] Flatten gal took : 56 ms
[2021-05-13 11:12:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-13 11:12:42] [INFO ] Flatten gal took : 21 ms
FORMULA BusinessProcesses-PT-03-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 11:12:42] [INFO ] Applying decomposition
[2021-05-13 11:12:42] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph10655403511980361194.txt, -o, /tmp/graph10655403511980361194.bin, -w, /tmp/graph10655403511980361194.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph10655403511980361194.bin, -l, -1, -v, -w, /tmp/graph10655403511980361194.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 11:12:42] [INFO ] Decomposing Gal with order
[2021-05-13 11:12:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:12:42] [INFO ] Removed a total of 48 redundant transitions.
[2021-05-13 11:12:42] [INFO ] Flatten gal took : 54 ms
[2021-05-13 11:12:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-05-13 11:12:42] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 8 ms
[2021-05-13 11:12:42] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 6 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
built 43 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 4 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 37 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 16 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.4794e+13,0.177324,12080,1896,24,14766,497,616,21365,49,826,0


Converting to forward existential form...Done !
original formula: AG((EF((((((((((((((((((((((i1.i1.u77.p193==1)||(i17.u96.p240==1))||(((i3.i0.u9.p22==1)&&(i3.i1.u50.p124==1))&&(i17.u79.p273==1)))||(i17.u102.p252==1))||(((i8.i0.u25.p62==1)&&(i11.i3.u60.p150==1))&&(i8.i0.u101.p249==1)))||(i12.u47.p118==1))||(i17.u112.p272==1))||(i17.u79.p273==1))||(i13.i1.u54.p133==1))||(((i1.i0.u33.p85==1)&&(i8.i1.u75.p190==1))&&(i1.i0.u109.p265==1)))||(((i5.u13.p28==1)&&(i11.i3.u60.p149==1))&&(i17.u79.p273==1)))||(i17.u110.p267==1))||(i0.u31.p81==1))||(i2.u26.p65==1))||(((i3.i0.u7.p15==1)&&(i11.i1.u52.p129==1))&&(i17.u79.p273==1)))||(i5.u14.p36==1))||(i17.u79.p199==1))||(i0.u2.p6==1))||(((i16.u29.p73==1)&&(i16.u68.p170==1))&&(i2.u105.p257==1)))||(i10.i0.u41.p104==1))||(i16.u29.p75==1))) + ((E(AF(((((i11.i0.u44.p112==1)||(i11.i1.u27.p69==1))||(i17.u81.p207==1))||(i17.u80.p205==1))) U (i3.i0.u9.p23==1)) + (EX((((((((((((i4.u6.p16==1)||(i17.u99.p245==1))||(i17.u112.p272==1))||(i17.u79.p273==1))||(i1.i1.u78.p196==1))||(i3.i0.u10.p27==1))||(i17.u80.p205==1))||(((i3.i0.u7.p15==1)&&(i13.i1.u54.p134==1))&&(i17.u79.p273==1)))||(i10.i1.u69.p173==1))||(i5.u12.p31==1))&&((((i17.u106.p260==1)||(i2.u26.p65==1))||(i6.i3.u66.p166==1))||(i1.i1.u78.p196==1)))) * EG(AF(((((((((((i11.i0.u45.p114==1)||(((i8.i0.u23.p57==1)&&(i8.i1.u75.p189==1))&&(i17.u79.p273==1)))||(i1.i1.u77.p193==1))||(i17.u96.p240==1))||(i13.i0.u15.p39==1))||(i12.u48.p117==1))||(i16.u67.p171==1))||(i11.i0.u44.p111==1))||(i5.u11.p30==1))||(i14.u56.p141==1)))))) * (A((((((((((i1.i0.u32.p82==1)&&(i1.i1.u77.p194==1))&&(i17.u79.p273==1))||(i17.u96.p240==1))||(i17.u93.p234==1))||(i17.u112.p271==1))||(i8.i0.u101.p250==1))&&(((((i11.i1.u27.p67==1)&&(i11.i1.u52.p130==1))&&(i2.u103.p253==1))||(((i8.i0.u25.p62==1)&&(i11.i3.u60.p150==1))&&(i8.i0.u101.p249==1)))||(i0.u30.p77==1)))||(((((((((i11.i0.u45.p113==1)||(i2.u26.p66==1))||(i1.i0.u32.p84==1))||(i11.i0.u46.p116==1))||(i6.i0.u42.p107==1))||(i9.i1.u34.p90==1))||(i16.u29.p74==1))||(i17.u96.p239==1))&&((((((((i17.u99.p245==1)||(i9.i1.u0.p1==1))||(i17.u89.p225==1))||(i1.i1.u77.p193==1))||(i17.u81.p208==1))||(i1.i1.u78.p192==1))||(i9.i1.u34.p89==1))||(i3.i0.u10.p27==1)))) U A(((((((((i17.u106.p260==1)||(((i11.i1.u27.p67==1)&&(i11.i1.u52.p130==1))&&(i2.u103.p253==1)))||(i9.i1.u0.p1==1))||(((i4.u8.p20==1)&&(i3.i1.u50.p125==1))&&(i18.u82.p213==1)))||(i16.u67.p171==1))||(i15.u17.p44==1))||(((i5.u13.p28==1)&&(i11.i3.u60.p149==1))&&(i17.u79.p273==1)))||(i5.u12.p31==1)) U ((((i4.u6.p16==1)||(((i0.u30.p76==1)&&(i10.i3.u74.p184==1))&&(i17.u79.p273==1)))||(i8.i0.u25.p63==1))||(i5.u12.p31==1)))) + AF((((i9.i1.u39.p101==1)&&(i14.u55.p140==1))&&(i17.u79.p273==1)))))))
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * !(E(TRUE U (((((((((((((((((((((i1.i1.u77.p193==1)||(i17.u96.p240==1))||(((i3.i0.u9.p22==1)&&(i3.i1.u50.p124==1))&&(i17.u79.p273==1)))||(i17.u102.p252==1))||(((i8.i0.u25.p62==1)&&(i11.i3.u60.p150==1))&&(i8.i0.u101.p249==1)))||(i12.u47.p118==1))||(i17.u112.p272==1))||(i17.u79.p273==1))||(i13.i1.u54.p133==1))||(((i1.i0.u33.p85==1)&&(i8.i1.u75.p190==1))&&(i1.i0.u109.p265==1)))||(((i5.u13.p28==1)&&(i11.i3.u60.p149==1))&&(i17.u79.p273==1)))||(i17.u110.p267==1))||(i0.u31.p81==1))||(i2.u26.p65==1))||(((i3.i0.u7.p15==1)&&(i11.i1.u52.p129==1))&&(i17.u79.p273==1)))||(i5.u14.p36==1))||(i17.u79.p199==1))||(i0.u2.p6==1))||(((i16.u29.p73==1)&&(i16.u68.p170==1))&&(i2.u105.p257==1)))||(i10.i0.u41.p104==1))||(i16.u29.p75==1))))) * !((EX((((((((((((i4.u6.p16==1)||(i17.u99.p245==1))||(i17.u112.p272==1))||(i17.u79.p273==1))||(i1.i1.u78.p196==1))||(i3.i0.u10.p27==1))||(i17.u80.p205==1))||(((i3.i0.u7.p15==1)&&(i13.i1.u54.p134==1))&&(i17.u79.p273==1)))||(i10.i1.u69.p173==1))||(i5.u12.p31==1))&&((((i17.u106.p260==1)||(i2.u26.p65==1))||(i6.i3.u66.p166==1))||(i1.i1.u78.p196==1)))) * EG(!(EG(!(((((((((((i11.i0.u45.p114==1)||(((i8.i0.u23.p57==1)&&(i8.i1.u75.p189==1))&&(i17.u79.p273==1)))||(i1.i1.u77.p193==1))||(i17.u96.p240==1))||(i13.i0.u15.p39==1))||(i12.u48.p117==1))||(i16.u67.p171==1))||(i11.i0.u44.p111==1))||(i5.u11.p30==1))||(i14.u56.p141==1))))))))) * !(E(!(EG(!(((((i11.i0.u44.p112==1)||(i11.i1.u27.p69==1))||(i17.u81.p207==1))||(i17.u80.p205==1))))) U (i3.i0.u9.p23==1))))] = FALSE * [FwdG(((FwdU(Init,TRUE) * !(E(TRUE U (((((((((((((((((((((i1.i1.u77.p193==1)||(i17.u96.p240==1))||(((i3.i0.u9.p22==1)&&(i3.i1.u50.p124==1))&&(i17.u79.p273==1)))||(i17.u102.p252==1))||(((i8.i0.u25.p62==1)&&(i11.i3.u60.p150==1))&&(i8.i0.u101.p249==1)))||(i12.u47.p118==1))||(i17.u112.p272==1))||(i17.u79.p273==1))||(i13.i1.u54.p133==1))||(((i1.i0.u33.p85==1)&&(i8.i1.u75.p190==1))&&(i1.i0.u109.p265==1)))||(((i5.u13.p28==1)&&(i11.i3.u60.p149==1))&&(i17.u79.p273==1)))||(i17.u110.p267==1))||(i0.u31.p81==1))||(i2.u26.p65==1))||(((i3.i0.u7.p15==1)&&(i11.i1.u52.p129==1))&&(i17.u79.p273==1)))||(i5.u14.p36==1))||(i17.u79.p199==1))||(i0.u2.p6==1))||(((i16.u29.p73==1)&&(i16.u68.p170==1))&&(i2.u105.p257==1)))||(i10.i0.u41.p104==1))||(i16.u29.p75==1))))) * !(!((E(!(!((E(!(((((i4.u6.p16==1)||(((i0.u30.p76==1)&&(i10.i3.u74.p184==1))&&(i17.u79.p273==1)))||(i8.i0.u25.p63==1))||(i5.u12.p31==1))) U (!(((((((((i17.u106.p260==1)||(((i11.i1.u27.p67==1)&&(i11.i1.u52.p130==1))&&(i2.u103.p253==1)))||(i9.i1.u0.p1==1))||(((i4.u8.p20==1)&&(i3.i1.u50.p125==1))&&(i18.u82.p213==1)))||(i16.u67.p171==1))||(i15.u17.p44==1))||(((i5.u13.p28==1)&&(i11.i3.u60.p149==1))&&(i17.u79.p273==1)))||(i5.u12.p31==1))) * !(((((i4.u6.p16==1)||(((i0.u30.p76==1)&&(i10.i3.u74.p184==1))&&(i17.u79.p273==1)))||(i8.i0.u25.p63==1))||(i5.u12.p31==1))))) + EG(!(((((i4.u6.p16==1)||(((i0.u30.p76==1)&&(i10.i3.u74.p184==1))&&(i17.u79.p273==1)))||(i8.i0.u25.p63==1))||(i5.u12.p31==1))))))) U (!((((((((((i1.i0.u32.p82==1)&&(i1.i1.u77.p194==1))&&(i17.u79.p273==1))||(i17.u96.p240==1))||(i17.u93.p234==1))||(i17.u112.p271==1))||(i8.i0.u101.p250==1))&&(((((i11.i1.u27.p67==1)&&(i11.i1.u52.p130==1))&&(i2.u103.p253==1))||(((i8.i0.u25.p62==1)&&(i11.i3.u60.p150==1))&&(i8.i0.u101.p249==1)))||(i0.u30.p77==1)))||(((((((((i11.i0.u45.p113==1)||(i2.u26.p66==1))||(i1.i0.u32.p84==1))||(i11.i0.u46.p116==1))||(i6.i0.u42.p107==1))||(i9.i1.u34.p90==1))||(i16.u29.p74==1))||(i17.u96.p239==1))&&((((((((i17.u99.p245==1)||(i9.i1.u0.p1==1))||(i17.u89.p225==1))||(i1.i1.u77.p193==1))||(i17.u81.p208==1))||(i1.i1.u78.p192==1))||(i9.i1.u34.p89==1))||(i3.i0.u10.p27==1))))) * !(!((E(!(((((i4.u6.p16==1)||(((i0.u30.p76==1)&&(i10.i3.u74.p184==1))&&(i17.u79.p273==1)))||(i8.i0.u25.p63==1))||(i5.u12.p31==1))) U (!(((((((((i17.u106.p260==1)||(((i11.i1.u27.p67==1)&&(i11.i1.u52.p130==1))&&(i2.u103.p253==1)))||(i9.i1.u0.p1==1))||(((i4.u8.p20==1)&&(i3.i1.u50.p125==1))&&(i18.u82.p213==1)))||(i16.u67.p171==1))||(i15.u17.p44==1))||(((i5.u13.p28==1)&&(i11.i3.u60.p149==1))&&(i17.u79.p273==1)))||(i5.u12.p31==1))) * !(((((i4.u6.p16==1)||(((i0.u30.p76==1)&&(i10.i3.u74.p184==1))&&(i17.u79.p273==1)))||(i8.i0.u25.p63==1))||(i5.u12.p31==1))))) + EG(!(((((i4.u6.p16==1)||(((i0.u30.p76==1)&&(i10.i3.u74.p184==1))&&(i17.u79.p273==1)))||(i8.i0.u25.p63==1))||(i5.u12.p31==1))))))))) + EG(!(!((E(!(((((i4.u6.p16==1)||(((i0.u30.p76==1)&&(i10.i3.u74.p184==1))&&(i17.u79.p273==1)))||(i8.i0.u25.p63==1))||(i5.u12.p31==1))) U (!(((((((((i17.u106.p260==1)||(((i11.i1.u27.p67==1)&&(i11.i1.u52.p130==1))&&(i2.u103.p253==1)))||(i9.i1.u0.p1==1))||(((i4.u8.p20==1)&&(i3.i1.u50.p125==1))&&(i18.u82.p213==1)))||(i16.u67.p171==1))||(i15.u17.p44==1))||(((i5.u13.p28==1)&&(i11.i3.u60.p149==1))&&(i17.u79.p273==1)))||(i5.u12.p31==1))) * !(((((i4.u6.p16==1)||(((i0.u30.p76==1)&&(i10.i3.u74.p184==1))&&(i17.u79.p273==1)))||(i8.i0.u25.p63==1))||(i5.u12.p31==1))))) + EG(!(((((i4.u6.p16==1)||(((i0.u30.p76==1)&&(i10.i3.u74.p184==1))&&(i17.u79.p273==1)))||(i8.i0.u25.p63==1))||(i5.u12.p31==1)))))))))))),!((((i9.i1.u39.p101==1)&&(i14.u55.p140==1))&&(i17.u79.p273==1))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t137, t141, t157, t169, t179, i0.u30.t148, i1.i0.u32.t144, i1.i1.t71, i1.i1.u77.t72, i2.u26.t156, i2.u28.t152, i3.i0.t187, i3.i0.u7.t193, i3.i0.u9.t190, i3.i1.t127, i3.i1.u50.t128, i4.t195, i4.u8.t191, i5.t186, i5.t184, i5.u13.t182, i5.u14.t180, i6.i1.t103, i6.i1.u62.t104, i6.i2.t99, i6.i2.u63.t100, i6.i3.t95, i6.i3.u65.t96, i7.t166, i7.t163, i7.u20.t168, i8.i0.t160, i8.i0.u23.t162, i8.i1.t75, i8.i1.u75.t76, i9.i0.u36.t136, i9.i1.u34.t140, i10.i1.t87, i10.i1.u69.t88, i10.i2.t83, i10.i2.u72.t84, i10.i3.t79, i10.i3.u74.t80, i11.i1.t123, i11.i1.u52.t124, i11.i2.t111, i11.i2.u57.t112, i11.i3.t107, i11.i3.u60.t108, i12.t130, i12.u47.t131, i13.i0.u15.t178, i13.i1.t119, i13.i1.u54.t120, i14.t115, i14.u55.t116, i15.t174, i15.u18.t172, i16.t91, i16.u68.t92, i17.t55, i17.t51, i17.t47, i17.t40, i17.t36, i17.t33, i17.t31, i17.t28, i17.t26, i17.t23, i17.t21, i17.t18, i17.t15, i17.t12, i17.t9, i17.t6, i17.t3, i17.u79.t1, i18.t49, i18.u82.t53, i19.t42, i19.t38, i19.u87.t44, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/153/83/236
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,27.7307,658396,1,0,1.15943e+06,772,4724,2.31832e+06,285,1360,1596222
FORMULA BusinessProcesses-PT-03-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AF((AF(((((((((i17.u83.p211==1)||(((i1.i0.u32.p82==1)&&(i1.i1.u77.p194==1))&&(i17.u79.p273==1)))||(i1.i1.u77.p193==1))||(i17.u79.p273==1))||(i14.u55.p138==1))||(i13.i1.u53.p136==1))||(i16.u29.p74==1))||(i19.u88.p222==1))) * EF((((((((((((!(E((((((i6.i3.u66.p162==1)||(i9.i0.u37.p97==1))||(i1.i0.u32.p83==1))||(i6.i0.u42.p108==1))||(i17.u102.p251==1)) U ((i1.i0.u32.p84==1)||(i16.u29.p75==1)))) + (A(((((((((i11.i1.u27.p67==1)&&(i11.i1.u52.p130==1))&&(i2.u103.p253==1))||(i12.u47.p118==1))||(((i5.u13.p28==1)&&(i6.i1.u62.p154==1))&&(i17.u79.p273==1)))||(((i5.u13.p28==1)&&(i6.i2.u63.p159==1))&&(i17.u79.p273==1)))||(i3.i0.u86.p219==1))||(i17.u100.p248==1)) U (((i1.i0.u32.p83==1)||(i17.u81.p208==1))||(i10.i0.u41.p106==1))) * (((((i11.i3.u59.p151==1)||(((i5.u14.p35==1)&&(i11.i2.u57.p145==1))&&(i19.u87.p226==1)))||(i16.u29.p75==1))||(i7.u4.p11==1))||(i3.i1.u49.p126==1)))) + (i9.i1.u0.p1==1)) + (i9.i1.u1.p3==1)) + (i17.u89.p224==1)) + (i16.u67.p167==1)) + (i13.i0.u16.p41==1)) + (i10.i0.u41.p104==1)) + (i16.u67.p171==1)) + (i15.u17.p44==1)) + (i5.u11.p30==1)) + (i8.i0.u25.p63==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(((((((((i17.u83.p211==1)||(((i1.i0.u32.p82==1)&&(i1.i1.u77.p194==1))&&(i17.u79.p273==1)))||(i1.i1.u77.p193==1))||(i17.u79.p273==1))||(i14.u55.p138==1))||(i13.i1.u53.p136==1))||(i16.u29.p74==1))||(i19.u88.p222==1))))) * E(TRUE U (((((((((((!(E((((((i6.i3.u66.p162==1)||(i9.i0.u37.p97==1))||(i1.i0.u32.p83==1))||(i6.i0.u42.p108==1))||(i17.u102.p251==1)) U ((i1.i0.u32.p84==1)||(i16.u29.p75==1)))) + (!((E(!((((i1.i0.u32.p83==1)||(i17.u81.p208==1))||(i10.i0.u41.p106==1))) U (!(((((((((i11.i1.u27.p67==1)&&(i11.i1.u52.p130==1))&&(i2.u103.p253==1))||(i12.u47.p118==1))||(((i5.u13.p28==1)&&(i6.i1.u62.p154==1))&&(i17.u79.p273==1)))||(((i5.u13.p28==1)&&(i6.i2.u63.p159==1))&&(i17.u79.p273==1)))||(i3.i0.u86.p219==1))||(i17.u100.p248==1))) * !((((i1.i0.u32.p83==1)||(i17.u81.p208==1))||(i10.i0.u41.p106==1))))) + EG(!((((i1.i0.u32.p83==1)||(i17.u81.p208==1))||(i10.i0.u41.p106==1)))))) * (((((i11.i3.u59.p151==1)||(((i5.u14.p35==1)&&(i11.i2.u57.p145==1))&&(i19.u87.p226==1)))||(i16.u29.p75==1))||(i7.u4.p11==1))||(i3.i1.u49.p126==1)))) + (i9.i1.u0.p1==1)) + (i9.i1.u1.p3==1)) + (i17.u89.p224==1)) + (i16.u67.p167==1)) + (i13.i0.u16.p41==1)) + (i10.i0.u41.p104==1)) + (i16.u67.p171==1)) + (i15.u17.p44==1)) + (i5.u11.p30==1)) + (i8.i0.u25.p63==1))))))] = FALSE
(forward)formula 1,1,50.513,1192616,1,0,2.11411e+06,788,4975,3.92398e+06,285,1444,2641220
FORMULA BusinessProcesses-PT-03-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EF(AX(((((((((i17.u99.p246==1)||(i18.u84.p215==1))||(i17.u112.p272==1))||(i1.i0.u32.p84==1))||(i10.i0.u40.p103==1))||(i6.i0.u43.p109==1))||(((i13.i0.u15.p37==1)&&(i11.i2.u57.p144==1))&&(i17.u79.p273==1)))||(((i5.u14.p35==1)&&(i11.i2.u57.p145==1))&&(i19.u87.p226==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((((((((i17.u99.p246==1)||(i18.u84.p215==1))||(i17.u112.p272==1))||(i1.i0.u32.p84==1))||(i10.i0.u40.p103==1))||(i6.i0.u43.p109==1))||(((i13.i0.u15.p37==1)&&(i11.i2.u57.p144==1))&&(i17.u79.p273==1)))||(((i5.u14.p35==1)&&(i11.i2.u57.p145==1))&&(i19.u87.p226==1)))))))] != FALSE
(forward)formula 2,1,50.7862,1197896,1,0,2.12366e+06,788,5003,3.94715e+06,285,1444,2656163
FORMULA BusinessProcesses-PT-03-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EX(E(A(((!(EX(((((((i11.i2.u58.p146==1)||(i6.i2.u64.p161==1))||(i16.u67.p167==1))||(i3.i0.u9.p24==1))||(i8.i1.u76.p187==1))||(i13.i0.u92.p232==1)))) + ((((((i11.i1.u51.p131!=1)&&(i11.i3.u59.p151!=1))&&(i1.i0.u33.p87!=1))&&(i7.u4.p11!=1))&&(i19.u88.p223!=1))&&(i15.u18.p46!=1))) + (((((((((i17.u83.p211!=1)&&(i17.u89.p224!=1))&&(i11.i1.u27.p69!=1))&&(i17.u97.p242!=1))&&(i17.u80.p206!=1))&&(i1.i0.u109.p266!=1))&&(i6.i1.u61.p156!=1))&&(i17.u102.p251!=1))&&(((i5.u14.p35!=1)||(i11.i2.u57.p145!=1))||(i19.u87.p226!=1)))) U EG(((((((((i11.i0.u45.p114==1)||(i11.i0.u45.p113==1))||(i11.i1.u51.p127==1))||(i19.u87.p220==1))||(i1.i0.u32.p83==1))||(i11.i3.u60.p148==1))||(i17.u104.p255==1))||(((i2.u26.p64==1)&&(i6.i3.u65.p164==1))&&(i17.u79.p273==1))))) U EF((!(EF((((((((((i17.u99.p246==1)||(i3.i0.u7.p18==1))||(i12.u47.p118==1))||(i11.i3.u59.p151==1))||(i17.u100.p248==1))||(i15.u17.p45==1))||(i9.i1.u35.p92==1))||(i17.u80.p206==1))||(i5.u12.p31==1)))) + (AG((i13.i0.u16.p42==1)) * (((((((i11.i1.u51.p131==1)||(i1.i0.u32.p83==1))||(i17.u79.p197==1))||(i10.i0.u40.p103==1))||(i2.u105.p258==1))||(i3.i0.u9.p24==1))||(((i9.i1.u39.p101==1)&&(i14.u55.p140==1))&&(i17.u79.p273==1))))))))
=> equivalent forward existential formula: ([(FwdU(FwdU(EY(Init),!((E(!(EG(((((((((i11.i0.u45.p114==1)||(i11.i0.u45.p113==1))||(i11.i1.u51.p127==1))||(i19.u87.p220==1))||(i1.i0.u32.p83==1))||(i11.i3.u60.p148==1))||(i17.u104.p255==1))||(((i2.u26.p64==1)&&(i6.i3.u65.p164==1))&&(i17.u79.p273==1))))) U (!(((!(EX(((((((i11.i2.u58.p146==1)||(i6.i2.u64.p161==1))||(i16.u67.p167==1))||(i3.i0.u9.p24==1))||(i8.i1.u76.p187==1))||(i13.i0.u92.p232==1)))) + ((((((i11.i1.u51.p131!=1)&&(i11.i3.u59.p151!=1))&&(i1.i0.u33.p87!=1))&&(i7.u4.p11!=1))&&(i19.u88.p223!=1))&&(i15.u18.p46!=1))) + (((((((((i17.u83.p211!=1)&&(i17.u89.p224!=1))&&(i11.i1.u27.p69!=1))&&(i17.u97.p242!=1))&&(i17.u80.p206!=1))&&(i1.i0.u109.p266!=1))&&(i6.i1.u61.p156!=1))&&(i17.u102.p251!=1))&&(((i5.u14.p35!=1)||(i11.i2.u57.p145!=1))||(i19.u87.p226!=1))))) * !(EG(((((((((i11.i0.u45.p114==1)||(i11.i0.u45.p113==1))||(i11.i1.u51.p127==1))||(i19.u87.p220==1))||(i1.i0.u32.p83==1))||(i11.i3.u60.p148==1))||(i17.u104.p255==1))||(((i2.u26.p64==1)&&(i6.i3.u65.p164==1))&&(i17.u79.p273==1))))))) + EG(!(EG(((((((((i11.i0.u45.p114==1)||(i11.i0.u45.p113==1))||(i11.i1.u51.p127==1))||(i19.u87.p220==1))||(i1.i0.u32.p83==1))||(i11.i3.u60.p148==1))||(i17.u104.p255==1))||(((i2.u26.p64==1)&&(i6.i3.u65.p164==1))&&(i17.u79.p273==1))))))))),TRUE) * !(E(TRUE U (((((((((i17.u99.p246==1)||(i3.i0.u7.p18==1))||(i12.u47.p118==1))||(i11.i3.u59.p151==1))||(i17.u100.p248==1))||(i15.u17.p45==1))||(i9.i1.u35.p92==1))||(i17.u80.p206==1))||(i5.u12.p31==1)))))] != FALSE + [((FwdU(FwdU(EY(Init),!((E(!(EG(((((((((i11.i0.u45.p114==1)||(i11.i0.u45.p113==1))||(i11.i1.u51.p127==1))||(i19.u87.p220==1))||(i1.i0.u32.p83==1))||(i11.i3.u60.p148==1))||(i17.u104.p255==1))||(((i2.u26.p64==1)&&(i6.i3.u65.p164==1))&&(i17.u79.p273==1))))) U (!(((!(EX(((((((i11.i2.u58.p146==1)||(i6.i2.u64.p161==1))||(i16.u67.p167==1))||(i3.i0.u9.p24==1))||(i8.i1.u76.p187==1))||(i13.i0.u92.p232==1)))) + ((((((i11.i1.u51.p131!=1)&&(i11.i3.u59.p151!=1))&&(i1.i0.u33.p87!=1))&&(i7.u4.p11!=1))&&(i19.u88.p223!=1))&&(i15.u18.p46!=1))) + (((((((((i17.u83.p211!=1)&&(i17.u89.p224!=1))&&(i11.i1.u27.p69!=1))&&(i17.u97.p242!=1))&&(i17.u80.p206!=1))&&(i1.i0.u109.p266!=1))&&(i6.i1.u61.p156!=1))&&(i17.u102.p251!=1))&&(((i5.u14.p35!=1)||(i11.i2.u57.p145!=1))||(i19.u87.p226!=1))))) * !(EG(((((((((i11.i0.u45.p114==1)||(i11.i0.u45.p113==1))||(i11.i1.u51.p127==1))||(i19.u87.p220==1))||(i1.i0.u32.p83==1))||(i11.i3.u60.p148==1))||(i17.u104.p255==1))||(((i2.u26.p64==1)&&(i6.i3.u65.p164==1))&&(i17.u79.p273==1))))))) + EG(!(EG(((((((((i11.i0.u45.p114==1)||(i11.i0.u45.p113==1))||(i11.i1.u51.p127==1))||(i19.u87.p220==1))||(i1.i0.u32.p83==1))||(i11.i3.u60.p148==1))||(i17.u104.p255==1))||(((i2.u26.p64==1)&&(i6.i3.u65.p164==1))&&(i17.u79.p273==1))))))))),TRUE) * (((((((i11.i1.u51.p131==1)||(i1.i0.u32.p83==1))||(i17.u79.p197==1))||(i10.i0.u40.p103==1))||(i2.u105.p258==1))||(i3.i0.u9.p24==1))||(((i9.i1.u39.p101==1)&&(i14.u55.p140==1))&&(i17.u79.p273==1)))) * !(E(TRUE U !((i13.i0.u16.p42==1)))))] != FALSE)
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 3,1,169.873,2206076,1,0,3.65189e+06,804,2378,7.85354e+06,160,1681,787084
FORMULA BusinessProcesses-PT-03-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EG(A((((((((i17.u79.p273==1)||(i17.u91.p229==1))||(i17.u94.p235==1))||(i13.i0.u16.p42==1))||(i6.i2.u63.p158==1))||(i15.u95.p238==1))||(((i5.u14.p35==1)&&(i11.i2.u57.p145==1))&&(i19.u87.p226==1))) U (((((((((((((((((((i9.i1.u1.p4==1)||(i11.i1.u27.p69==1))||(i2.u105.p258==1))||(i11.i3.u60.p148==1))||(i15.u17.p45==1))||(i11.i2.u57.p143==1)) + EF(((((i4.u6.p17==1)||(i11.i1.u27.p68==1))||(i2.u105.p258==1))||(i19.u87.p221==1)))) + (i5.u12.p32==1)) + (i11.i1.u51.p131==1)) + (i10.i2.u72.p178==1)) + (i17.u108.p263==1)) + (i17.u79.p199==1)) + (i17.u102.p252==1)) + (i3.i0.u5.p13==1)) + (((i4.u8.p20==1)&&(i3.i1.u50.p125==1))&&(i18.u82.p213==1))) + (((i9.i1.u35.p91==1)&&(i1.i1.u77.p195==1))&&(i9.i1.u111.p269==1))) + (((i5.u14.p35==1)&&(i11.i2.u57.p145==1))&&(i19.u87.p226==1))) + (((i9.i1.u34.p88==1)&&(i14.u55.p139==1))&&(i17.u79.p273==1))) + (((i1.i0.u33.p85==1)&&(i8.i1.u75.p190==1))&&(i1.i0.u109.p265==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!((((((((((((((((((((i9.i1.u1.p4==1)||(i11.i1.u27.p69==1))||(i2.u105.p258==1))||(i11.i3.u60.p148==1))||(i15.u17.p45==1))||(i11.i2.u57.p143==1)) + E(TRUE U ((((i4.u6.p17==1)||(i11.i1.u27.p68==1))||(i2.u105.p258==1))||(i19.u87.p221==1)))) + (i5.u12.p32==1)) + (i11.i1.u51.p131==1)) + (i10.i2.u72.p178==1)) + (i17.u108.p263==1)) + (i17.u79.p199==1)) + (i17.u102.p252==1)) + (i3.i0.u5.p13==1)) + (((i4.u8.p20==1)&&(i3.i1.u50.p125==1))&&(i18.u82.p213==1))) + (((i9.i1.u35.p91==1)&&(i1.i1.u77.p195==1))&&(i9.i1.u111.p269==1))) + (((i5.u14.p35==1)&&(i11.i2.u57.p145==1))&&(i19.u87.p226==1))) + (((i9.i1.u34.p88==1)&&(i14.u55.p139==1))&&(i17.u79.p273==1))) + (((i1.i0.u33.p85==1)&&(i8.i1.u75.p190==1))&&(i1.i0.u109.p265==1)))) U (!((((((((i17.u79.p273==1)||(i17.u91.p229==1))||(i17.u94.p235==1))||(i13.i0.u16.p42==1))||(i6.i2.u63.p158==1))||(i15.u95.p238==1))||(((i5.u14.p35==1)&&(i11.i2.u57.p145==1))&&(i19.u87.p226==1)))) * !((((((((((((((((((((i9.i1.u1.p4==1)||(i11.i1.u27.p69==1))||(i2.u105.p258==1))||(i11.i3.u60.p148==1))||(i15.u17.p45==1))||(i11.i2.u57.p143==1)) + E(TRUE U ((((i4.u6.p17==1)||(i11.i1.u27.p68==1))||(i2.u105.p258==1))||(i19.u87.p221==1)))) + (i5.u12.p32==1)) + (i11.i1.u51.p131==1)) + (i10.i2.u72.p178==1)) + (i17.u108.p263==1)) + (i17.u79.p199==1)) + (i17.u102.p252==1)) + (i3.i0.u5.p13==1)) + (((i4.u8.p20==1)&&(i3.i1.u50.p125==1))&&(i18.u82.p213==1))) + (((i9.i1.u35.p91==1)&&(i1.i1.u77.p195==1))&&(i9.i1.u111.p269==1))) + (((i5.u14.p35==1)&&(i11.i2.u57.p145==1))&&(i19.u87.p226==1))) + (((i9.i1.u34.p88==1)&&(i14.u55.p139==1))&&(i17.u79.p273==1))) + (((i1.i0.u33.p85==1)&&(i8.i1.u75.p190==1))&&(i1.i0.u109.p265==1)))))) + EG(!((((((((((((((((((((i9.i1.u1.p4==1)||(i11.i1.u27.p69==1))||(i2.u105.p258==1))||(i11.i3.u60.p148==1))||(i15.u17.p45==1))||(i11.i2.u57.p143==1)) + E(TRUE U ((((i4.u6.p17==1)||(i11.i1.u27.p68==1))||(i2.u105.p258==1))||(i19.u87.p221==1)))) + (i5.u12.p32==1)) + (i11.i1.u51.p131==1)) + (i10.i2.u72.p178==1)) + (i17.u108.p263==1)) + (i17.u79.p199==1)) + (i17.u102.p252==1)) + (i3.i0.u5.p13==1)) + (((i4.u8.p20==1)&&(i3.i1.u50.p125==1))&&(i18.u82.p213==1))) + (((i9.i1.u35.p91==1)&&(i1.i1.u77.p195==1))&&(i9.i1.u111.p269==1))) + (((i5.u14.p35==1)&&(i11.i2.u57.p145==1))&&(i19.u87.p226==1))) + (((i9.i1.u34.p88==1)&&(i14.u55.p139==1))&&(i17.u79.p273==1))) + (((i1.i0.u33.p85==1)&&(i8.i1.u75.p190==1))&&(i1.i0.u109.p265==1))))))))] != FALSE
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 4,1,194.211,2206076,1,0,3.65189e+06,1037,3205,7.85354e+06,186,2252,2286690
FORMULA BusinessProcesses-PT-03-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (!(AG(E((((((((i17.u83.p211==1)||(i4.u6.p17==1))||(i10.i3.u74.p183==1))||(i14.u38.p100==1))||(((i0.u31.p79==1)&&(i10.i2.u72.p180==1))&&(i0.u107.p261==1)))||(i16.u29.p74==1))||(i19.u88.p222==1)) U (EF(((((((i3.i0.u7.p18==1)||(i16.u67.p171==1))||(i8.i0.u23.p59==1))||(i3.i0.u10.p27==1))||(i17.u108.p264==1))||(i11.i1.u51.p127==1))) + !(AG((((((i17.u100.p247==1)||(i17.u93.p234==1))||(i16.u29.p75==1))||(i17.u81.p207==1))||(i17.u94.p236==1)))))))) + (!(AX((((((((i10.i1.u70.p176==1)||(i17.u91.p229==1))||(i11.i0.u46.p116==1))||(i17.u79.p197==1))||(i17.u112.p271==1))||(i3.i0.u5.p14==1))||(((i3.i0.u7.p15==1)&&(i13.i1.u54.p134==1))&&(i17.u79.p273==1))))) * (!(EG(E(((((((((((i11.i1.u52.p128==1)||(i17.u99.p246==1))||(i1.i0.u32.p83==1))||(i3.i0.u7.p18==1))||(i9.i1.u39.p98==1))||(i3.i0.u86.p219==1))||(i3.i0.u10.p27==1))||(((i3.i0.u10.p25==1)&&(i12.u47.p120==1))&&(i3.i0.u86.p218==1)))||(i15.u18.p46==1))&&((((((((i4.u6.p16==1)||(i18.u82.p210==1))||(i4.u6.p17==1))||(i17.u79.p198==1))||(i17.u79.p197==1))||(i17.u94.p235==1))||(i17.u110.p268==1))||(i8.i1.u76.p191==1))) U (i8.i1.u76.p191!=1)))) + !(EG(((((((((((i18.u82.p209==1)||(i9.i1.u0.p2==1))||(i6.i3.u66.p166==1))||(i18.u84.p214==1))||(i2.u28.p71==1))||(((i13.i0.u15.p37==1)&&(i11.i2.u57.p144==1))&&(i17.u79.p273==1)))||(i17.u79.p201==1))||(i6.i2.u63.p158==1))||(i6.i0.u42.p108==1))||(i14.u56.p141==1)))))))
=> equivalent forward existential formula: ([((Init * !(!(!(E(TRUE U !(E((((((((i17.u83.p211==1)||(i4.u6.p17==1))||(i10.i3.u74.p183==1))||(i14.u38.p100==1))||(((i0.u31.p79==1)&&(i10.i2.u72.p180==1))&&(i0.u107.p261==1)))||(i16.u29.p74==1))||(i19.u88.p222==1)) U (E(TRUE U ((((((i3.i0.u7.p18==1)||(i16.u67.p171==1))||(i8.i0.u23.p59==1))||(i3.i0.u10.p27==1))||(i17.u108.p264==1))||(i11.i1.u51.p127==1))) + !(!(E(TRUE U !((((((i17.u100.p247==1)||(i17.u93.p234==1))||(i16.u29.p75==1))||(i17.u81.p207==1))||(i17.u94.p236==1)))))))))))))) * !(EX(!((((((((i10.i1.u70.p176==1)||(i17.u91.p229==1))||(i11.i0.u46.p116==1))||(i17.u79.p197==1))||(i17.u112.p271==1))||(i3.i0.u5.p14==1))||(((i3.i0.u7.p15==1)&&(i13.i1.u54.p134==1))&&(i17.u79.p273==1)))))))] = FALSE * [FwdG(((Init * !(!(!(E(TRUE U !(E((((((((i17.u83.p211==1)||(i4.u6.p17==1))||(i10.i3.u74.p183==1))||(i14.u38.p100==1))||(((i0.u31.p79==1)&&(i10.i2.u72.p180==1))&&(i0.u107.p261==1)))||(i16.u29.p74==1))||(i19.u88.p222==1)) U (E(TRUE U ((((((i3.i0.u7.p18==1)||(i16.u67.p171==1))||(i8.i0.u23.p59==1))||(i3.i0.u10.p27==1))||(i17.u108.p264==1))||(i11.i1.u51.p127==1))) + !(!(E(TRUE U !((((((i17.u100.p247==1)||(i17.u93.p234==1))||(i16.u29.p75==1))||(i17.u81.p207==1))||(i17.u94.p236==1)))))))))))))) * !(!(EG(E(((((((((((i11.i1.u52.p128==1)||(i17.u99.p246==1))||(i1.i0.u32.p83==1))||(i3.i0.u7.p18==1))||(i9.i1.u39.p98==1))||(i3.i0.u86.p219==1))||(i3.i0.u10.p27==1))||(((i3.i0.u10.p25==1)&&(i12.u47.p120==1))&&(i3.i0.u86.p218==1)))||(i15.u18.p46==1))&&((((((((i4.u6.p16==1)||(i18.u82.p210==1))||(i4.u6.p17==1))||(i17.u79.p198==1))||(i17.u79.p197==1))||(i17.u94.p235==1))||(i17.u110.p268==1))||(i8.i1.u76.p191==1))) U (i8.i1.u76.p191!=1)))))),((((((((((i18.u82.p209==1)||(i9.i1.u0.p2==1))||(i6.i3.u66.p166==1))||(i18.u84.p214==1))||(i2.u28.p71==1))||(((i13.i0.u15.p37==1)&&(i11.i2.u57.p144==1))&&(i17.u79.p273==1)))||(i17.u79.p201==1))||(i6.i2.u63.p158==1))||(i6.i0.u42.p108==1))||(i14.u56.p141==1)))] = FALSE)
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 5,0,215.92,2206076,1,0,3.65189e+06,1052,3521,7.85354e+06,189,2311,2984005
FORMULA BusinessProcesses-PT-03-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EF(((((((i17.u83.p211==1)||(i3.i0.u7.p19==1))||(i12.u48.p117==1))||(i6.i0.u42.p107==1))&&(((((((i13.i0.u15.p39==1)||(i9.i1.u34.p89==1))||(i13.i0.u92.p232==1))||(i17.u96.p239==1))||(i17.u108.p264==1))||(i14.u56.p141==1))||(((i9.i1.u39.p101==1)&&(i14.u55.p140==1))&&(i17.u79.p273==1)))) * ((((((((i6.i3.u66.p162==1)||(i10.i2.u71.p177==1))||(i17.u81.p208==1))||(i2.u3.p7==1))||(i7.u22.p56==1))||(i7.u4.p10==1))||(i6.i1.u61.p156==1)) + ((A((((i7.u21.p54==1)||(i16.u29.p74==1))||(i11.i2.u57.p143==1)) U (((((i17.u99.p246==1)||(i10.i1.u70.p176==1))||(i17.u97.p242==1))||(i8.i1.u76.p191==1))||(i17.u102.p251==1))) * (AG((((((i7.u98.p244==1)||(i11.i1.u27.p68==1))||(i3.i1.u49.p122==1))||(i17.u102.p252==1))||(i10.i1.u70.p172==1))) + !(E((((i1.i1.u77.p193==1)||(((i16.u29.p73==1)&&(i16.u68.p170==1))&&(i2.u105.p257==1)))||(i10.i1.u70.p172==1)) U ((((i5.u12.p32==1)||(i17.u99.p246==1))||(((i1.i0.u32.p82==1)&&(i1.i1.u77.p194==1))&&(i17.u79.p273==1)))||(i1.i0.u109.p266==1)))))) * (((i11.i2.u57.p143!=1)&&(((i5.u14.p35!=1)||(i11.i2.u57.p145!=1))||(i19.u87.p226!=1)))||((((((((((i19.u90.p227!=1)&&(i9.i1.u0.p0!=1))&&(i17.u108.p263!=1))&&(i17.u81.p208!=1))&&(i1.i0.u33.p86!=1))&&(i10.i1.u69.p173!=1))&&(i5.u11.p30!=1))&&(i8.i1.u75.p188!=1))&&(((i8.i0.u23.p57!=1)||(i8.i1.u75.p189!=1))||(i17.u79.p273!=1)))&&(((i9.i0.u36.p94!=1)||(i12.u47.p119!=1))||(i17.u79.p273!=1))))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (((((i17.u83.p211==1)||(i3.i0.u7.p19==1))||(i12.u48.p117==1))||(i6.i0.u42.p107==1))&&(((((((i13.i0.u15.p39==1)||(i9.i1.u34.p89==1))||(i13.i0.u92.p232==1))||(i17.u96.p239==1))||(i17.u108.p264==1))||(i14.u56.p141==1))||(((i9.i1.u39.p101==1)&&(i14.u55.p140==1))&&(i17.u79.p273==1))))) * (((((((i6.i3.u66.p162==1)||(i10.i2.u71.p177==1))||(i17.u81.p208==1))||(i2.u3.p7==1))||(i7.u22.p56==1))||(i7.u4.p10==1))||(i6.i1.u61.p156==1)))] != FALSE + ([((((FwdU(Init,TRUE) * (((((i17.u83.p211==1)||(i3.i0.u7.p19==1))||(i12.u48.p117==1))||(i6.i0.u42.p107==1))&&(((((((i13.i0.u15.p39==1)||(i9.i1.u34.p89==1))||(i13.i0.u92.p232==1))||(i17.u96.p239==1))||(i17.u108.p264==1))||(i14.u56.p141==1))||(((i9.i1.u39.p101==1)&&(i14.u55.p140==1))&&(i17.u79.p273==1))))) * (((i11.i2.u57.p143!=1)&&(((i5.u14.p35!=1)||(i11.i2.u57.p145!=1))||(i19.u87.p226!=1)))||((((((((((i19.u90.p227!=1)&&(i9.i1.u0.p0!=1))&&(i17.u108.p263!=1))&&(i17.u81.p208!=1))&&(i1.i0.u33.p86!=1))&&(i10.i1.u69.p173!=1))&&(i5.u11.p30!=1))&&(i8.i1.u75.p188!=1))&&(((i8.i0.u23.p57!=1)||(i8.i1.u75.p189!=1))||(i17.u79.p273!=1)))&&(((i9.i0.u36.p94!=1)||(i12.u47.p119!=1))||(i17.u79.p273!=1))))) * !((E(!((((((i17.u99.p246==1)||(i10.i1.u70.p176==1))||(i17.u97.p242==1))||(i8.i1.u76.p191==1))||(i17.u102.p251==1))) U (!((((i7.u21.p54==1)||(i16.u29.p74==1))||(i11.i2.u57.p143==1))) * !((((((i17.u99.p246==1)||(i10.i1.u70.p176==1))||(i17.u97.p242==1))||(i8.i1.u76.p191==1))||(i17.u102.p251==1))))) + EG(!((((((i17.u99.p246==1)||(i10.i1.u70.p176==1))||(i17.u97.p242==1))||(i8.i1.u76.p191==1))||(i17.u102.p251==1))))))) * !(E(TRUE U !((((((i7.u98.p244==1)||(i11.i1.u27.p68==1))||(i3.i1.u49.p122==1))||(i17.u102.p252==1))||(i10.i1.u70.p172==1))))))] != FALSE + [((((FwdU(Init,TRUE) * (((((i17.u83.p211==1)||(i3.i0.u7.p19==1))||(i12.u48.p117==1))||(i6.i0.u42.p107==1))&&(((((((i13.i0.u15.p39==1)||(i9.i1.u34.p89==1))||(i13.i0.u92.p232==1))||(i17.u96.p239==1))||(i17.u108.p264==1))||(i14.u56.p141==1))||(((i9.i1.u39.p101==1)&&(i14.u55.p140==1))&&(i17.u79.p273==1))))) * (((i11.i2.u57.p143!=1)&&(((i5.u14.p35!=1)||(i11.i2.u57.p145!=1))||(i19.u87.p226!=1)))||((((((((((i19.u90.p227!=1)&&(i9.i1.u0.p0!=1))&&(i17.u108.p263!=1))&&(i17.u81.p208!=1))&&(i1.i0.u33.p86!=1))&&(i10.i1.u69.p173!=1))&&(i5.u11.p30!=1))&&(i8.i1.u75.p188!=1))&&(((i8.i0.u23.p57!=1)||(i8.i1.u75.p189!=1))||(i17.u79.p273!=1)))&&(((i9.i0.u36.p94!=1)||(i12.u47.p119!=1))||(i17.u79.p273!=1))))) * !((E(!((((((i17.u99.p246==1)||(i10.i1.u70.p176==1))||(i17.u97.p242==1))||(i8.i1.u76.p191==1))||(i17.u102.p251==1))) U (!((((i7.u21.p54==1)||(i16.u29.p74==1))||(i11.i2.u57.p143==1))) * !((((((i17.u99.p246==1)||(i10.i1.u70.p176==1))||(i17.u97.p242==1))||(i8.i1.u76.p191==1))||(i17.u102.p251==1))))) + EG(!((((((i17.u99.p246==1)||(i10.i1.u70.p176==1))||(i17.u97.p242==1))||(i8.i1.u76.p191==1))||(i17.u102.p251==1))))))) * !(E((((i1.i1.u77.p193==1)||(((i16.u29.p73==1)&&(i16.u68.p170==1))&&(i2.u105.p257==1)))||(i10.i1.u70.p172==1)) U ((((i5.u12.p32==1)||(i17.u99.p246==1))||(((i1.i0.u32.p82==1)&&(i1.i1.u77.p194==1))&&(i17.u79.p273==1)))||(i1.i0.u109.p266==1)))))] != FALSE))
(forward)formula 6,1,215.94,2206076,1,0,3.65189e+06,1052,3581,7.85354e+06,189,2311,2990193
FORMULA BusinessProcesses-PT-03-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EX(EF((((i13.i0.u15.p38==1)||(i8.i0.u25.p63==1))||(((i5.u13.p28==1)&&(i6.i1.u62.p154==1))&&(i17.u79.p273==1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * (((i13.i0.u15.p38==1)||(i8.i0.u25.p63==1))||(((i5.u13.p28==1)&&(i6.i1.u62.p154==1))&&(i17.u79.p273==1))))] != FALSE
(forward)formula 7,1,215.942,2206076,1,0,3.65189e+06,1052,3594,7.85354e+06,189,2311,2991760
FORMULA BusinessProcesses-PT-03-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EG(A((((((i7.u22.p56==1)||(i8.i0.u23.p59==1))||(i13.i0.u16.p42==1))||(i17.u81.p207==1))||(i15.u18.p47==1)) U E((((((((((((((((i2.u28.p72!=1)&&(i17.u97.p241!=1))&&(i11.i0.u46.p116!=1))&&(i12.u48.p117!=1))&&(i14.u55.p138!=1))&&(i6.i1.u61.p156!=1))&&(i6.i2.u64.p157!=1))&&(i6.i3.u66.p162!=1))&&(i5.u13.p34!=1))&&(i17.u96.p240!=1))&&(i9.i1.u34.p89!=1))&&(i11.i0.u44.p111!=1))&&(i15.u95.p238!=1))&&(((i9.i1.u39.p101!=1)||(i14.u55.p140!=1))||(i17.u79.p273!=1)))&&(((i13.i0.u16.p40!=1)||(i13.i1.u54.p135!=1))||(i13.i0.u92.p231!=1))) U AG(EX(((((i10.i3.u73.p182==1)||(i17.u93.p234==1))||(i10.i0.u41.p105==1))||(i8.i1.u76.p191==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(E((((((((((((((((i2.u28.p72!=1)&&(i17.u97.p241!=1))&&(i11.i0.u46.p116!=1))&&(i12.u48.p117!=1))&&(i14.u55.p138!=1))&&(i6.i1.u61.p156!=1))&&(i6.i2.u64.p157!=1))&&(i6.i3.u66.p162!=1))&&(i5.u13.p34!=1))&&(i17.u96.p240!=1))&&(i9.i1.u34.p89!=1))&&(i11.i0.u44.p111!=1))&&(i15.u95.p238!=1))&&(((i9.i1.u39.p101!=1)||(i14.u55.p140!=1))||(i17.u79.p273!=1)))&&(((i13.i0.u16.p40!=1)||(i13.i1.u54.p135!=1))||(i13.i0.u92.p231!=1))) U !(E(TRUE U !(EX(((((i10.i3.u73.p182==1)||(i17.u93.p234==1))||(i10.i0.u41.p105==1))||(i8.i1.u76.p191==1)))))))) U (!((((((i7.u22.p56==1)||(i8.i0.u23.p59==1))||(i13.i0.u16.p42==1))||(i17.u81.p207==1))||(i15.u18.p47==1))) * !(E((((((((((((((((i2.u28.p72!=1)&&(i17.u97.p241!=1))&&(i11.i0.u46.p116!=1))&&(i12.u48.p117!=1))&&(i14.u55.p138!=1))&&(i6.i1.u61.p156!=1))&&(i6.i2.u64.p157!=1))&&(i6.i3.u66.p162!=1))&&(i5.u13.p34!=1))&&(i17.u96.p240!=1))&&(i9.i1.u34.p89!=1))&&(i11.i0.u44.p111!=1))&&(i15.u95.p238!=1))&&(((i9.i1.u39.p101!=1)||(i14.u55.p140!=1))||(i17.u79.p273!=1)))&&(((i13.i0.u16.p40!=1)||(i13.i1.u54.p135!=1))||(i13.i0.u92.p231!=1))) U !(E(TRUE U !(EX(((((i10.i3.u73.p182==1)||(i17.u93.p234==1))||(i10.i0.u41.p105==1))||(i8.i1.u76.p191==1)))))))))) + EG(!(E((((((((((((((((i2.u28.p72!=1)&&(i17.u97.p241!=1))&&(i11.i0.u46.p116!=1))&&(i12.u48.p117!=1))&&(i14.u55.p138!=1))&&(i6.i1.u61.p156!=1))&&(i6.i2.u64.p157!=1))&&(i6.i3.u66.p162!=1))&&(i5.u13.p34!=1))&&(i17.u96.p240!=1))&&(i9.i1.u34.p89!=1))&&(i11.i0.u44.p111!=1))&&(i15.u95.p238!=1))&&(((i9.i1.u39.p101!=1)||(i14.u55.p140!=1))||(i17.u79.p273!=1)))&&(((i13.i0.u16.p40!=1)||(i13.i1.u54.p135!=1))||(i13.i0.u92.p231!=1))) U !(E(TRUE U !(EX(((((i10.i3.u73.p182==1)||(i17.u93.p234==1))||(i10.i0.u41.p105==1))||(i8.i1.u76.p191==1))))))))))))] != FALSE
(forward)formula 8,0,222.783,2206076,1,0,3.65189e+06,1054,3726,7.85354e+06,192,2317,3290257
FORMULA BusinessProcesses-PT-03-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E((EX(((((((((i8.i0.u25.p62==1)&&(i11.i3.u60.p150==1))&&(i8.i0.u101.p249==1))||(i10.i0.u41.p106==1))||(((i13.i0.u15.p37==1)&&(i11.i2.u57.p144==1))&&(i17.u79.p273==1)))||(i10.i1.u70.p172==1))||((((((((((i11.i1.u27.p69==1)||(i4.u8.p21==1))||(i10.i3.u73.p186==1))||(i13.i1.u53.p136==1))||(i3.i0.u5.p13==1))&&((((((((((i5.u13.p28==1)&&(i6.i2.u63.p159==1))&&(i17.u79.p273==1))||(i11.i1.u27.p68==1))||(((i15.u18.p43==1)&&(i16.u68.p169==1))&&(i17.u79.p273==1)))||(((i2.u28.p70==1)&&(i10.i1.u69.p174==1))&&(i17.u79.p273==1)))||(i3.i1.u49.p122==1))||(i17.u85.p217==1))||(i13.i0.u16.p42==1))||(i0.u30.p78==1)))&&(i4.u6.p16!=1))&&(i11.i3.u59.p151!=1))&&(((i9.i1.u35.p91!=1)||(i1.i1.u77.p195!=1))||(i9.i1.u111.p269!=1)))&&(i7.u21.p54!=1))) + EG((((i13.i0.u15.p39==1)||(((i5.u13.p28==1)&&(i11.i3.u60.p149==1))&&(i17.u79.p273==1)))&&(((((i11.i2.u58.p146==1)||(i6.i0.u42.p107==1))||(i2.u103.p254==1))||(i9.i1.u111.p270==1))||(i1.i0.u109.p266==1)))))) + (EF(!(AX(((((((((((i11.i2.u58.p146==1)||(i2.u26.p65==1))||(i9.i1.u39.p98==1))||(i12.u47.p118==1))||(((i9.i0.u36.p94==1)&&(i12.u47.p119==1))&&(i17.u79.p273==1)))||(i16.u67.p171==1))||(i7.u4.p10==1))||(i8.i0.u23.p58==1))||(i17.u108.p264==1))||(i8.i0.u24.p60==1))))) * (((i10.i1.u70.p176==1)||(i15.u18.p46==1)) + EG(AF((((((((((i19.u90.p227==1)||(i11.i2.u58.p146==1))||(i9.i1.u0.p1==1))||(i1.i0.u33.p86==1))||(i17.u94.p235==1))||(i6.i2.u63.p158==1))||(i17.u81.p207==1))||(((i3.i0.u7.p15==1)&&(i13.i1.u54.p134==1))&&(i17.u79.p273==1)))||(((i5.u13.p28==1)&&(i11.i3.u60.p149==1))&&(i17.u79.p273==1)))))))) U AG((EG((((((i1.i1.u77.p193==1)||(i5.u14.p36==1))||(i14.u38.p100==1))||(i3.i0.u5.p14==1))&&(i9.i1.u34.p90!=1))) * ((((((((((i5.u13.p33!=1)&&(i17.u112.p272!=1))&&(i2.u3.p7!=1))&&(i12.u48.p117!=1))&&(i10.i0.u41.p104!=1))&&(i15.u17.p45!=1))&&(i10.i1.u70.p172!=1))&&(((i3.i0.u7.p15!=1)||(i11.i1.u52.p129!=1))||(i17.u79.p273!=1)))&&(((i11.i1.u27.p67!=1)||(i11.i1.u52.p130!=1))||(i2.u103.p253!=1)))||(((((((((((i9.i0.u37.p97==1)||(i9.i1.u0.p1==1))||(i6.i3.u65.p163==1))||(i11.i1.u52.p128==1))||(i11.i1.u27.p69==1))||(i7.u22.p56==1))||(i14.u56.p137==1))||(i13.i0.u16.p42==1))||(i5.u11.p29==1))||(((i2.u26.p64==1)&&(i6.i3.u65.p164==1))&&(i17.u79.p273==1)))&&((((((i9.i1.u0.p2==1)||(i17.u89.p224==1))||(i17.u93.p234==1))||(i17.u93.p233==1))||(((i5.u13.p28==1)&&(i6.i1.u62.p154==1))&&(i17.u79.p273==1)))||(((i3.i0.u10.p25==1)&&(i12.u47.p120==1))&&(i3.i0.u86.p218==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,(EX(((((((((i8.i0.u25.p62==1)&&(i11.i3.u60.p150==1))&&(i8.i0.u101.p249==1))||(i10.i0.u41.p106==1))||(((i13.i0.u15.p37==1)&&(i11.i2.u57.p144==1))&&(i17.u79.p273==1)))||(i10.i1.u70.p172==1))||((((((((((i11.i1.u27.p69==1)||(i4.u8.p21==1))||(i10.i3.u73.p186==1))||(i13.i1.u53.p136==1))||(i3.i0.u5.p13==1))&&((((((((((i5.u13.p28==1)&&(i6.i2.u63.p159==1))&&(i17.u79.p273==1))||(i11.i1.u27.p68==1))||(((i15.u18.p43==1)&&(i16.u68.p169==1))&&(i17.u79.p273==1)))||(((i2.u28.p70==1)&&(i10.i1.u69.p174==1))&&(i17.u79.p273==1)))||(i3.i1.u49.p122==1))||(i17.u85.p217==1))||(i13.i0.u16.p42==1))||(i0.u30.p78==1)))&&(i4.u6.p16!=1))&&(i11.i3.u59.p151!=1))&&(((i9.i1.u35.p91!=1)||(i1.i1.u77.p195!=1))||(i9.i1.u111.p269!=1)))&&(i7.u21.p54!=1))) + EG((((i13.i0.u15.p39==1)||(((i5.u13.p28==1)&&(i11.i3.u60.p149==1))&&(i17.u79.p273==1)))&&(((((i11.i2.u58.p146==1)||(i6.i0.u42.p107==1))||(i2.u103.p254==1))||(i9.i1.u111.p270==1))||(i1.i0.u109.p266==1)))))) + (E(TRUE U !(!(EX(!(((((((((((i11.i2.u58.p146==1)||(i2.u26.p65==1))||(i9.i1.u39.p98==1))||(i12.u47.p118==1))||(((i9.i0.u36.p94==1)&&(i12.u47.p119==1))&&(i17.u79.p273==1)))||(i16.u67.p171==1))||(i7.u4.p10==1))||(i8.i0.u23.p58==1))||(i17.u108.p264==1))||(i8.i0.u24.p60==1))))))) * (((i10.i1.u70.p176==1)||(i15.u18.p46==1)) + EG(!(EG(!((((((((((i19.u90.p227==1)||(i11.i2.u58.p146==1))||(i9.i1.u0.p1==1))||(i1.i0.u33.p86==1))||(i17.u94.p235==1))||(i6.i2.u63.p158==1))||(i17.u81.p207==1))||(((i3.i0.u7.p15==1)&&(i13.i1.u54.p134==1))&&(i17.u79.p273==1)))||(((i5.u13.p28==1)&&(i11.i3.u60.p149==1))&&(i17.u79.p273==1))))))))))) * !(E(TRUE U !((EG((((((i1.i1.u77.p193==1)||(i5.u14.p36==1))||(i14.u38.p100==1))||(i3.i0.u5.p14==1))&&(i9.i1.u34.p90!=1))) * ((((((((((i5.u13.p33!=1)&&(i17.u112.p272!=1))&&(i2.u3.p7!=1))&&(i12.u48.p117!=1))&&(i10.i0.u41.p104!=1))&&(i15.u17.p45!=1))&&(i10.i1.u70.p172!=1))&&(((i3.i0.u7.p15!=1)||(i11.i1.u52.p129!=1))||(i17.u79.p273!=1)))&&(((i11.i1.u27.p67!=1)||(i11.i1.u52.p130!=1))||(i2.u103.p253!=1)))||(((((((((((i9.i0.u37.p97==1)||(i9.i1.u0.p1==1))||(i6.i3.u65.p163==1))||(i11.i1.u52.p128==1))||(i11.i1.u27.p69==1))||(i7.u22.p56==1))||(i14.u56.p137==1))||(i13.i0.u16.p42==1))||(i5.u11.p29==1))||(((i2.u26.p64==1)&&(i6.i3.u65.p164==1))&&(i17.u79.p273==1)))&&((((((i9.i1.u0.p2==1)||(i17.u89.p224==1))||(i17.u93.p234==1))||(i17.u93.p233==1))||(((i5.u13.p28==1)&&(i6.i1.u62.p154==1))&&(i17.u79.p273==1)))||(((i3.i0.u10.p25==1)&&(i12.u47.p120==1))&&(i3.i0.u86.p218==1))))))))))] != FALSE
(forward)formula 9,0,236.898,2206076,1,0,3.65189e+06,1054,3846,7.85354e+06,192,2317,3788250
FORMULA BusinessProcesses-PT-03-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E(AG((!(EG(((((((((i3.i0.u7.p19==1)||(i17.u104.p256==1))||(i1.i0.u32.p84==1))||(i13.i0.u92.p232==1))||(i9.i1.u34.p90==1))||(i8.i1.u76.p191==1))||(i9.i0.u36.p95==1))&&((((((((((i17.u108.p263==1)||(i17.u79.p273==1))||(i13.i0.u15.p39==1))||(i10.i2.u71.p181==1))||(i3.i0.u9.p23==1))||(i17.u100.p248==1))||(i11.i2.u58.p142==1))||(i15.u17.p44==1))||(i8.i0.u101.p250==1))||(i17.u94.p236==1))))) + (((((((i17.u85.p217!=1)&&(i14.u56.p141!=1))||((((((((((i6.i3.u66.p162!=1)&&(i11.i1.u51.p131!=1))&&(i7.u20.p51!=1))&&(i10.i1.u70.p176!=1))&&(i17.u81.p208!=1))&&(i17.u93.p233!=1))&&(i5.u11.p30!=1))&&(i17.u80.p205!=1))&&(i17.u102.p251!=1))&&(((i3.i0.u10.p25!=1)||(i12.u47.p120!=1))||(i3.i0.u86.p218!=1))))||(((((((((i10.i2.u72.p178!=1)&&(i17.u89.p225!=1))&&(i11.i0.u45.p113!=1))&&(i10.i3.u74.p183!=1))&&(i17.u79.p200!=1))&&(i6.i0.u42.p108!=1))&&(((i8.i0.u25.p62!=1)||(i11.i3.u60.p150!=1))||(i8.i0.u101.p249!=1)))&&(((i7.u22.p55!=1)||(i10.i1.u69.p175!=1))||(i7.u98.p243!=1)))&&(((i7.u22.p55!=1)||(i6.i1.u62.p155!=1))||(i7.u98.p243!=1))))||(((i7.u22.p56!=1)&&(i11.i2.u58.p142!=1))&&(((i5.u13.p28!=1)||(i6.i1.u62.p154!=1))||(i17.u79.p273!=1)))) * (((((((EG((((((((i17.u99.p245==1)||(i11.i0.u46.p116==1))||(i17.u91.p229==1))||(((i13.i0.u16.p40==1)&&(i13.i1.u54.p135==1))&&(i13.i0.u92.p231==1)))||(i13.i0.u15.p38==1))||(i5.u11.p29==1))||(i9.i1.u35.p92==1))) + (i11.i0.u46.p115==1)) + (i5.u13.p34==1)) + (i0.u107.p262==1)) + (i17.u91.p230==1)) + (i3.i0.u86.p219==1)) + (((i5.u13.p28==1)&&(i6.i1.u62.p154==1))&&(i17.u79.p273==1))) + (((i3.i0.u10.p25==1)&&(i12.u47.p120==1))&&(i3.i0.u86.p218==1)))) * (EF((((((i6.i2.u64.p161==1)||(i7.u21.p53==1))||(i11.i0.u46.p116==1))||(i12.u48.p121==1))||(i6.i2.u64.p157==1))) + ((i0.u31.p80!=1)&&(i17.u99.p246!=1)))))) U (((AF(((((((((((i9.i1.u0.p0==1)||(i6.i3.u66.p162==1))||(((i3.i0.u7.p15==1)&&(i11.i1.u52.p129==1))&&(i17.u79.p273==1)))||(i17.u108.p263==1))||(i17.u81.p208==1))||(i9.i1.u1.p4==1))||(((i0.u31.p79==1)&&(i10.i2.u72.p180==1))&&(i0.u107.p261==1)))||(i17.u110.p268==1))||(i17.u79.p201==1))||(i2.u103.p254==1))) * (EX(((((((((((i0.u107.p262==1)||(i17.u96.p240==1))||(i6.i2.u64.p161==1))||(i3.i0.u9.p23==1))||(i2.u3.p7==1))||(((i5.u14.p35==1)&&(i11.i2.u57.p145==1))&&(i19.u87.p226==1)))||(i8.i0.u23.p59==1))||(((i8.i0.u25.p62==1)&&(i10.i3.u74.p185==1))&&(i8.i0.u101.p249==1)))||(i5.u11.p29==1))||(i9.i0.u36.p95==1))) + AG((((i18.u82.p209==1)||(((i9.i1.u39.p101==1)&&(i14.u55.p140==1))&&(i17.u79.p273==1)))||(i17.u85.p216==1))))) * ((((((((i4.u6.p16==1)||(i17.u79.p273==1))||(i2.u28.p71==1))||(i3.i0.u10.p26==1))||(i7.u4.p11==1))||(i3.i0.u5.p12==1)) + E(((i16.u67.p167==1)||(i17.u80.p206==1)) U ((((((i11.i1.u27.p67==1)&&(i11.i1.u52.p130==1))&&(i2.u103.p253==1))||(i11.i3.u59.p151==1))||(i11.i3.u60.p148==1))||(i9.i1.u111.p270==1)))) + (((i9.i1.u35.p91==1)&&(i1.i1.u77.p195==1))&&(i9.i1.u111.p269==1)))) * ((i11.i2.u58.p142==1) + ((((EF(((((((((i7.u98.p244==1)||(i19.u90.p227==1))||(i9.i0.u37.p96==1))||(i3.i0.u7.p19==1))||(i17.u91.p229==1))||(((i16.u29.p73==1)&&(i16.u68.p170==1))&&(i2.u105.p257==1)))||(i19.u87.p220==1))||(i17.u94.p236==1))) * ((((((((i17.u100.p247==1)||(i9.i1.u1.p3==1))||(i11.i1.u27.p69==1))||(i0.u2.p5==1))||(i3.i0.u9.p24==1))||(i17.u96.p239==1))||(((i5.u13.p28==1)&&(i6.i2.u63.p159==1))&&(i17.u79.p273==1)))||(((i15.u19.p48==1)&&(i6.i2.u63.p160==1))&&(i15.u95.p237==1)))) * ((((((((i7.u98.p244==1)||(i2.u28.p71==1))||(i2.u3.p7==1))||(i17.u102.p252==1))||(i3.i0.u86.p219==1))||(i6.i2.u63.p158==1))||(i14.u56.p141==1))||(((i7.u22.p55==1)&&(i10.i1.u69.p175==1))&&(i7.u98.p243==1)))) * ((i8.i0.u23.p58==1)||(((i0.u30.p76==1)&&(i10.i3.u74.p184==1))&&(i17.u79.p273==1)))) * ((((((((((((i5.u12.p32==1)||(i17.u112.p272==1))||(i17.u91.p230==1))||(i0.u2.p5==1))||(i17.u93.p234==1))||(i17.u106.p260==1))||(i19.u90.p227==1))||(i9.i1.u39.p98==1))||(i11.i0.u45.p113==1))||(i1.i1.u78.p196==1))||(i13.i1.u53.p136==1))||(((i9.i0.u36.p94==1)&&(i12.u47.p119==1))&&(i17.u79.p273==1)))))))
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U !((!(EG(((((((((i3.i0.u7.p19==1)||(i17.u104.p256==1))||(i1.i0.u32.p84==1))||(i13.i0.u92.p232==1))||(i9.i1.u34.p90==1))||(i8.i1.u76.p191==1))||(i9.i0.u36.p95==1))&&((((((((((i17.u108.p263==1)||(i17.u79.p273==1))||(i13.i0.u15.p39==1))||(i10.i2.u71.p181==1))||(i3.i0.u9.p23==1))||(i17.u100.p248==1))||(i11.i2.u58.p142==1))||(i15.u17.p44==1))||(i8.i0.u101.p250==1))||(i17.u94.p236==1))))) + (((((((i17.u85.p217!=1)&&(i14.u56.p141!=1))||((((((((((i6.i3.u66.p162!=1)&&(i11.i1.u51.p131!=1))&&(i7.u20.p51!=1))&&(i10.i1.u70.p176!=1))&&(i17.u81.p208!=1))&&(i17.u93.p233!=1))&&(i5.u11.p30!=1))&&(i17.u80.p205!=1))&&(i17.u102.p251!=1))&&(((i3.i0.u10.p25!=1)||(i12.u47.p120!=1))||(i3.i0.u86.p218!=1))))||(((((((((i10.i2.u72.p178!=1)&&(i17.u89.p225!=1))&&(i11.i0.u45.p113!=1))&&(i10.i3.u74.p183!=1))&&(i17.u79.p200!=1))&&(i6.i0.u42.p108!=1))&&(((i8.i0.u25.p62!=1)||(i11.i3.u60.p150!=1))||(i8.i0.u101.p249!=1)))&&(((i7.u22.p55!=1)||(i10.i1.u69.p175!=1))||(i7.u98.p243!=1)))&&(((i7.u22.p55!=1)||(i6.i1.u62.p155!=1))||(i7.u98.p243!=1))))||(((i7.u22.p56!=1)&&(i11.i2.u58.p142!=1))&&(((i5.u13.p28!=1)||(i6.i1.u62.p154!=1))||(i17.u79.p273!=1)))) * (((((((EG((((((((i17.u99.p245==1)||(i11.i0.u46.p116==1))||(i17.u91.p229==1))||(((i13.i0.u16.p40==1)&&(i13.i1.u54.p135==1))&&(i13.i0.u92.p231==1)))||(i13.i0.u15.p38==1))||(i5.u11.p29==1))||(i9.i1.u35.p92==1))) + (i11.i0.u46.p115==1)) + (i5.u13.p34==1)) + (i0.u107.p262==1)) + (i17.u91.p230==1)) + (i3.i0.u86.p219==1)) + (((i5.u13.p28==1)&&(i6.i1.u62.p154==1))&&(i17.u79.p273==1))) + (((i3.i0.u10.p25==1)&&(i12.u47.p120==1))&&(i3.i0.u86.p218==1)))) * (E(TRUE U (((((i6.i2.u64.p161==1)||(i7.u21.p53==1))||(i11.i0.u46.p116==1))||(i12.u48.p121==1))||(i6.i2.u64.p157==1))) + ((i0.u31.p80!=1)&&(i17.u99.p246!=1))))))))) * ((!(EG(!(((((((((((i9.i1.u0.p0==1)||(i6.i3.u66.p162==1))||(((i3.i0.u7.p15==1)&&(i11.i1.u52.p129==1))&&(i17.u79.p273==1)))||(i17.u108.p263==1))||(i17.u81.p208==1))||(i9.i1.u1.p4==1))||(((i0.u31.p79==1)&&(i10.i2.u72.p180==1))&&(i0.u107.p261==1)))||(i17.u110.p268==1))||(i17.u79.p201==1))||(i2.u103.p254==1))))) * (EX(((((((((((i0.u107.p262==1)||(i17.u96.p240==1))||(i6.i2.u64.p161==1))||(i3.i0.u9.p23==1))||(i2.u3.p7==1))||(((i5.u14.p35==1)&&(i11.i2.u57.p145==1))&&(i19.u87.p226==1)))||(i8.i0.u23.p59==1))||(((i8.i0.u25.p62==1)&&(i10.i3.u74.p185==1))&&(i8.i0.u101.p249==1)))||(i5.u11.p29==1))||(i9.i0.u36.p95==1))) + !(E(TRUE U !((((i18.u82.p209==1)||(((i9.i1.u39.p101==1)&&(i14.u55.p140==1))&&(i17.u79.p273==1)))||(i17.u85.p216==1))))))) * ((((((((i4.u6.p16==1)||(i17.u79.p273==1))||(i2.u28.p71==1))||(i3.i0.u10.p26==1))||(i7.u4.p11==1))||(i3.i0.u5.p12==1)) + E(((i16.u67.p167==1)||(i17.u80.p206==1)) U ((((((i11.i1.u27.p67==1)&&(i11.i1.u52.p130==1))&&(i2.u103.p253==1))||(i11.i3.u59.p151==1))||(i11.i3.u60.p148==1))||(i9.i1.u111.p270==1)))) + (((i9.i1.u35.p91==1)&&(i1.i1.u77.p195==1))&&(i9.i1.u111.p269==1))))) * (i11.i2.u58.p142==1))] != FALSE + [(FwdU((((((FwdU(Init,!(E(TRUE U !((!(EG(((((((((i3.i0.u7.p19==1)||(i17.u104.p256==1))||(i1.i0.u32.p84==1))||(i13.i0.u92.p232==1))||(i9.i1.u34.p90==1))||(i8.i1.u76.p191==1))||(i9.i0.u36.p95==1))&&((((((((((i17.u108.p263==1)||(i17.u79.p273==1))||(i13.i0.u15.p39==1))||(i10.i2.u71.p181==1))||(i3.i0.u9.p23==1))||(i17.u100.p248==1))||(i11.i2.u58.p142==1))||(i15.u17.p44==1))||(i8.i0.u101.p250==1))||(i17.u94.p236==1))))) + (((((((i17.u85.p217!=1)&&(i14.u56.p141!=1))||((((((((((i6.i3.u66.p162!=1)&&(i11.i1.u51.p131!=1))&&(i7.u20.p51!=1))&&(i10.i1.u70.p176!=1))&&(i17.u81.p208!=1))&&(i17.u93.p233!=1))&&(i5.u11.p30!=1))&&(i17.u80.p205!=1))&&(i17.u102.p251!=1))&&(((i3.i0.u10.p25!=1)||(i12.u47.p120!=1))||(i3.i0.u86.p218!=1))))||(((((((((i10.i2.u72.p178!=1)&&(i17.u89.p225!=1))&&(i11.i0.u45.p113!=1))&&(i10.i3.u74.p183!=1))&&(i17.u79.p200!=1))&&(i6.i0.u42.p108!=1))&&(((i8.i0.u25.p62!=1)||(i11.i3.u60.p150!=1))||(i8.i0.u101.p249!=1)))&&(((i7.u22.p55!=1)||(i10.i1.u69.p175!=1))||(i7.u98.p243!=1)))&&(((i7.u22.p55!=1)||(i6.i1.u62.p155!=1))||(i7.u98.p243!=1))))||(((i7.u22.p56!=1)&&(i11.i2.u58.p142!=1))&&(((i5.u13.p28!=1)||(i6.i1.u62.p154!=1))||(i17.u79.p273!=1)))) * (((((((EG((((((((i17.u99.p245==1)||(i11.i0.u46.p116==1))||(i17.u91.p229==1))||(((i13.i0.u16.p40==1)&&(i13.i1.u54.p135==1))&&(i13.i0.u92.p231==1)))||(i13.i0.u15.p38==1))||(i5.u11.p29==1))||(i9.i1.u35.p92==1))) + (i11.i0.u46.p115==1)) + (i5.u13.p34==1)) + (i0.u107.p262==1)) + (i17.u91.p230==1)) + (i3.i0.u86.p219==1)) + (((i5.u13.p28==1)&&(i6.i1.u62.p154==1))&&(i17.u79.p273==1))) + (((i3.i0.u10.p25==1)&&(i12.u47.p120==1))&&(i3.i0.u86.p218==1)))) * (E(TRUE U (((((i6.i2.u64.p161==1)||(i7.u21.p53==1))||(i11.i0.u46.p116==1))||(i12.u48.p121==1))||(i6.i2.u64.p157==1))) + ((i0.u31.p80!=1)&&(i17.u99.p246!=1))))))))) * ((!(EG(!(((((((((((i9.i1.u0.p0==1)||(i6.i3.u66.p162==1))||(((i3.i0.u7.p15==1)&&(i11.i1.u52.p129==1))&&(i17.u79.p273==1)))||(i17.u108.p263==1))||(i17.u81.p208==1))||(i9.i1.u1.p4==1))||(((i0.u31.p79==1)&&(i10.i2.u72.p180==1))&&(i0.u107.p261==1)))||(i17.u110.p268==1))||(i17.u79.p201==1))||(i2.u103.p254==1))))) * (EX(((((((((((i0.u107.p262==1)||(i17.u96.p240==1))||(i6.i2.u64.p161==1))||(i3.i0.u9.p23==1))||(i2.u3.p7==1))||(((i5.u14.p35==1)&&(i11.i2.u57.p145==1))&&(i19.u87.p226==1)))||(i8.i0.u23.p59==1))||(((i8.i0.u25.p62==1)&&(i10.i3.u74.p185==1))&&(i8.i0.u101.p249==1)))||(i5.u11.p29==1))||(i9.i0.u36.p95==1))) + !(E(TRUE U !((((i18.u82.p209==1)||(((i9.i1.u39.p101==1)&&(i14.u55.p140==1))&&(i17.u79.p273==1)))||(i17.u85.p216==1))))))) * ((((((((i4.u6.p16==1)||(i17.u79.p273==1))||(i2.u28.p71==1))||(i3.i0.u10.p26==1))||(i7.u4.p11==1))||(i3.i0.u5.p12==1)) + E(((i16.u67.p167==1)||(i17.u80.p206==1)) U ((((((i11.i1.u27.p67==1)&&(i11.i1.u52.p130==1))&&(i2.u103.p253==1))||(i11.i3.u59.p151==1))||(i11.i3.u60.p148==1))||(i9.i1.u111.p270==1)))) + (((i9.i1.u35.p91==1)&&(i1.i1.u77.p195==1))&&(i9.i1.u111.p269==1))))) * ((((((((((((i5.u12.p32==1)||(i17.u112.p272==1))||(i17.u91.p230==1))||(i0.u2.p5==1))||(i17.u93.p234==1))||(i17.u106.p260==1))||(i19.u90.p227==1))||(i9.i1.u39.p98==1))||(i11.i0.u45.p113==1))||(i1.i1.u78.p196==1))||(i13.i1.u53.p136==1))||(((i9.i0.u36.p94==1)&&(i12.u47.p119==1))&&(i17.u79.p273==1)))) * ((i8.i0.u23.p58==1)||(((i0.u30.p76==1)&&(i10.i3.u74.p184==1))&&(i17.u79.p273==1)))) * ((((((((i7.u98.p244==1)||(i2.u28.p71==1))||(i2.u3.p7==1))||(i17.u102.p252==1))||(i3.i0.u86.p219==1))||(i6.i2.u63.p158==1))||(i14.u56.p141==1))||(((i7.u22.p55==1)&&(i10.i1.u69.p175==1))&&(i7.u98.p243==1)))) * ((((((((i17.u100.p247==1)||(i9.i1.u1.p3==1))||(i11.i1.u27.p69==1))||(i0.u2.p5==1))||(i3.i0.u9.p24==1))||(i17.u96.p239==1))||(((i5.u13.p28==1)&&(i6.i2.u63.p159==1))&&(i17.u79.p273==1)))||(((i15.u19.p48==1)&&(i6.i2.u63.p160==1))&&(i15.u95.p237==1)))),TRUE) * ((((((((i7.u98.p244==1)||(i19.u90.p227==1))||(i9.i0.u37.p96==1))||(i3.i0.u7.p19==1))||(i17.u91.p229==1))||(((i16.u29.p73==1)&&(i16.u68.p170==1))&&(i2.u105.p257==1)))||(i19.u87.p220==1))||(i17.u94.p236==1)))] != FALSE)
(forward)formula 10,0,309.513,2431796,1,0,4.34803e+06,1070,2783,8.09262e+06,152,2403,1819082
FORMULA BusinessProcesses-PT-03-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AF(!(EF((i3.i0.u9.p24==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U (i3.i0.u9.p24==1)))))] = FALSE
(forward)formula 11,0,316.154,2431796,1,0,4.34803e+06,1070,3032,8.09262e+06,155,2403,2542068
FORMULA BusinessProcesses-PT-03-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EF(((((i3.i0.u7.p18==1)||(i11.i1.u52.p128==1))||(i17.u104.p256==1))||(i17.u102.p252==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((((i3.i0.u7.p18==1)||(i11.i1.u52.p128==1))||(i17.u104.p256==1))||(i17.u102.p252==1)))] != FALSE
(forward)formula 12,1,316.158,2431796,1,0,4.34803e+06,1070,3040,8.09262e+06,155,2403,2543272
FORMULA BusinessProcesses-PT-03-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EG(((((((i0.u31.p81!=1)&&(i17.u83.p211!=1))&&(i17.u97.p241!=1))&&(i3.i0.u10.p26!=1))&&(i12.u48.p121!=1)) + ((i17.u104.p256==1) * !(E(EF(((((((i7.u98.p244==1)||(((i4.u8.p20==1)&&(i3.i1.u50.p125==1))&&(i18.u82.p213==1)))||(i18.u82.p209==1))||(i17.u79.p199==1))||(i2.u3.p8==1))||(i6.i0.u42.p108==1))) U (EG((((((((((i17.u106.p260==1)||(i0.u107.p262==1))||(i17.u100.p247==1))||(i1.i0.u33.p87==1))||(i8.i1.u76.p187==1))||(((i5.u14.p35==1)&&(i11.i2.u57.p145==1))&&(i19.u87.p226==1)))||(i8.i0.u23.p59==1))||(i17.u85.p216==1))||(i10.i1.u69.p173==1))) + (((((((i1.i1.u77.p193!=1)&&(i17.u91.p229!=1))&&(i6.i1.u61.p152!=1))&&(((i7.u22.p55!=1)||(i10.i1.u69.p175!=1))||(i7.u98.p243!=1)))&&(i11.i2.u58.p142!=1))&&(i15.u95.p238!=1))&&(i11.i1.u51.p127!=1))))))))
=> equivalent forward existential formula: [FwdG(Init,((((((i0.u31.p81!=1)&&(i17.u83.p211!=1))&&(i17.u97.p241!=1))&&(i3.i0.u10.p26!=1))&&(i12.u48.p121!=1)) + ((i17.u104.p256==1) * !(E(E(TRUE U ((((((i7.u98.p244==1)||(((i4.u8.p20==1)&&(i3.i1.u50.p125==1))&&(i18.u82.p213==1)))||(i18.u82.p209==1))||(i17.u79.p199==1))||(i2.u3.p8==1))||(i6.i0.u42.p108==1))) U (EG((((((((((i17.u106.p260==1)||(i0.u107.p262==1))||(i17.u100.p247==1))||(i1.i0.u33.p87==1))||(i8.i1.u76.p187==1))||(((i5.u14.p35==1)&&(i11.i2.u57.p145==1))&&(i19.u87.p226==1)))||(i8.i0.u23.p59==1))||(i17.u85.p216==1))||(i10.i1.u69.p173==1))) + (((((((i1.i1.u77.p193!=1)&&(i17.u91.p229!=1))&&(i6.i1.u61.p152!=1))&&(((i7.u22.p55!=1)||(i10.i1.u69.p175!=1))||(i7.u98.p243!=1)))&&(i11.i2.u58.p142!=1))&&(i15.u95.p238!=1))&&(i11.i1.u51.p127!=1))))))))] != FALSE
(forward)formula 13,1,322.939,2431796,1,0,4.34803e+06,1070,3151,8.09262e+06,155,2403,3027979
FORMULA BusinessProcesses-PT-03-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (AX(((i3.i1.u50.p123!=1) * !(AG((((((((((((((((((((((i4.u6.p16==1)||(i6.i3.u65.p163==1))||(i3.i0.u7.p19==1))||(i11.i1.u27.p69==1))||(i9.i1.u1.p4==1))||(i17.u91.p230==1))||(i2.u3.p8==1))||(i17.u102.p252==1))||(i8.i0.u24.p60==1))||(i15.u18.p47==1))||(i17.u89.p225==1))||(i10.i1.u70.p176==1))||(i17.u81.p208==1))||(((i3.i0.u9.p22==1)&&(i3.i1.u50.p124==1))&&(i17.u79.p273==1)))||(((i2.u26.p64==1)&&(i6.i3.u65.p164==1))&&(i17.u79.p273==1)))||(i17.u102.p252==1))||(i10.i3.u73.p186==1))||(i8.i0.u24.p61==1))||(i9.i1.u35.p93==1))||(i10.i1.u70.p172==1)) * EG((((((i10.i2.u72.p178==1)||(i11.i3.u59.p151==1))||(i3.i1.u49.p122==1))||(i6.i1.u61.p152==1))||(((i7.u22.p55==1)&&(i10.i1.u69.p175==1))&&(i7.u98.p243==1))))))))) * !(EF(AG(((((i7.u20.p51!=1)&&(i8.i1.u76.p191!=1))&&(i1.i0.u109.p266!=1))&&(i8.i1.u75.p188!=1))))))
=> equivalent forward existential formula: (([(EY(Init) * !((i3.i1.u50.p123!=1)))] = FALSE * [(EY(Init) * !(E(TRUE U !((((((((((((((((((((((i4.u6.p16==1)||(i6.i3.u65.p163==1))||(i3.i0.u7.p19==1))||(i11.i1.u27.p69==1))||(i9.i1.u1.p4==1))||(i17.u91.p230==1))||(i2.u3.p8==1))||(i17.u102.p252==1))||(i8.i0.u24.p60==1))||(i15.u18.p47==1))||(i17.u89.p225==1))||(i10.i1.u70.p176==1))||(i17.u81.p208==1))||(((i3.i0.u9.p22==1)&&(i3.i1.u50.p124==1))&&(i17.u79.p273==1)))||(((i2.u26.p64==1)&&(i6.i3.u65.p164==1))&&(i17.u79.p273==1)))||(i17.u102.p252==1))||(i10.i3.u73.p186==1))||(i8.i0.u24.p61==1))||(i9.i1.u35.p93==1))||(i10.i1.u70.p172==1)) * EG((((((i10.i2.u72.p178==1)||(i11.i3.u59.p151==1))||(i3.i1.u49.p122==1))||(i6.i1.u61.p152==1))||(((i7.u22.p55==1)&&(i10.i1.u69.p175==1))&&(i7.u98.p243==1)))))))))] = FALSE) * [(FwdU(Init,TRUE) * !(E(TRUE U !(((((i7.u20.p51!=1)&&(i8.i1.u76.p191!=1))&&(i1.i0.u109.p266!=1))&&(i8.i1.u75.p188!=1))))))] = FALSE)
(forward)formula 14,0,323.374,2431796,1,0,4.34803e+06,1070,3167,8.09262e+06,155,2403,3066146
FORMULA BusinessProcesses-PT-03-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************


BK_STOP 1620904686622

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="BusinessProcesses-PT-03"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is BusinessProcesses-PT-03, 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 r035-tajo-162038167700086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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