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-158961258000660.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-COL-2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258000660
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 3.4K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 42K 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-COL-2-CTLFireability-00
FORMULA_NAME Peterson-COL-2-CTLFireability-01
FORMULA_NAME Peterson-COL-2-CTLFireability-02
FORMULA_NAME Peterson-COL-2-CTLFireability-03
FORMULA_NAME Peterson-COL-2-CTLFireability-04
FORMULA_NAME Peterson-COL-2-CTLFireability-05
FORMULA_NAME Peterson-COL-2-CTLFireability-06
FORMULA_NAME Peterson-COL-2-CTLFireability-07
FORMULA_NAME Peterson-COL-2-CTLFireability-08
FORMULA_NAME Peterson-COL-2-CTLFireability-09
FORMULA_NAME Peterson-COL-2-CTLFireability-10
FORMULA_NAME Peterson-COL-2-CTLFireability-11
FORMULA_NAME Peterson-COL-2-CTLFireability-12
FORMULA_NAME Peterson-COL-2-CTLFireability-13
FORMULA_NAME Peterson-COL-2-CTLFireability-14
FORMULA_NAME Peterson-COL-2-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590019001666

[2020-05-20 23:56:44] [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-20 23:56:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 23:56:44] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-20 23:56:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 922 ms
[2020-05-20 23:56:45] [INFO ] sort/places :
ProcTourProc->beginLoop,testIdentity,testAlone,isEndLoop,
ProcBool->wantSection,
TourProc->turn,
ProcTour->askForSection,testTurn,endTurn,
Process->idle,CS,

