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-158961258000715.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258000715
=====================================================================

--------------------
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-CTLCardinality-00
FORMULA_NAME Peterson-PT-3-CTLCardinality-01
FORMULA_NAME Peterson-PT-3-CTLCardinality-02
FORMULA_NAME Peterson-PT-3-CTLCardinality-03
FORMULA_NAME Peterson-PT-3-CTLCardinality-04
FORMULA_NAME Peterson-PT-3-CTLCardinality-05
FORMULA_NAME Peterson-PT-3-CTLCardinality-06
FORMULA_NAME Peterson-PT-3-CTLCardinality-07
FORMULA_NAME Peterson-PT-3-CTLCardinality-08
FORMULA_NAME Peterson-PT-3-CTLCardinality-09
FORMULA_NAME Peterson-PT-3-CTLCardinality-10
FORMULA_NAME Peterson-PT-3-CTLCardinality-11
FORMULA_NAME Peterson-PT-3-CTLCardinality-12
FORMULA_NAME Peterson-PT-3-CTLCardinality-13
FORMULA_NAME Peterson-PT-3-CTLCardinality-14
FORMULA_NAME Peterson-PT-3-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1590022968807

[2020-05-21 01:02:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -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:02:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 01:02:51] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2020-05-21 01:02:51] [INFO ] Transformed 244 places.
[2020-05-21 01:02:51] [INFO ] Transformed 332 transitions.
[2020-05-21 01:02:51] [INFO ] Parsed PT model containing 244 places and 332 transitions in 131 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 30 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 368 ms. (steps per millisecond=271 ) properties seen :[1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0]
[2020-05-21 01:02:51] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2020-05-21 01:02:51] [INFO ] Computed 15 place invariants in 17 ms
[2020-05-21 01:02:51] [INFO ] [Real]Absence check using 11 positive place invariants in 24 ms returned sat
[2020-05-21 01:02:51] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:02:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:52] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2020-05-21 01:02:52] [INFO ] State equation strengthened by 66 read => feed constraints.
[2020-05-21 01:02:52] [INFO ] [Real]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-05-21 01:02:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:02:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-05-21 01:02:52] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 27 ms returned sat
[2020-05-21 01:02:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:02:52] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2020-05-21 01:02:52] [INFO ] [Nat]Added 66 Read/Feed constraints in 56 ms returned sat
[2020-05-21 01:02:53] [INFO ] Deduced a trap composed of 23 places in 448 ms
[2020-05-21 01:02:53] [INFO ] Deduced a trap composed of 9 places in 317 ms
[2020-05-21 01:02:53] [INFO ] Deduced a trap composed of 11 places in 145 ms
[2020-05-21 01:02:53] [INFO ] Deduced a trap composed of 9 places in 218 ms
[2020-05-21 01:02:53] [INFO ] Deduced a trap composed of 60 places in 91 ms
[2020-05-21 01:02:54] [INFO ] Deduced a trap composed of 49 places in 118 ms
[2020-05-21 01:02:54] [INFO ] Deduced a trap composed of 27 places in 123 ms
[2020-05-21 01:02:54] [INFO ] Deduced a trap composed of 49 places in 66 ms
[2020-05-21 01:02:54] [INFO ] Deduced a trap composed of 31 places in 106 ms
[2020-05-21 01:02:54] [INFO ] Deduced a trap composed of 45 places in 98 ms
[2020-05-21 01:02:54] [INFO ] Deduced a trap composed of 45 places in 68 ms
[2020-05-21 01:02:54] [INFO ] Deduced a trap composed of 27 places in 99 ms
[2020-05-21 01:02:54] [INFO ] Deduced a trap composed of 44 places in 167 ms
[2020-05-21 01:02:55] [INFO ] Deduced a trap composed of 16 places in 102 ms
[2020-05-21 01:02:55] [INFO ] Deduced a trap composed of 9 places in 401 ms
[2020-05-21 01:02:55] [INFO ] Deduced a trap composed of 49 places in 76 ms
[2020-05-21 01:02:55] [INFO ] Deduced a trap composed of 27 places in 102 ms
[2020-05-21 01:02:55] [INFO ] Deduced a trap composed of 30 places in 159 ms
[2020-05-21 01:02:55] [INFO ] Deduced a trap composed of 17 places in 109 ms
[2020-05-21 01:02:56] [INFO ] Deduced a trap composed of 21 places in 97 ms
[2020-05-21 01:02:56] [INFO ] Deduced a trap composed of 13 places in 552 ms
[2020-05-21 01:02:56] [INFO ] Deduced a trap composed of 51 places in 64 ms
[2020-05-21 01:02:56] [INFO ] Deduced a trap composed of 56 places in 59 ms
[2020-05-21 01:02:56] [INFO ] Deduced a trap composed of 50 places in 52 ms
[2020-05-21 01:02:57] [INFO ] Deduced a trap composed of 48 places in 142 ms
[2020-05-21 01:02:57] [INFO ] Deduced a trap composed of 52 places in 90 ms
[2020-05-21 01:02:57] [INFO ] Deduced a trap composed of 52 places in 212 ms
[2020-05-21 01:02:57] [INFO ] Deduced a trap composed of 34 places in 93 ms
[2020-05-21 01:02:57] [INFO ] Deduced a trap composed of 56 places in 266 ms
[2020-05-21 01:02:58] [INFO ] Deduced a trap composed of 16 places in 352 ms
[2020-05-21 01:02:59] [INFO ] Deduced a trap composed of 54 places in 730 ms
[2020-05-21 01:02:59] [INFO ] Deduced a trap composed of 38 places in 121 ms
[2020-05-21 01:02:59] [INFO ] Deduced a trap composed of 56 places in 169 ms
[2020-05-21 01:02:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 33 trap constraints in 7420 ms
[2020-05-21 01:03:00] [INFO ] [Real]Absence check using 11 positive place invariants in 39 ms returned sat
[2020-05-21 01:03:00] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 8 ms returned sat
[2020-05-21 01:03:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:00] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2020-05-21 01:03:00] [INFO ] [Real]Added 66 Read/Feed constraints in 36 ms returned sat
[2020-05-21 01:03:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 59 ms returned sat
[2020-05-21 01:03:00] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 13 ms returned sat
[2020-05-21 01:03:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:01] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2020-05-21 01:03:01] [INFO ] [Nat]Added 66 Read/Feed constraints in 24 ms returned sat
[2020-05-21 01:03:01] [INFO ] Deduced a trap composed of 35 places in 130 ms
[2020-05-21 01:03:01] [INFO ] Deduced a trap composed of 27 places in 111 ms
[2020-05-21 01:03:01] [INFO ] Deduced a trap composed of 34 places in 120 ms
[2020-05-21 01:03:01] [INFO ] Deduced a trap composed of 13 places in 271 ms
[2020-05-21 01:03:01] [INFO ] Deduced a trap composed of 34 places in 134 ms
[2020-05-21 01:03:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 894 ms
[2020-05-21 01:03:01] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-05-21 01:03:02] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:03:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:02] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2020-05-21 01:03:02] [INFO ] [Real]Added 66 Read/Feed constraints in 16 ms returned sat
[2020-05-21 01:03:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-21 01:03:02] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:03:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:02] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2020-05-21 01:03:02] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-05-21 01:03:02] [INFO ] Deduced a trap composed of 9 places in 140 ms
[2020-05-21 01:03:02] [INFO ] Deduced a trap composed of 9 places in 86 ms
[2020-05-21 01:03:02] [INFO ] Deduced a trap composed of 9 places in 103 ms
[2020-05-21 01:03:03] [INFO ] Deduced a trap composed of 27 places in 84 ms
[2020-05-21 01:03:03] [INFO ] Deduced a trap composed of 35 places in 78 ms
[2020-05-21 01:03:03] [INFO ] Deduced a trap composed of 34 places in 81 ms
[2020-05-21 01:03:03] [INFO ] Deduced a trap composed of 26 places in 93 ms
[2020-05-21 01:03:03] [INFO ] Deduced a trap composed of 26 places in 85 ms
[2020-05-21 01:03:03] [INFO ] Deduced a trap composed of 16 places in 103 ms
[2020-05-21 01:03:03] [INFO ] Deduced a trap composed of 13 places in 102 ms
[2020-05-21 01:03:03] [INFO ] Deduced a trap composed of 13 places in 106 ms
[2020-05-21 01:03:03] [INFO ] Deduced a trap composed of 16 places in 102 ms
[2020-05-21 01:03:04] [INFO ] Deduced a trap composed of 49 places in 120 ms
[2020-05-21 01:03:04] [INFO ] Deduced a trap composed of 31 places in 112 ms
[2020-05-21 01:03:04] [INFO ] Deduced a trap composed of 31 places in 87 ms
[2020-05-21 01:03:04] [INFO ] Deduced a trap composed of 35 places in 112 ms
[2020-05-21 01:03:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 2111 ms
[2020-05-21 01:03:04] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned unsat
[2020-05-21 01:03:04] [INFO ] [Real]Absence check using 11 positive place invariants in 21 ms returned sat
[2020-05-21 01:03:04] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:03:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:05] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2020-05-21 01:03:05] [INFO ] [Real]Added 66 Read/Feed constraints in 37 ms returned sat
[2020-05-21 01:03:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 27 ms returned sat
[2020-05-21 01:03:05] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 19 ms returned sat
[2020-05-21 01:03:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:05] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2020-05-21 01:03:05] [INFO ] [Nat]Added 66 Read/Feed constraints in 33 ms returned sat
[2020-05-21 01:03:05] [INFO ] Deduced a trap composed of 9 places in 138 ms
[2020-05-21 01:03:05] [INFO ] Deduced a trap composed of 16 places in 116 ms
[2020-05-21 01:03:05] [INFO ] Deduced a trap composed of 31 places in 105 ms
[2020-05-21 01:03:05] [INFO ] Deduced a trap composed of 16 places in 123 ms
[2020-05-21 01:03:06] [INFO ] Deduced a trap composed of 9 places in 116 ms
[2020-05-21 01:03:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 668 ms
[2020-05-21 01:03:06] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned unsat
[2020-05-21 01:03:06] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-21 01:03:06] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:03:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:06] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2020-05-21 01:03:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-21 01:03:06] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-21 01:03:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:06] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2020-05-21 01:03:06] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2020-05-21 01:03:06] [INFO ] Deduced a trap composed of 9 places in 73 ms
[2020-05-21 01:03:06] [INFO ] Deduced a trap composed of 9 places in 65 ms
[2020-05-21 01:03:07] [INFO ] Deduced a trap composed of 12 places in 68 ms
[2020-05-21 01:03:07] [INFO ] Deduced a trap composed of 9 places in 91 ms
[2020-05-21 01:03:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 360 ms
[2020-05-21 01:03:07] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 22 ms.
[2020-05-21 01:03:08] [INFO ] Added : 304 causal constraints over 61 iterations in 1646 ms. Result :sat
[2020-05-21 01:03:09] [INFO ] Deduced a trap composed of 29 places in 149 ms
[2020-05-21 01:03:09] [INFO ] Deduced a trap composed of 26 places in 175 ms
[2020-05-21 01:03:09] [INFO ] Deduced a trap composed of 26 places in 151 ms
[2020-05-21 01:03:09] [INFO ] Deduced a trap composed of 44 places in 119 ms
[2020-05-21 01:03:09] [INFO ] Deduced a trap composed of 49 places in 120 ms
[2020-05-21 01:03:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 877 ms
[2020-05-21 01:03:09] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned unsat
[2020-05-21 01:03:09] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-05-21 01:03:09] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-21 01:03:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:10] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2020-05-21 01:03:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 39 ms returned sat
[2020-05-21 01:03:10] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 14 ms returned sat
[2020-05-21 01:03:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:10] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2020-05-21 01:03:10] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-05-21 01:03:10] [INFO ] Deduced a trap composed of 79 places in 100 ms
[2020-05-21 01:03:10] [INFO ] Deduced a trap composed of 52 places in 112 ms
[2020-05-21 01:03:11] [INFO ] Deduced a trap composed of 13 places in 493 ms
[2020-05-21 01:03:11] [INFO ] Deduced a trap composed of 31 places in 64 ms
[2020-05-21 01:03:11] [INFO ] Deduced a trap composed of 49 places in 91 ms
[2020-05-21 01:03:11] [INFO ] Deduced a trap composed of 34 places in 89 ms
[2020-05-21 01:03:11] [INFO ] Deduced a trap composed of 38 places in 88 ms
[2020-05-21 01:03:11] [INFO ] Deduced a trap composed of 23 places in 87 ms
[2020-05-21 01:03:11] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1262 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 1420 ms. Result :sat
[2020-05-21 01:03:13] [INFO ] Deduced a trap composed of 9 places in 101 ms
[2020-05-21 01:03:13] [INFO ] Deduced a trap composed of 16 places in 93 ms
[2020-05-21 01:03:13] [INFO ] Deduced a trap composed of 9 places in 114 ms
[2020-05-21 01:03:13] [INFO ] Deduced a trap composed of 16 places in 100 ms
[2020-05-21 01:03:13] [INFO ] Deduced a trap composed of 11 places in 99 ms
[2020-05-21 01:03:13] [INFO ] Deduced a trap composed of 56 places in 71 ms
[2020-05-21 01:03:14] [INFO ] Deduced a trap composed of 45 places in 99 ms
[2020-05-21 01:03:14] [INFO ] Deduced a trap composed of 61 places in 74 ms
[2020-05-21 01:03:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1010 ms
[2020-05-21 01:03:14] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned unsat
[2020-05-21 01:03:14] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned unsat
[2020-05-21 01:03:14] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-05-21 01:03:14] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-21 01:03:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:14] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2020-05-21 01:03:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 29 ms returned sat
[2020-05-21 01:03:14] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:03:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:14] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2020-05-21 01:03:14] [INFO ] [Nat]Added 66 Read/Feed constraints in 22 ms returned sat
[2020-05-21 01:03:14] [INFO ] Deduced a trap composed of 9 places in 118 ms
[2020-05-21 01:03:15] [INFO ] Deduced a trap composed of 35 places in 109 ms
[2020-05-21 01:03:15] [INFO ] Deduced a trap composed of 18 places in 101 ms
[2020-05-21 01:03:15] [INFO ] Deduced a trap composed of 61 places in 118 ms
[2020-05-21 01:03:15] [INFO ] Deduced a trap composed of 31 places in 92 ms
[2020-05-21 01:03:15] [INFO ] Deduced a trap composed of 34 places in 90 ms
[2020-05-21 01:03:15] [INFO ] Deduced a trap composed of 12 places in 88 ms
[2020-05-21 01:03:15] [INFO ] Deduced a trap composed of 9 places in 156 ms
[2020-05-21 01:03:15] [INFO ] Deduced a trap composed of 13 places in 156 ms
[2020-05-21 01:03:16] [INFO ] Deduced a trap composed of 79 places in 120 ms
[2020-05-21 01:03:16] [INFO ] Deduced a trap composed of 52 places in 103 ms
[2020-05-21 01:03:16] [INFO ] Deduced a trap composed of 34 places in 53 ms
[2020-05-21 01:03:16] [INFO ] Deduced a trap composed of 49 places in 71 ms
[2020-05-21 01:03:16] [INFO ] Deduced a trap composed of 50 places in 86 ms
[2020-05-21 01:03:16] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1666 ms
[2020-05-21 01:03:16] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 22 ms.
[2020-05-21 01:03:17] [INFO ] Added : 304 causal constraints over 61 iterations in 1385 ms. Result :sat
[2020-05-21 01:03:17] [INFO ] Deduced a trap composed of 48 places in 86 ms
[2020-05-21 01:03:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2020-05-21 01:03:18] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned unsat
[2020-05-21 01:03:18] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-05-21 01:03:18] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-21 01:03:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:18] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2020-05-21 01:03:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:03:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-21 01:03:18] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-21 01:03:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:03:18] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2020-05-21 01:03:18] [INFO ] [Nat]Added 66 Read/Feed constraints in 19 ms returned sat
[2020-05-21 01:03:18] [INFO ] Deduced a trap composed of 74 places in 104 ms
[2020-05-21 01:03:18] [INFO ] Deduced a trap composed of 31 places in 88 ms
[2020-05-21 01:03:19] [INFO ] Deduced a trap composed of 31 places in 94 ms
[2020-05-21 01:03:19] [INFO ] Deduced a trap composed of 38 places in 51 ms
[2020-05-21 01:03:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 409 ms
[2020-05-21 01:03:19] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 15 ms.
[2020-05-21 01:03:20] [INFO ] Added : 292 causal constraints over 59 iterations in 1302 ms. Result :sat
[2020-05-21 01:03:20] [INFO ] Deduced a trap composed of 9 places in 129 ms
[2020-05-21 01:03:20] [INFO ] Deduced a trap composed of 9 places in 171 ms
[2020-05-21 01:03:20] [INFO ] Deduced a trap composed of 16 places in 114 ms
[2020-05-21 01:03:21] [INFO ] Deduced a trap composed of 37 places in 80 ms
[2020-05-21 01:03:21] [INFO ] Deduced a trap composed of 27 places in 85 ms
[2020-05-21 01:03:21] [INFO ] Deduced a trap composed of 27 places in 99 ms
[2020-05-21 01:03:21] [INFO ] Deduced a trap composed of 17 places in 141 ms
[2020-05-21 01:03:21] [INFO ] Deduced a trap composed of 9 places in 135 ms
[2020-05-21 01:03:21] [INFO ] Deduced a trap composed of 38 places in 86 ms
[2020-05-21 01:03:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1391 ms
[2020-05-21 01:03:21] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned unsat
[2020-05-21 01:03:21] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned unsat
[2020-05-21 01:03:21] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned unsat
Successfully simplified 13 atomic propositions for a total of 14 simplifications.
[2020-05-21 01:03:22] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-05-21 01:03:22] [INFO ] Flatten gal took : 127 ms
[2020-05-21 01:03:22] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-05-21 01:03:22] [INFO ] Flatten gal took : 26 ms
FORMULA Peterson-PT-3-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 01:03:22] [INFO ] Applying decomposition
[2020-05-21 01:03:22] [INFO ] Flatten gal took : 19 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/graph7647221594753126219.txt, -o, /tmp/graph7647221594753126219.bin, -w, /tmp/graph7647221594753126219.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/graph7647221594753126219.bin, -l, -1, -v, -w, /tmp/graph7647221594753126219.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 01:03:22] [INFO ] Decomposing Gal with order
[2020-05-21 01:03:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 01:03:23] [INFO ] Removed a total of 193 redundant transitions.
[2020-05-21 01:03:23] [INFO ] Flatten gal took : 292 ms
[2020-05-21 01:03:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 36 ms.
[2020-05-21 01:03:23] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 24 ms
[2020-05-21 01:03:23] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 1 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/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl, --gen-order, FOLLOW], 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/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
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,21.6091,398748,2,68750,5,1.08226e+06,6,0,1321,1.77563e+06,0


