Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 23K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 37K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 248K Apr 27 15:14 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 Peterson-PT-3-CTLFireability-00
FORMULA_NAME Peterson-PT-3-CTLFireability-01
FORMULA_NAME Peterson-PT-3-CTLFireability-02
FORMULA_NAME Peterson-PT-3-CTLFireability-03
FORMULA_NAME Peterson-PT-3-CTLFireability-04
FORMULA_NAME Peterson-PT-3-CTLFireability-05
FORMULA_NAME Peterson-PT-3-CTLFireability-06
FORMULA_NAME Peterson-PT-3-CTLFireability-07
FORMULA_NAME Peterson-PT-3-CTLFireability-08
FORMULA_NAME Peterson-PT-3-CTLFireability-09
FORMULA_NAME Peterson-PT-3-CTLFireability-10
FORMULA_NAME Peterson-PT-3-CTLFireability-11
FORMULA_NAME Peterson-PT-3-CTLFireability-12
FORMULA_NAME Peterson-PT-3-CTLFireability-13
FORMULA_NAME Peterson-PT-3-CTLFireability-14
FORMULA_NAME Peterson-PT-3-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590022978672

[2020-05-21 01:03:01] [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]
[2020-05-21 01:03:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 01:03:01] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2020-05-21 01:03:01] [INFO ] Transformed 244 places.
[2020-05-21 01:03:01] [INFO ] Transformed 332 transitions.
[2020-05-21 01:03:01] [INFO ] Parsed PT model containing 244 places and 332 transitions in 174 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 40 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 494 ms. (steps per millisecond=202 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1]
[2020-05-21 01:03:02] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2020-05-21 01:03:02] [INFO ] Computed 15 place invariants in 14 ms
[2020-05-21 01:03:02] [INFO ] [Real]Absence check using 11 positive place invariants in 36 ms returned sat
[2020-05-21 01:03:02] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 8 ms returned sat
[2020-05-21 01:03:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:03] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2020-05-21 01:03:03] [INFO ] State equation strengthened by 66 read => feed constraints.
[2020-05-21 01:03:03] [INFO ] [Real]Added 66 Read/Feed constraints in 26 ms returned sat
[2020-05-21 01:03:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 25 ms returned sat
[2020-05-21 01:03:03] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 14 ms returned sat
[2020-05-21 01:03:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:03] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2020-05-21 01:03:03] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-05-21 01:03:03] [INFO ] Deduced a trap composed of 35 places in 204 ms
[2020-05-21 01:03:04] [INFO ] Deduced a trap composed of 23 places in 477 ms
[2020-05-21 01:03:04] [INFO ] Deduced a trap composed of 13 places in 134 ms
[2020-05-21 01:03:04] [INFO ] Deduced a trap composed of 79 places in 193 ms
[2020-05-21 01:03:05] [INFO ] Deduced a trap composed of 38 places in 636 ms
[2020-05-21 01:03:05] [INFO ] Deduced a trap composed of 30 places in 173 ms
[2020-05-21 01:03:05] [INFO ] Deduced a trap composed of 49 places in 100 ms
[2020-05-21 01:03:05] [INFO ] Deduced a trap composed of 48 places in 72 ms
[2020-05-21 01:03:06] [INFO ] Deduced a trap composed of 45 places in 99 ms
[2020-05-21 01:03:06] [INFO ] Deduced a trap composed of 27 places in 98 ms
[2020-05-21 01:03:06] [INFO ] Deduced a trap composed of 31 places in 244 ms
[2020-05-21 01:03:06] [INFO ] Deduced a trap composed of 49 places in 84 ms
[2020-05-21 01:03:06] [INFO ] Deduced a trap composed of 16 places in 57 ms
[2020-05-21 01:03:06] [INFO ] Deduced a trap composed of 16 places in 311 ms
[2020-05-21 01:03:07] [INFO ] Deduced a trap composed of 9 places in 80 ms
[2020-05-21 01:03:07] [INFO ] Deduced a trap composed of 13 places in 62 ms
[2020-05-21 01:03:07] [INFO ] Deduced a trap composed of 34 places in 53 ms
[2020-05-21 01:03:07] [INFO ] Deduced a trap composed of 31 places in 82 ms
[2020-05-21 01:03:07] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3638 ms
[2020-05-21 01:03:07] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 33 ms.
[2020-05-21 01:03:09] [INFO ] Added : 301 causal constraints over 61 iterations in 1770 ms. Result :sat
[2020-05-21 01:03:09] [INFO ] [Real]Absence check using 11 positive place invariants in 50 ms returned sat
[2020-05-21 01:03:09] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:03:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:09] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2020-05-21 01:03:09] [INFO ] [Real]Added 66 Read/Feed constraints in 21 ms returned sat
[2020-05-21 01:03:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-05-21 01:03:09] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:03:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:10] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2020-05-21 01:03:10] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-05-21 01:03:10] [INFO ] Deduced a trap composed of 35 places in 442 ms
[2020-05-21 01:03:10] [INFO ] Deduced a trap composed of 52 places in 286 ms
[2020-05-21 01:03:11] [INFO ] Deduced a trap composed of 9 places in 535 ms
[2020-05-21 01:03:11] [INFO ] Deduced a trap composed of 38 places in 64 ms
[2020-05-21 01:03:11] [INFO ] Deduced a trap composed of 38 places in 59 ms
[2020-05-21 01:03:11] [INFO ] Deduced a trap composed of 13 places in 39 ms
[2020-05-21 01:03:11] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1579 ms
[2020-05-21 01:03:11] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 20 ms.
[2020-05-21 01:03:13] [INFO ] Added : 304 causal constraints over 61 iterations in 2094 ms. Result :sat
[2020-05-21 01:03:14] [INFO ] Deduced a trap composed of 53 places in 206 ms
[2020-05-21 01:03:14] [INFO ] Deduced a trap composed of 12 places in 497 ms
[2020-05-21 01:03:15] [INFO ] Deduced a trap composed of 9 places in 358 ms
[2020-05-21 01:03:15] [INFO ] Deduced a trap composed of 9 places in 278 ms
[2020-05-21 01:03:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1572 ms
[2020-05-21 01:03:15] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-05-21 01:03:15] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-05-21 01:03:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:16] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2020-05-21 01:03:16] [INFO ] [Real]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-05-21 01:03:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-05-21 01:03:16] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:03:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:16] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2020-05-21 01:03:16] [INFO ] [Nat]Added 66 Read/Feed constraints in 23 ms returned sat
[2020-05-21 01:03:16] [INFO ] Deduced a trap composed of 27 places in 132 ms
[2020-05-21 01:03:16] [INFO ] Deduced a trap composed of 13 places in 161 ms
[2020-05-21 01:03:17] [INFO ] Deduced a trap composed of 13 places in 392 ms
[2020-05-21 01:03:17] [INFO ] Deduced a trap composed of 31 places in 362 ms
[2020-05-21 01:03:18] [INFO ] Deduced a trap composed of 35 places in 494 ms
[2020-05-21 01:03:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1660 ms
[2020-05-21 01:03:18] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 22 ms.
[2020-05-21 01:03:19] [INFO ] Added : 304 causal constraints over 61 iterations in 1774 ms. Result :sat
[2020-05-21 01:03:19] [INFO ] Deduced a trap composed of 16 places in 136 ms
[2020-05-21 01:03:20] [INFO ] Deduced a trap composed of 9 places in 236 ms
[2020-05-21 01:03:20] [INFO ] Deduced a trap composed of 9 places in 488 ms
[2020-05-21 01:03:21] [INFO ] Deduced a trap composed of 9 places in 484 ms
[2020-05-21 01:03:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1560 ms
[2020-05-21 01:03:21] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-21 01:03:21] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:03:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:22] [INFO ] [Real]Absence check using state equation in 808 ms returned sat
[2020-05-21 01:03:22] [INFO ] [Real]Added 66 Read/Feed constraints in 17 ms returned sat
[2020-05-21 01:03:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-05-21 01:03:22] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:03:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:22] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2020-05-21 01:03:22] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-05-21 01:03:22] [INFO ] Deduced a trap composed of 27 places in 115 ms
[2020-05-21 01:03:23] [INFO ] Deduced a trap composed of 9 places in 794 ms
[2020-05-21 01:03:23] [INFO ] Deduced a trap composed of 9 places in 129 ms
[2020-05-21 01:03:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1123 ms
[2020-05-21 01:03:23] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 23 ms.
[2020-05-21 01:03:25] [INFO ] Added : 304 causal constraints over 61 iterations in 1433 ms. Result :sat
[2020-05-21 01:03:25] [INFO ] Deduced a trap composed of 16 places in 151 ms
[2020-05-21 01:03:25] [INFO ] Deduced a trap composed of 9 places in 94 ms
[2020-05-21 01:03:25] [INFO ] Deduced a trap composed of 52 places in 84 ms
[2020-05-21 01:03:25] [INFO ] Deduced a trap composed of 52 places in 232 ms
[2020-05-21 01:03:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 756 ms
[2020-05-21 01:03:25] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-21 01:03:25] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:03:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:26] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2020-05-21 01:03:26] [INFO ] [Real]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-05-21 01:03:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-21 01:03:26] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:03:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:26] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2020-05-21 01:03:26] [INFO ] [Nat]Added 66 Read/Feed constraints in 26 ms returned sat
[2020-05-21 01:03:26] [INFO ] Deduced a trap composed of 9 places in 110 ms
[2020-05-21 01:03:26] [INFO ] Deduced a trap composed of 27 places in 68 ms
[2020-05-21 01:03:26] [INFO ] Deduced a trap composed of 27 places in 66 ms
[2020-05-21 01:03:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 310 ms
[2020-05-21 01:03:26] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 18 ms.
[2020-05-21 01:03:28] [INFO ] Added : 304 causal constraints over 61 iterations in 1389 ms. Result :sat
[2020-05-21 01:03:28] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-21 01:03:28] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:03:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:28] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2020-05-21 01:03:28] [INFO ] [Real]Added 66 Read/Feed constraints in 11 ms returned sat
[2020-05-21 01:03:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 23 ms returned sat
[2020-05-21 01:03:28] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:03:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:28] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2020-05-21 01:03:28] [INFO ] [Nat]Added 66 Read/Feed constraints in 22 ms returned sat
[2020-05-21 01:03:29] [INFO ] Deduced a trap composed of 49 places in 111 ms
[2020-05-21 01:03:29] [INFO ] Deduced a trap composed of 30 places in 135 ms
[2020-05-21 01:03:29] [INFO ] Deduced a trap composed of 62 places in 115 ms
[2020-05-21 01:03:29] [INFO ] Deduced a trap composed of 34 places in 116 ms
[2020-05-21 01:03:29] [INFO ] Deduced a trap composed of 17 places in 87 ms
[2020-05-21 01:03:29] [INFO ] Deduced a trap composed of 16 places in 84 ms
[2020-05-21 01:03:29] [INFO ] Deduced a trap composed of 16 places in 81 ms
[2020-05-21 01:03:29] [INFO ] Deduced a trap composed of 35 places in 62 ms
[2020-05-21 01:03:29] [INFO ] Deduced a trap composed of 9 places in 81 ms
[2020-05-21 01:03:30] [INFO ] Deduced a trap composed of 37 places in 109 ms
[2020-05-21 01:03:30] [INFO ] Deduced a trap composed of 45 places in 120 ms
[2020-05-21 01:03:30] [INFO ] Deduced a trap composed of 53 places in 49 ms
[2020-05-21 01:03:30] [INFO ] Deduced a trap composed of 52 places in 45 ms
[2020-05-21 01:03:30] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1403 ms
[2020-05-21 01:03:30] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 26 ms.
[2020-05-21 01:03:31] [INFO ] Added : 304 causal constraints over 61 iterations in 1450 ms. Result :sat
[2020-05-21 01:03:31] [INFO ] Deduced a trap composed of 38 places in 49 ms
[2020-05-21 01:03:32] [INFO ] Deduced a trap composed of 27 places in 67 ms
[2020-05-21 01:03:32] [INFO ] Deduced a trap composed of 27 places in 57 ms
[2020-05-21 01:03:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 398 ms
[2020-05-21 01:03:32] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-05-21 01:03:32] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-21 01:03:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:32] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2020-05-21 01:03:32] [INFO ] [Real]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-05-21 01:03:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned sat
[2020-05-21 01:03:32] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:03:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:32] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2020-05-21 01:03:32] [INFO ] [Nat]Added 66 Read/Feed constraints in 27 ms returned sat
[2020-05-21 01:03:32] [INFO ] Deduced a trap composed of 9 places in 55 ms
[2020-05-21 01:03:32] [INFO ] Deduced a trap composed of 17 places in 40 ms
[2020-05-21 01:03:33] [INFO ] Deduced a trap composed of 18 places in 55 ms
[2020-05-21 01:03:33] [INFO ] Deduced a trap composed of 18 places in 39 ms
[2020-05-21 01:03:33] [INFO ] Deduced a trap composed of 57 places in 48 ms
[2020-05-21 01:03:33] [INFO ] Deduced a trap composed of 57 places in 44 ms
[2020-05-21 01:03:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 378 ms
[2020-05-21 01:03:33] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 14 ms.
[2020-05-21 01:03:34] [INFO ] Added : 304 causal constraints over 61 iterations in 1310 ms. Result :sat
[2020-05-21 01:03:34] [INFO ] Deduced a trap composed of 50 places in 124 ms
[2020-05-21 01:03:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2020-05-21 01:03:34] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-05-21 01:03:34] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:03:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:34] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2020-05-21 01:03:35] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-05-21 01:03:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-21 01:03:35] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:03:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:35] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2020-05-21 01:03:35] [INFO ] [Nat]Added 66 Read/Feed constraints in 33 ms returned sat
[2020-05-21 01:03:35] [INFO ] Deduced a trap composed of 9 places in 115 ms
[2020-05-21 01:03:35] [INFO ] Deduced a trap composed of 13 places in 83 ms
[2020-05-21 01:03:35] [INFO ] Deduced a trap composed of 62 places in 71 ms
[2020-05-21 01:03:35] [INFO ] Deduced a trap composed of 20 places in 98 ms
[2020-05-21 01:03:35] [INFO ] Deduced a trap composed of 50 places in 59 ms
[2020-05-21 01:03:35] [INFO ] Deduced a trap composed of 50 places in 69 ms
[2020-05-21 01:03:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 582 ms
[2020-05-21 01:03:35] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 13 ms.
[2020-05-21 01:03:37] [INFO ] Added : 304 causal constraints over 61 iterations in 1360 ms. Result :sat
[2020-05-21 01:03:37] [INFO ] [Real]Absence check using 11 positive place invariants in 27 ms returned sat
[2020-05-21 01:03:37] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:03:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:37] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2020-05-21 01:03:37] [INFO ] [Real]Added 66 Read/Feed constraints in 17 ms returned sat
[2020-05-21 01:03:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-21 01:03:37] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-21 01:03:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:37] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2020-05-21 01:03:37] [INFO ] [Nat]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-05-21 01:03:38] [INFO ] Deduced a trap composed of 13 places in 90 ms
[2020-05-21 01:03:38] [INFO ] Deduced a trap composed of 9 places in 99 ms
[2020-05-21 01:03:38] [INFO ] Deduced a trap composed of 16 places in 71 ms
[2020-05-21 01:03:38] [INFO ] Deduced a trap composed of 49 places in 60 ms
[2020-05-21 01:03:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 381 ms
[2020-05-21 01:03:38] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 28 ms.
[2020-05-21 01:03:39] [INFO ] Added : 304 causal constraints over 61 iterations in 1681 ms. Result :sat
[2020-05-21 01:03:40] [INFO ] Deduced a trap composed of 16 places in 112 ms
[2020-05-21 01:03:40] [INFO ] Deduced a trap composed of 9 places in 100 ms
[2020-05-21 01:03:40] [INFO ] Deduced a trap composed of 11 places in 144 ms
[2020-05-21 01:03:40] [INFO ] Deduced a trap composed of 38 places in 105 ms
[2020-05-21 01:03:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 607 ms
[2020-05-21 01:03:40] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-05-21 01:03:40] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:03:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:40] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2020-05-21 01:03:40] [INFO ] [Real]Added 66 Read/Feed constraints in 27 ms returned sat
[2020-05-21 01:03:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-05-21 01:03:40] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:03:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:41] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2020-05-21 01:03:41] [INFO ] [Nat]Added 66 Read/Feed constraints in 22 ms returned sat
[2020-05-21 01:03:41] [INFO ] Deduced a trap composed of 9 places in 126 ms
[2020-05-21 01:03:41] [INFO ] Deduced a trap composed of 34 places in 49 ms
[2020-05-21 01:03:41] [INFO ] Deduced a trap composed of 35 places in 52 ms
[2020-05-21 01:03:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 277 ms
[2020-05-21 01:03:41] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 13 ms.
[2020-05-21 01:03:43] [INFO ] Added : 303 causal constraints over 61 iterations in 1594 ms. Result :sat
[2020-05-21 01:03:43] [INFO ] Deduced a trap composed of 11 places in 100 ms
[2020-05-21 01:03:43] [INFO ] Deduced a trap composed of 17 places in 88 ms
[2020-05-21 01:03:43] [INFO ] Deduced a trap composed of 54 places in 45 ms
[2020-05-21 01:03:43] [INFO ] Deduced a trap composed of 39 places in 36 ms
[2020-05-21 01:03:43] [INFO ] Deduced a trap composed of 62 places in 101 ms
[2020-05-21 01:03:43] [INFO ] Deduced a trap composed of 34 places in 97 ms
[2020-05-21 01:03:43] [INFO ] Deduced a trap composed of 24 places in 89 ms
[2020-05-21 01:03:44] [INFO ] Deduced a trap composed of 9 places in 115 ms
[2020-05-21 01:03:44] [INFO ] Deduced a trap composed of 52 places in 75 ms
[2020-05-21 01:03:44] [INFO ] Deduced a trap composed of 53 places in 96 ms
[2020-05-21 01:03:44] [INFO ] Deduced a trap composed of 52 places in 106 ms
[2020-05-21 01:03:44] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1423 ms
[2020-05-21 01:03:44] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-05-21 01:03:44] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:03:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:44] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2020-05-21 01:03:44] [INFO ] [Real]Added 66 Read/Feed constraints in 8 ms returned sat
[2020-05-21 01:03:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-05-21 01:03:44] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:03:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:45] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2020-05-21 01:03:45] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-05-21 01:03:45] [INFO ] Deduced a trap composed of 13 places in 136 ms
[2020-05-21 01:03:45] [INFO ] Deduced a trap composed of 32 places in 102 ms
[2020-05-21 01:03:45] [INFO ] Deduced a trap composed of 42 places in 97 ms
[2020-05-21 01:03:45] [INFO ] Deduced a trap composed of 52 places in 98 ms
[2020-05-21 01:03:45] [INFO ] Deduced a trap composed of 38 places in 72 ms
[2020-05-21 01:03:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 572 ms
[2020-05-21 01:03:45] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 13 ms.
[2020-05-21 01:03:47] [INFO ] Added : 303 causal constraints over 61 iterations in 1532 ms. Result :sat
[2020-05-21 01:03:47] [INFO ] Deduced a trap composed of 52 places in 153 ms
[2020-05-21 01:03:47] [INFO ] Deduced a trap composed of 18 places in 144 ms
[2020-05-21 01:03:47] [INFO ] Deduced a trap composed of 9 places in 119 ms
[2020-05-21 01:03:47] [INFO ] Deduced a trap composed of 57 places in 131 ms
[2020-05-21 01:03:47] [INFO ] Deduced a trap composed of 64 places in 137 ms
[2020-05-21 01:03:48] [INFO ] Deduced a trap composed of 14 places in 156 ms
[2020-05-21 01:03:48] [INFO ] Deduced a trap composed of 71 places in 125 ms
[2020-05-21 01:03:48] [INFO ] Deduced a trap composed of 56 places in 124 ms
[2020-05-21 01:03:48] [INFO ] Deduced a trap composed of 13 places in 125 ms
[2020-05-21 01:03:48] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1560 ms
[2020-05-21 01:03:49] [INFO ] Flatten gal took : 103 ms
[2020-05-21 01:03:49] [INFO ] Flatten gal took : 30 ms
[2020-05-21 01:03:49] [INFO ] Applying decomposition
[2020-05-21 01:03:49] [INFO ] Flatten gal took : 23 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/graph126357026990858160.txt, -o, /tmp/graph126357026990858160.bin, -w, /tmp/graph126357026990858160.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/graph126357026990858160.bin, -l, -1, -v, -w, /tmp/graph126357026990858160.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 01:03:49] [INFO ] Decomposing Gal with order
[2020-05-21 01:03:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 01:03:49] [INFO ] Removed a total of 214 redundant transitions.
[2020-05-21 01:03:49] [INFO ] Flatten gal took : 110 ms
[2020-05-21 01:03:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 12 ms.
[2020-05-21 01:03:49] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 21 ms
[2020-05-21 01:03:49] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 7 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 16 CTL formulae.
built 65 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 29 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 32 ordering constraints for composite.
built 7 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 16 ordering constraints for composite.
built 15 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 23 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 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,3.40795e+06,3.55316,85376,3095,128,128560,2089,663,430892,86,13371,0


Converting to forward existential form...Done !
original formula: A(!(AF(((((((((((((i12.i1.u5.TestIdentity_1_2_1>=1)||(i15.u8.TestIdentity_2_2_2>=1))||(i0.i0.u35.TestIdentity_0_2_0>=1))||(i14.u47.TestIdentity_3_0_3>=1))||(i13.u58.TestIdentity_3_2_3>=1))||(i2.u7.TestIdentity_2_1_2>=1))||(i8.u61.TestIdentity_3_1_3>=1))||(i1.u3.TestIdentity_1_0_1>=1))||(i6.u6.TestIdentity_2_0_2>=1))||(i9.i1.u39.TestIdentity_0_0_0>=1))||(i5.u4.TestIdentity_1_1_1>=1))||(i7.i1.u1.TestIdentity_0_1_0>=1)))) U (AF(((((((((((((((((((((((((((((((((((((((((((((((((i3.u34.BeginLoop_1_0_0>=1)||(i0.i0.u35.BeginLoop_0_2_0>=1))||(i3.u32.BeginLoop_3_0_0>=1))||(i3.u33.BeginLoop_2_0_0>=1))||(i1.u3.BeginLoop_1_0_1>=1))||(i7.i1.u1.BeginLoop_0_1_0>=1))||(i14.u44.BeginLoop_3_0_1>=1))||(i11.u46.BeginLoop_2_0_1>=1))||(i12.i0.u16.BeginLoop_1_2_0>=1))||(i7.i1.u45.BeginLoop_0_1_1>=1))||(i10.u42.BeginLoop_3_2_0>=1))||(i10.u43.BeginLoop_2_2_0>=1))||(i15.u17.BeginLoop_2_2_1>=1))||(i9.i1.u0.BeginLoop_0_0_1>=1))||(i9.i0.u25.BeginLoop_0_0_2>=1))||(i12.i1.u5.BeginLoop_1_2_1>=1))||(i2.u18.BeginLoop_2_1_1>=1))||(i13.u41.BeginLoop_3_2_1>=1))||(i0.i0.u2.BeginLoop_0_2_1>=1))||(i5.u4.BeginLoop_1_1_1>=1))||(i2.u7.BeginLoop_2_1_2>=1))||(i8.u27.BeginLoop_3_1_1>=1))||(i0.i1.u51.BeginLoop_0_2_2>=1))||(i5.u19.BeginLoop_1_1_2>=1))||(i6.u6.BeginLoop_2_0_2>=1))||(i8.u52.BeginLoop_3_1_2>=1))||(i7.i0.u54.BeginLoop_0_1_2>=1))||(i1.u53.BeginLoop_1_0_2>=1))||(i14.u47.BeginLoop_3_0_3>=1))||(i14.u55.BeginLoop_3_0_2>=1))||(i1.u30.BeginLoop_1_0_3>=1))||(i7.i0.u31.BeginLoop_0_1_3>=1))||(i13.u50.BeginLoop_3_2_2>=1))||(i6.u20.BeginLoop_2_0_3>=1))||(i12.i1.u48.BeginLoop_1_2_2>=1))||(i9.i0.u49.BeginLoop_0_0_3>=1))||(i13.u58.BeginLoop_3_2_3>=1))||(i15.u8.BeginLoop_2_2_2>=1))||(i12.i0.u56.BeginLoop_1_2_3>=1))||(i0.i1.u22.BeginLoop_0_2_3>=1))||(i15.u57.BeginLoop_2_2_3>=1))||(i5.u59.BeginLoop_1_1_3>=1))||(i8.u61.BeginLoop_3_1_3>=1))||(i2.u60.BeginLoop_2_1_3>=1))||(i9.i1.u39.BeginLoop_0_0_0>=1))||(i4.u14.BeginLoop_1_1_0>=1))||(i4.u36.BeginLoop_3_1_0>=1))||(i4.u15.BeginLoop_2_1_0>=1))) * ((((((((((((((((((((((((((((((((((((((((((((((((i3.u34.BeginLoop_1_0_0>=1)||(i0.i0.u35.BeginLoop_0_2_0>=1))||(i3.u32.BeginLoop_3_0_0>=1))||(i3.u33.BeginLoop_2_0_0>=1))||(i1.u3.BeginLoop_1_0_1>=1))||(i7.i1.u1.BeginLoop_0_1_0>=1))||(i14.u44.BeginLoop_3_0_1>=1))||(i11.u46.BeginLoop_2_0_1>=1))||(i12.i0.u16.BeginLoop_1_2_0>=1))||(i7.i1.u45.BeginLoop_0_1_1>=1))||(i10.u42.BeginLoop_3_2_0>=1))||(i10.u43.BeginLoop_2_2_0>=1))||(i15.u17.BeginLoop_2_2_1>=1))||(i9.i1.u0.BeginLoop_0_0_1>=1))||(i9.i0.u25.BeginLoop_0_0_2>=1))||(i12.i1.u5.BeginLoop_1_2_1>=1))||(i2.u18.BeginLoop_2_1_1>=1))||(i13.u41.BeginLoop_3_2_1>=1))||(i0.i0.u2.BeginLoop_0_2_1>=1))||(i5.u4.BeginLoop_1_1_1>=1))||(i2.u7.BeginLoop_2_1_2>=1))||(i8.u27.BeginLoop_3_1_1>=1))||(i0.i1.u51.BeginLoop_0_2_2>=1))||(i5.u19.BeginLoop_1_1_2>=1))||(i6.u6.BeginLoop_2_0_2>=1))||(i8.u52.BeginLoop_3_1_2>=1))||(i7.i0.u54.BeginLoop_0_1_2>=1))||(i1.u53.BeginLoop_1_0_2>=1))||(i14.u47.BeginLoop_3_0_3>=1))||(i14.u55.BeginLoop_3_0_2>=1))||(i1.u30.BeginLoop_1_0_3>=1))||(i7.i0.u31.BeginLoop_0_1_3>=1))||(i13.u50.BeginLoop_3_2_2>=1))||(i6.u20.BeginLoop_2_0_3>=1))||(i12.i1.u48.BeginLoop_1_2_2>=1))||(i9.i0.u49.BeginLoop_0_0_3>=1))||(i13.u58.BeginLoop_3_2_3>=1))||(i15.u8.BeginLoop_2_2_2>=1))||(i12.i0.u56.BeginLoop_1_2_3>=1))||(i0.i1.u22.BeginLoop_0_2_3>=1))||(i15.u57.BeginLoop_2_2_3>=1))||(i5.u59.BeginLoop_1_1_3>=1))||(i8.u61.BeginLoop_3_1_3>=1))||(i2.u60.BeginLoop_2_1_3>=1))||(i9.i1.u39.BeginLoop_0_0_0>=1))||(i4.u14.BeginLoop_1_1_0>=1))||(i4.u36.BeginLoop_3_1_0>=1))||(i4.u15.BeginLoop_2_1_0>=1))))
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(!(((((((((((((((((((((((((((((((((((((((((((((((((i3.u34.BeginLoop_1_0_0>=1)||(i0.i0.u35.BeginLoop_0_2_0>=1))||(i3.u32.BeginLoop_3_0_0>=1))||(i3.u33.BeginLoop_2_0_0>=1))||(i1.u3.BeginLoop_1_0_1>=1))||(i7.i1.u1.BeginLoop_0_1_0>=1))||(i14.u44.BeginLoop_3_0_1>=1))||(i11.u46.BeginLoop_2_0_1>=1))||(i12.i0.u16.BeginLoop_1_2_0>=1))||(i7.i1.u45.BeginLoop_0_1_1>=1))||(i10.u42.BeginLoop_3_2_0>=1))||(i10.u43.BeginLoop_2_2_0>=1))||(i15.u17.BeginLoop_2_2_1>=1))||(i9.i1.u0.BeginLoop_0_0_1>=1))||(i9.i0.u25.BeginLoop_0_0_2>=1))||(i12.i1.u5.BeginLoop_1_2_1>=1))||(i2.u18.BeginLoop_2_1_1>=1))||(i13.u41.BeginLoop_3_2_1>=1))||(i0.i0.u2.BeginLoop_0_2_1>=1))||(i5.u4.BeginLoop_1_1_1>=1))||(i2.u7.BeginLoop_2_1_2>=1))||(i8.u27.BeginLoop_3_1_1>=1))||(i0.i1.u51.BeginLoop_0_2_2>=1))||(i5.u19.BeginLoop_1_1_2>=1))||(i6.u6.BeginLoop_2_0_2>=1))||(i8.u52.BeginLoop_3_1_2>=1))||(i7.i0.u54.BeginLoop_0_1_2>=1))||(i1.u53.BeginLoop_1_0_2>=1))||(i14.u47.BeginLoop_3_0_3>=1))||(i14.u55.BeginLoop_3_0_2>=1))||(i1.u30.BeginLoop_1_0_3>=1))||(i7.i0.u31.BeginLoop_0_1_3>=1))||(i13.u50.BeginLoop_3_2_2>=1))||(i6.u20.BeginLoop_2_0_3>=1))||(i12.i1.u48.BeginLoop_1_2_2>=1))||(i9.i0.u49.BeginLoop_0_0_3>=1))||(i13.u58.BeginLoop_3_2_3>=1))||(i15.u8.BeginLoop_2_2_2>=1))||(i12.i0.u56.BeginLoop_1_2_3>=1))||(i0.i1.u22.BeginLoop_0_2_3>=1))||(i15.u57.BeginLoop_2_2_3>=1))||(i5.u59.BeginLoop_1_1_3>=1))||(i8.u61.BeginLoop_3_1_3>=1))||(i2.u60.BeginLoop_2_1_3>=1))||(i9.i1.u39.BeginLoop_0_0_0>=1))||(i4.u14.BeginLoop_1_1_0>=1))||(i4.u36.BeginLoop_3_1_0>=1))||(i4.u15.BeginLoop_2_1_0>=1))))) * ((((((((((((((((((((((((((((((((((((((((((((((((i3.u34.BeginLoop_1_0_0>=1)||(i0.i0.u35.BeginLoop_0_2_0>=1))||(i3.u32.BeginLoop_3_0_0>=1))||(i3.u33.BeginLoop_2_0_0>=1))||(i1.u3.BeginLoop_1_0_1>=1))||(i7.i1.u1.BeginLoop_0_1_0>=1))||(i14.u44.BeginLoop_3_0_1>=1))||(i11.u46.BeginLoop_2_0_1>=1))||(i12.i0.u16.BeginLoop_1_2_0>=1))||(i7.i1.u45.BeginLoop_0_1_1>=1))||(i10.u42.BeginLoop_3_2_0>=1))||(i10.u43.BeginLoop_2_2_0>=1))||(i15.u17.BeginLoop_2_2_1>=1))||(i9.i1.u0.BeginLoop_0_0_1>=1))||(i9.i0.u25.BeginLoop_0_0_2>=1))||(i12.i1.u5.BeginLoop_1_2_1>=1))||(i2.u18.BeginLoop_2_1_1>=1))||(i13.u41.BeginLoop_3_2_1>=1))||(i0.i0.u2.BeginLoop_0_2_1>=1))||(i5.u4.BeginLoop_1_1_1>=1))||(i2.u7.BeginLoop_2_1_2>=1))||(i8.u27.BeginLoop_3_1_1>=1))||(i0.i1.u51.BeginLoop_0_2_2>=1))||(i5.u19.BeginLoop_1_1_2>=1))||(i6.u6.BeginLoop_2_0_2>=1))||(i8.u52.BeginLoop_3_1_2>=1))||(i7.i0.u54.BeginLoop_0_1_2>=1))||(i1.u53.BeginLoop_1_0_2>=1))||(i14.u47.BeginLoop_3_0_3>=1))||(i14.u55.BeginLoop_3_0_2>=1))||(i1.u30.BeginLoop_1_0_3>=1))||(i7.i0.u31.BeginLoop_0_1_3>=1))||(i13.u50.BeginLoop_3_2_2>=1))||(i6.u20.BeginLoop_2_0_3>=1))||(i12.i1.u48.BeginLoop_1_2_2>=1))||(i9.i0.u49.BeginLoop_0_0_3>=1))||(i13.u58.BeginLoop_3_2_3>=1))||(i15.u8.BeginLoop_2_2_2>=1))||(i12.i0.u56.BeginLoop_1_2_3>=1))||(i0.i1.u22.BeginLoop_0_2_3>=1))||(i15.u57.BeginLoop_2_2_3>=1))||(i5.u59.BeginLoop_1_1_3>=1))||(i8.u61.BeginLoop_3_1_3>=1))||(i2.u60.BeginLoop_2_1_3>=1))||(i9.i1.u39.BeginLoop_0_0_0>=1))||(i4.u14.BeginLoop_1_1_0>=1))||(i4.u36.BeginLoop_3_1_0>=1))||(i4.u15.BeginLoop_2_1_0>=1))))))) * !(E(!((!(EG(!(((((((((((((((((((((((((((((((((((((((((((((((((i3.u34.BeginLoop_1_0_0>=1)||(i0.i0.u35.BeginLoop_0_2_0>=1))||(i3.u32.BeginLoop_3_0_0>=1))||(i3.u33.BeginLoop_2_0_0>=1))||(i1.u3.BeginLoop_1_0_1>=1))||(i7.i1.u1.BeginLoop_0_1_0>=1))||(i14.u44.BeginLoop_3_0_1>=1))||(i11.u46.BeginLoop_2_0_1>=1))||(i12.i0.u16.BeginLoop_1_2_0>=1))||(i7.i1.u45.BeginLoop_0_1_1>=1))||(i10.u42.BeginLoop_3_2_0>=1))||(i10.u43.BeginLoop_2_2_0>=1))||(i15.u17.BeginLoop_2_2_1>=1))||(i9.i1.u0.BeginLoop_0_0_1>=1))||(i9.i0.u25.BeginLoop_0_0_2>=1))||(i12.i1.u5.BeginLoop_1_2_1>=1))||(i2.u18.BeginLoop_2_1_1>=1))||(i13.u41.BeginLoop_3_2_1>=1))||(i0.i0.u2.BeginLoop_0_2_1>=1))||(i5.u4.BeginLoop_1_1_1>=1))||(i2.u7.BeginLoop_2_1_2>=1))||(i8.u27.BeginLoop_3_1_1>=1))||(i0.i1.u51.BeginLoop_0_2_2>=1))||(i5.u19.BeginLoop_1_1_2>=1))||(i6.u6.BeginLoop_2_0_2>=1))||(i8.u52.BeginLoop_3_1_2>=1))||(i7.i0.u54.BeginLoop_0_1_2>=1))||(i1.u53.BeginLoop_1_0_2>=1))||(i14.u47.BeginLoop_3_0_3>=1))||(i14.u55.BeginLoop_3_0_2>=1))||(i1.u30.BeginLoop_1_0_3>=1))||(i7.i0.u31.BeginLoop_0_1_3>=1))||(i13.u50.BeginLoop_3_2_2>=1))||(i6.u20.BeginLoop_2_0_3>=1))||(i12.i1.u48.BeginLoop_1_2_2>=1))||(i9.i0.u49.BeginLoop_0_0_3>=1))||(i13.u58.BeginLoop_3_2_3>=1))||(i15.u8.BeginLoop_2_2_2>=1))||(i12.i0.u56.BeginLoop_1_2_3>=1))||(i0.i1.u22.BeginLoop_0_2_3>=1))||(i15.u57.BeginLoop_2_2_3>=1))||(i5.u59.BeginLoop_1_1_3>=1))||(i8.u61.BeginLoop_3_1_3>=1))||(i2.u60.BeginLoop_2_1_3>=1))||(i9.i1.u39.BeginLoop_0_0_0>=1))||(i4.u14.BeginLoop_1_1_0>=1))||(i4.u36.BeginLoop_3_1_0>=1))||(i4.u15.BeginLoop_2_1_0>=1))))) * ((((((((((((((((((((((((((((((((((((((((((((((((i3.u34.BeginLoop_1_0_0>=1)||(i0.i0.u35.BeginLoop_0_2_0>=1))||(i3.u32.BeginLoop_3_0_0>=1))||(i3.u33.BeginLoop_2_0_0>=1))||(i1.u3.BeginLoop_1_0_1>=1))||(i7.i1.u1.BeginLoop_0_1_0>=1))||(i14.u44.BeginLoop_3_0_1>=1))||(i11.u46.BeginLoop_2_0_1>=1))||(i12.i0.u16.BeginLoop_1_2_0>=1))||(i7.i1.u45.BeginLoop_0_1_1>=1))||(i10.u42.BeginLoop_3_2_0>=1))||(i10.u43.BeginLoop_2_2_0>=1))||(i15.u17.BeginLoop_2_2_1>=1))||(i9.i1.u0.BeginLoop_0_0_1>=1))||(i9.i0.u25.BeginLoop_0_0_2>=1))||(i12.i1.u5.BeginLoop_1_2_1>=1))||(i2.u18.BeginLoop_2_1_1>=1))||(i13.u41.BeginLoop_3_2_1>=1))||(i0.i0.u2.BeginLoop_0_2_1>=1))||(i5.u4.BeginLoop_1_1_1>=1))||(i2.u7.BeginLoop_2_1_2>=1))||(i8.u27.BeginLoop_3_1_1>=1))||(i0.i1.u51.BeginLoop_0_2_2>=1))||(i5.u19.BeginLoop_1_1_2>=1))||(i6.u6.BeginLoop_2_0_2>=1))||(i8.u52.BeginLoop_3_1_2>=1))||(i7.i0.u54.BeginLoop_0_1_2>=1))||(i1.u53.BeginLoop_1_0_2>=1))||(i14.u47.BeginLoop_3_0_3>=1))||(i14.u55.BeginLoop_3_0_2>=1))||(i1.u30.BeginLoop_1_0_3>=1))||(i7.i0.u31.BeginLoop_0_1_3>=1))||(i13.u50.BeginLoop_3_2_2>=1))||(i6.u20.BeginLoop_2_0_3>=1))||(i12.i1.u48.BeginLoop_1_2_2>=1))||(i9.i0.u49.BeginLoop_0_0_3>=1))||(i13.u58.BeginLoop_3_2_3>=1))||(i15.u8.BeginLoop_2_2_2>=1))||(i12.i0.u56.BeginLoop_1_2_3>=1))||(i0.i1.u22.BeginLoop_0_2_3>=1))||(i15.u57.BeginLoop_2_2_3>=1))||(i5.u59.BeginLoop_1_1_3>=1))||(i8.u61.BeginLoop_3_1_3>=1))||(i2.u60.BeginLoop_2_1_3>=1))||(i9.i1.u39.BeginLoop_0_0_0>=1))||(i4.u14.BeginLoop_1_1_0>=1))||(i4.u36.BeginLoop_3_1_0>=1))||(i4.u15.BeginLoop_2_1_0>=1)))) U (!(!(!(EG(!(((((((((((((i12.i1.u5.TestIdentity_1_2_1>=1)||(i15.u8.TestIdentity_2_2_2>=1))||(i0.i0.u35.TestIdentity_0_2_0>=1))||(i14.u47.TestIdentity_3_0_3>=1))||(i13.u58.TestIdentity_3_2_3>=1))||(i2.u7.TestIdentity_2_1_2>=1))||(i8.u61.TestIdentity_3_1_3>=1))||(i1.u3.TestIdentity_1_0_1>=1))||(i6.u6.TestIdentity_2_0_2>=1))||(i9.i1.u39.TestIdentity_0_0_0>=1))||(i5.u4.TestIdentity_1_1_1>=1))||(i7.i1.u1.TestIdentity_0_1_0>=1))))))) * !((!(EG(!(((((((((((((((((((((((((((((((((((((((((((((((((i3.u34.BeginLoop_1_0_0>=1)||(i0.i0.u35.BeginLoop_0_2_0>=1))||(i3.u32.BeginLoop_3_0_0>=1))||(i3.u33.BeginLoop_2_0_0>=1))||(i1.u3.BeginLoop_1_0_1>=1))||(i7.i1.u1.BeginLoop_0_1_0>=1))||(i14.u44.BeginLoop_3_0_1>=1))||(i11.u46.BeginLoop_2_0_1>=1))||(i12.i0.u16.BeginLoop_1_2_0>=1))||(i7.i1.u45.BeginLoop_0_1_1>=1))||(i10.u42.BeginLoop_3_2_0>=1))||(i10.u43.BeginLoop_2_2_0>=1))||(i15.u17.BeginLoop_2_2_1>=1))||(i9.i1.u0.BeginLoop_0_0_1>=1))||(i9.i0.u25.BeginLoop_0_0_2>=1))||(i12.i1.u5.BeginLoop_1_2_1>=1))||(i2.u18.BeginLoop_2_1_1>=1))||(i13.u41.BeginLoop_3_2_1>=1))||(i0.i0.u2.BeginLoop_0_2_1>=1))||(i5.u4.BeginLoop_1_1_1>=1))||(i2.u7.BeginLoop_2_1_2>=1))||(i8.u27.BeginLoop_3_1_1>=1))||(i0.i1.u51.BeginLoop_0_2_2>=1))||(i5.u19.BeginLoop_1_1_2>=1))||(i6.u6.BeginLoop_2_0_2>=1))||(i8.u52.BeginLoop_3_1_2>=1))||(i7.i0.u54.BeginLoop_0_1_2>=1))||(i1.u53.BeginLoop_1_0_2>=1))||(i14.u47.BeginLoop_3_0_3>=1))||(i14.u55.BeginLoop_3_0_2>=1))||(i1.u30.BeginLoop_1_0_3>=1))||(i7.i0.u31.BeginLoop_0_1_3>=1))||(i13.u50.BeginLoop_3_2_2>=1))||(i6.u20.BeginLoop_2_0_3>=1))||(i12.i1.u48.BeginLoop_1_2_2>=1))||(i9.i0.u49.BeginLoop_0_0_3>=1))||(i13.u58.BeginLoop_3_2_3>=1))||(i15.u8.BeginLoop_2_2_2>=1))||(i12.i0.u56.BeginLoop_1_2_3>=1))||(i0.i1.u22.BeginLoop_0_2_3>=1))||(i15.u57.BeginLoop_2_2_3>=1))||(i5.u59.BeginLoop_1_1_3>=1))||(i8.u61.BeginLoop_3_1_3>=1))||(i2.u60.BeginLoop_2_1_3>=1))||(i9.i1.u39.BeginLoop_0_0_0>=1))||(i4.u14.BeginLoop_1_1_0>=1))||(i4.u36.BeginLoop_3_1_0>=1))||(i4.u15.BeginLoop_2_1_0>=1))))) * ((((((((((((((((((((((((((((((((((((((((((((((((i3.u34.BeginLoop_1_0_0>=1)||(i0.i0.u35.BeginLoop_0_2_0>=1))||(i3.u32.BeginLoop_3_0_0>=1))||(i3.u33.BeginLoop_2_0_0>=1))||(i1.u3.BeginLoop_1_0_1>=1))||(i7.i1.u1.BeginLoop_0_1_0>=1))||(i14.u44.BeginLoop_3_0_1>=1))||(i11.u46.BeginLoop_2_0_1>=1))||(i12.i0.u16.BeginLoop_1_2_0>=1))||(i7.i1.u45.BeginLoop_0_1_1>=1))||(i10.u42.BeginLoop_3_2_0>=1))||(i10.u43.BeginLoop_2_2_0>=1))||(i15.u17.BeginLoop_2_2_1>=1))||(i9.i1.u0.BeginLoop_0_0_1>=1))||(i9.i0.u25.BeginLoop_0_0_2>=1))||(i12.i1.u5.BeginLoop_1_2_1>=1))||(i2.u18.BeginLoop_2_1_1>=1))||(i13.u41.BeginLoop_3_2_1>=1))||(i0.i0.u2.BeginLoop_0_2_1>=1))||(i5.u4.BeginLoop_1_1_1>=1))||(i2.u7.BeginLoop_2_1_2>=1))||(i8.u27.BeginLoop_3_1_1>=1))||(i0.i1.u51.BeginLoop_0_2_2>=1))||(i5.u19.BeginLoop_1_1_2>=1))||(i6.u6.BeginLoop_2_0_2>=1))||(i8.u52.BeginLoop_3_1_2>=1))||(i7.i0.u54.BeginLoop_0_1_2>=1))||(i1.u53.BeginLoop_1_0_2>=1))||(i14.u47.BeginLoop_3_0_3>=1))||(i14.u55.BeginLoop_3_0_2>=1))||(i1.u30.BeginLoop_1_0_3>=1))||(i7.i0.u31.BeginLoop_0_1_3>=1))||(i13.u50.BeginLoop_3_2_2>=1))||(i6.u20.BeginLoop_2_0_3>=1))||(i12.i1.u48.BeginLoop_1_2_2>=1))||(i9.i0.u49.BeginLoop_0_0_3>=1))||(i13.u58.BeginLoop_3_2_3>=1))||(i15.u8.BeginLoop_2_2_2>=1))||(i12.i0.u56.BeginLoop_1_2_3>=1))||(i0.i1.u22.BeginLoop_0_2_3>=1))||(i15.u57.BeginLoop_2_2_3>=1))||(i5.u59.BeginLoop_1_1_3>=1))||(i8.u61.BeginLoop_3_1_3>=1))||(i2.u60.BeginLoop_2_1_3>=1))||(i9.i1.u39.BeginLoop_0_0_0>=1))||(i4.u14.BeginLoop_1_1_0>=1))||(i4.u36.BeginLoop_3_1_0>=1))||(i4.u15.BeginLoop_2_1_0>=1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions BecomeIdle_0, BecomeIdle_1, BecomeIdle_2, BecomeIdle_3, EndLoop_3_1, EndLoop_3_0, NotAlone_2_3_0, NotAlone_1_3_0, NotAlone_0_3_0, NotAlone_3_2_0, NotAlone_1_2_0, NotAlone_0_2_0, NotAlone_3_1_0, NotAlone_3_2_1, NotAlone_1_2_1, NotAlone_0_2_1, NotAlone_3_1_1, NotAlone_2_1_1, NotAlone_2_1_0, NotAlone_2_1_2, NotAlone_0_3_1, NotAlone_1_3_1, NotAlone_2_3_1, NotAlone_0_3_2, NotAlone_1_3_2, NotAlone_2_3_2, NotAlone_3_1_2, NotAlone_0_2_2, NotAlone_3_2_2, UpdateTurn_1_2_2, UpdateTurn_1_1_2, i3.UpdateTurn_1_3_0, i3.UpdateTurn_2_3_0, i3.UpdateTurn_2_0_0, i3.UpdateTurn_1_0_0, i3.UpdateTurn_0_1_0, i3.UpdateTurn_3_0_0, i3.UpdateTurn_2_1_0, i3.UpdateTurn_0_2_0, i3.UpdateTurn_3_1_0, i3.UpdateTurn_1_2_0, i3.UpdateTurn_0_3_0, i3.UpdateTurn_3_2_0, i3.u9.EndLoop_0_0, i3.u9.UpdateTurn_0_0_0, i3.u10.UpdateTurn_3_3_0, i3.u63.EndLoop_2_0, i3.u63.UpdateTurn_2_2_0, i3.u64.EndLoop_1_0, i3.u64.UpdateTurn_1_1_0, i4.UpdateTurn_3_0_1, i4.UpdateTurn_0_1_1, i4.UpdateTurn_1_0_1, i4.UpdateTurn_2_0_1, i4.UpdateTurn_3_1_1, i4.UpdateTurn_0_2_1, i4.UpdateTurn_2_1_1, i4.UpdateTurn_3_2_1, i4.UpdateTurn_0_3_1, i4.UpdateTurn_1_2_1, i4.UpdateTurn_2_3_1, i4.UpdateTurn_1_3_1, i4.u11.EndLoop_1_1, i4.u11.UpdateTurn_1_1_1, i4.u29.EndLoop_0_1, i4.u29.UpdateTurn_0_0_1, i4.u38.UpdateTurn_3_3_1, i4.u62.EndLoop_2_1, i4.u62.UpdateTurn_2_2_1, i10.UpdateTurn_0_0_2, i10.UpdateTurn_0_1_2, i10.UpdateTurn_2_2_2, i10.UpdateTurn_2_3_2, i10.u40.UpdateTurn_3_3_2, i10.u40.UpdateTurn_3_2_2, i10.u40.UpdateTurn_3_1_2, i10.u40.UpdateTurn_3_0_2, i12.NotAlone_1_2_2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/247/78/325
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,49.2442,907080,1,0,1.26806e+06,2815,3813,5.41521e+06,453,13840,2315170
FORMULA Peterson-PT-3-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(AG((((((((((((((i12.i1.u5.TestIdentity_1_2_1<1)&&(i15.u8.TestIdentity_2_2_2<1))&&(i0.i0.u35.TestIdentity_0_2_0<1))&&(i14.u47.TestIdentity_3_0_3<1))&&(i13.u58.TestIdentity_3_2_3<1))&&(i2.u7.TestIdentity_2_1_2<1))&&(i8.u61.TestIdentity_3_1_3<1))&&(i1.u3.TestIdentity_1_0_1<1))&&(i6.u6.TestIdentity_2_0_2<1))&&(i9.i1.u39.TestIdentity_0_0_0<1))&&(i5.u4.TestIdentity_1_1_1<1))&&(i7.i1.u1.TestIdentity_0_1_0<1))&&(((((i3.u23.WantSection_3_F>=1)&&(i3.u23.Idle_3>=1))||((i12.i0.u65.WantSection_2_F>=1)&&(i12.i0.u65.Idle_2>=1)))||((i6.u24.WantSection_1_F>=1)&&(i6.u24.Idle_1>=1)))||((i11.u21.WantSection_0_F>=1)&&(i11.u21.Idle_0>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((((((((((((i12.i1.u5.TestIdentity_1_2_1<1)&&(i15.u8.TestIdentity_2_2_2<1))&&(i0.i0.u35.TestIdentity_0_2_0<1))&&(i14.u47.TestIdentity_3_0_3<1))&&(i13.u58.TestIdentity_3_2_3<1))&&(i2.u7.TestIdentity_2_1_2<1))&&(i8.u61.TestIdentity_3_1_3<1))&&(i1.u3.TestIdentity_1_0_1<1))&&(i6.u6.TestIdentity_2_0_2<1))&&(i9.i1.u39.TestIdentity_0_0_0<1))&&(i5.u4.TestIdentity_1_1_1<1))&&(i7.i1.u1.TestIdentity_0_1_0<1))&&(((((i3.u23.WantSection_3_F>=1)&&(i3.u23.Idle_3>=1))||((i12.i0.u65.WantSection_2_F>=1)&&(i12.i0.u65.Idle_2>=1)))||((i6.u24.WantSection_1_F>=1)&&(i6.u24.Idle_1>=1)))||((i11.u21.WantSection_0_F>=1)&&(i11.u21.Idle_0>=1))))))))] != FALSE
(forward)formula 1,0,49.8721,920808,1,0,1.29283e+06,2939,4328,5.47706e+06,471,14199,2385798
FORMULA Peterson-PT-3-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((!(EF((((((((((((((i10.u40.TestTurn_3_2>=1)&&(i10.u40.Turn_2_3>=1))||((i3.u63.TestTurn_2_0>=1)&&(i3.u63.Turn_0_2>=1)))||((i3.u64.TestTurn_1_0>=1)&&(i3.u64.Turn_0_1>=1)))||((i4.u29.TestTurn_0_1>=1)&&(i4.u29.Turn_1_0>=1)))||((i10.u12.TestTurn_2_2>=1)&&(i10.u40.Turn_2_2>=1)))||((i12.i0.u13.TestTurn_1_2>=1)&&(i10.u40.Turn_2_1>=1)))||((i10.u37.TestTurn_0_2>=1)&&(i10.u40.Turn_2_0>=1)))||((i4.u11.TestTurn_1_1>=1)&&(i4.u11.Turn_1_1>=1)))||((i4.u38.TestTurn_3_1>=1)&&(i4.u38.Turn_1_3>=1)))||((i3.u9.TestTurn_0_0>=1)&&(i3.u9.Turn_0_0>=1)))||((i4.u62.TestTurn_2_1>=1)&&(i4.u62.Turn_1_2>=1)))||((i3.u10.TestTurn_3_0>=1)&&(i3.u10.Turn_0_3>=1))))) * (((((((((((((((((((((((((((((((((((((((((((((((((i3.u64.Turn_0_1>=1)&&(i3.u63.AskForSection_2_0>=1))||((i3.u9.Turn_0_0>=1)&&(i3.u64.AskForSection_1_0>=1)))||((i3.u64.Turn_0_1>=1)&&(i3.u64.AskForSection_1_0>=1)))||((i3.u9.Turn_0_0>=1)&&(i3.u9.AskForSection_0_0>=1)))||((i3.u64.Turn_0_1>=1)&&(i3.u10.AskForSection_3_0>=1)))||((i10.u37.AskForSection_0_2>=1)&&(i10.u40.Turn_2_3>=1)))||((i3.u9.Turn_0_0>=1)&&(i3.u10.AskForSection_3_0>=1)))||((i3.u9.Turn_0_0>=1)&&(i3.u63.AskForSection_2_0>=1)))||((i3.u10.AskForSection_3_0>=1)&&(i3.u10.Turn_0_3>=1)))||((i10.u40.Turn_2_2>=1)&&(i10.u12.AskForSection_2_2>=1)))||((i10.u40.Turn_2_0>=1)&&(i10.u37.AskForSection_0_2>=1)))||((i10.u40.Turn_2_2>=1)&&(i12.i0.u13.AskForSection_1_2>=1)))||((i10.u40.Turn_2_2>=1)&&(i10.u40.AskForSection_3_2>=1)))||((i10.u40.Turn_2_1>=1)&&(i10.u37.AskForSection_0_2>=1)))||((i4.u62.Turn_1_2>=1)&&(i4.u29.AskForSection_0_1>=1)))||((i3.u64.Turn_0_1>=1)&&(i3.u9.AskForSection_0_0>=1)))||((i4.u62.Turn_1_2>=1)&&(i4.u38.AskForSection_3_1>=1)))||((i4.u62.Turn_1_2>=1)&&(i4.u11.AskForSection_1_1>=1)))||((i4.u62.Turn_1_2>=1)&&(i4.u62.AskForSection_2_1>=1)))||((i4.u62.AskForSection_2_1>=1)&&(i4.u38.Turn_1_3>=1)))||((i4.u38.AskForSection_3_1>=1)&&(i4.u38.Turn_1_3>=1)))||((i3.u63.AskForSection_2_0>=1)&&(i3.u10.Turn_0_3>=1)))||((i3.u63.Turn_0_2>=1)&&(i3.u9.AskForSection_0_0>=1)))||((i10.u40.Turn_2_1>=1)&&(i10.u40.AskForSection_3_2>=1)))||((i3.u63.Turn_0_2>=1)&&(i3.u64.AskForSection_1_0>=1)))||((i3.u63.Turn_0_2>=1)&&(i3.u63.AskForSection_2_0>=1)))||((i10.u40.Turn_2_1>=1)&&(i12.i0.u13.AskForSection_1_2>=1)))||((i3.u63.Turn_0_2>=1)&&(i3.u10.AskForSection_3_0>=1)))||((i10.u40.Turn_2_3>=1)&&(i10.u40.AskForSection_3_2>=1)))||((i10.u40.Turn_2_1>=1)&&(i10.u12.AskForSection_2_2>=1)))||((i3.u9.AskForSection_0_0>=1)&&(i3.u10.Turn_0_3>=1)))||((i10.u40.Turn_2_3>=1)&&(i12.i0.u13.AskForSection_1_2>=1)))||((i10.u40.Turn_2_2>=1)&&(i10.u37.AskForSection_0_2>=1)))||((i4.u11.AskForSection_1_1>=1)&&(i4.u38.Turn_1_3>=1)))||((i10.u40.Turn_2_3>=1)&&(i10.u12.AskForSection_2_2>=1)))||((i4.u29.Turn_1_0>=1)&&(i4.u11.AskForSection_1_1>=1)))||((i4.u29.Turn_1_0>=1)&&(i4.u62.AskForSection_2_1>=1)))||((i10.u40.Turn_2_0>=1)&&(i10.u40.AskForSection_3_2>=1)))||((i4.u29.Turn_1_0>=1)&&(i4.u29.AskForSection_0_1>=1)))||((i10.u40.Turn_2_0>=1)&&(i12.i0.u13.AskForSection_1_2>=1)))||((i10.u40.Turn_2_0>=1)&&(i10.u12.AskForSection_2_2>=1)))||((i4.u11.Turn_1_1>=1)&&(i4.u11.AskForSection_1_1>=1)))||((i4.u11.Turn_1_1>=1)&&(i4.u29.AskForSection_0_1>=1)))||((i3.u64.AskForSection_1_0>=1)&&(i3.u10.Turn_0_3>=1)))||((i4.u11.Turn_1_1>=1)&&(i4.u38.AskForSection_3_1>=1)))||((i4.u29.Turn_1_0>=1)&&(i4.u38.AskForSection_3_1>=1)))||((i4.u29.AskForSection_0_1>=1)&&(i4.u38.Turn_1_3>=1)))||((i4.u11.Turn_1_1>=1)&&(i4.u62.AskForSection_2_1>=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (((((((((((((((((((((((((((((((((((((((((((((((((i3.u64.Turn_0_1>=1)&&(i3.u63.AskForSection_2_0>=1))||((i3.u9.Turn_0_0>=1)&&(i3.u64.AskForSection_1_0>=1)))||((i3.u64.Turn_0_1>=1)&&(i3.u64.AskForSection_1_0>=1)))||((i3.u9.Turn_0_0>=1)&&(i3.u9.AskForSection_0_0>=1)))||((i3.u64.Turn_0_1>=1)&&(i3.u10.AskForSection_3_0>=1)))||((i10.u37.AskForSection_0_2>=1)&&(i10.u40.Turn_2_3>=1)))||((i3.u9.Turn_0_0>=1)&&(i3.u10.AskForSection_3_0>=1)))||((i3.u9.Turn_0_0>=1)&&(i3.u63.AskForSection_2_0>=1)))||((i3.u10.AskForSection_3_0>=1)&&(i3.u10.Turn_0_3>=1)))||((i10.u40.Turn_2_2>=1)&&(i10.u12.AskForSection_2_2>=1)))||((i10.u40.Turn_2_0>=1)&&(i10.u37.AskForSection_0_2>=1)))||((i10.u40.Turn_2_2>=1)&&(i12.i0.u13.AskForSection_1_2>=1)))||((i10.u40.Turn_2_2>=1)&&(i10.u40.AskForSection_3_2>=1)))||((i10.u40.Turn_2_1>=1)&&(i10.u37.AskForSection_0_2>=1)))||((i4.u62.Turn_1_2>=1)&&(i4.u29.AskForSection_0_1>=1)))||((i3.u64.Turn_0_1>=1)&&(i3.u9.AskForSection_0_0>=1)))||((i4.u62.Turn_1_2>=1)&&(i4.u38.AskForSection_3_1>=1)))||((i4.u62.Turn_1_2>=1)&&(i4.u11.AskForSection_1_1>=1)))||((i4.u62.Turn_1_2>=1)&&(i4.u62.AskForSection_2_1>=1)))||((i4.u62.AskForSection_2_1>=1)&&(i4.u38.Turn_1_3>=1)))||((i4.u38.AskForSection_3_1>=1)&&(i4.u38.Turn_1_3>=1)))||((i3.u63.AskForSection_2_0>=1)&&(i3.u10.Turn_0_3>=1)))||((i3.u63.Turn_0_2>=1)&&(i3.u9.AskForSection_0_0>=1)))||((i10.u40.Turn_2_1>=1)&&(i10.u40.AskForSection_3_2>=1)))||((i3.u63.Turn_0_2>=1)&&(i3.u64.AskForSection_1_0>=1)))||((i3.u63.Turn_0_2>=1)&&(i3.u63.AskForSection_2_0>=1)))||((i10.u40.Turn_2_1>=1)&&(i12.i0.u13.AskForSection_1_2>=1)))||((i3.u63.Turn_0_2>=1)&&(i3.u10.AskForSection_3_0>=1)))||((i10.u40.Turn_2_3>=1)&&(i10.u40.AskForSection_3_2>=1)))||((i10.u40.Turn_2_1>=1)&&(i10.u12.AskForSection_2_2>=1)))||((i3.u9.AskForSection_0_0>=1)&&(i3.u10.Turn_0_3>=1)))||((i10.u40.Turn_2_3>=1)&&(i12.i0.u13.AskForSection_1_2>=1)))||((i10.u40.Turn_2_2>=1)&&(i10.u37.AskForSection_0_2>=1)))||((i4.u11.AskForSection_1_1>=1)&&(i4.u38.Turn_1_3>=1)))||((i10.u40.Turn_2_3>=1)&&(i10.u12.AskForSection_2_2>=1)))||((i4.u29.Turn_1_0>=1)&&(i4.u11.AskForSection_1_1>=1)))||((i4.u29.Turn_1_0>=1)&&(i4.u62.AskForSection_2_1>=1)))||((i10.u40.Turn_2_0>=1)&&(i10.u40.AskForSection_3_2>=1)))||((i4.u29.Turn_1_0>=1)&&(i4.u29.AskForSection_0_1>=1)))||((i10.u40.Turn_2_0>=1)&&(i12.i0.u13.AskForSection_1_2>=1)))||((i10.u40.Turn_2_0>=1)&&(i10.u12.AskForSection_2_2>=1)))||((i4.u11.Turn_1_1>=1)&&(i4.u11.AskForSection_1_1>=1)))||((i4.u11.Turn_1_1>=1)&&(i4.u29.AskForSection_0_1>=1)))||((i3.u64.AskForSection_1_0>=1)&&(i3.u10.Turn_0_3>=1)))||((i4.u11.Turn_1_1>=1)&&(i4.u38.AskForSection_3_1>=1)))||((i4.u29.Turn_1_0>=1)&&(i4.u38.AskForSection_3_1>=1)))||((i4.u29.AskForSection_0_1>=1)&&(i4.u38.Turn_1_3>=1)))||((i4.u11.Turn_1_1>=1)&&(i4.u62.AskForSection_2_1>=1)))) * !(E(TRUE U (((((((((((((i10.u40.TestTurn_3_2>=1)&&(i10.u40.Turn_2_3>=1))||((i3.u63.TestTurn_2_0>=1)&&(i3.u63.Turn_0_2>=1)))||((i3.u64.TestTurn_1_0>=1)&&(i3.u64.Turn_0_1>=1)))||((i4.u29.TestTurn_0_1>=1)&&(i4.u29.Turn_1_0>=1)))||((i10.u12.TestTurn_2_2>=1)&&(i10.u40.Turn_2_2>=1)))||((i12.i0.u13.TestTurn_1_2>=1)&&(i10.u40.Turn_2_1>=1)))||((i10.u37.TestTurn_0_2>=1)&&(i10.u40.Turn_2_0>=1)))||((i4.u11.TestTurn_1_1>=1)&&(i4.u11.Turn_1_1>=1)))||((i4.u38.TestTurn_3_1>=1)&&(i4.u38.Turn_1_3>=1)))||((i3.u9.TestTurn_0_0>=1)&&(i3.u9.Turn_0_0>=1)))||((i4.u62.TestTurn_2_1>=1)&&(i4.u62.Turn_1_2>=1)))||((i3.u10.TestTurn_3_0>=1)&&(i3.u10.Turn_0_3>=1))))))] != FALSE
(forward)formula 2,0,51.003,945888,1,0,1.3325e+06,2961,4440,5.62434e+06,477,14357,2478234
FORMULA Peterson-PT-3-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(AG((((((((((((((((((((((((((((((((((((((i4.u38.TestTurn_3_1>=1)&&(i4.u11.Turn_1_1>=1))||((i4.u29.TestTurn_0_1>=1)&&(i4.u38.Turn_1_3>=1)))||((i10.u40.TestTurn_3_2>=1)&&(i10.u40.Turn_2_1>=1)))||((i3.u10.TestTurn_3_0>=1)&&(i3.u9.Turn_0_0>=1)))||((i3.u63.TestTurn_2_0>=1)&&(i3.u64.Turn_0_1>=1)))||((i12.i0.u13.TestTurn_1_2>=1)&&(i10.u40.Turn_2_3>=1)))||((i10.u40.TestTurn_3_2>=1)&&(i10.u40.Turn_2_0>=1)))||((i10.u40.TestTurn_3_2>=1)&&(i10.u40.Turn_2_2>=1)))||((i3.u10.TestTurn_3_0>=1)&&(i3.u64.Turn_0_1>=1)))||((i4.u11.TestTurn_1_1>=1)&&(i4.u38.Turn_1_3>=1)))||((i3.u63.TestTurn_2_0>=1)&&(i3.u9.Turn_0_0>=1)))||((i4.u38.TestTurn_3_1>=1)&&(i4.u29.Turn_1_0>=1)))||((i3.u64.TestTurn_1_0>=1)&&(i3.u63.Turn_0_2>=1)))||((i4.u38.TestTurn_3_1>=1)&&(i4.u62.Turn_1_2>=1)))||((i3.u10.TestTurn_3_0>=1)&&(i3.u63.Turn_0_2>=1)))||((i4.u29.TestTurn_0_1>=1)&&(i4.u11.Turn_1_1>=1)))||((i10.u12.TestTurn_2_2>=1)&&(i10.u40.Turn_2_3>=1)))||((i10.u37.TestTurn_0_2>=1)&&(i10.u40.Turn_2_2>=1)))||((i4.u62.TestTurn_2_1>=1)&&(i4.u38.Turn_1_3>=1)))||((i3.u9.TestTurn_0_0>=1)&&(i3.u63.Turn_0_2>=1)))||((i3.u63.TestTurn_2_0>=1)&&(i3.u10.Turn_0_3>=1)))||((i4.u29.TestTurn_0_1>=1)&&(i4.u62.Turn_1_2>=1)))||((i10.u37.TestTurn_0_2>=1)&&(i10.u40.Turn_2_1>=1)))||((i4.u11.TestTurn_1_1>=1)&&(i4.u62.Turn_1_2>=1)))||((i10.u37.TestTurn_0_2>=1)&&(i10.u40.Turn_2_3>=1)))||((i3.u9.TestTurn_0_0>=1)&&(i3.u64.Turn_0_1>=1)))||((i3.u64.TestTurn_1_0>=1)&&(i3.u10.Turn_0_3>=1)))||((i12.i0.u13.TestTurn_1_2>=1)&&(i10.u40.Turn_2_2>=1)))||((i12.i0.u13.TestTurn_1_2>=1)&&(i10.u40.Turn_2_0>=1)))||((i4.u11.TestTurn_1_1>=1)&&(i4.u29.Turn_1_0>=1)))||((i4.u62.TestTurn_2_1>=1)&&(i4.u29.Turn_1_0>=1)))||((i4.u62.TestTurn_2_1>=1)&&(i4.u11.Turn_1_1>=1)))||((i3.u9.TestTurn_0_0>=1)&&(i3.u10.Turn_0_3>=1)))||((i3.u64.TestTurn_1_0>=1)&&(i3.u9.Turn_0_0>=1)))||((i10.u12.TestTurn_2_2>=1)&&(i10.u40.Turn_2_1>=1)))||((i10.u12.TestTurn_2_2>=1)&&(i10.u40.Turn_2_0>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((((((((((((((((((((((((((((((((((((i4.u38.TestTurn_3_1>=1)&&(i4.u11.Turn_1_1>=1))||((i4.u29.TestTurn_0_1>=1)&&(i4.u38.Turn_1_3>=1)))||((i10.u40.TestTurn_3_2>=1)&&(i10.u40.Turn_2_1>=1)))||((i3.u10.TestTurn_3_0>=1)&&(i3.u9.Turn_0_0>=1)))||((i3.u63.TestTurn_2_0>=1)&&(i3.u64.Turn_0_1>=1)))||((i12.i0.u13.TestTurn_1_2>=1)&&(i10.u40.Turn_2_3>=1)))||((i10.u40.TestTurn_3_2>=1)&&(i10.u40.Turn_2_0>=1)))||((i10.u40.TestTurn_3_2>=1)&&(i10.u40.Turn_2_2>=1)))||((i3.u10.TestTurn_3_0>=1)&&(i3.u64.Turn_0_1>=1)))||((i4.u11.TestTurn_1_1>=1)&&(i4.u38.Turn_1_3>=1)))||((i3.u63.TestTurn_2_0>=1)&&(i3.u9.Turn_0_0>=1)))||((i4.u38.TestTurn_3_1>=1)&&(i4.u29.Turn_1_0>=1)))||((i3.u64.TestTurn_1_0>=1)&&(i3.u63.Turn_0_2>=1)))||((i4.u38.TestTurn_3_1>=1)&&(i4.u62.Turn_1_2>=1)))||((i3.u10.TestTurn_3_0>=1)&&(i3.u63.Turn_0_2>=1)))||((i4.u29.TestTurn_0_1>=1)&&(i4.u11.Turn_1_1>=1)))||((i10.u12.TestTurn_2_2>=1)&&(i10.u40.Turn_2_3>=1)))||((i10.u37.TestTurn_0_2>=1)&&(i10.u40.Turn_2_2>=1)))||((i4.u62.TestTurn_2_1>=1)&&(i4.u38.Turn_1_3>=1)))||((i3.u9.TestTurn_0_0>=1)&&(i3.u63.Turn_0_2>=1)))||((i3.u63.TestTurn_2_0>=1)&&(i3.u10.Turn_0_3>=1)))||((i4.u29.TestTurn_0_1>=1)&&(i4.u62.Turn_1_2>=1)))||((i10.u37.TestTurn_0_2>=1)&&(i10.u40.Turn_2_1>=1)))||((i4.u11.TestTurn_1_1>=1)&&(i4.u62.Turn_1_2>=1)))||((i10.u37.TestTurn_0_2>=1)&&(i10.u40.Turn_2_3>=1)))||((i3.u9.TestTurn_0_0>=1)&&(i3.u64.Turn_0_1>=1)))||((i3.u64.TestTurn_1_0>=1)&&(i3.u10.Turn_0_3>=1)))||((i12.i0.u13.TestTurn_1_2>=1)&&(i10.u40.Turn_2_2>=1)))||((i12.i0.u13.TestTurn_1_2>=1)&&(i10.u40.Turn_2_0>=1)))||((i4.u11.TestTurn_1_1>=1)&&(i4.u29.Turn_1_0>=1)))||((i4.u62.TestTurn_2_1>=1)&&(i4.u29.Turn_1_0>=1)))||((i4.u62.TestTurn_2_1>=1)&&(i4.u11.Turn_1_1>=1)))||((i3.u9.TestTurn_0_0>=1)&&(i3.u10.Turn_0_3>=1)))||((i3.u64.TestTurn_1_0>=1)&&(i3.u9.Turn_0_0>=1)))||((i10.u12.TestTurn_2_2>=1)&&(i10.u40.Turn_2_1>=1)))||((i10.u12.TestTurn_2_2>=1)&&(i10.u40.Turn_2_0>=1)))))))] != FALSE
(forward)formula 3,0,51.1276,948528,1,0,1.33671e+06,2963,4713,5.63541e+06,482,14496,2492825
FORMULA Peterson-PT-3-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i9.i0.u49.TestIdentity_0_0_3>=1)||(i12.i1.u48.TestIdentity_1_2_2>=1))||(i0.i1.u51.TestIdentity_0_2_2>=1))||(i5.u19.TestIdentity_1_1_2>=1))||(i13.u50.TestIdentity_3_2_2>=1))||(i7.i0.u54.TestIdentity_0_1_2>=1))||(i1.u53.TestIdentity_1_0_2>=1))||(i8.u52.TestIdentity_3_1_2>=1))||(i14.u55.TestIdentity_3_0_2>=1))||(i15.u57.TestIdentity_2_2_3>=1))||(i12.i0.u56.TestIdentity_1_2_3>=1))||(i2.u60.TestIdentity_2_1_3>=1))||(i5.u59.TestIdentity_1_1_3>=1))||(i3.u32.TestIdentity_3_0_0>=1))||(i3.u33.TestIdentity_2_0_0>=1))||(i0.i1.u22.TestIdentity_0_2_3>=1))||(i4.u36.TestIdentity_3_1_0>=1))||(i4.u15.TestIdentity_2_1_0>=1))||(i3.u34.TestIdentity_1_0_0>=1))||(i4.u14.TestIdentity_1_1_0>=1))||(i0.i0.u28.TestIdentity_0_2_1>=1))||(i8.u27.TestIdentity_3_1_1>=1))||(i9.i0.u25.TestIdentity_0_0_2>=1))||(i13.u41.TestIdentity_3_2_1>=1))||(i2.u18.TestIdentity_2_1_1>=1))||(i12.i0.u16.TestIdentity_1_2_0>=1))||(i9.i1.u26.TestIdentity_0_0_1>=1))||(i10.u42.TestIdentity_3_2_0>=1))||(i15.u17.TestIdentity_2_2_1>=1))||(i7.i1.u45.TestIdentity_0_1_1>=1))||(i14.u44.TestIdentity_3_0_1>=1))||(i10.u43.TestIdentity_2_2_0>=1))||(i7.i0.u31.TestIdentity_0_1_3>=1))||(i1.u30.TestIdentity_1_0_3>=1))||(i6.u20.TestIdentity_2_0_3>=1))||(i11.u46.TestIdentity_2_0_1>=1))||((i4.u38.TestTurn_3_1>=1)&&(i4.u11.Turn_1_1>=1)))||((i4.u29.TestTurn_0_1>=1)&&(i4.u38.Turn_1_3>=1)))||((i10.u40.TestTurn_3_2>=1)&&(i10.u40.Turn_2_1>=1)))||((i3.u10.TestTurn_3_0>=1)&&(i3.u9.Turn_0_0>=1)))||((i3.u63.TestTurn_2_0>=1)&&(i3.u64.Turn_0_1>=1)))||((i12.i0.u13.TestTurn_1_2>=1)&&(i10.u40.Turn_2_3>=1)))||((i10.u40.TestTurn_3_2>=1)&&(i10.u40.Turn_2_0>=1)))||((i10.u40.TestTurn_3_2>=1)&&(i10.u40.Turn_2_2>=1)))||((i3.u10.TestTurn_3_0>=1)&&(i3.u64.Turn_0_1>=1)))||((i4.u11.TestTurn_1_1>=1)&&(i4.u38.Turn_1_3>=1)))||((i3.u63.TestTurn_2_0>=1)&&(i3.u9.Turn_0_0>=1)))||((i4.u38.TestTurn_3_1>=1)&&(i4.u29.Turn_1_0>=1)))||((i3.u64.TestTurn_1_0>=1)&&(i3.u63.Turn_0_2>=1)))||((i4.u38.TestTurn_3_1>=1)&&(i4.u62.Turn_1_2>=1)))||((i3.u10.TestTurn_3_0>=1)&&(i3.u63.Turn_0_2>=1)))||((i4.u29.TestTurn_0_1>=1)&&(i4.u11.Turn_1_1>=1)))||((i10.u12.TestTurn_2_2>=1)&&(i10.u40.Turn_2_3>=1)))||((i10.u37.TestTurn_0_2>=1)&&(i10.u40.Turn_2_2>=1)))||((i4.u62.TestTurn_2_1>=1)&&(i4.u38.Turn_1_3>=1)))||((i3.u9.TestTurn_0_0>=1)&&(i3.u63.Turn_0_2>=1)))||((i3.u63.TestTurn_2_0>=1)&&(i3.u10.Turn_0_3>=1)))||((i4.u29.TestTurn_0_1>=1)&&(i4.u62.Turn_1_2>=1)))||((i10.u37.TestTurn_0_2>=1)&&(i10.u40.Turn_2_1>=1)))||((i4.u11.TestTurn_1_1>=1)&&(i4.u62.Turn_1_2>=1)))||((i10.u37.TestTurn_0_2>=1)&&(i10.u40.Turn_2_3>=1)))||((i3.u9.TestTurn_0_0>=1)&&(i3.u64.Turn_0_1>=1)))||((i3.u64.TestTurn_1_0>=1)&&(i3.u10.Turn_0_3>=1)))||((i12.i0.u13.TestTurn_1_2>=1)&&(i10.u40.Turn_2_2>=1)))||((i12.i0.u13.TestTurn_1_2>=1)&&(i10.u40.Turn_2_0>=1)))||((i4.u11.TestTurn_1_1>=1)&&(i4.u29.Turn_1_0>=1)))||((i4.u62.TestTurn_2_1>=1)&&(i4.u29.Turn_1_0>=1)))||((i4.u62.TestTurn_2_1>=1)&&(i4.u11.Turn_1_1>=1)))||((i3.u9.TestTurn_0_0>=1)&&(i3.u10.Turn_0_3>=1)))||((i3.u64.TestTurn_1_0>=1)&&(i3.u9.Turn_0_0>=1)))||((i10.u12.TestTurn_2_2>=1)&&(i10.u40.Turn_2_1>=1)))||((i10.u12.TestTurn_2_2>=1)&&(i10.u40.Turn_2_0>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i9.i0.u49.TestIdentity_0_0_3>=1)||(i12.i1.u48.TestIdentity_1_2_2>=1))||(i0.i1.u51.TestIdentity_0_2_2>=1))||(i5.u19.TestIdentity_1_1_2>=1))||(i13.u50.TestIdentity_3_2_2>=1))||(i7.i0.u54.TestIdentity_0_1_2>=1))||(i1.u53.TestIdentity_1_0_2>=1))||(i8.u52.TestIdentity_3_1_2>=1))||(i14.u55.TestIdentity_3_0_2>=1))||(i15.u57.TestIdentity_2_2_3>=1))||(i12.i0.u56.TestIdentity_1_2_3>=1))||(i2.u60.TestIdentity_2_1_3>=1))||(i5.u59.TestIdentity_1_1_3>=1))||(i3.u32.TestIdentity_3_0_0>=1))||(i3.u33.TestIdentity_2_0_0>=1))||(i0.i1.u22.TestIdentity_0_2_3>=1))||(i4.u36.TestIdentity_3_1_0>=1))||(i4.u15.TestIdentity_2_1_0>=1))||(i3.u34.TestIdentity_1_0_0>=1))||(i4.u14.TestIdentity_1_1_0>=1))||(i0.i0.u28.TestIdentity_0_2_1>=1))||(i8.u27.TestIdentity_3_1_1>=1))||(i9.i0.u25.TestIdentity_0_0_2>=1))||(i13.u41.TestIdentity_3_2_1>=1))||(i2.u18.TestIdentity_2_1_1>=1))||(i12.i0.u16.TestIdentity_1_2_0>=1))||(i9.i1.u26.TestIdentity_0_0_1>=1))||(i10.u42.TestIdentity_3_2_0>=1))||(i15.u17.TestIdentity_2_2_1>=1))||(i7.i1.u45.TestIdentity_0_1_1>=1))||(i14.u44.TestIdentity_3_0_1>=1))||(i10.u43.TestIdentity_2_2_0>=1))||(i7.i0.u31.TestIdentity_0_1_3>=1))||(i1.u30.TestIdentity_1_0_3>=1))||(i6.u20.TestIdentity_2_0_3>=1))||(i11.u46.TestIdentity_2_0_1>=1))||((i4.u38.TestTurn_3_1>=1)&&(i4.u11.Turn_1_1>=1)))||((i4.u29.TestTurn_0_1>=1)&&(i4.u38.Turn_1_3>=1)))||((i10.u40.TestTurn_3_2>=1)&&(i10.u40.Turn_2_1>=1)))||((i3.u10.TestTurn_3_0>=1)&&(i3.u9.Turn_0_0>=1)))||((i3.u63.TestTurn_2_0>=1)&&(i3.u64.Turn_0_1>=1)))||((i12.i0.u13.TestTurn_1_2>=1)&&(i10.u40.Turn_2_3>=1)))||((i10.u40.TestTurn_3_2>=1)&&(i10.u40.Turn_2_0>=1)))||((i10.u40.TestTurn_3_2>=1)&&(i10.u40.Turn_2_2>=1)))||((i3.u10.TestTurn_3_0>=1)&&(i3.u64.Turn_0_1>=1)))||((i4.u11.TestTurn_1_1>=1)&&(i4.u38.Turn_1_3>=1)))||((i3.u63.TestTurn_2_0>=1)&&(i3.u9.Turn_0_0>=1)))||((i4.u38.TestTurn_3_1>=1)&&(i4.u29.Turn_1_0>=1)))||((i3.u64.TestTurn_1_0>=1)&&(i3.u63.Turn_0_2>=1)))||((i4.u38.TestTurn_3_1>=1)&&(i4.u62.Turn_1_2>=1)))||((i3.u10.TestTurn_3_0>=1)&&(i3.u63.Turn_0_2>=1)))||((i4.u29.TestTurn_0_1>=1)&&(i4.u11.Turn_1_1>=1)))||((i10.u12.TestTurn_2_2>=1)&&(i10.u40.Turn_2_3>=1)))||((i10.u37.TestTurn_0_2>=1)&&(i10.u40.Turn_2_2>=1)))||((i4.u62.TestTurn_2_1>=1)&&(i4.u38.Turn_1_3>=1)))||((i3.u9.TestTurn_0_0>=1)&&(i3.u63.Turn_0_2>=1)))||((i3.u63.TestTurn_2_0>=1)&&(i3.u10.Turn_0_3>=1)))||((i4.u29.TestTurn_0_1>=1)&&(i4.u62.Turn_1_2>=1)))||((i10.u37.TestTurn_0_2>=1)&&(i10.u40.Turn_2_1>=1)))||((i4.u11.TestTurn_1_1>=1)&&(i4.u62.Turn_1_2>=1)))||((i10.u37.TestTurn_0_2>=1)&&(i10.u40.Turn_2_3>=1)))||((i3.u9.TestTurn_0_0>=1)&&(i3.u64.Turn_0_1>=1)))||((i3.u64.TestTurn_1_0>=1)&&(i3.u10.Turn_0_3>=1)))||((i12.i0.u13.TestTurn_1_2>=1)&&(i10.u40.Turn_2_2>=1)))||((i12.i0.u13.TestTurn_1_2>=1)&&(i10.u40.Turn_2_0>=1)))||((i4.u11.TestTurn_1_1>=1)&&(i4.u29.Turn_1_0>=1)))||((i4.u62.TestTurn_2_1>=1)&&(i4.u29.Turn_1_0>=1)))||((i4.u62.TestTurn_2_1>=1)&&(i4.u11.Turn_1_1>=1)))||((i3.u9.TestTurn_0_0>=1)&&(i3.u10.Turn_0_3>=1)))||((i3.u64.TestTurn_1_0>=1)&&(i3.u9.Turn_0_0>=1)))||((i10.u12.TestTurn_2_2>=1)&&(i10.u40.Turn_2_1>=1)))||((i10.u12.TestTurn_2_2>=1)&&(i10.u40.Turn_2_0>=1)))))] = FALSE
(forward)formula 4,1,51.3733,955920,1,0,1.3511e+06,2965,5002,5.6697e+06,484,14535,2529892
FORMULA Peterson-PT-3-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(AG((((((((((((((((((((((((((((((((((((((i12.i0.u65.WantSection_2_F>=1)&&(i8.u52.TestAlone_3_1_2>=1))||((i12.i0.u65.WantSection_2_F>=1)&&(i0.i1.u51.TestAlone_0_2_2>=1)))||((i12.i0.u65.WantSection_2_F>=1)&&(i7.i0.u54.TestAlone_0_1_2>=1)))||((i12.i0.u65.WantSection_2_F>=1)&&(i5.u19.TestAlone_1_1_2>=1)))||((i3.u34.TestAlone_1_0_0>=1)&&(i11.u21.WantSection_0_F>=1)))||((i3.u23.WantSection_3_F>=1)&&(i15.u57.TestAlone_2_2_3>=1)))||((i3.u23.WantSection_3_F>=1)&&(i12.i0.u56.TestAlone_1_2_3>=1)))||((i12.i0.u65.WantSection_2_F>=1)&&(i1.u53.TestAlone_1_0_2>=1)))||((i12.i0.u65.WantSection_2_F>=1)&&(i14.u55.TestAlone_3_0_2>=1)))||((i3.u23.WantSection_3_F>=1)&&(i0.i1.u22.TestAlone_0_2_3>=1)))||((i12.i0.u65.WantSection_2_F>=1)&&(i9.i0.u25.TestAlone_0_0_2>=1)))||((i3.u23.WantSection_3_F>=1)&&(i9.i0.u49.TestAlone_0_0_3>=1)))||((i3.u23.WantSection_3_F>=1)&&(i6.u20.TestAlone_2_0_3>=1)))||((i11.u21.WantSection_0_F>=1)&&(i3.u33.TestAlone_2_0_0>=1)))||((i3.u23.WantSection_3_F>=1)&&(i1.u30.TestAlone_1_0_3>=1)))||((i11.u21.WantSection_0_F>=1)&&(i3.u32.TestAlone_3_0_0>=1)))||((i11.u21.WantSection_0_F>=1)&&(i4.u14.TestAlone_1_1_0>=1)))||((i11.u21.WantSection_0_F>=1)&&(i4.u15.TestAlone_2_1_0>=1)))||((i11.u21.WantSection_0_F>=1)&&(i4.u36.TestAlone_3_1_0>=1)))||((i11.u21.WantSection_0_F>=1)&&(i12.i0.u16.TestAlone_1_2_0>=1)))||((i11.u21.WantSection_0_F>=1)&&(i10.u43.TestAlone_2_2_0>=1)))||((i11.u21.WantSection_0_F>=1)&&(i10.u42.TestAlone_3_2_0>=1)))||((i3.u23.WantSection_3_F>=1)&&(i5.u59.TestAlone_1_1_3>=1)))||((i3.u23.WantSection_3_F>=1)&&(i7.i0.u31.TestAlone_0_1_3>=1)))||((i3.u23.WantSection_3_F>=1)&&(i2.u60.TestAlone_2_1_3>=1)))||((i6.u24.WantSection_1_F>=1)&&(i13.u41.TestAlone_3_2_1>=1)))||((i6.u24.WantSection_1_F>=1)&&(i11.u46.TestAlone_2_0_1>=1)))||((i6.u24.WantSection_1_F>=1)&&(i7.i1.u45.TestAlone_0_1_1>=1)))||((i12.i0.u65.WantSection_2_F>=1)&&(i13.u50.TestAlone_3_2_2>=1)))||((i6.u24.WantSection_1_F>=1)&&(i9.i1.u26.TestAlone_0_0_1>=1)))||((i12.i0.u65.WantSection_2_F>=1)&&(i12.i1.u48.TestAlone_1_2_2>=1)))||((i6.u24.WantSection_1_F>=1)&&(i8.u27.TestAlone_3_1_1>=1)))||((i6.u24.WantSection_1_F>=1)&&(i14.u44.TestAlone_3_0_1>=1)))||((i6.u24.WantSection_1_F>=1)&&(i15.u17.TestAlone_2_2_1>=1)))||((i6.u24.WantSection_1_F>=1)&&(i2.u18.TestAlone_2_1_1>=1)))||((i6.u24.WantSection_1_F>=1)&&(i0.i0.u28.TestAlone_0_2_1>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((((((((((((((((((((((((((((((((((((i12.i0.u65.WantSection_2_F>=1)&&(i8.u52.TestAlone_3_1_2>=1))||((i12.i0.u65.WantSection_2_F>=1)&&(i0.i1.u51.TestAlone_0_2_2>=1)))||((i12.i0.u65.WantSection_2_F>=1)&&(i7.i0.u54.TestAlone_0_1_2>=1)))||((i12.i0.u65.WantSection_2_F>=1)&&(i5.u19.TestAlone_1_1_2>=1)))||((i3.u34.TestAlone_1_0_0>=1)&&(i11.u21.WantSection_0_F>=1)))||((i3.u23.WantSection_3_F>=1)&&(i15.u57.TestAlone_2_2_3>=1)))||((i3.u23.WantSection_3_F>=1)&&(i12.i0.u56.TestAlone_1_2_3>=1)))||((i12.i0.u65.WantSection_2_F>=1)&&(i1.u53.TestAlone_1_0_2>=1)))||((i12.i0.u65.WantSection_2_F>=1)&&(i14.u55.TestAlone_3_0_2>=1)))||((i3.u23.WantSection_3_F>=1)&&(i0.i1.u22.TestAlone_0_2_3>=1)))||((i12.i0.u65.WantSection_2_F>=1)&&(i9.i0.u25.TestAlone_0_0_2>=1)))||((i3.u23.WantSection_3_F>=1)&&(i9.i0.u49.TestAlone_0_0_3>=1)))||((i3.u23.WantSection_3_F>=1)&&(i6.u20.TestAlone_2_0_3>=1)))||((i11.u21.WantSection_0_F>=1)&&(i3.u33.TestAlone_2_0_0>=1)))||((i3.u23.WantSection_3_F>=1)&&(i1.u30.TestAlone_1_0_3>=1)))||((i11.u21.WantSection_0_F>=1)&&(i3.u32.TestAlone_3_0_0>=1)))||((i11.u21.WantSection_0_F>=1)&&(i4.u14.TestAlone_1_1_0>=1)))||((i11.u21.WantSection_0_F>=1)&&(i4.u15.TestAlone_2_1_0>=1)))||((i11.u21.WantSection_0_F>=1)&&(i4.u36.TestAlone_3_1_0>=1)))||((i11.u21.WantSection_0_F>=1)&&(i12.i0.u16.TestAlone_1_2_0>=1)))||((i11.u21.WantSection_0_F>=1)&&(i10.u43.TestAlone_2_2_0>=1)))||((i11.u21.WantSection_0_F>=1)&&(i10.u42.TestAlone_3_2_0>=1)))||((i3.u23.WantSection_3_F>=1)&&(i5.u59.TestAlone_1_1_3>=1)))||((i3.u23.WantSection_3_F>=1)&&(i7.i0.u31.TestAlone_0_1_3>=1)))||((i3.u23.WantSection_3_F>=1)&&(i2.u60.TestAlone_2_1_3>=1)))||((i6.u24.WantSection_1_F>=1)&&(i13.u41.TestAlone_3_2_1>=1)))||((i6.u24.WantSection_1_F>=1)&&(i11.u46.TestAlone_2_0_1>=1)))||((i6.u24.WantSection_1_F>=1)&&(i7.i1.u45.TestAlone_0_1_1>=1)))||((i12.i0.u65.WantSection_2_F>=1)&&(i13.u50.TestAlone_3_2_2>=1)))||((i6.u24.WantSection_1_F>=1)&&(i9.i1.u26.TestAlone_0_0_1>=1)))||((i12.i0.u65.WantSection_2_F>=1)&&(i12.i1.u48.TestAlone_1_2_2>=1)))||((i6.u24.WantSection_1_F>=1)&&(i8.u27.TestAlone_3_1_1>=1)))||((i6.u24.WantSection_1_F>=1)&&(i14.u44.TestAlone_3_0_1>=1)))||((i6.u24.WantSection_1_F>=1)&&(i15.u17.TestAlone_2_2_1>=1)))||((i6.u24.WantSection_1_F>=1)&&(i2.u18.TestAlone_2_1_1>=1)))||((i6.u24.WantSection_1_F>=1)&&(i0.i0.u28.TestAlone_0_2_1>=1)))))))] != FALSE
(forward)formula 5,0,51.568,960144,1,0,1.36108e+06,2965,5221,5.68402e+06,484,14535,2562154
FORMULA Peterson-PT-3-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG((((((((((((((((((((((((((((((((((((((((((((((((((i3.u34.BeginLoop_1_0_0<1)&&(i0.i0.u35.BeginLoop_0_2_0<1))&&(i3.u32.BeginLoop_3_0_0<1))&&(i3.u33.BeginLoop_2_0_0<1))&&(i1.u3.BeginLoop_1_0_1<1))&&(i7.i1.u1.BeginLoop_0_1_0<1))&&(i14.u44.BeginLoop_3_0_1<1))&&(i11.u46.BeginLoop_2_0_1<1))&&(i12.i0.u16.BeginLoop_1_2_0<1))&&(i7.i1.u45.BeginLoop_0_1_1<1))&&(i10.u42.BeginLoop_3_2_0<1))&&(i10.u43.BeginLoop_2_2_0<1))&&(i15.u17.BeginLoop_2_2_1<1))&&(i9.i1.u0.BeginLoop_0_0_1<1))&&(i9.i0.u25.BeginLoop_0_0_2<1))&&(i12.i1.u5.BeginLoop_1_2_1<1))&&(i2.u18.BeginLoop_2_1_1<1))&&(i13.u41.BeginLoop_3_2_1<1))&&(i0.i0.u2.BeginLoop_0_2_1<1))&&(i5.u4.BeginLoop_1_1_1<1))&&(i2.u7.BeginLoop_2_1_2<1))&&(i8.u27.BeginLoop_3_1_1<1))&&(i0.i1.u51.BeginLoop_0_2_2<1))&&(i5.u19.BeginLoop_1_1_2<1))&&(i6.u6.BeginLoop_2_0_2<1))&&(i8.u52.BeginLoop_3_1_2<1))&&(i7.i0.u54.BeginLoop_0_1_2<1))&&(i1.u53.BeginLoop_1_0_2<1))&&(i14.u47.BeginLoop_3_0_3<1))&&(i14.u55.BeginLoop_3_0_2<1))&&(i1.u30.BeginLoop_1_0_3<1))&&(i7.i0.u31.BeginLoop_0_1_3<1))&&(i13.u50.BeginLoop_3_2_2<1))&&(i6.u20.BeginLoop_2_0_3<1))&&(i12.i1.u48.BeginLoop_1_2_2<1))&&(i9.i0.u49.BeginLoop_0_0_3<1))&&(i13.u58.BeginLoop_3_2_3<1))&&(i15.u8.BeginLoop_2_2_2<1))&&(i12.i0.u56.BeginLoop_1_2_3<1))&&(i0.i1.u22.BeginLoop_0_2_3<1))&&(i15.u57.BeginLoop_2_2_3<1))&&(i5.u59.BeginLoop_1_1_3<1))&&(i8.u61.BeginLoop_3_1_3<1))&&(i2.u60.BeginLoop_2_1_3<1))&&(i9.i1.u39.BeginLoop_0_0_0<1))&&(i4.u14.BeginLoop_1_1_0<1))&&(i4.u36.BeginLoop_3_1_0<1))&&(i4.u15.BeginLoop_2_1_0<1))||(((((i3.u23.WantSection_3_T<1)||(i10.u40.CS_3<1))&&((i11.u21.WantSection_0_T<1)||(i10.u37.CS_0<1)))&&((i6.u24.WantSection_1_T<1)||(i12.i0.u13.CS_1<1)))&&((i12.i0.u65.WantSection_2_T<1)||(i10.u12.CS_2<1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((((((((((((((((((((((((((((((((((((((((((((((((((i3.u34.BeginLoop_1_0_0<1)&&(i0.i0.u35.BeginLoop_0_2_0<1))&&(i3.u32.BeginLoop_3_0_0<1))&&(i3.u33.BeginLoop_2_0_0<1))&&(i1.u3.BeginLoop_1_0_1<1))&&(i7.i1.u1.BeginLoop_0_1_0<1))&&(i14.u44.BeginLoop_3_0_1<1))&&(i11.u46.BeginLoop_2_0_1<1))&&(i12.i0.u16.BeginLoop_1_2_0<1))&&(i7.i1.u45.BeginLoop_0_1_1<1))&&(i10.u42.BeginLoop_3_2_0<1))&&(i10.u43.BeginLoop_2_2_0<1))&&(i15.u17.BeginLoop_2_2_1<1))&&(i9.i1.u0.BeginLoop_0_0_1<1))&&(i9.i0.u25.BeginLoop_0_0_2<1))&&(i12.i1.u5.BeginLoop_1_2_1<1))&&(i2.u18.BeginLoop_2_1_1<1))&&(i13.u41.BeginLoop_3_2_1<1))&&(i0.i0.u2.BeginLoop_0_2_1<1))&&(i5.u4.BeginLoop_1_1_1<1))&&(i2.u7.BeginLoop_2_1_2<1))&&(i8.u27.BeginLoop_3_1_1<1))&&(i0.i1.u51.BeginLoop_0_2_2<1))&&(i5.u19.BeginLoop_1_1_2<1))&&(i6.u6.BeginLoop_2_0_2<1))&&(i8.u52.BeginLoop_3_1_2<1))&&(i7.i0.u54.BeginLoop_0_1_2<1))&&(i1.u53.BeginLoop_1_0_2<1))&&(i14.u47.BeginLoop_3_0_3<1))&&(i14.u55.BeginLoop_3_0_2<1))&&(i1.u30.BeginLoop_1_0_3<1))&&(i7.i0.u31.BeginLoop_0_1_3<1))&&(i13.u50.BeginLoop_3_2_2<1))&&(i6.u20.BeginLoop_2_0_3<1))&&(i12.i1.u48.BeginLoop_1_2_2<1))&&(i9.i0.u49.BeginLoop_0_0_3<1))&&(i13.u58.BeginLoop_3_2_3<1))&&(i15.u8.BeginLoop_2_2_2<1))&&(i12.i0.u56.BeginLoop_1_2_3<1))&&(i0.i1.u22.BeginLoop_0_2_3<1))&&(i15.u57.BeginLoop_2_2_3<1))&&(i5.u59.BeginLoop_1_1_3<1))&&(i8.u61.BeginLoop_3_1_3<1))&&(i2.u60.BeginLoop_2_1_3<1))&&(i9.i1.u39.BeginLoop_0_0_0<1))&&(i4.u14.BeginLoop_1_1_0<1))&&(i4.u36.BeginLoop_3_1_0<1))&&(i4.u15.BeginLoop_2_1_0<1))||(((((i3.u23.WantSection_3_T<1)||(i10.u40.CS_3<1))&&((i11.u21.WantSection_0_T<1)||(i10.u37.CS_0<1)))&&((i6.u24.WantSection_1_T<1)||(i12.i0.u13.CS_1<1)))&&((i12.i0.u65.WantSection_2_T<1)||(i10.u12.CS_2<1))))))] = FALSE
(forward)formula 6,0,51.6359,961728,1,0,1.36344e+06,2975,5511,5.68788e+06,486,14621,2571797
FORMULA Peterson-PT-3-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AX(((((((((((((((((((((((((((((((((((((i9.i0.u49.TestIdentity_0_0_3>=1)||(i12.i1.u48.TestIdentity_1_2_2>=1))||(i0.i1.u51.TestIdentity_0_2_2>=1))||(i5.u19.TestIdentity_1_1_2>=1))||(i13.u50.TestIdentity_3_2_2>=1))||(i7.i0.u54.TestIdentity_0_1_2>=1))||(i1.u53.TestIdentity_1_0_2>=1))||(i8.u52.TestIdentity_3_1_2>=1))||(i14.u55.TestIdentity_3_0_2>=1))||(i15.u57.TestIdentity_2_2_3>=1))||(i12.i0.u56.TestIdentity_1_2_3>=1))||(i2.u60.TestIdentity_2_1_3>=1))||(i5.u59.TestIdentity_1_1_3>=1))||(i3.u32.TestIdentity_3_0_0>=1))||(i3.u33.TestIdentity_2_0_0>=1))||(i0.i1.u22.TestIdentity_0_2_3>=1))||(i4.u36.TestIdentity_3_1_0>=1))||(i4.u15.TestIdentity_2_1_0>=1))||(i3.u34.TestIdentity_1_0_0>=1))||(i4.u14.TestIdentity_1_1_0>=1))||(i0.i0.u28.TestIdentity_0_2_1>=1))||(i8.u27.TestIdentity_3_1_1>=1))||(i9.i0.u25.TestIdentity_0_0_2>=1))||(i13.u41.TestIdentity_3_2_1>=1))||(i2.u18.TestIdentity_2_1_1>=1))||(i12.i0.u16.TestIdentity_1_2_0>=1))||(i9.i1.u26.TestIdentity_0_0_1>=1))||(i10.u42.TestIdentity_3_2_0>=1))||(i15.u17.TestIdentity_2_2_1>=1))||(i7.i1.u45.TestIdentity_0_1_1>=1))||(i14.u44.TestIdentity_3_0_1>=1))||(i10.u43.TestIdentity_2_2_0>=1))||(i7.i0.u31.TestIdentity_0_1_3>=1))||(i1.u30.TestIdentity_1_0_3>=1))||(i6.u20.TestIdentity_2_0_3>=1))||(i11.u46.TestIdentity_2_0_1>=1))) + EG(((((((((((((((((((((((((((((((((((((((((((((((((((((i3.u34.BeginLoop_1_0_0<1)&&(i0.i0.u35.BeginLoop_0_2_0<1))&&(i3.u32.BeginLoop_3_0_0<1))&&(i3.u33.BeginLoop_2_0_0<1))&&(i1.u3.BeginLoop_1_0_1<1))&&(i7.i1.u1.BeginLoop_0_1_0<1))&&(i14.u44.BeginLoop_3_0_1<1))&&(i11.u46.BeginLoop_2_0_1<1))&&(i12.i0.u16.BeginLoop_1_2_0<1))&&(i7.i1.u45.BeginLoop_0_1_1<1))&&(i10.u42.BeginLoop_3_2_0<1))&&(i10.u43.BeginLoop_2_2_0<1))&&(i15.u17.BeginLoop_2_2_1<1))&&(i9.i1.u0.BeginLoop_0_0_1<1))&&(i9.i0.u25.BeginLoop_0_0_2<1))&&(i12.i1.u5.BeginLoop_1_2_1<1))&&(i2.u18.BeginLoop_2_1_1<1))&&(i13.u41.BeginLoop_3_2_1<1))&&(i0.i0.u2.BeginLoop_0_2_1<1))&&(i5.u4.BeginLoop_1_1_1<1))&&(i2.u7.BeginLoop_2_1_2<1))&&(i8.u27.BeginLoop_3_1_1<1))&&(i0.i1.u51.BeginLoop_0_2_2<1))&&(i5.u19.BeginLoop_1_1_2<1))&&(i6.u6.BeginLoop_2_0_2<1))&&(i8.u52.BeginLoop_3_1_2<1))&&(i7.i0.u54.BeginLoop_0_1_2<1))&&(i1.u53.BeginLoop_1_0_2<1))&&(i14.u47.BeginLoop_3_0_3<1))&&(i14.u55.BeginLoop_3_0_2<1))&&(i1.u30.BeginLoop_1_0_3<1))&&(i7.i0.u31.BeginLoop_0_1_3<1))&&(i13.u50.BeginLoop_3_2_2<1))&&(i6.u20.BeginLoop_2_0_3<1))&&(i12.i1.u48.BeginLoop_1_2_2<1))&&(i9.i0.u49.BeginLoop_0_0_3<1))&&(i13.u58.BeginLoop_3_2_3<1))&&(i15.u8.BeginLoop_2_2_2<1))&&(i12.i0.u56.BeginLoop_1_2_3<1))&&(i0.i1.u22.BeginLoop_0_2_3<1))&&(i15.u57.BeginLoop_2_2_3<1))&&(i5.u59.BeginLoop_1_1_3<1))&&(i8.u61.BeginLoop_3_1_3<1))&&(i2.u60.BeginLoop_2_1_3<1))&&(i9.i1.u39.BeginLoop_0_0_0<1))&&(i4.u14.BeginLoop_1_1_0<1))&&(i4.u36.BeginLoop_3_1_0<1))&&(i4.u15.BeginLoop_2_1_0<1))||((i3.u23.WantSection_3_T>=1)&&(i10.u40.CS_3>=1)))||((i11.u21.WantSection_0_T>=1)&&(i10.u37.CS_0>=1)))||((i6.u24.WantSection_1_T>=1)&&(i12.i0.u13.CS_1>=1)))||((i12.i0.u65.WantSection_2_T>=1)&&(i10.u12.CS_2>=1)))))
=> equivalent forward existential formula: [(EY((Init * !(EG(((((((((((((((((((((((((((((((((((((((((((((((((((((i3.u34.BeginLoop_1_0_0<1)&&(i0.i0.u35.BeginLoop_0_2_0<1))&&(i3.u32.BeginLoop_3_0_0<1))&&(i3.u33.BeginLoop_2_0_0<1))&&(i1.u3.BeginLoop_1_0_1<1))&&(i7.i1.u1.BeginLoop_0_1_0<1))&&(i14.u44.BeginLoop_3_0_1<1))&&(i11.u46.BeginLoop_2_0_1<1))&&(i12.i0.u16.BeginLoop_1_2_0<1))&&(i7.i1.u45.BeginLoop_0_1_1<1))&&(i10.u42.BeginLoop_3_2_0<1))&&(i10.u43.BeginLoop_2_2_0<1))&&(i15.u17.BeginLoop_2_2_1<1))&&(i9.i1.u0.BeginLoop_0_0_1<1))&&(i9.i0.u25.BeginLoop_0_0_2<1))&&(i12.i1.u5.BeginLoop_1_2_1<1))&&(i2.u18.BeginLoop_2_1_1<1))&&(i13.u41.BeginLoop_3_2_1<1))&&(i0.i0.u2.BeginLoop_0_2_1<1))&&(i5.u4.BeginLoop_1_1_1<1))&&(i2.u7.BeginLoop_2_1_2<1))&&(i8.u27.BeginLoop_3_1_1<1))&&(i0.i1.u51.BeginLoop_0_2_2<1))&&(i5.u19.BeginLoop_1_1_2<1))&&(i6.u6.BeginLoop_2_0_2<1))&&(i8.u52.BeginLoop_3_1_2<1))&&(i7.i0.u54.BeginLoop_0_1_2<1))&&(i1.u53.BeginLoop_1_0_2<1))&&(i14.u47.BeginLoop_3_0_3<1))&&(i14.u55.BeginLoop_3_0_2<1))&&(i1.u30.BeginLoop_1_0_3<1))&&(i7.i0.u31.BeginLoop_0_1_3<1))&&(i13.u50.BeginLoop_3_2_2<1))&&(i6.u20.BeginLoop_2_0_3<1))&&(i12.i1.u48.BeginLoop_1_2_2<1))&&(i9.i0.u49.BeginLoop_0_0_3<1))&&(i13.u58.BeginLoop_3_2_3<1))&&(i15.u8.BeginLoop_2_2_2<1))&&(i12.i0.u56.BeginLoop_1_2_3<1))&&(i0.i1.u22.BeginLoop_0_2_3<1))&&(i15.u57.BeginLoop_2_2_3<1))&&(i5.u59.BeginLoop_1_1_3<1))&&(i8.u61.BeginLoop_3_1_3<1))&&(i2.u60.BeginLoop_2_1_3<1))&&(i9.i1.u39.BeginLoop_0_0_0<1))&&(i4.u14.BeginLoop_1_1_0<1))&&(i4.u36.BeginLoop_3_1_0<1))&&(i4.u15.BeginLoop_2_1_0<1))||((i3.u23.WantSection_3_T>=1)&&(i10.u40.CS_3>=1)))||((i11.u21.WantSection_0_T>=1)&&(i10.u37.CS_0>=1)))||((i6.u24.WantSection_1_T>=1)&&(i12.i0.u13.CS_1>=1)))||((i12.i0.u65.WantSection_2_T>=1)&&(i10.u12.CS_2>=1))))))) * !(((((((((((((((((((((((((((((((((((((i9.i0.u49.TestIdentity_0_0_3>=1)||(i12.i1.u48.TestIdentity_1_2_2>=1))||(i0.i1.u51.TestIdentity_0_2_2>=1))||(i5.u19.TestIdentity_1_1_2>=1))||(i13.u50.TestIdentity_3_2_2>=1))||(i7.i0.u54.TestIdentity_0_1_2>=1))||(i1.u53.TestIdentity_1_0_2>=1))||(i8.u52.TestIdentity_3_1_2>=1))||(i14.u55.TestIdentity_3_0_2>=1))||(i15.u57.TestIdentity_2_2_3>=1))||(i12.i0.u56.TestIdentity_1_2_3>=1))||(i2.u60.TestIdentity_2_1_3>=1))||(i5.u59.TestIdentity_1_1_3>=1))||(i3.u32.TestIdentity_3_0_0>=1))||(i3.u33.TestIdentity_2_0_0>=1))||(i0.i1.u22.TestIdentity_0_2_3>=1))||(i4.u36.TestIdentity_3_1_0>=1))||(i4.u15.TestIdentity_2_1_0>=1))||(i3.u34.TestIdentity_1_0_0>=1))||(i4.u14.TestIdentity_1_1_0>=1))||(i0.i0.u28.TestIdentity_0_2_1>=1))||(i8.u27.TestIdentity_3_1_1>=1))||(i9.i0.u25.TestIdentity_0_0_2>=1))||(i13.u41.TestIdentity_3_2_1>=1))||(i2.u18.TestIdentity_2_1_1>=1))||(i12.i0.u16.TestIdentity_1_2_0>=1))||(i9.i1.u26.TestIdentity_0_0_1>=1))||(i10.u42.TestIdentity_3_2_0>=1))||(i15.u17.TestIdentity_2_2_1>=1))||(i7.i1.u45.TestIdentity_0_1_1>=1))||(i14.u44.TestIdentity_3_0_1>=1))||(i10.u43.TestIdentity_2_2_0>=1))||(i7.i0.u31.TestIdentity_0_1_3>=1))||(i1.u30.TestIdentity_1_0_3>=1))||(i6.u20.TestIdentity_2_0_3>=1))||(i11.u46.TestIdentity_2_0_1>=1))))] = FALSE
(forward)formula 7,1,54.0567,1003968,1,0,1.45496e+06,2999,5555,5.80447e+06,486,14881,2686064
FORMULA Peterson-PT-3-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(((i4.u14.TestIdentity_1_1_0<1) + EX(((i6.u24.WantSection_1_T<1)||(i7.i1.u45.TestAlone_0_1_1<1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((i4.u14.TestIdentity_1_1_0<1))) * !(EX(((i6.u24.WantSection_1_T<1)||(i7.i1.u45.TestAlone_0_1_1<1)))))] = FALSE
(forward)formula 8,1,54.3837,1010304,1,0,1.46726e+06,2999,5558,5.81971e+06,486,14890,2707968
FORMULA Peterson-PT-3-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EF(((i4.u62.TestTurn_2_1>=1)&&(i4.u38.Turn_1_3>=1))) + AX((((i10.u40.Turn_2_1>=1)&&(i10.u12.AskForSection_2_2>=1)) * EF(((i6.u24.WantSection_1_F>=1)&&(i7.i1.u45.TestAlone_0_1_1>=1))))))
=> equivalent forward existential formula: ([(EY((Init * !(E(TRUE U ((i4.u62.TestTurn_2_1>=1)&&(i4.u38.Turn_1_3>=1)))))) * !(((i10.u40.Turn_2_1>=1)&&(i10.u12.AskForSection_2_2>=1))))] = FALSE * [(EY((Init * !(E(TRUE U ((i4.u62.TestTurn_2_1>=1)&&(i4.u38.Turn_1_3>=1)))))) * !(E(TRUE U ((i6.u24.WantSection_1_F>=1)&&(i7.i1.u45.TestAlone_0_1_1>=1)))))] = FALSE)
(forward)formula 9,1,71.7378,1269344,1,0,1.87964e+06,3194,5565,6.9746e+06,486,16127,3608134
FORMULA Peterson-PT-3-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((((i10.u43.BeginLoop_2_2_0>=1)&&(i4.u11.Turn_1_1>=1))&&(i4.u29.AskForSection_0_1>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((i10.u43.BeginLoop_2_2_0>=1)&&(i4.u11.Turn_1_1>=1))&&(i4.u29.AskForSection_0_1>=1)))] != FALSE
(forward)formula 10,1,71.7395,1269344,1,0,1.87965e+06,3194,5573,6.97463e+06,486,16127,3608354
FORMULA Peterson-PT-3-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(((((i6.u6.TestIdentity_2_0_2<1)&&((i12.i0.u65.WantSection_2_F<1)||(i5.u19.TestAlone_1_1_2<1)))&&((i12.i0.u65.WantSection_2_T<1)||(i10.u12.CS_2<1)))&&((((((i3.u10.EndTurn_3_0<1)||(i12.i0.u65.WantSection_2_T<1))||(i12.i1.u48.TestAlone_1_2_2<1))||(i13.u41.TestIdentity_3_2_1<1))||(i10.u40.Turn_2_3<1))||(i10.u40.AskForSection_3_2<1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((((i6.u6.TestIdentity_2_0_2<1)&&((i12.i0.u65.WantSection_2_F<1)||(i5.u19.TestAlone_1_1_2<1)))&&((i12.i0.u65.WantSection_2_T<1)||(i10.u12.CS_2<1)))&&((((((i3.u10.EndTurn_3_0<1)||(i12.i0.u65.WantSection_2_T<1))||(i12.i1.u48.TestAlone_1_2_2<1))||(i13.u41.TestIdentity_3_2_1<1))||(i10.u40.Turn_2_3<1))||(i10.u40.AskForSection_3_2<1)))))] = FALSE
(forward)formula 11,0,71.7812,1270400,1,0,1.88133e+06,3204,5605,6.98121e+06,489,16255,3611991
FORMULA Peterson-PT-3-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EG((((i3.u64.AskForSection_1_0>=1)&&(i3.u10.Turn_0_3>=1))&&(((i7.i0.u54.TestIdentity_0_1_2>=1)||(i9.i0.u25.IsEndLoop_0_0_1>=1))||((((i3.u64.TestTurn_1_0>=1)&&(i3.u63.Turn_0_2>=1))&&(i4.u11.TestTurn_1_1>=1))&&(i4.u11.Turn_1_1>=1))))) + ((!(AF(((i3.u63.TestTurn_2_0>=1)&&(i3.u63.Turn_0_2>=1)))) * EF((((i3.u23.WantSection_3_T>=1)&&(i15.u57.TestAlone_2_2_3>=1))||((i4.u38.TestTurn_3_1>=1)&&(i4.u29.Turn_1_0>=1))))) * !(AF(((i4.u62.TestTurn_2_1>=1)&&(i4.u29.Turn_1_0>=1))))))
=> equivalent forward existential formula: ([FwdG(Init,(((i3.u64.AskForSection_1_0>=1)&&(i3.u10.Turn_0_3>=1))&&(((i7.i0.u54.TestIdentity_0_1_2>=1)||(i9.i0.u25.IsEndLoop_0_0_1>=1))||((((i3.u64.TestTurn_1_0>=1)&&(i3.u63.Turn_0_2>=1))&&(i4.u11.TestTurn_1_1>=1))&&(i4.u11.Turn_1_1>=1)))))] != FALSE + [FwdG((Init * (!(!(EG(!(((i3.u63.TestTurn_2_0>=1)&&(i3.u63.Turn_0_2>=1)))))) * E(TRUE U (((i3.u23.WantSection_3_T>=1)&&(i15.u57.TestAlone_2_2_3>=1))||((i4.u38.TestTurn_3_1>=1)&&(i4.u29.Turn_1_0>=1)))))),!(((i4.u62.TestTurn_2_1>=1)&&(i4.u29.Turn_1_0>=1))))] != FALSE)
(forward)formula 12,1,82.1856,1499552,1,0,2.27053e+06,3769,6135,7.93397e+06,512,20870,4550708
FORMULA Peterson-PT-3-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((AX(((i4.u11.Turn_1_1>=1)&&(i4.u62.AskForSection_2_1>=1))) + ((i0.i1.u51.IsEndLoop_0_2_1>=1) * AG(((i4.u29.Turn_1_0>=1)&&(i4.u38.AskForSection_3_1>=1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!(((i4.u11.Turn_1_1>=1)&&(i4.u62.AskForSection_2_1>=1))))))] != FALSE + [((FwdU(Init,TRUE) * (i0.i1.u51.IsEndLoop_0_2_1>=1)) * !(E(TRUE U !(((i4.u29.Turn_1_0>=1)&&(i4.u38.AskForSection_3_1>=1))))))] != FALSE)
(forward)formula 13,0,82.6184,1508000,1,0,2.28394e+06,3771,6149,7.96296e+06,512,20874,4579796
FORMULA Peterson-PT-3-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E((((i6.u6.BeginLoop_2_0_2<1)&&((i6.u24.WantSection_1_F<1)||(i9.i1.u26.TestAlone_0_0_1<1)))||((i15.u17.TestIdentity_2_2_1<1)&&(i12.i0.u56.BeginLoop_1_2_3<1))) U (i8.u61.TestIdentity_3_1_3>=1))
=> equivalent forward existential formula: [(FwdU(Init,(((i6.u6.BeginLoop_2_0_2<1)&&((i6.u24.WantSection_1_F<1)||(i9.i1.u26.TestAlone_0_0_1<1)))||((i15.u17.TestIdentity_2_2_1<1)&&(i12.i0.u56.BeginLoop_1_2_3<1)))) * (i8.u61.TestIdentity_3_1_3>=1))] != FALSE
(forward)formula 14,1,88.3024,1635248,1,0,2.49674e+06,4587,6305,8.53115e+06,512,27938,4988866
FORMULA Peterson-PT-3-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E((((i3.u23.WantSection_3_F<1)||(i9.i0.u49.TestAlone_0_0_3<1))&&((i11.u21.WantSection_0_T<1)||(i4.u14.TestAlone_1_1_0<1))) U ((i11.u21.WantSection_0_F>=1)&&(i10.u42.TestAlone_3_2_0>=1)))
=> equivalent forward existential formula: [(FwdU(Init,(((i3.u23.WantSection_3_F<1)||(i9.i0.u49.TestAlone_0_0_3<1))&&((i11.u21.WantSection_0_T<1)||(i4.u14.TestAlone_1_1_0<1)))) * ((i11.u21.WantSection_0_F>=1)&&(i10.u42.TestAlone_3_2_0>=1)))] != FALSE
(forward)formula 15,1,136.592,2487684,1,0,3.49948e+06,4743,6357,1.49183e+07,513,29278,6589073
FORMULA Peterson-PT-3-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1590023167404

--------------------
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="Peterson-PT-3"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Peterson-PT-3, 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 r111-csrt-158961258000716"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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