[2020-05-20 23:56:45] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 108 PT places and 159.0 transition bindings in 49 ms.
[2020-05-20 23:56:45] [INFO ] Computed order based on color domains.
[2020-05-20 23:56:45] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions in 37 ms.
[2020-05-20 23:56:45] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 12 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 124 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 430 ms. (steps per millisecond=232 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0]
[2020-05-20 23:56:45] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2020-05-20 23:56:45] [INFO ] Computed 11 place invariants in 8 ms
[2020-05-20 23:56:45] [INFO ] [Real]Absence check using 8 positive place invariants in 36 ms returned sat
[2020-05-20 23:56:45] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 9 ms returned sat
[2020-05-20 23:56:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:46] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2020-05-20 23:56:46] [INFO ] State equation strengthened by 26 read => feed constraints.
[2020-05-20 23:56:46] [INFO ] [Real]Added 26 Read/Feed constraints in 17 ms returned sat
[2020-05-20 23:56:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:56:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 19 ms returned sat
[2020-05-20 23:56:46] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-20 23:56:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:46] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2020-05-20 23:56:46] [INFO ] [Nat]Added 26 Read/Feed constraints in 15 ms returned sat
[2020-05-20 23:56:46] [INFO ] Deduced a trap composed of 11 places in 110 ms
[2020-05-20 23:56:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2020-05-20 23:56:46] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 101 ms.
[2020-05-20 23:56:47] [INFO ] Added : 117 causal constraints over 24 iterations in 771 ms. Result :sat
[2020-05-20 23:56:47] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-05-20 23:56:47] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 17 ms returned sat
[2020-05-20 23:56:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:47] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2020-05-20 23:56:47] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-20 23:56:47] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 11 ms.
[2020-05-20 23:56:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:56:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-20 23:56:47] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-20 23:56:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:47] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2020-05-20 23:56:47] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-05-20 23:56:47] [INFO ] Deduced a trap composed of 34 places in 48 ms
[2020-05-20 23:56:47] [INFO ] Deduced a trap composed of 12 places in 68 ms
[2020-05-20 23:56:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2020-05-20 23:56:47] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 9 ms.
[2020-05-20 23:56:48] [INFO ] Added : 117 causal constraints over 24 iterations in 364 ms. Result :sat
[2020-05-20 23:56:48] [INFO ] Deduced a trap composed of 8 places in 33 ms
[2020-05-20 23:56:48] [INFO ] Deduced a trap composed of 14 places in 25 ms
[2020-05-20 23:56:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2020-05-20 23:56:48] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-20 23:56:48] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-20 23:56:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:48] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2020-05-20 23:56:48] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-20 23:56:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:56:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-20 23:56:48] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-20 23:56:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:48] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2020-05-20 23:56:48] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-05-20 23:56:48] [INFO ] Deduced a trap composed of 26 places in 138 ms
[2020-05-20 23:56:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2020-05-20 23:56:48] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 19 ms.
[2020-05-20 23:56:49] [INFO ] Added : 117 causal constraints over 24 iterations in 331 ms. Result :sat
[2020-05-20 23:56:49] [INFO ] Deduced a trap composed of 12 places in 41 ms
[2020-05-20 23:56:49] [INFO ] Deduced a trap composed of 28 places in 37 ms
[2020-05-20 23:56:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2020-05-20 23:56:49] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-05-20 23:56:49] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-20 23:56:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:49] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2020-05-20 23:56:49] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-20 23:56:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:56:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2020-05-20 23:56:49] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-20 23:56:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:49] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2020-05-20 23:56:49] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-20 23:56:49] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 14 ms.
[2020-05-20 23:56:50] [INFO ] Added : 117 causal constraints over 24 iterations in 435 ms. Result :sat
[2020-05-20 23:56:50] [INFO ] Deduced a trap composed of 15 places in 27 ms
[2020-05-20 23:56:50] [INFO ] Deduced a trap composed of 8 places in 19 ms
[2020-05-20 23:56:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2020-05-20 23:56:50] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-20 23:56:50] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-20 23:56:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:50] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2020-05-20 23:56:50] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-20 23:56:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:56:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-05-20 23:56:50] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-20 23:56:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:50] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2020-05-20 23:56:50] [INFO ] [Nat]Added 26 Read/Feed constraints in 7 ms returned sat
[2020-05-20 23:56:50] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 15 ms.
[2020-05-20 23:56:50] [INFO ] Added : 117 causal constraints over 24 iterations in 228 ms. Result :sat
[2020-05-20 23:56:50] [INFO ] Deduced a trap composed of 15 places in 34 ms
[2020-05-20 23:56:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2020-05-20 23:56:50] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-05-20 23:56:50] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-20 23:56:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:50] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2020-05-20 23:56:50] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-05-20 23:56:50] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 16 ms.
[2020-05-20 23:56:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:56:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-05-20 23:56:50] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-20 23:56:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:50] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2020-05-20 23:56:50] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-20 23:56:50] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 10 ms.
[2020-05-20 23:56:51] [INFO ] Added : 117 causal constraints over 24 iterations in 262 ms. Result :sat
[2020-05-20 23:56:51] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-05-20 23:56:51] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-20 23:56:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:51] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2020-05-20 23:56:51] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-20 23:56:51] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 11 ms.
[2020-05-20 23:56:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:56:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2020-05-20 23:56:51] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 9 ms returned sat
[2020-05-20 23:56:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:51] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2020-05-20 23:56:51] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-20 23:56:51] [INFO ] Deduced a trap composed of 24 places in 49 ms
[2020-05-20 23:56:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2020-05-20 23:56:51] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 13 ms.
[2020-05-20 23:56:51] [INFO ] Added : 117 causal constraints over 24 iterations in 274 ms. Result :sat
[2020-05-20 23:56:51] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2020-05-20 23:56:51] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 6 ms returned sat
[2020-05-20 23:56:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:52] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2020-05-20 23:56:52] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-20 23:56:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:56:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-05-20 23:56:52] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-20 23:56:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:52] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2020-05-20 23:56:52] [INFO ] [Nat]Added 26 Read/Feed constraints in 12 ms returned sat
[2020-05-20 23:56:52] [INFO ] Deduced a trap composed of 26 places in 135 ms
[2020-05-20 23:56:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2020-05-20 23:56:52] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 29 ms.
[2020-05-20 23:56:52] [INFO ] Added : 117 causal constraints over 24 iterations in 302 ms. Result :sat
[2020-05-20 23:56:52] [INFO ] Deduced a trap composed of 12 places in 141 ms
[2020-05-20 23:56:52] [INFO ] Deduced a trap composed of 28 places in 40 ms
[2020-05-20 23:56:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2020-05-20 23:56:52] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-05-20 23:56:52] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-20 23:56:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:52] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2020-05-20 23:56:52] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-05-20 23:56:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:56:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-05-20 23:56:53] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-20 23:56:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:53] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2020-05-20 23:56:53] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-20 23:56:53] [INFO ] Deduced a trap composed of 26 places in 41 ms
[2020-05-20 23:56:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2020-05-20 23:56:53] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 17 ms.
[2020-05-20 23:56:53] [INFO ] Added : 117 causal constraints over 24 iterations in 272 ms. Result :sat
[2020-05-20 23:56:53] [INFO ] Deduced a trap composed of 12 places in 118 ms
[2020-05-20 23:56:53] [INFO ] Deduced a trap composed of 28 places in 65 ms
[2020-05-20 23:56:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 215 ms
[2020-05-20 23:56:53] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-05-20 23:56:53] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-20 23:56:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:53] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2020-05-20 23:56:53] [INFO ] [Real]Added 26 Read/Feed constraints in 13 ms returned sat
[2020-05-20 23:56:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:56:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-05-20 23:56:53] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-20 23:56:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:54] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2020-05-20 23:56:54] [INFO ] [Nat]Added 26 Read/Feed constraints in 10 ms returned sat
[2020-05-20 23:56:54] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2020-05-20 23:56:54] [INFO ] Added : 117 causal constraints over 24 iterations in 353 ms. Result :sat
[2020-05-20 23:56:54] [INFO ] Deduced a trap composed of 15 places in 350 ms
[2020-05-20 23:56:54] [INFO ] Deduced a trap composed of 8 places in 40 ms
[2020-05-20 23:56:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 426 ms
[2020-05-20 23:56:54] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-05-20 23:56:54] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-20 23:56:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:55] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2020-05-20 23:56:55] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-05-20 23:56:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:56:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2020-05-20 23:56:55] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2020-05-20 23:56:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:55] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2020-05-20 23:56:55] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-20 23:56:55] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 9 ms.
[2020-05-20 23:56:55] [INFO ] Added : 117 causal constraints over 24 iterations in 264 ms. Result :sat
[2020-05-20 23:56:55] [INFO ] Deduced a trap composed of 17 places in 52 ms
[2020-05-20 23:56:55] [INFO ] Deduced a trap composed of 8 places in 33 ms
[2020-05-20 23:56:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2020-05-20 23:56:55] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-05-20 23:56:55] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-20 23:56:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:55] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2020-05-20 23:56:55] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-20 23:56:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:56:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-20 23:56:55] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-20 23:56:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:55] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2020-05-20 23:56:55] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-20 23:56:55] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2020-05-20 23:56:56] [INFO ] Added : 117 causal constraints over 24 iterations in 271 ms. Result :sat
[2020-05-20 23:56:56] [INFO ] Deduced a trap composed of 15 places in 24 ms
[2020-05-20 23:56:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2020-05-20 23:56:56] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-05-20 23:56:56] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-20 23:56:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:56] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2020-05-20 23:56:56] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-05-20 23:56:56] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2020-05-20 23:56:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:56:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-05-20 23:56:56] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-20 23:56:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:56] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2020-05-20 23:56:56] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-20 23:56:56] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2020-05-20 23:56:56] [INFO ] Added : 117 causal constraints over 24 iterations in 250 ms. Result :sat
[2020-05-20 23:56:56] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-05-20 23:56:56] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 15 ms returned sat
[2020-05-20 23:56:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:56] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2020-05-20 23:56:56] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-20 23:56:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:56:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-20 23:56:56] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-20 23:56:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:56] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2020-05-20 23:56:56] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-20 23:56:56] [INFO ] Deduced a trap composed of 15 places in 49 ms
[2020-05-20 23:56:56] [INFO ] Deduced a trap composed of 8 places in 31 ms
[2020-05-20 23:56:57] [INFO ] Deduced a trap composed of 8 places in 50 ms
[2020-05-20 23:56:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 154 ms
[2020-05-20 23:56:57] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2020-05-20 23:56:57] [INFO ] Added : 117 causal constraints over 24 iterations in 236 ms. Result :sat
[2020-05-20 23:56:57] [INFO ] Deduced a trap composed of 29 places in 18 ms
[2020-05-20 23:56:57] [INFO ] Deduced a trap composed of 29 places in 35 ms
[2020-05-20 23:56:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2020-05-20 23:56:57] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-05-20 23:56:57] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-20 23:56:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:57] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2020-05-20 23:56:57] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-05-20 23:56:57] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 24 ms.
[2020-05-20 23:56:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:56:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2020-05-20 23:56:57] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-20 23:56:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:56:57] [INFO ] [Nat]Absence check using state equation in 368 ms returned sat
[2020-05-20 23:56:57] [INFO ] [Nat]Added 26 Read/Feed constraints in 12 ms returned sat
[2020-05-20 23:56:58] [INFO ] Deduced a trap composed of 12 places in 980 ms
[2020-05-20 23:56:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 991 ms
[2020-05-20 23:56:58] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 17 ms.
[2020-05-20 23:56:59] [INFO ] Added : 117 causal constraints over 24 iterations in 611 ms. Result :sat
[2020-05-20 23:56:59] [INFO ] [Real]Absence check using 8 positive place invariants in 57 ms returned sat
[2020-05-20 23:56:59] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2020-05-20 23:56:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:57:00] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2020-05-20 23:57:00] [INFO ] [Real]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-05-20 23:57:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:57:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-20 23:57:00] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-20 23:57:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:57:00] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2020-05-20 23:57:00] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-20 23:57:00] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 10 ms.
[2020-05-20 23:57:00] [INFO ] Added : 117 causal constraints over 24 iterations in 325 ms. Result :sat
[2020-05-20 23:57:00] [INFO ] [Real]Absence check using 8 positive place invariants in 33 ms returned sat
[2020-05-20 23:57:00] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 4 ms returned sat
[2020-05-20 23:57:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:57:00] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2020-05-20 23:57:00] [INFO ] [Real]Added 26 Read/Feed constraints in 13 ms returned sat
[2020-05-20 23:57:00] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 15 ms.
[2020-05-20 23:57:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:57:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2020-05-20 23:57:01] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 25 ms returned sat
[2020-05-20 23:57:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:57:01] [INFO ] [Nat]Absence check using state equation in 726 ms returned sat
[2020-05-20 23:57:01] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2020-05-20 23:57:01] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 15 ms.
[2020-05-20 23:57:02] [INFO ] Added : 117 causal constraints over 24 iterations in 244 ms. Result :sat
[2020-05-20 23:57:02] [INFO ] Deduced a trap composed of 8 places in 32 ms
[2020-05-20 23:57:02] [INFO ] Deduced a trap composed of 14 places in 30 ms
[2020-05-20 23:57:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2020-05-20 23:57:02] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2020-05-20 23:57:02] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 7 ms returned sat
[2020-05-20 23:57:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:57:02] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2020-05-20 23:57:02] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-05-20 23:57:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:57:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-05-20 23:57:02] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-20 23:57:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:57:02] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2020-05-20 23:57:02] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-20 23:57:02] [INFO ] Deduced a trap composed of 15 places in 50 ms
[2020-05-20 23:57:02] [INFO ] Deduced a trap composed of 12 places in 35 ms
[2020-05-20 23:57:02] [INFO ] Deduced a trap composed of 28 places in 37 ms
[2020-05-20 23:57:02] [INFO ] Deduced a trap composed of 40 places in 34 ms
[2020-05-20 23:57:02] [INFO ] Deduced a trap composed of 17 places in 32 ms
[2020-05-20 23:57:02] [INFO ] Deduced a trap composed of 25 places in 49 ms
[2020-05-20 23:57:02] [INFO ] Deduced a trap composed of 12 places in 29 ms
[2020-05-20 23:57:02] [INFO ] Deduced a trap composed of 8 places in 51 ms
[2020-05-20 23:57:02] [INFO ] Deduced a trap composed of 34 places in 60 ms
[2020-05-20 23:57:02] [INFO ] Deduced a trap composed of 22 places in 41 ms
[2020-05-20 23:57:03] [INFO ] Deduced a trap composed of 8 places in 49 ms
[2020-05-20 23:57:03] [INFO ] Deduced a trap composed of 22 places in 46 ms
[2020-05-20 23:57:03] [INFO ] Deduced a trap composed of 37 places in 31 ms
[2020-05-20 23:57:03] [INFO ] Deduced a trap composed of 33 places in 36 ms
[2020-05-20 23:57:03] [INFO ] Deduced a trap composed of 15 places in 47 ms
[2020-05-20 23:57:03] [INFO ] Deduced a trap composed of 32 places in 38 ms
[2020-05-20 23:57:03] [INFO ] Deduced a trap composed of 30 places in 36 ms
[2020-05-20 23:57:03] [INFO ] Deduced a trap composed of 30 places in 24 ms
[2020-05-20 23:57:03] [INFO ] Deduced a trap composed of 37 places in 27 ms
[2020-05-20 23:57:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 19 trap constraints in 981 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-20 23:57:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-20 23:57:03] [INFO ] Flatten gal took : 52 ms
[2020-05-20 23:57:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-20 23:57:03] [INFO ] Flatten gal took : 27 ms
FORMULA Peterson-COL-2-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-20 23:57:03] [INFO ] Applying decomposition
[2020-05-20 23:57:03] [INFO ] Flatten gal took : 24 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/graph13840090485340460306.txt, -o, /tmp/graph13840090485340460306.bin, -w, /tmp/graph13840090485340460306.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/graph13840090485340460306.bin, -l, -1, -v, -w, /tmp/graph13840090485340460306.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-20 23:57:03] [INFO ] Decomposing Gal with order
[2020-05-20 23:57:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-20 23:57:03] [INFO ] Removed a total of 68 redundant transitions.
[2020-05-20 23:57:03] [INFO ] Flatten gal took : 91 ms
[2020-05-20 23:57:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 6 ms.
[2020-05-20 23:57:04] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 5 ms
[2020-05-20 23:57:04] [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 15 CTL formulae.
built 25 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 13 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 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,20754,0.179703,7580,373,131,4824,932,379,8411,82,3811,0


Converting to forward existential form...Done !
original formula: EF((EG((((((i1.u0.wantSection_3>=1)&&(i7.u23.CS_1>=1))||((i5.i0.u2.wantSection_1>=1)&&(i6.u22.CS_0>=1)))||((i6.u1.wantSection_5>=1)&&(i9.i2.u24.CS_2>=1)))&&(((((((((((((i3.u6.turn_0>=1)&&(i5.i0.u3.testTurn_4>=1))||((i3.u6.turn_1>=1)&&(i6.u5.testTurn_0>=1)))||((i3.u6.turn_2>=1)&&(i6.u5.testTurn_0>=1)))||((i7.u23.turn_5>=1)&&(i7.u23.testTurn_3>=1)))||((i7.u23.turn_5>=1)&&(i6.u22.testTurn_1>=1)))||((i7.u23.turn_4>=1)&&(i6.u22.testTurn_1>=1)))||((i7.u23.turn_3>=1)&&(i7.u23.testTurn_3>=1)))||((i7.u23.turn_4>=1)&&(i9.i1.u4.testTurn_5>=1)))||((i3.u6.turn_2>=1)&&(i3.u6.testTurn_2>=1)))||((i3.u6.turn_1>=1)&&(i5.i0.u3.testTurn_4>=1)))||((i3.u6.turn_0>=1)&&(i3.u6.testTurn_2>=1)))||((i7.u23.turn_3>=1)&&(i9.i1.u4.testTurn_5>=1))))) + (EG((((i7.u23.endTurn_3>=1)||(i9.i2.u24.endTurn_5>=1))||(i6.u22.endTurn_1>=1))) * ((((((i8.u31.testIdentity_10>=1)||(i5.i1.u18.testIdentity_14>=1))||(i9.i2.u36.testIdentity_17>=1))||(i0.i0.u25.testIdentity_0>=1))||(i2.u9.testIdentity_3>=1))||(i4.u13.testIdentity_7>=1)))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),(((((i1.u0.wantSection_3>=1)&&(i7.u23.CS_1>=1))||((i5.i0.u2.wantSection_1>=1)&&(i6.u22.CS_0>=1)))||((i6.u1.wantSection_5>=1)&&(i9.i2.u24.CS_2>=1)))&&(((((((((((((i3.u6.turn_0>=1)&&(i5.i0.u3.testTurn_4>=1))||((i3.u6.turn_1>=1)&&(i6.u5.testTurn_0>=1)))||((i3.u6.turn_2>=1)&&(i6.u5.testTurn_0>=1)))||((i7.u23.turn_5>=1)&&(i7.u23.testTurn_3>=1)))||((i7.u23.turn_5>=1)&&(i6.u22.testTurn_1>=1)))||((i7.u23.turn_4>=1)&&(i6.u22.testTurn_1>=1)))||((i7.u23.turn_3>=1)&&(i7.u23.testTurn_3>=1)))||((i7.u23.turn_4>=1)&&(i9.i1.u4.testTurn_5>=1)))||((i3.u6.turn_2>=1)&&(i3.u6.testTurn_2>=1)))||((i3.u6.turn_1>=1)&&(i5.i0.u3.testTurn_4>=1)))||((i3.u6.turn_0>=1)&&(i3.u6.testTurn_2>=1)))||((i7.u23.turn_3>=1)&&(i9.i1.u4.testTurn_5>=1)))))] != FALSE + [FwdG((FwdU(Init,TRUE) * ((((((i8.u31.testIdentity_10>=1)||(i5.i1.u18.testIdentity_14>=1))||(i9.i2.u36.testIdentity_17>=1))||(i0.i0.u25.testIdentity_0>=1))||(i2.u9.testIdentity_3>=1))||(i4.u13.testIdentity_7>=1))),(((i7.u23.endTurn_3>=1)||(i9.i2.u24.endTurn_5>=1))||(i6.u22.endTurn_1>=1)))] != FALSE)
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 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,0.220672,7964,1,0,4878,1402,1268,9058,334,3911,11149
FORMULA Peterson-COL-2-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((((((((((((((i1.u0.wantSection_3<1)||(i0.i0.u26.testAlone_1<1))&&((i1.u0.wantSection_3<1)||(i5.i0.u17.testAlone_13<1)))&&((i6.u1.wantSection_5<1)||(i1.u29.testAlone_5<1)))&&((i6.u1.wantSection_5<1)||(i0.i1.u27.testAlone_2<1)))&&((i5.i0.u2.wantSection_1<1)||(i9.i1.u34.testAlone_15<1)))&&((i1.u0.wantSection_3<1)||(i9.i0.u35.testAlone_16<1)))&&((i5.i0.u2.wantSection_1<1)||(i5.i0.u16.testAlone_12<1)))&&((i1.u0.wantSection_3<1)||(i2.u28.testAlone_4<1)))&&((i5.i0.u2.wantSection_1<1)||(i7.u30.testAlone_9<1)))&&((i5.i0.u2.wantSection_1<1)||(i3.u12.testAlone_6<1)))&&((i6.u1.wantSection_5<1)||(i8.u32.testAlone_11<1)))&&((i6.u1.wantSection_5<1)||(i4.u14.testAlone_8<1))))
=> equivalent forward existential formula: [FwdG(Init,(((((((((((((i1.u0.wantSection_3<1)||(i0.i0.u26.testAlone_1<1))&&((i1.u0.wantSection_3<1)||(i5.i0.u17.testAlone_13<1)))&&((i6.u1.wantSection_5<1)||(i1.u29.testAlone_5<1)))&&((i6.u1.wantSection_5<1)||(i0.i1.u27.testAlone_2<1)))&&((i5.i0.u2.wantSection_1<1)||(i9.i1.u34.testAlone_15<1)))&&((i1.u0.wantSection_3<1)||(i9.i0.u35.testAlone_16<1)))&&((i5.i0.u2.wantSection_1<1)||(i5.i0.u16.testAlone_12<1)))&&((i1.u0.wantSection_3<1)||(i2.u28.testAlone_4<1)))&&((i5.i0.u2.wantSection_1<1)||(i7.u30.testAlone_9<1)))&&((i5.i0.u2.wantSection_1<1)||(i3.u12.testAlone_6<1)))&&((i6.u1.wantSection_5<1)||(i8.u32.testAlone_11<1)))&&((i6.u1.wantSection_5<1)||(i4.u14.testAlone_8<1))))] != FALSE
(forward)formula 1,1,0.65338,24068,1,0,38244,1746,1345,52069,337,7264,87317
FORMULA Peterson-COL-2-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AG(EF(((((((((((((i8.u32.testIdentity_11>=1)||(i5.i0.u17.testIdentity_13>=1))||(i5.i0.u16.testIdentity_12>=1))||(i9.i1.u34.testIdentity_15>=1))||(i0.i0.u26.testIdentity_1>=1))||(i9.i0.u35.testIdentity_16>=1))||(i0.i1.u27.testIdentity_2>=1))||(i1.u29.testIdentity_5>=1))||(i2.u28.testIdentity_4>=1))||(i3.u12.testIdentity_6>=1))||(i7.u30.testIdentity_9>=1))||(i4.u14.testIdentity_8>=1)))) + E((((((((((((((i1.u0.wantSection_2>=1)&&(i9.i0.u35.testAlone_16>=1))||((i6.u1.wantSection_4>=1)&&(i8.u32.testAlone_11>=1)))||((i1.u0.wantSection_2>=1)&&(i5.i0.u17.testAlone_13>=1)))||((i6.u1.wantSection_4>=1)&&(i0.i1.u27.testAlone_2>=1)))||((i1.u0.wantSection_2>=1)&&(i2.u28.testAlone_4>=1)))||((i6.u1.wantSection_4>=1)&&(i1.u29.testAlone_5>=1)))||((i6.u1.wantSection_4>=1)&&(i4.u14.testAlone_8>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i3.u12.testAlone_6>=1)))||((i1.u0.wantSection_2>=1)&&(i0.i0.u26.testAlone_1>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i7.u30.testAlone_9>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i5.i0.u16.testAlone_12>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i9.i1.u34.testAlone_15>=1))) U (((i5.i1.u33.endTurn_4>=1)||(i6.u21.endTurn_0>=1))||(i3.u6.endTurn_2>=1))))
=> equivalent forward existential formula: [(FwdU((Init * !(E((((((((((((((i1.u0.wantSection_2>=1)&&(i9.i0.u35.testAlone_16>=1))||((i6.u1.wantSection_4>=1)&&(i8.u32.testAlone_11>=1)))||((i1.u0.wantSection_2>=1)&&(i5.i0.u17.testAlone_13>=1)))||((i6.u1.wantSection_4>=1)&&(i0.i1.u27.testAlone_2>=1)))||((i1.u0.wantSection_2>=1)&&(i2.u28.testAlone_4>=1)))||((i6.u1.wantSection_4>=1)&&(i1.u29.testAlone_5>=1)))||((i6.u1.wantSection_4>=1)&&(i4.u14.testAlone_8>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i3.u12.testAlone_6>=1)))||((i1.u0.wantSection_2>=1)&&(i0.i0.u26.testAlone_1>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i7.u30.testAlone_9>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i5.i0.u16.testAlone_12>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i9.i1.u34.testAlone_15>=1))) U (((i5.i1.u33.endTurn_4>=1)||(i6.u21.endTurn_0>=1))||(i3.u6.endTurn_2>=1))))),TRUE) * !(E(TRUE U ((((((((((((i8.u32.testIdentity_11>=1)||(i5.i0.u17.testIdentity_13>=1))||(i5.i0.u16.testIdentity_12>=1))||(i9.i1.u34.testIdentity_15>=1))||(i0.i0.u26.testIdentity_1>=1))||(i9.i0.u35.testIdentity_16>=1))||(i0.i1.u27.testIdentity_2>=1))||(i1.u29.testIdentity_5>=1))||(i2.u28.testIdentity_4>=1))||(i3.u12.testIdentity_6>=1))||(i7.u30.testIdentity_9>=1))||(i4.u14.testIdentity_8>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions updateTurnj0k0i0, updateTurnj0k1i0, updateTurnj0k1i2, updateTurnj0k2i2, updateTurnj1k0i0, updateTurnj1k1i0, updateTurnj1k1i2, updateTurnj1k2i2, becomeIdlei0, becomeIdlei1, becomeIdlei2, notAlonej0k1i2, notAlonej0k2i0, notAlonej0k2i1, notAlonej1k1i2, notAlonej1k2i0, notAlonej1k2i1, i3.u6.updateTurnj0k0i1, i3.u6.updateTurnj0k1i1, i3.u6.updateTurnj0k2i1, i3.u6.endLoopj0i1, i5.i1.u33.endLoopj0i2, i6.u21.endLoopj0i0, i7.u23.updateTurnj1k0i1, i7.u23.updateTurnj1k1i1, i7.u23.updateTurnj1k2i1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/96/26/122
(forward)formula 2,1,0.779304,27500,1,0,43442,1945,2240,63340,457,8785,112199
FORMULA Peterson-COL-2-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((((((((((((((i1.u0.wantSection_3>=1)&&(i0.i0.u26.testAlone_1>=1))||((i1.u0.wantSection_3>=1)&&(i5.i0.u17.testAlone_13>=1)))||((i6.u1.wantSection_5>=1)&&(i1.u29.testAlone_5>=1)))||((i6.u1.wantSection_5>=1)&&(i0.i1.u27.testAlone_2>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i9.i1.u34.testAlone_15>=1)))||((i1.u0.wantSection_3>=1)&&(i9.i0.u35.testAlone_16>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i5.i0.u16.testAlone_12>=1)))||((i1.u0.wantSection_3>=1)&&(i2.u28.testAlone_4>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i7.u30.testAlone_9>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i3.u12.testAlone_6>=1)))||((i6.u1.wantSection_5>=1)&&(i8.u32.testAlone_11>=1)))||((i6.u1.wantSection_5>=1)&&(i4.u14.testAlone_8>=1))))
=> equivalent forward existential formula: [FwdG(Init,!((((((((((((((i1.u0.wantSection_3>=1)&&(i0.i0.u26.testAlone_1>=1))||((i1.u0.wantSection_3>=1)&&(i5.i0.u17.testAlone_13>=1)))||((i6.u1.wantSection_5>=1)&&(i1.u29.testAlone_5>=1)))||((i6.u1.wantSection_5>=1)&&(i0.i1.u27.testAlone_2>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i9.i1.u34.testAlone_15>=1)))||((i1.u0.wantSection_3>=1)&&(i9.i0.u35.testAlone_16>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i5.i0.u16.testAlone_12>=1)))||((i1.u0.wantSection_3>=1)&&(i2.u28.testAlone_4>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i7.u30.testAlone_9>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i3.u12.testAlone_6>=1)))||((i6.u1.wantSection_5>=1)&&(i8.u32.testAlone_11>=1)))||((i6.u1.wantSection_5>=1)&&(i4.u14.testAlone_8>=1)))))] = FALSE
(forward)formula 3,0,0.856613,29876,1,0,47294,1976,2325,69660,457,9054,127522
FORMULA Peterson-COL-2-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(EF((((((((i3.u6.turn_1>=1)&&(i3.u6.testTurn_2>=1))||((i7.u23.turn_5>=1)&&(i9.i1.u4.testTurn_5>=1)))||((i7.u23.turn_4>=1)&&(i7.u23.testTurn_3>=1)))||((i7.u23.turn_3>=1)&&(i6.u22.testTurn_1>=1)))||((i3.u6.turn_0>=1)&&(i6.u5.testTurn_0>=1)))||((i3.u6.turn_2>=1)&&(i5.i0.u3.testTurn_4>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((i3.u6.turn_1>=1)&&(i3.u6.testTurn_2>=1))||((i7.u23.turn_5>=1)&&(i9.i1.u4.testTurn_5>=1)))||((i7.u23.turn_4>=1)&&(i7.u23.testTurn_3>=1)))||((i7.u23.turn_3>=1)&&(i6.u22.testTurn_1>=1)))||((i3.u6.turn_0>=1)&&(i6.u5.testTurn_0>=1)))||((i3.u6.turn_2>=1)&&(i5.i0.u3.testTurn_4>=1))))))] = FALSE
(forward)formula 4,1,0.880235,30404,1,0,48388,2017,2359,71712,461,9178,131746
FORMULA Peterson-COL-2-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EX(((((((EF(((((((((((((i8.u32.testIdentity_11>=1)||(i5.i0.u17.testIdentity_13>=1))||(i5.i0.u16.testIdentity_12>=1))||(i9.i1.u34.testIdentity_15>=1))||(i0.i0.u26.testIdentity_1>=1))||(i9.i0.u35.testIdentity_16>=1))||(i0.i1.u27.testIdentity_2>=1))||(i1.u29.testIdentity_5>=1))||(i2.u28.testIdentity_4>=1))||(i3.u12.testIdentity_6>=1))||(i7.u30.testIdentity_9>=1))||(i4.u14.testIdentity_8>=1))) * ((i1.u0.idle_1<1)||(i1.u0.wantSection_2<1))) * ((i5.i0.u2.idle_0<1)||(i5.i0.u2.wantSection_0<1))) * ((i6.u1.idle_2<1)||(i6.u1.wantSection_4<1))) * ((i1.u0.idle_1<1)||(i1.u0.wantSection_2<1))) * ((i5.i0.u2.idle_0<1)||(i5.i0.u2.wantSection_0<1))) * ((i6.u1.idle_2<1)||(i6.u1.wantSection_4<1)))) + A((((((((((((((((((((i1.u11.beginLoop_5<1)&&(i3.u12.beginLoop_6<1))&&(i4.u13.beginLoop_7<1))&&(i4.u37.beginLoop_8<1))&&(i7.u30.beginLoop_9<1))&&(i8.u15.beginLoop_10<1))&&(i5.i0.u16.beginLoop_12<1))&&(i8.u32.beginLoop_11<1))&&(i5.i1.u18.beginLoop_14<1))&&(i5.i0.u17.beginLoop_13<1))&&(i9.i0.u19.beginLoop_16<1))&&(i9.i1.u34.beginLoop_15<1))&&(i9.i2.u20.beginLoop_17<1))&&(i0.i0.u25.beginLoop_0<1))&&(i0.i0.u7.beginLoop_1<1))&&(i0.i1.u8.beginLoop_2<1))&&(i2.u9.beginLoop_3<1))&&(i2.u10.beginLoop_4<1))||((((((((((((((i1.u0.wantSection_2>=1)&&(i9.i0.u35.testAlone_16>=1))||((i6.u1.wantSection_4>=1)&&(i8.u32.testAlone_11>=1)))||((i1.u0.wantSection_2>=1)&&(i5.i0.u17.testAlone_13>=1)))||((i6.u1.wantSection_4>=1)&&(i0.i1.u27.testAlone_2>=1)))||((i1.u0.wantSection_2>=1)&&(i2.u28.testAlone_4>=1)))||((i6.u1.wantSection_4>=1)&&(i1.u29.testAlone_5>=1)))||((i6.u1.wantSection_4>=1)&&(i4.u14.testAlone_8>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i3.u12.testAlone_6>=1)))||((i1.u0.wantSection_2>=1)&&(i0.i0.u26.testAlone_1>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i7.u30.testAlone_9>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i5.i0.u16.testAlone_12>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i9.i1.u34.testAlone_15>=1)))&&((((((((((((i4.u37.isEndLoop_7>=1)||(i4.u13.isEndLoop_6>=1))||(i8.u15.isEndLoop_9>=1))||(i8.u31.isEndLoop_10>=1))||(i5.i1.u18.isEndLoop_13>=1))||(i5.i0.u17.isEndLoop_12>=1))||(i9.i2.u20.isEndLoop_16>=1))||(i0.i1.u8.isEndLoop_1>=1))||(i0.i0.u7.isEndLoop_0>=1))||(i9.i0.u19.isEndLoop_15>=1))||(i2.u10.isEndLoop_3>=1))||(i1.u11.isEndLoop_4>=1)))) U ((((((((((((((((((i1.u11.beginLoop_5>=1)||(i3.u12.beginLoop_6>=1))||(i4.u13.beginLoop_7>=1))||(i4.u37.beginLoop_8>=1))||(i7.u30.beginLoop_9>=1))||(i8.u15.beginLoop_10>=1))||(i5.i0.u16.beginLoop_12>=1))||(i8.u32.beginLoop_11>=1))||(i5.i1.u18.beginLoop_14>=1))||(i5.i0.u17.beginLoop_13>=1))||(i9.i0.u19.beginLoop_16>=1))||(i9.i1.u34.beginLoop_15>=1))||(i9.i2.u20.beginLoop_17>=1))||(i0.i0.u25.beginLoop_0>=1))||(i0.i0.u7.beginLoop_1>=1))||(i0.i1.u8.beginLoop_2>=1))||(i2.u9.beginLoop_3>=1))||(i2.u10.beginLoop_4>=1))))
=> equivalent forward existential formula: ([(FwdU(((((((EY(Init) * ((i6.u1.idle_2<1)||(i6.u1.wantSection_4<1))) * ((i5.i0.u2.idle_0<1)||(i5.i0.u2.wantSection_0<1))) * ((i1.u0.idle_1<1)||(i1.u0.wantSection_2<1))) * ((i6.u1.idle_2<1)||(i6.u1.wantSection_4<1))) * ((i5.i0.u2.idle_0<1)||(i5.i0.u2.wantSection_0<1))) * ((i1.u0.idle_1<1)||(i1.u0.wantSection_2<1))),TRUE) * ((((((((((((i8.u32.testIdentity_11>=1)||(i5.i0.u17.testIdentity_13>=1))||(i5.i0.u16.testIdentity_12>=1))||(i9.i1.u34.testIdentity_15>=1))||(i0.i0.u26.testIdentity_1>=1))||(i9.i0.u35.testIdentity_16>=1))||(i0.i1.u27.testIdentity_2>=1))||(i1.u29.testIdentity_5>=1))||(i2.u28.testIdentity_4>=1))||(i3.u12.testIdentity_6>=1))||(i7.u30.testIdentity_9>=1))||(i4.u14.testIdentity_8>=1)))] != FALSE + [((Init * !(EG(!(((((((((((((((((((i1.u11.beginLoop_5>=1)||(i3.u12.beginLoop_6>=1))||(i4.u13.beginLoop_7>=1))||(i4.u37.beginLoop_8>=1))||(i7.u30.beginLoop_9>=1))||(i8.u15.beginLoop_10>=1))||(i5.i0.u16.beginLoop_12>=1))||(i8.u32.beginLoop_11>=1))||(i5.i1.u18.beginLoop_14>=1))||(i5.i0.u17.beginLoop_13>=1))||(i9.i0.u19.beginLoop_16>=1))||(i9.i1.u34.beginLoop_15>=1))||(i9.i2.u20.beginLoop_17>=1))||(i0.i0.u25.beginLoop_0>=1))||(i0.i0.u7.beginLoop_1>=1))||(i0.i1.u8.beginLoop_2>=1))||(i2.u9.beginLoop_3>=1))||(i2.u10.beginLoop_4>=1)))))) * !(E(!(((((((((((((((((((i1.u11.beginLoop_5>=1)||(i3.u12.beginLoop_6>=1))||(i4.u13.beginLoop_7>=1))||(i4.u37.beginLoop_8>=1))||(i7.u30.beginLoop_9>=1))||(i8.u15.beginLoop_10>=1))||(i5.i0.u16.beginLoop_12>=1))||(i8.u32.beginLoop_11>=1))||(i5.i1.u18.beginLoop_14>=1))||(i5.i0.u17.beginLoop_13>=1))||(i9.i0.u19.beginLoop_16>=1))||(i9.i1.u34.beginLoop_15>=1))||(i9.i2.u20.beginLoop_17>=1))||(i0.i0.u25.beginLoop_0>=1))||(i0.i0.u7.beginLoop_1>=1))||(i0.i1.u8.beginLoop_2>=1))||(i2.u9.beginLoop_3>=1))||(i2.u10.beginLoop_4>=1))) U (!((((((((((((((((((((i1.u11.beginLoop_5<1)&&(i3.u12.beginLoop_6<1))&&(i4.u13.beginLoop_7<1))&&(i4.u37.beginLoop_8<1))&&(i7.u30.beginLoop_9<1))&&(i8.u15.beginLoop_10<1))&&(i5.i0.u16.beginLoop_12<1))&&(i8.u32.beginLoop_11<1))&&(i5.i1.u18.beginLoop_14<1))&&(i5.i0.u17.beginLoop_13<1))&&(i9.i0.u19.beginLoop_16<1))&&(i9.i1.u34.beginLoop_15<1))&&(i9.i2.u20.beginLoop_17<1))&&(i0.i0.u25.beginLoop_0<1))&&(i0.i0.u7.beginLoop_1<1))&&(i0.i1.u8.beginLoop_2<1))&&(i2.u9.beginLoop_3<1))&&(i2.u10.beginLoop_4<1))||((((((((((((((i1.u0.wantSection_2>=1)&&(i9.i0.u35.testAlone_16>=1))||((i6.u1.wantSection_4>=1)&&(i8.u32.testAlone_11>=1)))||((i1.u0.wantSection_2>=1)&&(i5.i0.u17.testAlone_13>=1)))||((i6.u1.wantSection_4>=1)&&(i0.i1.u27.testAlone_2>=1)))||((i1.u0.wantSection_2>=1)&&(i2.u28.testAlone_4>=1)))||((i6.u1.wantSection_4>=1)&&(i1.u29.testAlone_5>=1)))||((i6.u1.wantSection_4>=1)&&(i4.u14.testAlone_8>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i3.u12.testAlone_6>=1)))||((i1.u0.wantSection_2>=1)&&(i0.i0.u26.testAlone_1>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i7.u30.testAlone_9>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i5.i0.u16.testAlone_12>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i9.i1.u34.testAlone_15>=1)))&&((((((((((((i4.u37.isEndLoop_7>=1)||(i4.u13.isEndLoop_6>=1))||(i8.u15.isEndLoop_9>=1))||(i8.u31.isEndLoop_10>=1))||(i5.i1.u18.isEndLoop_13>=1))||(i5.i0.u17.isEndLoop_12>=1))||(i9.i2.u20.isEndLoop_16>=1))||(i0.i1.u8.isEndLoop_1>=1))||(i0.i0.u7.isEndLoop_0>=1))||(i9.i0.u19.isEndLoop_15>=1))||(i2.u10.isEndLoop_3>=1))||(i1.u11.isEndLoop_4>=1))))) * !(((((((((((((((((((i1.u11.beginLoop_5>=1)||(i3.u12.beginLoop_6>=1))||(i4.u13.beginLoop_7>=1))||(i4.u37.beginLoop_8>=1))||(i7.u30.beginLoop_9>=1))||(i8.u15.beginLoop_10>=1))||(i5.i0.u16.beginLoop_12>=1))||(i8.u32.beginLoop_11>=1))||(i5.i1.u18.beginLoop_14>=1))||(i5.i0.u17.beginLoop_13>=1))||(i9.i0.u19.beginLoop_16>=1))||(i9.i1.u34.beginLoop_15>=1))||(i9.i2.u20.beginLoop_17>=1))||(i0.i0.u25.beginLoop_0>=1))||(i0.i0.u7.beginLoop_1>=1))||(i0.i1.u8.beginLoop_2>=1))||(i2.u9.beginLoop_3>=1))||(i2.u10.beginLoop_4>=1)))))))] != FALSE)
(forward)formula 5,0,1.1694,39380,1,0,65724,2516,2661,98370,464,10897,167348
FORMULA Peterson-COL-2-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(EF(AX((((((((((((((i1.u0.wantSection_3>=1)&&(i0.i0.u26.testAlone_1>=1))||((i1.u0.wantSection_3>=1)&&(i5.i0.u17.testAlone_13>=1)))||((i6.u1.wantSection_5>=1)&&(i1.u29.testAlone_5>=1)))||((i6.u1.wantSection_5>=1)&&(i0.i1.u27.testAlone_2>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i9.i1.u34.testAlone_15>=1)))||((i1.u0.wantSection_3>=1)&&(i9.i0.u35.testAlone_16>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i5.i0.u16.testAlone_12>=1)))||((i1.u0.wantSection_3>=1)&&(i2.u28.testAlone_4>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i7.u30.testAlone_9>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i3.u12.testAlone_6>=1)))||((i6.u1.wantSection_5>=1)&&(i8.u32.testAlone_11>=1)))||((i6.u1.wantSection_5>=1)&&(i4.u14.testAlone_8>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!((((((((((((((i1.u0.wantSection_3>=1)&&(i0.i0.u26.testAlone_1>=1))||((i1.u0.wantSection_3>=1)&&(i5.i0.u17.testAlone_13>=1)))||((i6.u1.wantSection_5>=1)&&(i1.u29.testAlone_5>=1)))||((i6.u1.wantSection_5>=1)&&(i0.i1.u27.testAlone_2>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i9.i1.u34.testAlone_15>=1)))||((i1.u0.wantSection_3>=1)&&(i9.i0.u35.testAlone_16>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i5.i0.u16.testAlone_12>=1)))||((i1.u0.wantSection_3>=1)&&(i2.u28.testAlone_4>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i7.u30.testAlone_9>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i3.u12.testAlone_6>=1)))||((i6.u1.wantSection_5>=1)&&(i8.u32.testAlone_11>=1)))||((i6.u1.wantSection_5>=1)&&(i4.u14.testAlone_8>=1)))))))))] = FALSE
(forward)formula 6,1,1.30908,41492,1,0,69408,2566,2661,105151,464,11348,177283
FORMULA Peterson-COL-2-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(EF(((((i5.i1.u33.endTurn_4>=1)||(i6.u21.endTurn_0>=1))||(i3.u6.endTurn_2>=1))&&((((i1.u0.wantSection_3>=1)&&(i7.u23.CS_1>=1))||((i5.i0.u2.wantSection_1>=1)&&(i6.u22.CS_0>=1)))||((i6.u1.wantSection_5>=1)&&(i9.i2.u24.CS_2>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((((i5.i1.u33.endTurn_4>=1)||(i6.u21.endTurn_0>=1))||(i3.u6.endTurn_2>=1))&&((((i1.u0.wantSection_3>=1)&&(i7.u23.CS_1>=1))||((i5.i0.u2.wantSection_1>=1)&&(i6.u22.CS_0>=1)))||((i6.u1.wantSection_5>=1)&&(i9.i2.u24.CS_2>=1)))))] = FALSE
(forward)formula 7,0,1.31155,41756,1,0,69424,2566,2669,105172,464,11348,177458
FORMULA Peterson-COL-2-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(((((((((((((((((((((((((((((((((((((i1.u11.beginLoop_5>=1)||(i3.u12.beginLoop_6>=1))||(i4.u13.beginLoop_7>=1))||(i4.u37.beginLoop_8>=1))||(i7.u30.beginLoop_9>=1))||(i8.u15.beginLoop_10>=1))||(i5.i0.u16.beginLoop_12>=1))||(i8.u32.beginLoop_11>=1))||(i5.i1.u18.beginLoop_14>=1))||(i5.i0.u17.beginLoop_13>=1))||(i9.i0.u19.beginLoop_16>=1))||(i9.i1.u34.beginLoop_15>=1))||(i9.i2.u20.beginLoop_17>=1))||(i0.i0.u25.beginLoop_0>=1))||(i0.i0.u7.beginLoop_1>=1))||(i0.i1.u8.beginLoop_2>=1))||(i2.u9.beginLoop_3>=1))||(i2.u10.beginLoop_4>=1))||(i4.u37.isEndLoop_7>=1))||(i4.u13.isEndLoop_6>=1))||(i8.u15.isEndLoop_9>=1))||(i8.u31.isEndLoop_10>=1))||(i5.i1.u18.isEndLoop_13>=1))||(i5.i0.u17.isEndLoop_12>=1))||(i9.i2.u20.isEndLoop_16>=1))||(i0.i1.u8.isEndLoop_1>=1))||(i0.i0.u7.isEndLoop_0>=1))||(i9.i0.u19.isEndLoop_15>=1))||(i2.u10.isEndLoop_3>=1))||(i1.u11.isEndLoop_4>=1))||(i3.u6.isEndLoop_8>=1))||(i7.u23.isEndLoop_11>=1))||(i5.i1.u33.isEndLoop_14>=1))||(i9.i2.u36.isEndLoop_17>=1))||(i6.u21.isEndLoop_2>=1))||(i6.u22.isEndLoop_5>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((((((((((((((((((((((((((((((((((((i1.u11.beginLoop_5>=1)||(i3.u12.beginLoop_6>=1))||(i4.u13.beginLoop_7>=1))||(i4.u37.beginLoop_8>=1))||(i7.u30.beginLoop_9>=1))||(i8.u15.beginLoop_10>=1))||(i5.i0.u16.beginLoop_12>=1))||(i8.u32.beginLoop_11>=1))||(i5.i1.u18.beginLoop_14>=1))||(i5.i0.u17.beginLoop_13>=1))||(i9.i0.u19.beginLoop_16>=1))||(i9.i1.u34.beginLoop_15>=1))||(i9.i2.u20.beginLoop_17>=1))||(i0.i0.u25.beginLoop_0>=1))||(i0.i0.u7.beginLoop_1>=1))||(i0.i1.u8.beginLoop_2>=1))||(i2.u9.beginLoop_3>=1))||(i2.u10.beginLoop_4>=1))||(i4.u37.isEndLoop_7>=1))||(i4.u13.isEndLoop_6>=1))||(i8.u15.isEndLoop_9>=1))||(i8.u31.isEndLoop_10>=1))||(i5.i1.u18.isEndLoop_13>=1))||(i5.i0.u17.isEndLoop_12>=1))||(i9.i2.u20.isEndLoop_16>=1))||(i0.i1.u8.isEndLoop_1>=1))||(i0.i0.u7.isEndLoop_0>=1))||(i9.i0.u19.isEndLoop_15>=1))||(i2.u10.isEndLoop_3>=1))||(i1.u11.isEndLoop_4>=1))||(i3.u6.isEndLoop_8>=1))||(i7.u23.isEndLoop_11>=1))||(i5.i1.u33.isEndLoop_14>=1))||(i9.i2.u36.isEndLoop_17>=1))||(i6.u21.isEndLoop_2>=1))||(i6.u22.isEndLoop_5>=1))))] = FALSE
(forward)formula 8,0,1.34201,42812,1,0,71994,2575,2754,107731,464,11443,185208
FORMULA Peterson-COL-2-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(EG(((((((((((((((i8.u32.testIdentity_11>=1)||(i5.i0.u17.testIdentity_13>=1))||(i5.i0.u16.testIdentity_12>=1))||(i9.i1.u34.testIdentity_15>=1))||(i0.i0.u26.testIdentity_1>=1))||(i9.i0.u35.testIdentity_16>=1))||(i0.i1.u27.testIdentity_2>=1))||(i1.u29.testIdentity_5>=1))||(i2.u28.testIdentity_4>=1))||(i3.u12.testIdentity_6>=1))||(i7.u30.testIdentity_9>=1))||(i4.u14.testIdentity_8>=1))&&((((((i3.u6.isEndLoop_8>=1)||(i7.u23.isEndLoop_11>=1))||(i5.i1.u33.isEndLoop_14>=1))||(i9.i2.u36.isEndLoop_17>=1))||(i6.u21.isEndLoop_2>=1))||(i6.u22.isEndLoop_5>=1)))&&((((((((((((i4.u37.isEndLoop_7>=1)||(i4.u13.isEndLoop_6>=1))||(i8.u15.isEndLoop_9>=1))||(i8.u31.isEndLoop_10>=1))||(i5.i1.u18.isEndLoop_13>=1))||(i5.i0.u17.isEndLoop_12>=1))||(i9.i2.u20.isEndLoop_16>=1))||(i0.i1.u8.isEndLoop_1>=1))||(i0.i0.u7.isEndLoop_0>=1))||(i9.i0.u19.isEndLoop_15>=1))||(i2.u10.isEndLoop_3>=1))||(i1.u11.isEndLoop_4>=1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((((((((((((((i8.u32.testIdentity_11>=1)||(i5.i0.u17.testIdentity_13>=1))||(i5.i0.u16.testIdentity_12>=1))||(i9.i1.u34.testIdentity_15>=1))||(i0.i0.u26.testIdentity_1>=1))||(i9.i0.u35.testIdentity_16>=1))||(i0.i1.u27.testIdentity_2>=1))||(i1.u29.testIdentity_5>=1))||(i2.u28.testIdentity_4>=1))||(i3.u12.testIdentity_6>=1))||(i7.u30.testIdentity_9>=1))||(i4.u14.testIdentity_8>=1))&&((((((i3.u6.isEndLoop_8>=1)||(i7.u23.isEndLoop_11>=1))||(i5.i1.u33.isEndLoop_14>=1))||(i9.i2.u36.isEndLoop_17>=1))||(i6.u21.isEndLoop_2>=1))||(i6.u22.isEndLoop_5>=1)))&&((((((((((((i4.u37.isEndLoop_7>=1)||(i4.u13.isEndLoop_6>=1))||(i8.u15.isEndLoop_9>=1))||(i8.u31.isEndLoop_10>=1))||(i5.i1.u18.isEndLoop_13>=1))||(i5.i0.u17.isEndLoop_12>=1))||(i9.i2.u20.isEndLoop_16>=1))||(i0.i1.u8.isEndLoop_1>=1))||(i0.i0.u7.isEndLoop_0>=1))||(i9.i0.u19.isEndLoop_15>=1))||(i2.u10.isEndLoop_3>=1))||(i1.u11.isEndLoop_4>=1))))] != FALSE
(forward)formula 9,0,1.34988,43076,1,0,72410,2578,2769,107952,464,11449,187692
FORMULA Peterson-COL-2-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(EG(((((((((((((i8.u32.testIdentity_11>=1)||(i5.i0.u17.testIdentity_13>=1))||(i5.i0.u16.testIdentity_12>=1))||(i9.i1.u34.testIdentity_15>=1))||(i0.i0.u26.testIdentity_1>=1))||(i9.i0.u35.testIdentity_16>=1))||(i0.i1.u27.testIdentity_2>=1))||(i1.u29.testIdentity_5>=1))||(i2.u28.testIdentity_4>=1))||(i3.u12.testIdentity_6>=1))||(i7.u30.testIdentity_9>=1))||(i4.u14.testIdentity_8>=1))) U AF((((((((((((((i1.u0.wantSection_3>=1)&&(i0.i0.u26.testAlone_1>=1))||((i1.u0.wantSection_3>=1)&&(i5.i0.u17.testAlone_13>=1)))||((i6.u1.wantSection_5>=1)&&(i1.u29.testAlone_5>=1)))||((i6.u1.wantSection_5>=1)&&(i0.i1.u27.testAlone_2>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i9.i1.u34.testAlone_15>=1)))||((i1.u0.wantSection_3>=1)&&(i9.i0.u35.testAlone_16>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i5.i0.u16.testAlone_12>=1)))||((i1.u0.wantSection_3>=1)&&(i2.u28.testAlone_4>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i7.u30.testAlone_9>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i3.u12.testAlone_6>=1)))||((i6.u1.wantSection_5>=1)&&(i8.u32.testAlone_11>=1)))||((i6.u1.wantSection_5>=1)&&(i4.u14.testAlone_8>=1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((((((((((((((i1.u0.wantSection_3>=1)&&(i0.i0.u26.testAlone_1>=1))||((i1.u0.wantSection_3>=1)&&(i5.i0.u17.testAlone_13>=1)))||((i6.u1.wantSection_5>=1)&&(i1.u29.testAlone_5>=1)))||((i6.u1.wantSection_5>=1)&&(i0.i1.u27.testAlone_2>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i9.i1.u34.testAlone_15>=1)))||((i1.u0.wantSection_3>=1)&&(i9.i0.u35.testAlone_16>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i5.i0.u16.testAlone_12>=1)))||((i1.u0.wantSection_3>=1)&&(i2.u28.testAlone_4>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i7.u30.testAlone_9>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i3.u12.testAlone_6>=1)))||((i6.u1.wantSection_5>=1)&&(i8.u32.testAlone_11>=1)))||((i6.u1.wantSection_5>=1)&&(i4.u14.testAlone_8>=1)))))))))) * !(E(!(!(EG(!((((((((((((((i1.u0.wantSection_3>=1)&&(i0.i0.u26.testAlone_1>=1))||((i1.u0.wantSection_3>=1)&&(i5.i0.u17.testAlone_13>=1)))||((i6.u1.wantSection_5>=1)&&(i1.u29.testAlone_5>=1)))||((i6.u1.wantSection_5>=1)&&(i0.i1.u27.testAlone_2>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i9.i1.u34.testAlone_15>=1)))||((i1.u0.wantSection_3>=1)&&(i9.i0.u35.testAlone_16>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i5.i0.u16.testAlone_12>=1)))||((i1.u0.wantSection_3>=1)&&(i2.u28.testAlone_4>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i7.u30.testAlone_9>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i3.u12.testAlone_6>=1)))||((i6.u1.wantSection_5>=1)&&(i8.u32.testAlone_11>=1)))||((i6.u1.wantSection_5>=1)&&(i4.u14.testAlone_8>=1))))))) U (!(EG(((((((((((((i8.u32.testIdentity_11>=1)||(i5.i0.u17.testIdentity_13>=1))||(i5.i0.u16.testIdentity_12>=1))||(i9.i1.u34.testIdentity_15>=1))||(i0.i0.u26.testIdentity_1>=1))||(i9.i0.u35.testIdentity_16>=1))||(i0.i1.u27.testIdentity_2>=1))||(i1.u29.testIdentity_5>=1))||(i2.u28.testIdentity_4>=1))||(i3.u12.testIdentity_6>=1))||(i7.u30.testIdentity_9>=1))||(i4.u14.testIdentity_8>=1)))) * !(!(EG(!((((((((((((((i1.u0.wantSection_3>=1)&&(i0.i0.u26.testAlone_1>=1))||((i1.u0.wantSection_3>=1)&&(i5.i0.u17.testAlone_13>=1)))||((i6.u1.wantSection_5>=1)&&(i1.u29.testAlone_5>=1)))||((i6.u1.wantSection_5>=1)&&(i0.i1.u27.testAlone_2>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i9.i1.u34.testAlone_15>=1)))||((i1.u0.wantSection_3>=1)&&(i9.i0.u35.testAlone_16>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i5.i0.u16.testAlone_12>=1)))||((i1.u0.wantSection_3>=1)&&(i2.u28.testAlone_4>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i7.u30.testAlone_9>=1)))||((i5.i0.u2.wantSection_1>=1)&&(i3.u12.testAlone_6>=1)))||((i6.u1.wantSection_5>=1)&&(i8.u32.testAlone_11>=1)))||((i6.u1.wantSection_5>=1)&&(i4.u14.testAlone_8>=1)))))))))))] != FALSE
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 10,0,2.03303,64724,1,0,115559,2945,2886,162931,474,13279,276913
FORMULA Peterson-COL-2-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(AG(((((((((((((i8.u32.testIdentity_11>=1)||(i5.i0.u17.testIdentity_13>=1))||(i5.i0.u16.testIdentity_12>=1))||(i9.i1.u34.testIdentity_15>=1))||(i0.i0.u26.testIdentity_1>=1))||(i9.i0.u35.testIdentity_16>=1))||(i0.i1.u27.testIdentity_2>=1))||(i1.u29.testIdentity_5>=1))||(i2.u28.testIdentity_4>=1))||(i3.u12.testIdentity_6>=1))||(i7.u30.testIdentity_9>=1))||(i4.u14.testIdentity_8>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((((((((((((i8.u32.testIdentity_11>=1)||(i5.i0.u17.testIdentity_13>=1))||(i5.i0.u16.testIdentity_12>=1))||(i9.i1.u34.testIdentity_15>=1))||(i0.i0.u26.testIdentity_1>=1))||(i9.i0.u35.testIdentity_16>=1))||(i0.i1.u27.testIdentity_2>=1))||(i1.u29.testIdentity_5>=1))||(i2.u28.testIdentity_4>=1))||(i3.u12.testIdentity_6>=1))||(i7.u30.testIdentity_9>=1))||(i4.u14.testIdentity_8>=1))))))] != FALSE
(forward)formula 11,0,2.04065,64988,1,0,115601,2945,2887,162931,474,13279,277272
FORMULA Peterson-COL-2-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(AF((((((i5.i1.u33.endTurn_4<1)&&(i6.u21.endTurn_0<1))&&(i3.u6.endTurn_2<1))&&((((((i3.u6.isEndLoop_8>=1)||(i7.u23.isEndLoop_11>=1))||(i5.i1.u33.isEndLoop_14>=1))||(i9.i2.u36.isEndLoop_17>=1))||(i6.u21.isEndLoop_2>=1))||(i6.u22.isEndLoop_5>=1)))&&(((((((i3.u6.turn_1>=1)&&(i3.u6.testTurn_2>=1))||((i7.u23.turn_5>=1)&&(i9.i1.u4.testTurn_5>=1)))||((i7.u23.turn_4>=1)&&(i7.u23.testTurn_3>=1)))||((i7.u23.turn_3>=1)&&(i6.u22.testTurn_1>=1)))||((i3.u6.turn_0>=1)&&(i6.u5.testTurn_0>=1)))||((i3.u6.turn_2>=1)&&(i5.i0.u3.testTurn_4>=1)))))) * !(AG(EF(((((((i3.u6.isEndLoop_8>=1)||(i7.u23.isEndLoop_11>=1))||(i5.i1.u33.isEndLoop_14>=1))||(i9.i2.u36.isEndLoop_17>=1))||(i6.u21.isEndLoop_2>=1))||(i6.u22.isEndLoop_5>=1))))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(EG(!((((((i5.i1.u33.endTurn_4<1)&&(i6.u21.endTurn_0<1))&&(i3.u6.endTurn_2<1))&&((((((i3.u6.isEndLoop_8>=1)||(i7.u23.isEndLoop_11>=1))||(i5.i1.u33.isEndLoop_14>=1))||(i9.i2.u36.isEndLoop_17>=1))||(i6.u21.isEndLoop_2>=1))||(i6.u22.isEndLoop_5>=1)))&&(((((((i3.u6.turn_1>=1)&&(i3.u6.testTurn_2>=1))||((i7.u23.turn_5>=1)&&(i9.i1.u4.testTurn_5>=1)))||((i7.u23.turn_4>=1)&&(i7.u23.testTurn_3>=1)))||((i7.u23.turn_3>=1)&&(i6.u22.testTurn_1>=1)))||((i3.u6.turn_0>=1)&&(i6.u5.testTurn_0>=1)))||((i3.u6.turn_2>=1)&&(i5.i0.u3.testTurn_4>=1))))))))),TRUE) * !(E(TRUE U ((((((i3.u6.isEndLoop_8>=1)||(i7.u23.isEndLoop_11>=1))||(i5.i1.u33.isEndLoop_14>=1))||(i9.i2.u36.isEndLoop_17>=1))||(i6.u21.isEndLoop_2>=1))||(i6.u22.isEndLoop_5>=1)))))] != FALSE
(forward)formula 12,1,2.20149,67364,1,0,120454,3313,3169,171544,497,15304,294132
FORMULA Peterson-COL-2-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((((((E((((((((((((((((((((i7.u23.askForSection_3>=1)&&(i7.u23.turn_3>=1))||((i7.u23.askForSection_3>=1)&&(i7.u23.turn_4>=1)))||((i3.u6.askForSection_2>=1)&&(i3.u6.turn_0>=1)))||((i3.u6.askForSection_2>=1)&&(i3.u6.turn_1>=1)))||((i6.u5.askForSection_0>=1)&&(i3.u6.turn_0>=1)))||((i3.u6.askForSection_2>=1)&&(i3.u6.turn_2>=1)))||((i6.u5.askForSection_0>=1)&&(i3.u6.turn_1>=1)))||((i6.u5.askForSection_0>=1)&&(i3.u6.turn_2>=1)))||((i5.i0.u3.askForSection_4>=1)&&(i3.u6.turn_0>=1)))||((i5.i0.u3.askForSection_4>=1)&&(i3.u6.turn_1>=1)))||((i5.i0.u3.askForSection_4>=1)&&(i3.u6.turn_2>=1)))||((i9.i1.u4.askForSection_5>=1)&&(i7.u23.turn_5>=1)))||((i9.i1.u4.askForSection_5>=1)&&(i7.u23.turn_3>=1)))||((i9.i1.u4.askForSection_5>=1)&&(i7.u23.turn_4>=1)))||((i6.u21.askForSection_1>=1)&&(i7.u23.turn_5>=1)))||((i6.u21.askForSection_1>=1)&&(i7.u23.turn_3>=1)))||((i7.u23.askForSection_3>=1)&&(i7.u23.turn_5>=1)))||((i6.u21.askForSection_1>=1)&&(i7.u23.turn_4>=1))) U ((((i1.u0.idle_1>=1)&&(i1.u0.wantSection_2>=1))||((i5.i0.u2.idle_0>=1)&&(i5.i0.u2.wantSection_0>=1)))||((i6.u1.idle_2>=1)&&(i6.u1.wantSection_4>=1)))) * (((((((((((((i1.u0.wantSection_2>=1)&&(i9.i0.u35.testAlone_16>=1))||((i6.u1.wantSection_4>=1)&&(i8.u32.testAlone_11>=1)))||((i1.u0.wantSection_2>=1)&&(i5.i0.u17.testAlone_13>=1)))||((i6.u1.wantSection_4>=1)&&(i0.i1.u27.testAlone_2>=1)))||((i1.u0.wantSection_2>=1)&&(i2.u28.testAlone_4>=1)))||((i6.u1.wantSection_4>=1)&&(i1.u29.testAlone_5>=1)))||((i6.u1.wantSection_4>=1)&&(i4.u14.testAlone_8>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i3.u12.testAlone_6>=1)))||((i1.u0.wantSection_2>=1)&&(i0.i0.u26.testAlone_1>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i7.u30.testAlone_9>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i5.i0.u16.testAlone_12>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i9.i1.u34.testAlone_15>=1)))) * ((((i1.u0.idle_1>=1)&&(i1.u0.wantSection_2>=1))||((i5.i0.u2.idle_0>=1)&&(i5.i0.u2.wantSection_0>=1)))||((i6.u1.idle_2>=1)&&(i6.u1.wantSection_4>=1)))) * ((((((((((((((((((i1.u11.beginLoop_5>=1)||(i3.u12.beginLoop_6>=1))||(i4.u13.beginLoop_7>=1))||(i4.u37.beginLoop_8>=1))||(i7.u30.beginLoop_9>=1))||(i8.u15.beginLoop_10>=1))||(i5.i0.u16.beginLoop_12>=1))||(i8.u32.beginLoop_11>=1))||(i5.i1.u18.beginLoop_14>=1))||(i5.i0.u17.beginLoop_13>=1))||(i9.i0.u19.beginLoop_16>=1))||(i9.i1.u34.beginLoop_15>=1))||(i9.i2.u20.beginLoop_17>=1))||(i0.i0.u25.beginLoop_0>=1))||(i0.i0.u7.beginLoop_1>=1))||(i0.i1.u8.beginLoop_2>=1))||(i2.u9.beginLoop_3>=1))||(i2.u10.beginLoop_4>=1))) * (((((((((((((((((((i7.u23.askForSection_3>=1)&&(i7.u23.turn_3>=1))||((i7.u23.askForSection_3>=1)&&(i7.u23.turn_4>=1)))||((i3.u6.askForSection_2>=1)&&(i3.u6.turn_0>=1)))||((i3.u6.askForSection_2>=1)&&(i3.u6.turn_1>=1)))||((i6.u5.askForSection_0>=1)&&(i3.u6.turn_0>=1)))||((i3.u6.askForSection_2>=1)&&(i3.u6.turn_2>=1)))||((i6.u5.askForSection_0>=1)&&(i3.u6.turn_1>=1)))||((i6.u5.askForSection_0>=1)&&(i3.u6.turn_2>=1)))||((i5.i0.u3.askForSection_4>=1)&&(i3.u6.turn_0>=1)))||((i5.i0.u3.askForSection_4>=1)&&(i3.u6.turn_1>=1)))||((i5.i0.u3.askForSection_4>=1)&&(i3.u6.turn_2>=1)))||((i9.i1.u4.askForSection_5>=1)&&(i7.u23.turn_5>=1)))||((i9.i1.u4.askForSection_5>=1)&&(i7.u23.turn_3>=1)))||((i9.i1.u4.askForSection_5>=1)&&(i7.u23.turn_4>=1)))||((i6.u21.askForSection_1>=1)&&(i7.u23.turn_5>=1)))||((i6.u21.askForSection_1>=1)&&(i7.u23.turn_3>=1)))||((i7.u23.askForSection_3>=1)&&(i7.u23.turn_5>=1)))||((i6.u21.askForSection_1>=1)&&(i7.u23.turn_4>=1)))) * ((((((((((((i4.u37.isEndLoop_7>=1)||(i4.u13.isEndLoop_6>=1))||(i8.u15.isEndLoop_9>=1))||(i8.u31.isEndLoop_10>=1))||(i5.i1.u18.isEndLoop_13>=1))||(i5.i0.u17.isEndLoop_12>=1))||(i9.i2.u20.isEndLoop_16>=1))||(i0.i1.u8.isEndLoop_1>=1))||(i0.i0.u7.isEndLoop_0>=1))||(i9.i0.u19.isEndLoop_15>=1))||(i2.u10.isEndLoop_3>=1))||(i1.u11.isEndLoop_4>=1))))
=> equivalent forward existential formula: [(FwdU((((((FwdU(Init,TRUE) * ((((((((((((i4.u37.isEndLoop_7>=1)||(i4.u13.isEndLoop_6>=1))||(i8.u15.isEndLoop_9>=1))||(i8.u31.isEndLoop_10>=1))||(i5.i1.u18.isEndLoop_13>=1))||(i5.i0.u17.isEndLoop_12>=1))||(i9.i2.u20.isEndLoop_16>=1))||(i0.i1.u8.isEndLoop_1>=1))||(i0.i0.u7.isEndLoop_0>=1))||(i9.i0.u19.isEndLoop_15>=1))||(i2.u10.isEndLoop_3>=1))||(i1.u11.isEndLoop_4>=1))) * (((((((((((((((((((i7.u23.askForSection_3>=1)&&(i7.u23.turn_3>=1))||((i7.u23.askForSection_3>=1)&&(i7.u23.turn_4>=1)))||((i3.u6.askForSection_2>=1)&&(i3.u6.turn_0>=1)))||((i3.u6.askForSection_2>=1)&&(i3.u6.turn_1>=1)))||((i6.u5.askForSection_0>=1)&&(i3.u6.turn_0>=1)))||((i3.u6.askForSection_2>=1)&&(i3.u6.turn_2>=1)))||((i6.u5.askForSection_0>=1)&&(i3.u6.turn_1>=1)))||((i6.u5.askForSection_0>=1)&&(i3.u6.turn_2>=1)))||((i5.i0.u3.askForSection_4>=1)&&(i3.u6.turn_0>=1)))||((i5.i0.u3.askForSection_4>=1)&&(i3.u6.turn_1>=1)))||((i5.i0.u3.askForSection_4>=1)&&(i3.u6.turn_2>=1)))||((i9.i1.u4.askForSection_5>=1)&&(i7.u23.turn_5>=1)))||((i9.i1.u4.askForSection_5>=1)&&(i7.u23.turn_3>=1)))||((i9.i1.u4.askForSection_5>=1)&&(i7.u23.turn_4>=1)))||((i6.u21.askForSection_1>=1)&&(i7.u23.turn_5>=1)))||((i6.u21.askForSection_1>=1)&&(i7.u23.turn_3>=1)))||((i7.u23.askForSection_3>=1)&&(i7.u23.turn_5>=1)))||((i6.u21.askForSection_1>=1)&&(i7.u23.turn_4>=1)))) * ((((((((((((((((((i1.u11.beginLoop_5>=1)||(i3.u12.beginLoop_6>=1))||(i4.u13.beginLoop_7>=1))||(i4.u37.beginLoop_8>=1))||(i7.u30.beginLoop_9>=1))||(i8.u15.beginLoop_10>=1))||(i5.i0.u16.beginLoop_12>=1))||(i8.u32.beginLoop_11>=1))||(i5.i1.u18.beginLoop_14>=1))||(i5.i0.u17.beginLoop_13>=1))||(i9.i0.u19.beginLoop_16>=1))||(i9.i1.u34.beginLoop_15>=1))||(i9.i2.u20.beginLoop_17>=1))||(i0.i0.u25.beginLoop_0>=1))||(i0.i0.u7.beginLoop_1>=1))||(i0.i1.u8.beginLoop_2>=1))||(i2.u9.beginLoop_3>=1))||(i2.u10.beginLoop_4>=1))) * ((((i1.u0.idle_1>=1)&&(i1.u0.wantSection_2>=1))||((i5.i0.u2.idle_0>=1)&&(i5.i0.u2.wantSection_0>=1)))||((i6.u1.idle_2>=1)&&(i6.u1.wantSection_4>=1)))) * (((((((((((((i1.u0.wantSection_2>=1)&&(i9.i0.u35.testAlone_16>=1))||((i6.u1.wantSection_4>=1)&&(i8.u32.testAlone_11>=1)))||((i1.u0.wantSection_2>=1)&&(i5.i0.u17.testAlone_13>=1)))||((i6.u1.wantSection_4>=1)&&(i0.i1.u27.testAlone_2>=1)))||((i1.u0.wantSection_2>=1)&&(i2.u28.testAlone_4>=1)))||((i6.u1.wantSection_4>=1)&&(i1.u29.testAlone_5>=1)))||((i6.u1.wantSection_4>=1)&&(i4.u14.testAlone_8>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i3.u12.testAlone_6>=1)))||((i1.u0.wantSection_2>=1)&&(i0.i0.u26.testAlone_1>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i7.u30.testAlone_9>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i5.i0.u16.testAlone_12>=1)))||((i5.i0.u2.wantSection_0>=1)&&(i9.i1.u34.testAlone_15>=1)))),(((((((((((((((((((i7.u23.askForSection_3>=1)&&(i7.u23.turn_3>=1))||((i7.u23.askForSection_3>=1)&&(i7.u23.turn_4>=1)))||((i3.u6.askForSection_2>=1)&&(i3.u6.turn_0>=1)))||((i3.u6.askForSection_2>=1)&&(i3.u6.turn_1>=1)))||((i6.u5.askForSection_0>=1)&&(i3.u6.turn_0>=1)))||((i3.u6.askForSection_2>=1)&&(i3.u6.turn_2>=1)))||((i6.u5.askForSection_0>=1)&&(i3.u6.turn_1>=1)))||((i6.u5.askForSection_0>=1)&&(i3.u6.turn_2>=1)))||((i5.i0.u3.askForSection_4>=1)&&(i3.u6.turn_0>=1)))||((i5.i0.u3.askForSection_4>=1)&&(i3.u6.turn_1>=1)))||((i5.i0.u3.askForSection_4>=1)&&(i3.u6.turn_2>=1)))||((i9.i1.u4.askForSection_5>=1)&&(i7.u23.turn_5>=1)))||((i9.i1.u4.askForSection_5>=1)&&(i7.u23.turn_3>=1)))||((i9.i1.u4.askForSection_5>=1)&&(i7.u23.turn_4>=1)))||((i6.u21.askForSection_1>=1)&&(i7.u23.turn_5>=1)))||((i6.u21.askForSection_1>=1)&&(i7.u23.turn_3>=1)))||((i7.u23.askForSection_3>=1)&&(i7.u23.turn_5>=1)))||((i6.u21.askForSection_1>=1)&&(i7.u23.turn_4>=1)))) * ((((i1.u0.idle_1>=1)&&(i1.u0.wantSection_2>=1))||((i5.i0.u2.idle_0>=1)&&(i5.i0.u2.wantSection_0>=1)))||((i6.u1.idle_2>=1)&&(i6.u1.wantSection_4>=1))))] != FALSE
(forward)formula 13,0,2.223,67892,1,0,120741,3323,3312,172476,515,15339,295321
FORMULA Peterson-COL-2-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EF(AG(((((((((((((((((((i1.u11.beginLoop_5>=1)||(i3.u12.beginLoop_6>=1))||(i4.u13.beginLoop_7>=1))||(i4.u37.beginLoop_8>=1))||(i7.u30.beginLoop_9>=1))||(i8.u15.beginLoop_10>=1))||(i5.i0.u16.beginLoop_12>=1))||(i8.u32.beginLoop_11>=1))||(i5.i1.u18.beginLoop_14>=1))||(i5.i0.u17.beginLoop_13>=1))||(i9.i0.u19.beginLoop_16>=1))||(i9.i1.u34.beginLoop_15>=1))||(i9.i2.u20.beginLoop_17>=1))||(i0.i0.u25.beginLoop_0>=1))||(i0.i0.u7.beginLoop_1>=1))||(i0.i1.u8.beginLoop_2>=1))||(i2.u9.beginLoop_3>=1))||(i2.u10.beginLoop_4>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((((((((((((((((((i1.u11.beginLoop_5>=1)||(i3.u12.beginLoop_6>=1))||(i4.u13.beginLoop_7>=1))||(i4.u37.beginLoop_8>=1))||(i7.u30.beginLoop_9>=1))||(i8.u15.beginLoop_10>=1))||(i5.i0.u16.beginLoop_12>=1))||(i8.u32.beginLoop_11>=1))||(i5.i1.u18.beginLoop_14>=1))||(i5.i0.u17.beginLoop_13>=1))||(i9.i0.u19.beginLoop_16>=1))||(i9.i1.u34.beginLoop_15>=1))||(i9.i2.u20.beginLoop_17>=1))||(i0.i0.u25.beginLoop_0>=1))||(i0.i0.u7.beginLoop_1>=1))||(i0.i1.u8.beginLoop_2>=1))||(i2.u9.beginLoop_3>=1))||(i2.u10.beginLoop_4>=1))))))] = FALSE
(forward)formula 14,1,2.22999,67892,1,0,120744,3323,3312,172486,515,15339,295809
FORMULA Peterson-COL-2-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1590019026750

--------------------
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-COL-2"
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-COL-2, 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-158961258000660"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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