Converting to forward existential form...Done !
original formula: AG(EX(((((((((((((((((((((((((((((((((((((gu7.TestAlone_1_0_0+gu7.TestAlone_3_2_0)+gu7.TestAlone_2_2_0)+gu7.TestAlone_1_2_0)+gu7.TestAlone_3_1_0)+gu7.TestAlone_2_1_0)+gu7.TestAlone_1_1_0)+gu7.TestAlone_3_0_0)+gu7.TestAlone_2_0_0)+gu7.TestAlone_0_0_2)+gu7.TestAlone_3_2_1)+gu7.TestAlone_3_0_2)+gu7.TestAlone_1_0_2)+gu7.TestAlone_1_1_2)+gu7.TestAlone_0_1_2)+gu7.TestAlone_0_2_2)+gu7.TestAlone_3_1_2)+gu7.TestAlone_2_0_1)+gu7.TestAlone_0_0_1)+gu7.TestAlone_0_1_1)+gu7.TestAlone_3_0_1)+gu7.TestAlone_3_1_1)+gu7.TestAlone_2_1_1)+gu7.TestAlone_2_2_1)+gu7.TestAlone_0_2_1)+gu7.TestAlone_0_2_3)+gu7.TestAlone_1_2_3)+gu7.TestAlone_2_2_3)+gu7.TestAlone_1_2_2)+gu7.TestAlone_3_2_2)+gu7.TestAlone_0_0_3)+gu7.TestAlone_1_0_3)+gu7.TestAlone_2_0_3)+gu7.TestAlone_0_1_3)+gu7.TestAlone_1_1_3)+gu7.TestAlone_2_1_3)<2)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((((((((((((((((((((((((((((((((((((gu7.TestAlone_1_0_0+gu7.TestAlone_3_2_0)+gu7.TestAlone_2_2_0)+gu7.TestAlone_1_2_0)+gu7.TestAlone_3_1_0)+gu7.TestAlone_2_1_0)+gu7.TestAlone_1_1_0)+gu7.TestAlone_3_0_0)+gu7.TestAlone_2_0_0)+gu7.TestAlone_0_0_2)+gu7.TestAlone_3_2_1)+gu7.TestAlone_3_0_2)+gu7.TestAlone_1_0_2)+gu7.TestAlone_1_1_2)+gu7.TestAlone_0_1_2)+gu7.TestAlone_0_2_2)+gu7.TestAlone_3_1_2)+gu7.TestAlone_2_0_1)+gu7.TestAlone_0_0_1)+gu7.TestAlone_0_1_1)+gu7.TestAlone_3_0_1)+gu7.TestAlone_3_1_1)+gu7.TestAlone_2_1_1)+gu7.TestAlone_2_2_1)+gu7.TestAlone_0_2_1)+gu7.TestAlone_0_2_3)+gu7.TestAlone_1_2_3)+gu7.TestAlone_2_2_3)+gu7.TestAlone_1_2_2)+gu7.TestAlone_3_2_2)+gu7.TestAlone_0_0_3)+gu7.TestAlone_1_0_3)+gu7.TestAlone_2_0_3)+gu7.TestAlone_0_1_3)+gu7.TestAlone_1_1_3)+gu7.TestAlone_2_1_3)<2))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions gi1.gi0.gu2.UpdateTurn_0_0_0, gi1.gi0.gu3.UpdateTurn_2_2_0, gi1.gi0.gu4.UpdateTurn_1_1_0, gi1.gi0.gu9.UpdateTurn_3_3_0, gi1.gi0.UpdateTurn_3_2_0, gi1.gi0.UpdateTurn_0_3_0, gi1.gi0.UpdateTurn_1_2_0, gi1.gi0.UpdateTurn_3_1_0, gi1.gi0.UpdateTurn_0_2_0, gi1.gi0.UpdateTurn_2_1_0, gi1.gi0.UpdateTurn_3_0_0, gi1.gi0.UpdateTurn_0_1_0, gi1.gi0.UpdateTurn_1_0_0, gi1.gi0.UpdateTurn_2_0_0, gi1.gi0.UpdateTurn_2_3_0, gi1.gi0.UpdateTurn_1_3_0, gi1.gi1.gu5.UpdateTurn_0_0_2, gi1.gi1.gu14.UpdateTurn_1_1_2, gi1.gi1.gu15.UpdateTurn_3_3_1, gi1.gi1.gu15.UpdateTurn_3_2_1, gi1.gi1.gu15.UpdateTurn_3_1_1, gi1.gi1.gu15.UpdateTurn_3_0_1, gi1.gi1.gu18.UpdateTurn_2_2_2, gi1.gi1.UpdateTurn_1_2_2, gi1.gi1.UpdateTurn_2_1_2, gi1.gi1.UpdateTurn_0_2_2, gi1.gi1.UpdateTurn_1_0_2, gi1.gi1.UpdateTurn_2_0_2, gi1.gi1.UpdateTurn_0_1_2, gi1.gi1.UpdateTurn_2_2_1, gi1.gi1.UpdateTurn_2_0_1, gi1.gi1.UpdateTurn_0_1_1, gi1.gi1.UpdateTurn_0_0_1, BecomeIdle_0, UpdateTurn_2_3_2, UpdateTurn_3_3_2, BecomeIdle_1, BecomeIdle_2, BecomeIdle_3, EndLoop_3_1, EndLoop_1_1, EndLoop_2_1, EndLoop_3_0, EndLoop_0_1, EndLoop_1_0, EndLoop_2_0, EndLoop_0_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_1_2_2, NotAlone_3_2_2, UpdateTurn_3_1_2, UpdateTurn_3_0_2, UpdateTurn_1_1_1, UpdateTurn_1_0_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/246/75/321
(forward)formula 0,0,96.3106,1760428,1,0,632,1.03225e+07,658,326,7246,6.52663e+06,649
FORMULA Peterson-PT-3-CTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(EF(((((((((((((((((((((((((((((((((((((gu7.TestAlone_1_0_0+gu7.TestAlone_3_2_0)+gu7.TestAlone_2_2_0)+gu7.TestAlone_1_2_0)+gu7.TestAlone_3_1_0)+gu7.TestAlone_2_1_0)+gu7.TestAlone_1_1_0)+gu7.TestAlone_3_0_0)+gu7.TestAlone_2_0_0)+gu7.TestAlone_0_0_2)+gu7.TestAlone_3_2_1)+gu7.TestAlone_3_0_2)+gu7.TestAlone_1_0_2)+gu7.TestAlone_1_1_2)+gu7.TestAlone_0_1_2)+gu7.TestAlone_0_2_2)+gu7.TestAlone_3_1_2)+gu7.TestAlone_2_0_1)+gu7.TestAlone_0_0_1)+gu7.TestAlone_0_1_1)+gu7.TestAlone_3_0_1)+gu7.TestAlone_3_1_1)+gu7.TestAlone_2_1_1)+gu7.TestAlone_2_2_1)+gu7.TestAlone_0_2_1)+gu7.TestAlone_0_2_3)+gu7.TestAlone_1_2_3)+gu7.TestAlone_2_2_3)+gu7.TestAlone_1_2_2)+gu7.TestAlone_3_2_2)+gu7.TestAlone_0_0_3)+gu7.TestAlone_1_0_3)+gu7.TestAlone_2_0_3)+gu7.TestAlone_0_1_3)+gu7.TestAlone_1_1_3)+gu7.TestAlone_2_1_3)>=2)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * ((((((((((((((((((((((((((((((((((((gu7.TestAlone_1_0_0+gu7.TestAlone_3_2_0)+gu7.TestAlone_2_2_0)+gu7.TestAlone_1_2_0)+gu7.TestAlone_3_1_0)+gu7.TestAlone_2_1_0)+gu7.TestAlone_1_1_0)+gu7.TestAlone_3_0_0)+gu7.TestAlone_2_0_0)+gu7.TestAlone_0_0_2)+gu7.TestAlone_3_2_1)+gu7.TestAlone_3_0_2)+gu7.TestAlone_1_0_2)+gu7.TestAlone_1_1_2)+gu7.TestAlone_0_1_2)+gu7.TestAlone_0_2_2)+gu7.TestAlone_3_1_2)+gu7.TestAlone_2_0_1)+gu7.TestAlone_0_0_1)+gu7.TestAlone_0_1_1)+gu7.TestAlone_3_0_1)+gu7.TestAlone_3_1_1)+gu7.TestAlone_2_1_1)+gu7.TestAlone_2_2_1)+gu7.TestAlone_0_2_1)+gu7.TestAlone_0_2_3)+gu7.TestAlone_1_2_3)+gu7.TestAlone_2_2_3)+gu7.TestAlone_1_2_2)+gu7.TestAlone_3_2_2)+gu7.TestAlone_0_0_3)+gu7.TestAlone_1_0_3)+gu7.TestAlone_2_0_3)+gu7.TestAlone_0_1_3)+gu7.TestAlone_1_1_3)+gu7.TestAlone_2_1_3)>=2))] != FALSE
(forward)formula 1,1,112.998,2105400,1,0,635,1.10571e+07,660,327,8222,8.26475e+06,653
FORMULA Peterson-PT-3-CTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(AG(((((gu17.CS_3+gu17.CS_1)+gu17.CS_2)+gu17.CS_0)<=(((((((((((((((((((((((((((((((((((((((((((((((gu17.BeginLoop_0_0_0+gu17.BeginLoop_1_1_0)+gu17.BeginLoop_2_1_0)+gu17.BeginLoop_3_1_0)+gu17.BeginLoop_0_2_0)+gu17.BeginLoop_1_0_0)+gu17.BeginLoop_2_0_0)+gu17.BeginLoop_3_0_0)+gu17.BeginLoop_0_1_0)+gu17.BeginLoop_1_0_1)+gu17.BeginLoop_2_0_1)+gu17.BeginLoop_3_0_1)+gu17.BeginLoop_0_1_1)+gu17.BeginLoop_1_2_0)+gu17.BeginLoop_2_2_0)+gu17.BeginLoop_3_2_0)+gu17.BeginLoop_0_0_1)+gu17.BeginLoop_2_2_1)+gu17.BeginLoop_1_2_1)+gu17.BeginLoop_0_0_2)+gu17.BeginLoop_3_2_1)+gu17.BeginLoop_2_1_1)+gu17.BeginLoop_1_1_1)+gu17.BeginLoop_0_2_1)+gu17.BeginLoop_3_1_1)+gu17.BeginLoop_2_1_2)+gu17.BeginLoop_1_1_2)+gu17.BeginLoop_0_2_2)+gu17.BeginLoop_3_1_2)+gu17.BeginLoop_2_0_2)+gu17.BeginLoop_1_0_2)+gu17.BeginLoop_0_1_2)+gu17.BeginLoop_3_0_2)+gu17.BeginLoop_3_0_3)+gu17.BeginLoop_0_1_3)+gu17.BeginLoop_1_0_3)+gu17.BeginLoop_2_0_3)+gu17.BeginLoop_3_2_2)+gu17.BeginLoop_0_0_3)+gu17.BeginLoop_1_2_2)+gu17.BeginLoop_2_2_2)+gu17.BeginLoop_3_2_3)+gu17.BeginLoop_1_2_3)+gu17.BeginLoop_2_2_3)+gu17.BeginLoop_3_1_3)+gu17.BeginLoop_0_2_3)+gu17.BeginLoop_1_1_3)+gu17.BeginLoop_2_1_3))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((((gu17.CS_3+gu17.CS_1)+gu17.CS_2)+gu17.CS_0)<=(((((((((((((((((((((((((((((((((((((((((((((((gu17.BeginLoop_0_0_0+gu17.BeginLoop_1_1_0)+gu17.BeginLoop_2_1_0)+gu17.BeginLoop_3_1_0)+gu17.BeginLoop_0_2_0)+gu17.BeginLoop_1_0_0)+gu17.BeginLoop_2_0_0)+gu17.BeginLoop_3_0_0)+gu17.BeginLoop_0_1_0)+gu17.BeginLoop_1_0_1)+gu17.BeginLoop_2_0_1)+gu17.BeginLoop_3_0_1)+gu17.BeginLoop_0_1_1)+gu17.BeginLoop_1_2_0)+gu17.BeginLoop_2_2_0)+gu17.BeginLoop_3_2_0)+gu17.BeginLoop_0_0_1)+gu17.BeginLoop_2_2_1)+gu17.BeginLoop_1_2_1)+gu17.BeginLoop_0_0_2)+gu17.BeginLoop_3_2_1)+gu17.BeginLoop_2_1_1)+gu17.BeginLoop_1_1_1)+gu17.BeginLoop_0_2_1)+gu17.BeginLoop_3_1_1)+gu17.BeginLoop_2_1_2)+gu17.BeginLoop_1_1_2)+gu17.BeginLoop_0_2_2)+gu17.BeginLoop_3_1_2)+gu17.BeginLoop_2_0_2)+gu17.BeginLoop_1_0_2)+gu17.BeginLoop_0_1_2)+gu17.BeginLoop_3_0_2)+gu17.BeginLoop_3_0_3)+gu17.BeginLoop_0_1_3)+gu17.BeginLoop_1_0_3)+gu17.BeginLoop_2_0_3)+gu17.BeginLoop_3_2_2)+gu17.BeginLoop_0_0_3)+gu17.BeginLoop_1_2_2)+gu17.BeginLoop_2_2_2)+gu17.BeginLoop_3_2_3)+gu17.BeginLoop_1_2_3)+gu17.BeginLoop_2_2_3)+gu17.BeginLoop_3_1_3)+gu17.BeginLoop_0_2_3)+gu17.BeginLoop_1_1_3)+gu17.BeginLoop_2_1_3)))))))] = FALSE
(forward)formula 2,0,303.129,2711008,1,0,641,2.29916e+07,23,329,6788,8.56184e+06,18
FORMULA Peterson-PT-3-CTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(A(((((((((((((((((((((((((((((((((((((((((((((((((gu0.IsEndLoop_0_0_0+gu0.IsEndLoop_1_0_0)+gu0.IsEndLoop_2_0_0)+gu0.IsEndLoop_3_0_0)+gu0.IsEndLoop_0_1_0)+gu0.IsEndLoop_1_1_0)+gu0.IsEndLoop_2_1_0)+gu0.IsEndLoop_3_1_0)+gu0.IsEndLoop_0_2_0)+gu0.IsEndLoop_1_2_0)+gu0.IsEndLoop_2_2_0)+gu0.IsEndLoop_3_2_0)+gu0.IsEndLoop_0_0_1)+gu0.IsEndLoop_2_0_1)+gu0.IsEndLoop_1_0_1)+gu0.IsEndLoop_0_1_1)+gu0.IsEndLoop_3_0_1)+gu0.IsEndLoop_2_1_1)+gu0.IsEndLoop_1_1_1)+gu0.IsEndLoop_0_2_1)+gu0.IsEndLoop_3_1_1)+gu0.IsEndLoop_2_2_1)+gu0.IsEndLoop_1_2_1)+gu0.IsEndLoop_0_0_2)+gu0.IsEndLoop_3_2_1)+gu0.IsEndLoop_2_0_2)+gu0.IsEndLoop_1_0_2)+gu0.IsEndLoop_0_1_2)+gu0.IsEndLoop_3_0_2)+gu0.IsEndLoop_3_1_2)+gu0.IsEndLoop_0_2_2)+gu0.IsEndLoop_1_1_2)+gu0.IsEndLoop_2_1_2)+gu0.IsEndLoop_3_2_2)+gu0.IsEndLoop_0_0_3)+gu0.IsEndLoop_1_2_2)+gu0.IsEndLoop_2_2_2)+gu0.IsEndLoop_3_0_3)+gu0.IsEndLoop_0_1_3)+gu0.IsEndLoop_1_0_3)+gu0.IsEndLoop_2_0_3)+gu0.IsEndLoop_3_1_3)+gu0.IsEndLoop_0_2_3)+gu0.IsEndLoop_1_1_3)+gu0.IsEndLoop_2_1_3)+gu0.IsEndLoop_3_2_3)+gu0.IsEndLoop_2_2_3)+gu0.IsEndLoop_1_2_3)<=(((((((((((((((((((((((((((((((((((gu7.TestAlone_1_0_0+gu7.TestAlone_3_2_0)+gu7.TestAlone_2_2_0)+gu7.TestAlone_1_2_0)+gu7.TestAlone_3_1_0)+gu7.TestAlone_2_1_0)+gu7.TestAlone_1_1_0)+gu7.TestAlone_3_0_0)+gu7.TestAlone_2_0_0)+gu7.TestAlone_0_0_2)+gu7.TestAlone_3_2_1)+gu7.TestAlone_3_0_2)+gu7.TestAlone_1_0_2)+gu7.TestAlone_1_1_2)+gu7.TestAlone_0_1_2)+gu7.TestAlone_0_2_2)+gu7.TestAlone_3_1_2)+gu7.TestAlone_2_0_1)+gu7.TestAlone_0_0_1)+gu7.TestAlone_0_1_1)+gu7.TestAlone_3_0_1)+gu7.TestAlone_3_1_1)+gu7.TestAlone_2_1_1)+gu7.TestAlone_2_2_1)+gu7.TestAlone_0_2_1)+gu7.TestAlone_0_2_3)+gu7.TestAlone_1_2_3)+gu7.TestAlone_2_2_3)+gu7.TestAlone_1_2_2)+gu7.TestAlone_3_2_2)+gu7.TestAlone_0_0_3)+gu7.TestAlone_1_0_3)+gu7.TestAlone_2_0_3)+gu7.TestAlone_0_1_3)+gu7.TestAlone_1_1_3)+gu7.TestAlone_2_1_3)) U ((((((((((((((((((((((((((((((((((((((((((((((((gu11.TestIdentity_0_1_0+gu11.TestIdentity_3_0_0)+gu11.TestIdentity_2_0_0)+gu11.TestIdentity_1_0_0)+gu11.TestIdentity_0_2_0)+gu11.TestIdentity_3_1_0)+gu11.TestIdentity_2_1_0)+gu11.TestIdentity_1_1_0)+gu11.TestIdentity_0_0_0)+gu11.TestIdentity_3_1_1)+gu11.TestIdentity_0_2_1)+gu11.TestIdentity_1_1_1)+gu11.TestIdentity_2_1_1)+gu11.TestIdentity_3_2_1)+gu11.TestIdentity_0_0_2)+gu11.TestIdentity_1_2_1)+gu11.TestIdentity_2_2_1)+gu11.TestIdentity_3_2_0)+gu11.TestIdentity_0_0_1)+gu11.TestIdentity_1_2_0)+gu11.TestIdentity_2_2_0)+gu11.TestIdentity_3_0_1)+gu11.TestIdentity_0_1_1)+gu11.TestIdentity_1_0_1)+gu11.TestIdentity_2_0_1)+gu11.TestIdentity_2_0_3)+gu11.TestIdentity_1_0_3)+gu11.TestIdentity_0_1_3)+gu11.TestIdentity_3_0_3)+gu11.TestIdentity_2_2_2)+gu11.TestIdentity_1_2_2)+gu11.TestIdentity_0_0_3)+gu11.TestIdentity_3_2_2)+gu11.TestIdentity_2_1_2)+gu11.TestIdentity_1_1_2)+gu11.TestIdentity_0_2_2)+gu11.TestIdentity_3_1_2)+gu11.TestIdentity_2_0_2)+gu11.TestIdentity_1_0_2)+gu11.TestIdentity_0_1_2)+gu11.TestIdentity_3_0_2)+gu11.TestIdentity_1_2_3)+gu11.TestIdentity_2_2_3)+gu11.TestIdentity_3_2_3)+gu11.TestIdentity_1_1_3)+gu11.TestIdentity_2_1_3)+gu11.TestIdentity_3_1_3)+gu11.TestIdentity_0_2_3)<=(((((((((((((((((((((((((((((((((((gu7.TestAlone_1_0_0+gu7.TestAlone_3_2_0)+gu7.TestAlone_2_2_0)+gu7.TestAlone_1_2_0)+gu7.TestAlone_3_1_0)+gu7.TestAlone_2_1_0)+gu7.TestAlone_1_1_0)+gu7.TestAlone_3_0_0)+gu7.TestAlone_2_0_0)+gu7.TestAlone_0_0_2)+gu7.TestAlone_3_2_1)+gu7.TestAlone_3_0_2)+gu7.TestAlone_1_0_2)+gu7.TestAlone_1_1_2)+gu7.TestAlone_0_1_2)+gu7.TestAlone_0_2_2)+gu7.TestAlone_3_1_2)+gu7.TestAlone_2_0_1)+gu7.TestAlone_0_0_1)+gu7.TestAlone_0_1_1)+gu7.TestAlone_3_0_1)+gu7.TestAlone_3_1_1)+gu7.TestAlone_2_1_1)+gu7.TestAlone_2_2_1)+gu7.TestAlone_0_2_1)+gu7.TestAlone_0_2_3)+gu7.TestAlone_1_2_3)+gu7.TestAlone_2_2_3)+gu7.TestAlone_1_2_2)+gu7.TestAlone_3_2_2)+gu7.TestAlone_0_0_3)+gu7.TestAlone_1_0_3)+gu7.TestAlone_2_0_3)+gu7.TestAlone_0_1_3)+gu7.TestAlone_1_1_3)+gu7.TestAlone_2_1_3))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(((((((((((((((((((((((((((((((((((((((((((((((((gu11.TestIdentity_0_1_0+gu11.TestIdentity_3_0_0)+gu11.TestIdentity_2_0_0)+gu11.TestIdentity_1_0_0)+gu11.TestIdentity_0_2_0)+gu11.TestIdentity_3_1_0)+gu11.TestIdentity_2_1_0)+gu11.TestIdentity_1_1_0)+gu11.TestIdentity_0_0_0)+gu11.TestIdentity_3_1_1)+gu11.TestIdentity_0_2_1)+gu11.TestIdentity_1_1_1)+gu11.TestIdentity_2_1_1)+gu11.TestIdentity_3_2_1)+gu11.TestIdentity_0_0_2)+gu11.TestIdentity_1_2_1)+gu11.TestIdentity_2_2_1)+gu11.TestIdentity_3_2_0)+gu11.TestIdentity_0_0_1)+gu11.TestIdentity_1_2_0)+gu11.TestIdentity_2_2_0)+gu11.TestIdentity_3_0_1)+gu11.TestIdentity_0_1_1)+gu11.TestIdentity_1_0_1)+gu11.TestIdentity_2_0_1)+gu11.TestIdentity_2_0_3)+gu11.TestIdentity_1_0_3)+gu11.TestIdentity_0_1_3)+gu11.TestIdentity_3_0_3)+gu11.TestIdentity_2_2_2)+gu11.TestIdentity_1_2_2)+gu11.TestIdentity_0_0_3)+gu11.TestIdentity_3_2_2)+gu11.TestIdentity_2_1_2)+gu11.TestIdentity_1_1_2)+gu11.TestIdentity_0_2_2)+gu11.TestIdentity_3_1_2)+gu11.TestIdentity_2_0_2)+gu11.TestIdentity_1_0_2)+gu11.TestIdentity_0_1_2)+gu11.TestIdentity_3_0_2)+gu11.TestIdentity_1_2_3)+gu11.TestIdentity_2_2_3)+gu11.TestIdentity_3_2_3)+gu11.TestIdentity_1_1_3)+gu11.TestIdentity_2_1_3)+gu11.TestIdentity_3_1_3)+gu11.TestIdentity_0_2_3)<=(((((((((((((((((((((((((((((((((((gu7.TestAlone_1_0_0+gu7.TestAlone_3_2_0)+gu7.TestAlone_2_2_0)+gu7.TestAlone_1_2_0)+gu7.TestAlone_3_1_0)+gu7.TestAlone_2_1_0)+gu7.TestAlone_1_1_0)+gu7.TestAlone_3_0_0)+gu7.TestAlone_2_0_0)+gu7.TestAlone_0_0_2)+gu7.TestAlone_3_2_1)+gu7.TestAlone_3_0_2)+gu7.TestAlone_1_0_2)+gu7.TestAlone_1_1_2)+gu7.TestAlone_0_1_2)+gu7.TestAlone_0_2_2)+gu7.TestAlone_3_1_2)+gu7.TestAlone_2_0_1)+gu7.TestAlone_0_0_1)+gu7.TestAlone_0_1_1)+gu7.TestAlone_3_0_1)+gu7.TestAlone_3_1_1)+gu7.TestAlone_2_1_1)+gu7.TestAlone_2_2_1)+gu7.TestAlone_0_2_1)+gu7.TestAlone_0_2_3)+gu7.TestAlone_1_2_3)+gu7.TestAlone_2_2_3)+gu7.TestAlone_1_2_2)+gu7.TestAlone_3_2_2)+gu7.TestAlone_0_0_3)+gu7.TestAlone_1_0_3)+gu7.TestAlone_2_0_3)+gu7.TestAlone_0_1_3)+gu7.TestAlone_1_1_3)+gu7.TestAlone_2_1_3))) U (!(((((((((((((((((((((((((((((((((((((((((((((((((gu0.IsEndLoop_0_0_0+gu0.IsEndLoop_1_0_0)+gu0.IsEndLoop_2_0_0)+gu0.IsEndLoop_3_0_0)+gu0.IsEndLoop_0_1_0)+gu0.IsEndLoop_1_1_0)+gu0.IsEndLoop_2_1_0)+gu0.IsEndLoop_3_1_0)+gu0.IsEndLoop_0_2_0)+gu0.IsEndLoop_1_2_0)+gu0.IsEndLoop_2_2_0)+gu0.IsEndLoop_3_2_0)+gu0.IsEndLoop_0_0_1)+gu0.IsEndLoop_2_0_1)+gu0.IsEndLoop_1_0_1)+gu0.IsEndLoop_0_1_1)+gu0.IsEndLoop_3_0_1)+gu0.IsEndLoop_2_1_1)+gu0.IsEndLoop_1_1_1)+gu0.IsEndLoop_0_2_1)+gu0.IsEndLoop_3_1_1)+gu0.IsEndLoop_2_2_1)+gu0.IsEndLoop_1_2_1)+gu0.IsEndLoop_0_0_2)+gu0.IsEndLoop_3_2_1)+gu0.IsEndLoop_2_0_2)+gu0.IsEndLoop_1_0_2)+gu0.IsEndLoop_0_1_2)+gu0.IsEndLoop_3_0_2)+gu0.IsEndLoop_3_1_2)+gu0.IsEndLoop_0_2_2)+gu0.IsEndLoop_1_1_2)+gu0.IsEndLoop_2_1_2)+gu0.IsEndLoop_3_2_2)+gu0.IsEndLoop_0_0_3)+gu0.IsEndLoop_1_2_2)+gu0.IsEndLoop_2_2_2)+gu0.IsEndLoop_3_0_3)+gu0.IsEndLoop_0_1_3)+gu0.IsEndLoop_1_0_3)+gu0.IsEndLoop_2_0_3)+gu0.IsEndLoop_3_1_3)+gu0.IsEndLoop_0_2_3)+gu0.IsEndLoop_1_1_3)+gu0.IsEndLoop_2_1_3)+gu0.IsEndLoop_3_2_3)+gu0.IsEndLoop_2_2_3)+gu0.IsEndLoop_1_2_3)<=(((((((((((((((((((((((((((((((((((gu7.TestAlone_1_0_0+gu7.TestAlone_3_2_0)+gu7.TestAlone_2_2_0)+gu7.TestAlone_1_2_0)+gu7.TestAlone_3_1_0)+gu7.TestAlone_2_1_0)+gu7.TestAlone_1_1_0)+gu7.TestAlone_3_0_0)+gu7.TestAlone_2_0_0)+gu7.TestAlone_0_0_2)+gu7.TestAlone_3_2_1)+gu7.TestAlone_3_0_2)+gu7.TestAlone_1_0_2)+gu7.TestAlone_1_1_2)+gu7.TestAlone_0_1_2)+gu7.TestAlone_0_2_2)+gu7.TestAlone_3_1_2)+gu7.TestAlone_2_0_1)+gu7.TestAlone_0_0_1)+gu7.TestAlone_0_1_1)+gu7.TestAlone_3_0_1)+gu7.TestAlone_3_1_1)+gu7.TestAlone_2_1_1)+gu7.TestAlone_2_2_1)+gu7.TestAlone_0_2_1)+gu7.TestAlone_0_2_3)+gu7.TestAlone_1_2_3)+gu7.TestAlone_2_2_3)+gu7.TestAlone_1_2_2)+gu7.TestAlone_3_2_2)+gu7.TestAlone_0_0_3)+gu7.TestAlone_1_0_3)+gu7.TestAlone_2_0_3)+gu7.TestAlone_0_1_3)+gu7.TestAlone_1_1_3)+gu7.TestAlone_2_1_3))) * !(((((((((((((((((((((((((((((((((((((((((((((((((gu11.TestIdentity_0_1_0+gu11.TestIdentity_3_0_0)+gu11.TestIdentity_2_0_0)+gu11.TestIdentity_1_0_0)+gu11.TestIdentity_0_2_0)+gu11.TestIdentity_3_1_0)+gu11.TestIdentity_2_1_0)+gu11.TestIdentity_1_1_0)+gu11.TestIdentity_0_0_0)+gu11.TestIdentity_3_1_1)+gu11.TestIdentity_0_2_1)+gu11.TestIdentity_1_1_1)+gu11.TestIdentity_2_1_1)+gu11.TestIdentity_3_2_1)+gu11.TestIdentity_0_0_2)+gu11.TestIdentity_1_2_1)+gu11.TestIdentity_2_2_1)+gu11.TestIdentity_3_2_0)+gu11.TestIdentity_0_0_1)+gu11.TestIdentity_1_2_0)+gu11.TestIdentity_2_2_0)+gu11.TestIdentity_3_0_1)+gu11.TestIdentity_0_1_1)+gu11.TestIdentity_1_0_1)+gu11.TestIdentity_2_0_1)+gu11.TestIdentity_2_0_3)+gu11.TestIdentity_1_0_3)+gu11.TestIdentity_0_1_3)+gu11.TestIdentity_3_0_3)+gu11.TestIdentity_2_2_2)+gu11.TestIdentity_1_2_2)+gu11.TestIdentity_0_0_3)+gu11.TestIdentity_3_2_2)+gu11.TestIdentity_2_1_2)+gu11.TestIdentity_1_1_2)+gu11.TestIdentity_0_2_2)+gu11.TestIdentity_3_1_2)+gu11.TestIdentity_2_0_2)+gu11.TestIdentity_1_0_2)+gu11.TestIdentity_0_1_2)+gu11.TestIdentity_3_0_2)+gu11.TestIdentity_1_2_3)+gu11.TestIdentity_2_2_3)+gu11.TestIdentity_3_2_3)+gu11.TestIdentity_1_1_3)+gu11.TestIdentity_2_1_3)+gu11.TestIdentity_3_1_3)+gu11.TestIdentity_0_2_3)<=(((((((((((((((((((((((((((((((((((gu7.TestAlone_1_0_0+gu7.TestAlone_3_2_0)+gu7.TestAlone_2_2_0)+gu7.TestAlone_1_2_0)+gu7.TestAlone_3_1_0)+gu7.TestAlone_2_1_0)+gu7.TestAlone_1_1_0)+gu7.TestAlone_3_0_0)+gu7.TestAlone_2_0_0)+gu7.TestAlone_0_0_2)+gu7.TestAlone_3_2_1)+gu7.TestAlone_3_0_2)+gu7.TestAlone_1_0_2)+gu7.TestAlone_1_1_2)+gu7.TestAlone_0_1_2)+gu7.TestAlone_0_2_2)+gu7.TestAlone_3_1_2)+gu7.TestAlone_2_0_1)+gu7.TestAlone_0_0_1)+gu7.TestAlone_0_1_1)+gu7.TestAlone_3_0_1)+gu7.TestAlone_3_1_1)+gu7.TestAlone_2_1_1)+gu7.TestAlone_2_2_1)+gu7.TestAlone_0_2_1)+gu7.TestAlone_0_2_3)+gu7.TestAlone_1_2_3)+gu7.TestAlone_2_2_3)+gu7.TestAlone_1_2_2)+gu7.TestAlone_3_2_2)+gu7.TestAlone_0_0_3)+gu7.TestAlone_1_0_3)+gu7.TestAlone_2_0_3)+gu7.TestAlone_0_1_3)+gu7.TestAlone_1_1_3)+gu7.TestAlone_2_1_3))))) + EG(!(((((((((((((((((((((((((((((((((((((((((((((((((gu11.TestIdentity_0_1_0+gu11.TestIdentity_3_0_0)+gu11.TestIdentity_2_0_0)+gu11.TestIdentity_1_0_0)+gu11.TestIdentity_0_2_0)+gu11.TestIdentity_3_1_0)+gu11.TestIdentity_2_1_0)+gu11.TestIdentity_1_1_0)+gu11.TestIdentity_0_0_0)+gu11.TestIdentity_3_1_1)+gu11.TestIdentity_0_2_1)+gu11.TestIdentity_1_1_1)+gu11.TestIdentity_2_1_1)+gu11.TestIdentity_3_2_1)+gu11.TestIdentity_0_0_2)+gu11.TestIdentity_1_2_1)+gu11.TestIdentity_2_2_1)+gu11.TestIdentity_3_2_0)+gu11.TestIdentity_0_0_1)+gu11.TestIdentity_1_2_0)+gu11.TestIdentity_2_2_0)+gu11.TestIdentity_3_0_1)+gu11.TestIdentity_0_1_1)+gu11.TestIdentity_1_0_1)+gu11.TestIdentity_2_0_1)+gu11.TestIdentity_2_0_3)+gu11.TestIdentity_1_0_3)+gu11.TestIdentity_0_1_3)+gu11.TestIdentity_3_0_3)+gu11.TestIdentity_2_2_2)+gu11.TestIdentity_1_2_2)+gu11.TestIdentity_0_0_3)+gu11.TestIdentity_3_2_2)+gu11.TestIdentity_2_1_2)+gu11.TestIdentity_1_1_2)+gu11.TestIdentity_0_2_2)+gu11.TestIdentity_3_1_2)+gu11.TestIdentity_2_0_2)+gu11.TestIdentity_1_0_2)+gu11.TestIdentity_0_1_2)+gu11.TestIdentity_3_0_2)+gu11.TestIdentity_1_2_3)+gu11.TestIdentity_2_2_3)+gu11.TestIdentity_3_2_3)+gu11.TestIdentity_1_1_3)+gu11.TestIdentity_2_1_3)+gu11.TestIdentity_3_1_3)+gu11.TestIdentity_0_2_3)<=(((((((((((((((((((((((((((((((((((gu7.TestAlone_1_0_0+gu7.TestAlone_3_2_0)+gu7.TestAlone_2_2_0)+gu7.TestAlone_1_2_0)+gu7.TestAlone_3_1_0)+gu7.TestAlone_2_1_0)+gu7.TestAlone_1_1_0)+gu7.TestAlone_3_0_0)+gu7.TestAlone_2_0_0)+gu7.TestAlone_0_0_2)+gu7.TestAlone_3_2_1)+gu7.TestAlone_3_0_2)+gu7.TestAlone_1_0_2)+gu7.TestAlone_1_1_2)+gu7.TestAlone_0_1_2)+gu7.TestAlone_0_2_2)+gu7.TestAlone_3_1_2)+gu7.TestAlone_2_0_1)+gu7.TestAlone_0_0_1)+gu7.TestAlone_0_1_1)+gu7.TestAlone_3_0_1)+gu7.TestAlone_3_1_1)+gu7.TestAlone_2_1_1)+gu7.TestAlone_2_2_1)+gu7.TestAlone_0_2_1)+gu7.TestAlone_0_2_3)+gu7.TestAlone_1_2_3)+gu7.TestAlone_2_2_3)+gu7.TestAlone_1_2_2)+gu7.TestAlone_3_2_2)+gu7.TestAlone_0_0_3)+gu7.TestAlone_1_0_3)+gu7.TestAlone_2_0_3)+gu7.TestAlone_0_1_3)+gu7.TestAlone_1_1_3)+gu7.TestAlone_2_1_3)))))))] != FALSE
(forward)formula 3,1,641.637,3571788,1,0,641,3.10484e+07,20,329,8892,1.28926e+07,123
FORMULA Peterson-PT-3-CTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(EF(((gu0.IsEndLoop_1_2_1>gu0.IsEndLoop_2_1_1)&&(gu17.BeginLoop_2_1_2>gu17.Idle_3))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((gu0.IsEndLoop_1_2_1>gu0.IsEndLoop_2_1_1)&&(gu17.BeginLoop_2_1_2>gu17.Idle_3)))] = FALSE
(forward)formula 4,1,641.653,3571788,1,0,641,3.10484e+07,21,329,8903,1.28926e+07,123
FORMULA Peterson-PT-3-CTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(AG((gu0.Turn_2_3<=gu0.IsEndLoop_2_2_1)))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((gu0.Turn_2_3<=gu0.IsEndLoop_2_2_1)))))] != FALSE
(forward)formula 5,0,818.065,4068200,1,0,641,3.43426e+07,19,329,4374,1.43039e+07,61
FORMULA Peterson-PT-3-CTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(AG((gu0.TestTurn_1_1<=gu0.IsEndLoop_0_1_3)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((gu0.TestTurn_1_1<=gu0.IsEndLoop_0_1_3)))))] != FALSE
(forward)formula 6,0,955.572,4498368,1,0,641,3.83553e+07,14,329,4372,1.4524e+07,15
FORMULA Peterson-PT-3-CTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1590023961114

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="CTLCardinality"
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 CTLCardinality"
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-158961258000715"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;