fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r096-oct2-158940145400684
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for LamportFastMutEx-PT-7

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15780.460 3600000.00 3493758.00 208646.50 F??????????????? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r096-oct2-158940145400684.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 LamportFastMutEx-PT-7, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940145400684
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 9.3K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 30 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 30 13:04 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 13:04 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 6 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 255K Apr 30 13:04 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 LamportFastMutEx-PT-7-CTLFireability-00
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-01
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-02
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-03
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-04
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-05
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-06
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-07
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-08
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-09
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-10
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-11
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-12
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-13
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-14
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589594808370

[2020-05-16 02:06:55] [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-16 02:06:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 02:06:56] [INFO ] Load time of PNML (sax parser for PT used): 240 ms
[2020-05-16 02:06:56] [INFO ] Transformed 264 places.
[2020-05-16 02:06:56] [INFO ] Transformed 536 transitions.
[2020-05-16 02:06:56] [INFO ] Parsed PT model containing 264 places and 536 transitions in 429 ms.
Deduced a syphon composed of 45 places in 11 ms
Reduce places removed 45 places and 74 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 207 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 741 ms. (steps per millisecond=134 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
[2020-05-16 02:06:57] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2020-05-16 02:06:57] [INFO ] Computed 65 place invariants in 19 ms
[2020-05-16 02:06:58] [INFO ] [Real]Absence check using 65 positive place invariants in 378 ms returned sat
[2020-05-16 02:06:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 02:06:58] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2020-05-16 02:06:59] [INFO ] State equation strengthened by 105 read => feed constraints.
[2020-05-16 02:06:59] [INFO ] [Real]Added 105 Read/Feed constraints in 70 ms returned sat
[2020-05-16 02:06:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 02:06:59] [INFO ] [Nat]Absence check using 65 positive place invariants in 233 ms returned sat
[2020-05-16 02:06:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:00] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2020-05-16 02:07:00] [INFO ] [Nat]Added 105 Read/Feed constraints in 40 ms returned sat
[2020-05-16 02:07:00] [INFO ] Deduced a trap composed of 32 places in 171 ms
[2020-05-16 02:07:00] [INFO ] Deduced a trap composed of 28 places in 186 ms
[2020-05-16 02:07:00] [INFO ] Deduced a trap composed of 9 places in 147 ms
[2020-05-16 02:07:00] [INFO ] Deduced a trap composed of 26 places in 154 ms
[2020-05-16 02:07:00] [INFO ] Deduced a trap composed of 9 places in 74 ms
[2020-05-16 02:07:01] [INFO ] Deduced a trap composed of 19 places in 69 ms
[2020-05-16 02:07:01] [INFO ] Deduced a trap composed of 18 places in 384 ms
[2020-05-16 02:07:01] [INFO ] Deduced a trap composed of 22 places in 426 ms
[2020-05-16 02:07:02] [INFO ] Deduced a trap composed of 19 places in 404 ms
[2020-05-16 02:07:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 2176 ms
[2020-05-16 02:07:02] [INFO ] [Real]Absence check using 65 positive place invariants in 167 ms returned sat
[2020-05-16 02:07:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:02] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2020-05-16 02:07:02] [INFO ] [Real]Added 105 Read/Feed constraints in 19 ms returned sat
[2020-05-16 02:07:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 02:07:02] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2020-05-16 02:07:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:03] [INFO ] [Nat]Absence check using state equation in 437 ms returned sat
[2020-05-16 02:07:03] [INFO ] [Nat]Added 105 Read/Feed constraints in 38 ms returned sat
[2020-05-16 02:07:03] [INFO ] Deduced a trap composed of 28 places in 434 ms
[2020-05-16 02:07:03] [INFO ] Deduced a trap composed of 8 places in 231 ms
[2020-05-16 02:07:04] [INFO ] Deduced a trap composed of 19 places in 342 ms
[2020-05-16 02:07:05] [INFO ] Deduced a trap composed of 16 places in 827 ms
[2020-05-16 02:07:05] [INFO ] Deduced a trap composed of 25 places in 164 ms
[2020-05-16 02:07:05] [INFO ] Deduced a trap composed of 9 places in 143 ms
[2020-05-16 02:07:05] [INFO ] Deduced a trap composed of 9 places in 92 ms
[2020-05-16 02:07:05] [INFO ] Deduced a trap composed of 22 places in 228 ms
[2020-05-16 02:07:05] [INFO ] Deduced a trap composed of 32 places in 72 ms
[2020-05-16 02:07:06] [INFO ] Deduced a trap composed of 9 places in 103 ms
[2020-05-16 02:07:06] [INFO ] Deduced a trap composed of 15 places in 100 ms
[2020-05-16 02:07:06] [INFO ] Deduced a trap composed of 9 places in 89 ms
[2020-05-16 02:07:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 2975 ms
[2020-05-16 02:07:06] [INFO ] [Real]Absence check using 65 positive place invariants in 114 ms returned sat
[2020-05-16 02:07:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:06] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2020-05-16 02:07:06] [INFO ] [Real]Added 105 Read/Feed constraints in 17 ms returned sat
[2020-05-16 02:07:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 02:07:06] [INFO ] [Nat]Absence check using 65 positive place invariants in 35 ms returned sat
[2020-05-16 02:07:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:07] [INFO ] [Nat]Absence check using state equation in 659 ms returned sat
[2020-05-16 02:07:07] [INFO ] [Nat]Added 105 Read/Feed constraints in 11 ms returned sat
[2020-05-16 02:07:07] [INFO ] Deduced a trap composed of 15 places in 69 ms
[2020-05-16 02:07:07] [INFO ] Deduced a trap composed of 14 places in 68 ms
[2020-05-16 02:07:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 154 ms
[2020-05-16 02:07:07] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2020-05-16 02:07:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:07] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2020-05-16 02:07:07] [INFO ] [Real]Added 105 Read/Feed constraints in 29 ms returned sat
[2020-05-16 02:07:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 02:07:07] [INFO ] [Nat]Absence check using 65 positive place invariants in 23 ms returned sat
[2020-05-16 02:07:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:08] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2020-05-16 02:07:08] [INFO ] [Nat]Added 105 Read/Feed constraints in 36 ms returned sat
[2020-05-16 02:07:08] [INFO ] Deduced a trap composed of 20 places in 152 ms
[2020-05-16 02:07:08] [INFO ] Deduced a trap composed of 23 places in 362 ms
[2020-05-16 02:07:09] [INFO ] Deduced a trap composed of 20 places in 301 ms
[2020-05-16 02:07:09] [INFO ] Deduced a trap composed of 18 places in 413 ms
[2020-05-16 02:07:09] [INFO ] Deduced a trap composed of 9 places in 185 ms
[2020-05-16 02:07:09] [INFO ] Deduced a trap composed of 27 places in 82 ms
[2020-05-16 02:07:10] [INFO ] Deduced a trap composed of 9 places in 117 ms
[2020-05-16 02:07:10] [INFO ] Deduced a trap composed of 9 places in 372 ms
[2020-05-16 02:07:10] [INFO ] Deduced a trap composed of 14 places in 287 ms
[2020-05-16 02:07:10] [INFO ] Deduced a trap composed of 9 places in 158 ms
[2020-05-16 02:07:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 2580 ms
[2020-05-16 02:07:10] [INFO ] [Real]Absence check using 65 positive place invariants in 27 ms returned sat
[2020-05-16 02:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:11] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2020-05-16 02:07:11] [INFO ] [Real]Added 105 Read/Feed constraints in 61 ms returned sat
[2020-05-16 02:07:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 02:07:11] [INFO ] [Nat]Absence check using 65 positive place invariants in 132 ms returned sat
[2020-05-16 02:07:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:11] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2020-05-16 02:07:11] [INFO ] [Nat]Added 105 Read/Feed constraints in 32 ms returned sat
[2020-05-16 02:07:12] [INFO ] Deduced a trap composed of 8 places in 611 ms
[2020-05-16 02:07:12] [INFO ] Deduced a trap composed of 8 places in 75 ms
[2020-05-16 02:07:12] [INFO ] Deduced a trap composed of 18 places in 92 ms
[2020-05-16 02:07:12] [INFO ] Deduced a trap composed of 9 places in 70 ms
[2020-05-16 02:07:12] [INFO ] Deduced a trap composed of 14 places in 59 ms
[2020-05-16 02:07:13] [INFO ] Deduced a trap composed of 14 places in 58 ms
[2020-05-16 02:07:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 1032 ms
[2020-05-16 02:07:13] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2020-05-16 02:07:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:13] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2020-05-16 02:07:13] [INFO ] [Real]Added 105 Read/Feed constraints in 18 ms returned sat
[2020-05-16 02:07:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 02:07:13] [INFO ] [Nat]Absence check using 65 positive place invariants in 17 ms returned sat
[2020-05-16 02:07:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:13] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2020-05-16 02:07:13] [INFO ] [Nat]Added 105 Read/Feed constraints in 21 ms returned sat
[2020-05-16 02:07:13] [INFO ] Deduced a trap composed of 9 places in 123 ms
[2020-05-16 02:07:14] [INFO ] Deduced a trap composed of 14 places in 577 ms
[2020-05-16 02:07:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 724 ms
[2020-05-16 02:07:14] [INFO ] [Real]Absence check using 65 positive place invariants in 33 ms returned sat
[2020-05-16 02:07:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:14] [INFO ] [Real]Absence check using state equation in 634 ms returned sat
[2020-05-16 02:07:15] [INFO ] [Real]Added 105 Read/Feed constraints in 27 ms returned sat
[2020-05-16 02:07:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 02:07:15] [INFO ] [Nat]Absence check using 65 positive place invariants in 38 ms returned sat
[2020-05-16 02:07:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:15] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2020-05-16 02:07:15] [INFO ] [Nat]Added 105 Read/Feed constraints in 14 ms returned sat
[2020-05-16 02:07:15] [INFO ] Deduced a trap composed of 29 places in 447 ms
[2020-05-16 02:07:16] [INFO ] Deduced a trap composed of 34 places in 683 ms
[2020-05-16 02:07:16] [INFO ] Deduced a trap composed of 30 places in 258 ms
[2020-05-16 02:07:16] [INFO ] Deduced a trap composed of 9 places in 130 ms
[2020-05-16 02:07:16] [INFO ] Deduced a trap composed of 15 places in 67 ms
[2020-05-16 02:07:17] [INFO ] Deduced a trap composed of 14 places in 84 ms
[2020-05-16 02:07:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 1783 ms
[2020-05-16 02:07:17] [INFO ] [Real]Absence check using 65 positive place invariants in 18 ms returned sat
[2020-05-16 02:07:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:17] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2020-05-16 02:07:17] [INFO ] [Real]Added 105 Read/Feed constraints in 26 ms returned sat
[2020-05-16 02:07:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 02:07:17] [INFO ] [Nat]Absence check using 65 positive place invariants in 61 ms returned sat
[2020-05-16 02:07:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:17] [INFO ] [Nat]Absence check using state equation in 548 ms returned sat
[2020-05-16 02:07:18] [INFO ] [Nat]Added 105 Read/Feed constraints in 15 ms returned sat
[2020-05-16 02:07:18] [INFO ] Deduced a trap composed of 15 places in 200 ms
[2020-05-16 02:07:18] [INFO ] Deduced a trap composed of 9 places in 201 ms
[2020-05-16 02:07:18] [INFO ] Deduced a trap composed of 9 places in 119 ms
[2020-05-16 02:07:18] [INFO ] Deduced a trap composed of 14 places in 273 ms
[2020-05-16 02:07:18] [INFO ] Deduced a trap composed of 9 places in 125 ms
[2020-05-16 02:07:19] [INFO ] Deduced a trap composed of 9 places in 88 ms
[2020-05-16 02:07:19] [INFO ] Deduced a trap composed of 9 places in 84 ms
[2020-05-16 02:07:19] [INFO ] Deduced a trap composed of 9 places in 188 ms
[2020-05-16 02:07:19] [INFO ] Deduced a trap composed of 8 places in 77 ms
[2020-05-16 02:07:19] [INFO ] Deduced a trap composed of 9 places in 127 ms
[2020-05-16 02:07:19] [INFO ] Deduced a trap composed of 32 places in 122 ms
[2020-05-16 02:07:19] [INFO ] Deduced a trap composed of 22 places in 135 ms
[2020-05-16 02:07:20] [INFO ] Deduced a trap composed of 33 places in 158 ms
[2020-05-16 02:07:20] [INFO ] Deduced a trap composed of 9 places in 113 ms
[2020-05-16 02:07:20] [INFO ] Deduced a trap composed of 17 places in 78 ms
[2020-05-16 02:07:20] [INFO ] Deduced a trap composed of 9 places in 109 ms
[2020-05-16 02:07:20] [INFO ] Deduced a trap composed of 16 places in 98 ms
[2020-05-16 02:07:20] [INFO ] Deduced a trap composed of 9 places in 24 ms
[2020-05-16 02:07:20] [INFO ] Deduced a trap composed of 9 places in 79 ms
[2020-05-16 02:07:20] [INFO ] Deduced a trap composed of 31 places in 71 ms
[2020-05-16 02:07:20] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2754 ms
[2020-05-16 02:07:20] [INFO ] Computed and/alt/rep : 455/3647/329 causal constraints in 31 ms.
[2020-05-16 02:07:27] [INFO ] Added : 70 causal constraints over 14 iterations in 6429 ms. Result :unknown
[2020-05-16 02:07:27] [INFO ] [Real]Absence check using 65 positive place invariants in 163 ms returned sat
[2020-05-16 02:07:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:28] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2020-05-16 02:07:28] [INFO ] [Real]Added 105 Read/Feed constraints in 16 ms returned sat
[2020-05-16 02:07:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 02:07:28] [INFO ] [Nat]Absence check using 65 positive place invariants in 197 ms returned sat
[2020-05-16 02:07:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:28] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2020-05-16 02:07:28] [INFO ] [Nat]Added 105 Read/Feed constraints in 27 ms returned sat
[2020-05-16 02:07:28] [INFO ] Deduced a trap composed of 10 places in 79 ms
[2020-05-16 02:07:28] [INFO ] Deduced a trap composed of 11 places in 75 ms
[2020-05-16 02:07:28] [INFO ] Deduced a trap composed of 9 places in 85 ms
[2020-05-16 02:07:28] [INFO ] Deduced a trap composed of 10 places in 71 ms
[2020-05-16 02:07:29] [INFO ] Deduced a trap composed of 33 places in 583 ms
[2020-05-16 02:07:29] [INFO ] Deduced a trap composed of 38 places in 73 ms
[2020-05-16 02:07:29] [INFO ] Deduced a trap composed of 9 places in 109 ms
[2020-05-16 02:07:29] [INFO ] Deduced a trap composed of 9 places in 102 ms
[2020-05-16 02:07:29] [INFO ] Deduced a trap composed of 9 places in 85 ms
[2020-05-16 02:07:30] [INFO ] Deduced a trap composed of 21 places in 144 ms
[2020-05-16 02:07:30] [INFO ] Deduced a trap composed of 9 places in 629 ms
[2020-05-16 02:07:30] [INFO ] Deduced a trap composed of 9 places in 67 ms
[2020-05-16 02:07:30] [INFO ] Deduced a trap composed of 34 places in 71 ms
[2020-05-16 02:07:30] [INFO ] Deduced a trap composed of 29 places in 58 ms
[2020-05-16 02:07:31] [INFO ] Deduced a trap composed of 31 places in 59 ms
[2020-05-16 02:07:31] [INFO ] Deduced a trap composed of 40 places in 66 ms
[2020-05-16 02:07:31] [INFO ] Deduced a trap composed of 9 places in 87 ms
[2020-05-16 02:07:31] [INFO ] Deduced a trap composed of 9 places in 121 ms
[2020-05-16 02:07:31] [INFO ] Deduced a trap composed of 15 places in 93 ms
[2020-05-16 02:07:31] [INFO ] Deduced a trap composed of 9 places in 114 ms
[2020-05-16 02:07:31] [INFO ] Deduced a trap composed of 22 places in 211 ms
[2020-05-16 02:07:31] [INFO ] Deduced a trap composed of 10 places in 93 ms
[2020-05-16 02:07:33] [INFO ] Deduced a trap composed of 16 places in 1366 ms
[2020-05-16 02:07:33] [INFO ] Deduced a trap composed of 9 places in 196 ms
[2020-05-16 02:07:33] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4977 ms
[2020-05-16 02:07:33] [INFO ] Computed and/alt/rep : 455/3647/329 causal constraints in 86 ms.
[2020-05-16 02:07:40] [INFO ] Added : 55 causal constraints over 11 iterations in 6685 ms. Result :unknown
[2020-05-16 02:07:40] [INFO ] [Real]Absence check using 65 positive place invariants in 105 ms returned sat
[2020-05-16 02:07:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:41] [INFO ] [Real]Absence check using state equation in 722 ms returned sat
[2020-05-16 02:07:41] [INFO ] [Real]Added 105 Read/Feed constraints in 46 ms returned sat
[2020-05-16 02:07:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 02:07:41] [INFO ] [Nat]Absence check using 65 positive place invariants in 158 ms returned sat
[2020-05-16 02:07:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:41] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2020-05-16 02:07:41] [INFO ] [Nat]Added 105 Read/Feed constraints in 18 ms returned sat
[2020-05-16 02:07:41] [INFO ] Deduced a trap composed of 8 places in 85 ms
[2020-05-16 02:07:41] [INFO ] Deduced a trap composed of 8 places in 52 ms
[2020-05-16 02:07:42] [INFO ] Deduced a trap composed of 11 places in 65 ms
[2020-05-16 02:07:42] [INFO ] Deduced a trap composed of 9 places in 85 ms
[2020-05-16 02:07:42] [INFO ] Deduced a trap composed of 9 places in 72 ms
[2020-05-16 02:07:42] [INFO ] Deduced a trap composed of 13 places in 88 ms
[2020-05-16 02:07:42] [INFO ] Deduced a trap composed of 29 places in 93 ms
[2020-05-16 02:07:42] [INFO ] Deduced a trap composed of 9 places in 80 ms
[2020-05-16 02:07:42] [INFO ] Deduced a trap composed of 28 places in 72 ms
[2020-05-16 02:07:42] [INFO ] Deduced a trap composed of 15 places in 87 ms
[2020-05-16 02:07:42] [INFO ] Deduced a trap composed of 16 places in 71 ms
[2020-05-16 02:07:42] [INFO ] Deduced a trap composed of 31 places in 93 ms
[2020-05-16 02:07:42] [INFO ] Deduced a trap composed of 43 places in 74 ms
[2020-05-16 02:07:43] [INFO ] Deduced a trap composed of 29 places in 72 ms
[2020-05-16 02:07:43] [INFO ] Deduced a trap composed of 9 places in 73 ms
[2020-05-16 02:07:43] [INFO ] Deduced a trap composed of 9 places in 72 ms
[2020-05-16 02:07:43] [INFO ] Deduced a trap composed of 35 places in 64 ms
[2020-05-16 02:07:43] [INFO ] Deduced a trap composed of 9 places in 35 ms
[2020-05-16 02:07:43] [INFO ] Deduced a trap composed of 9 places in 68 ms
[2020-05-16 02:07:43] [INFO ] Deduced a trap composed of 9 places in 63 ms
[2020-05-16 02:07:43] [INFO ] Deduced a trap composed of 45 places in 64 ms
[2020-05-16 02:07:43] [INFO ] Deduced a trap composed of 9 places in 61 ms
[2020-05-16 02:07:43] [INFO ] Deduced a trap composed of 9 places in 59 ms
[2020-05-16 02:07:43] [INFO ] Deduced a trap composed of 9 places in 31 ms
[2020-05-16 02:07:43] [INFO ] Deduced a trap composed of 9 places in 23 ms
[2020-05-16 02:07:43] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 1982 ms
[2020-05-16 02:07:43] [INFO ] Computed and/alt/rep : 455/3647/329 causal constraints in 24 ms.
[2020-05-16 02:07:50] [INFO ] Added : 55 causal constraints over 11 iterations in 6505 ms. Result :unknown
[2020-05-16 02:07:50] [INFO ] [Real]Absence check using 65 positive place invariants in 103 ms returned sat
[2020-05-16 02:07:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:51] [INFO ] [Real]Absence check using state equation in 646 ms returned sat
[2020-05-16 02:07:51] [INFO ] [Real]Added 105 Read/Feed constraints in 60 ms returned sat
[2020-05-16 02:07:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 02:07:51] [INFO ] [Nat]Absence check using 65 positive place invariants in 230 ms returned sat
[2020-05-16 02:07:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:52] [INFO ] [Nat]Absence check using state equation in 809 ms returned sat
[2020-05-16 02:07:52] [INFO ] [Nat]Added 105 Read/Feed constraints in 29 ms returned sat
[2020-05-16 02:07:54] [INFO ] Deduced a trap composed of 9 places in 2397 ms
[2020-05-16 02:07:56] [INFO ] Deduced a trap composed of 21 places in 1989 ms
[2020-05-16 02:07:57] [INFO ] Deduced a trap composed of 8 places in 1127 ms
[2020-05-16 02:07:57] [INFO ] Deduced a trap composed of 9 places in 120 ms
[2020-05-16 02:07:58] [INFO ] Deduced a trap composed of 29 places in 165 ms
[2020-05-16 02:07:58] [INFO ] Deduced a trap composed of 15 places in 311 ms
[2020-05-16 02:07:58] [INFO ] Deduced a trap composed of 16 places in 455 ms
[2020-05-16 02:07:58] [INFO ] Deduced a trap composed of 19 places in 62 ms
[2020-05-16 02:07:59] [INFO ] Deduced a trap composed of 9 places in 77 ms
[2020-05-16 02:07:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 6828 ms
[2020-05-16 02:07:59] [INFO ] [Real]Absence check using 65 positive place invariants in 23 ms returned sat
[2020-05-16 02:07:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:59] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2020-05-16 02:07:59] [INFO ] [Real]Added 105 Read/Feed constraints in 16 ms returned sat
[2020-05-16 02:07:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 02:07:59] [INFO ] [Nat]Absence check using 65 positive place invariants in 61 ms returned sat
[2020-05-16 02:07:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:59] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2020-05-16 02:07:59] [INFO ] [Nat]Added 105 Read/Feed constraints in 20 ms returned sat
[2020-05-16 02:07:59] [INFO ] Deduced a trap composed of 9 places in 24 ms
[2020-05-16 02:07:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2020-05-16 02:07:59] [INFO ] [Real]Absence check using 65 positive place invariants in 24 ms returned sat
[2020-05-16 02:07:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 02:07:59] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2020-05-16 02:07:59] [INFO ] [Real]Added 105 Read/Feed constraints in 36 ms returned sat
[2020-05-16 02:07:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 02:08:00] [INFO ] [Nat]Absence check using 65 positive place invariants in 205 ms returned sat
[2020-05-16 02:08:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 02:08:00] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2020-05-16 02:08:00] [INFO ] [Nat]Added 105 Read/Feed constraints in 19 ms returned sat
[2020-05-16 02:08:00] [INFO ] Deduced a trap composed of 9 places in 26 ms
[2020-05-16 02:08:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2020-05-16 02:08:00] [INFO ] [Real]Absence check using 65 positive place invariants in 18 ms returned sat
[2020-05-16 02:08:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 02:08:00] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2020-05-16 02:08:00] [INFO ] [Real]Added 105 Read/Feed constraints in 33 ms returned sat
[2020-05-16 02:08:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 02:08:00] [INFO ] [Nat]Absence check using 65 positive place invariants in 30 ms returned sat
[2020-05-16 02:08:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 02:08:00] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2020-05-16 02:08:00] [INFO ] [Nat]Added 105 Read/Feed constraints in 23 ms returned sat
[2020-05-16 02:08:00] [INFO ] Deduced a trap composed of 9 places in 29 ms
[2020-05-16 02:08:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2020-05-16 02:08:01] [INFO ] [Real]Absence check using 65 positive place invariants in 19 ms returned sat
[2020-05-16 02:08:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 02:08:01] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2020-05-16 02:08:01] [INFO ] [Real]Added 105 Read/Feed constraints in 24 ms returned sat
[2020-05-16 02:08:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 02:08:01] [INFO ] [Nat]Absence check using 65 positive place invariants in 24 ms returned sat
[2020-05-16 02:08:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 02:08:01] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2020-05-16 02:08:01] [INFO ] [Nat]Added 105 Read/Feed constraints in 14 ms returned sat
[2020-05-16 02:08:01] [INFO ] Deduced a trap composed of 18 places in 73 ms
[2020-05-16 02:08:01] [INFO ] Deduced a trap composed of 14 places in 320 ms
[2020-05-16 02:08:01] [INFO ] Deduced a trap composed of 9 places in 29 ms
[2020-05-16 02:08:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 450 ms
[2020-05-16 02:08:02] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2020-05-16 02:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 02:08:02] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2020-05-16 02:08:02] [INFO ] [Real]Added 105 Read/Feed constraints in 13 ms returned sat
[2020-05-16 02:08:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 02:08:02] [INFO ] [Nat]Absence check using 65 positive place invariants in 23 ms returned sat
[2020-05-16 02:08:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 02:08:02] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2020-05-16 02:08:02] [INFO ] [Nat]Added 105 Read/Feed constraints in 13 ms returned sat
[2020-05-16 02:08:02] [INFO ] Deduced a trap composed of 16 places in 72 ms
[2020-05-16 02:08:02] [INFO ] Deduced a trap composed of 9 places in 29 ms
[2020-05-16 02:08:02] [INFO ] Deduced a trap composed of 9 places in 12 ms
[2020-05-16 02:08:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 160 ms
[2020-05-16 02:08:02] [INFO ] [Real]Absence check using 65 positive place invariants in 24 ms returned sat
[2020-05-16 02:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 02:08:02] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2020-05-16 02:08:02] [INFO ] [Real]Added 105 Read/Feed constraints in 60 ms returned sat
[2020-05-16 02:08:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 02:08:03] [INFO ] [Nat]Absence check using 65 positive place invariants in 42 ms returned sat
[2020-05-16 02:08:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 02:08:03] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2020-05-16 02:08:03] [INFO ] [Nat]Added 105 Read/Feed constraints in 15 ms returned sat
[2020-05-16 02:08:03] [INFO ] Deduced a trap composed of 9 places in 25 ms
[2020-05-16 02:08:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2020-05-16 02:08:03] [INFO ] [Real]Absence check using 65 positive place invariants in 4 ms returned unsat
[2020-05-16 02:08:03] [INFO ] [Real]Absence check using 65 positive place invariants in 20 ms returned sat
[2020-05-16 02:08:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 02:08:03] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2020-05-16 02:08:03] [INFO ] [Real]Added 105 Read/Feed constraints in 16 ms returned sat
[2020-05-16 02:08:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 02:08:03] [INFO ] [Nat]Absence check using 65 positive place invariants in 21 ms returned sat
[2020-05-16 02:08:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 02:08:03] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2020-05-16 02:08:03] [INFO ] [Nat]Added 105 Read/Feed constraints in 13 ms returned sat
[2020-05-16 02:08:03] [INFO ] Deduced a trap composed of 9 places in 95 ms
[2020-05-16 02:08:03] [INFO ] Deduced a trap composed of 8 places in 101 ms
[2020-05-16 02:08:04] [INFO ] Deduced a trap composed of 22 places in 812 ms
[2020-05-16 02:08:04] [INFO ] Deduced a trap composed of 8 places in 162 ms
[2020-05-16 02:08:05] [INFO ] Deduced a trap composed of 23 places in 131 ms
[2020-05-16 02:08:05] [INFO ] Deduced a trap composed of 24 places in 650 ms
[2020-05-16 02:08:05] [INFO ] Deduced a trap composed of 18 places in 90 ms
[2020-05-16 02:08:05] [INFO ] Deduced a trap composed of 23 places in 71 ms
[2020-05-16 02:08:06] [INFO ] Deduced a trap composed of 30 places in 87 ms
[2020-05-16 02:08:06] [INFO ] Deduced a trap composed of 21 places in 103 ms
[2020-05-16 02:08:06] [INFO ] Deduced a trap composed of 21 places in 55 ms
[2020-05-16 02:08:06] [INFO ] Deduced a trap composed of 9 places in 107 ms
[2020-05-16 02:08:06] [INFO ] Deduced a trap composed of 16 places in 78 ms
[2020-05-16 02:08:06] [INFO ] Deduced a trap composed of 15 places in 55 ms
[2020-05-16 02:08:06] [INFO ] Deduced a trap composed of 37 places in 107 ms
[2020-05-16 02:08:07] [INFO ] Deduced a trap composed of 29 places in 727 ms
[2020-05-16 02:08:08] [INFO ] Deduced a trap composed of 30 places in 761 ms
[2020-05-16 02:08:09] [INFO ] Deduced a trap composed of 16 places in 1556 ms
[2020-05-16 02:08:09] [INFO ] Deduced a trap composed of 38 places in 263 ms
[2020-05-16 02:08:10] [INFO ] Deduced a trap composed of 20 places in 66 ms
[2020-05-16 02:08:10] [INFO ] Deduced a trap composed of 31 places in 76 ms
[2020-05-16 02:08:10] [INFO ] Deduced a trap composed of 19 places in 68 ms
[2020-05-16 02:08:10] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6555 ms
[2020-05-16 02:08:10] [INFO ] Computed and/alt/rep : 455/3647/329 causal constraints in 20 ms.
[2020-05-16 02:08:11] [INFO ] Added : 213 causal constraints over 43 iterations in 1479 ms. Result :sat
[2020-05-16 02:08:11] [INFO ] Deduced a trap composed of 16 places in 223 ms
[2020-05-16 02:08:12] [INFO ] Deduced a trap composed of 21 places in 700 ms
[2020-05-16 02:08:12] [INFO ] Deduced a trap composed of 25 places in 85 ms
[2020-05-16 02:08:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1157 ms
Successfully simplified 15 atomic propositions for a total of 15 simplifications.
[2020-05-16 02:08:13] [INFO ] Flatten gal took : 147 ms
[2020-05-16 02:08:13] [INFO ] Flatten gal took : 84 ms
[2020-05-16 02:08:13] [INFO ] Applying decomposition
[2020-05-16 02:08:13] [INFO ] Flatten gal took : 80 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/graph3851701827085064913.txt, -o, /tmp/graph3851701827085064913.bin, -w, /tmp/graph3851701827085064913.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/graph3851701827085064913.bin, -l, -1, -v, -w, /tmp/graph3851701827085064913.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-16 02:08:13] [INFO ] Decomposing Gal with order
[2020-05-16 02:08:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-16 02:08:14] [INFO ] Removed a total of 721 redundant transitions.
[2020-05-16 02:08:14] [INFO ] Flatten gal took : 147 ms
[2020-05-16 02:08:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 23 ms.
[2020-05-16 02:08:14] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 8 ms
[2020-05-16 02:08:14] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 10 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
built 64 ordering constraints for composite.
built 20 ordering constraints for composite.
built 19 ordering constraints for composite.
built 19 ordering constraints for composite.
built 23 ordering constraints for composite.
built 27 ordering constraints for composite.
built 19 ordering constraints for composite.
built 23 ordering constraints for composite.
built 27 ordering constraints for composite.
built 19 ordering constraints for composite.
built 26 ordering constraints for composite.
built 26 ordering constraints for composite.
built 21 ordering constraints for composite.
built 16 ordering constraints for composite.
built 22 ordering constraints for composite.
built 31 ordering constraints for composite.
built 23 ordering constraints for composite.
built 27 ordering constraints for composite.
built 19 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,2.3326e+15,1126.03,10870780,16905,51,1.53079e+07,409,887,2.98915e+07,58,1482,0


Converting to forward existential form...Done !
original formula: (AG(!(EX(((((((((i9.u17.y_1>=1)&&(i7.i0.u71.P_ifyi_15_1>=1))||((i8.i0.u18.y_4>=1)&&(i8.i0.u74.P_ifyi_15_4>=1)))||((i2.i0.u19.y_5>=1)&&(i2.i0.u70.P_ifyi_15_5>=1)))||((i0.i0.u14.y_2>=1)&&(i0.i0.u72.P_ifyi_15_2>=1)))||((i9.u15.y_3>=1)&&(i1.i0.u73.P_ifyi_15_3>=1)))||((u20.y_6>=1)&&(i3.u75.P_ifyi_15_6>=1)))||((u16.y_7>=1)&&(i4.u76.P_ifyi_15_7>=1)))))) * !(E(((((((((i7.i0.u7.x_1>=1)&&(i9.u17.P_ifxi_10_1>=1))||((i0.i0.u11.x_2>=1)&&(i0.i0.u14.P_ifxi_10_2>=1)))||((i1.i0.u12.x_3>=1)&&(i9.u15.P_ifxi_10_3>=1)))||((i8.i0.u8.x_4>=1)&&(i8.i0.u18.P_ifxi_10_4>=1)))||((i2.i0.u9.x_5>=1)&&(i2.i0.u19.P_ifxi_10_5>=1)))||((i3.u10.x_6>=1)&&(u20.P_ifxi_10_6>=1)))||((i4.u13.x_7>=1)&&(u16.P_ifxi_10_7>=1))) U ((((((((((((((((((((((((((((((((((((((((((((((((((u20.y_6>=1)&&(i7.i0.u7.P_ify0_4_1>=1))||((i0.i0.u14.y_2>=1)&&(i3.u10.P_ify0_4_6>=1)))||((u16.y_7>=1)&&(i1.i0.u12.P_ify0_4_3>=1)))||((i9.u17.y_1>=1)&&(i8.i0.u8.P_ify0_4_4>=1)))||((u16.y_7>=1)&&(i7.i0.u7.P_ify0_4_1>=1)))||((i9.u17.y_1>=1)&&(i3.u10.P_ify0_4_6>=1)))||((u16.y_7>=1)&&(i4.u13.P_ify0_4_7>=1)))||((i9.u17.y_1>=1)&&(i0.i0.u11.P_ify0_4_2>=1)))||((u16.y_7>=1)&&(i2.i0.u9.P_ify0_4_5>=1)))||((u20.y_6>=1)&&(i4.u13.P_ify0_4_7>=1)))||((u20.y_6>=1)&&(i1.i0.u12.P_ify0_4_3>=1)))||((i0.i0.u14.y_2>=1)&&(i8.i0.u8.P_ify0_4_4>=1)))||((i0.i0.u14.y_2>=1)&&(i0.i0.u11.P_ify0_4_2>=1)))||((u20.y_6>=1)&&(i2.i0.u9.P_ify0_4_5>=1)))||((i8.i0.u18.y_4>=1)&&(i2.i0.u9.P_ify0_4_5>=1)))||((i8.i0.u18.y_4>=1)&&(i7.i0.u7.P_ify0_4_1>=1)))||((i8.i0.u18.y_4>=1)&&(i4.u13.P_ify0_4_7>=1)))||((i2.i0.u19.y_5>=1)&&(i4.u13.P_ify0_4_7>=1)))||((i2.i0.u19.y_5>=1)&&(i2.i0.u9.P_ify0_4_5>=1)))||((i9.u15.y_3>=1)&&(i7.i0.u7.P_ify0_4_1>=1)))||((i2.i0.u19.y_5>=1)&&(i1.i0.u12.P_ify0_4_3>=1)))||((i9.u15.y_3>=1)&&(i1.i0.u12.P_ify0_4_3>=1)))||((i2.i0.u19.y_5>=1)&&(i7.i0.u7.P_ify0_4_1>=1)))||((i9.u15.y_3>=1)&&(i2.i0.u9.P_ify0_4_5>=1)))||((i9.u15.y_3>=1)&&(i4.u13.P_ify0_4_7>=1)))||((i8.i0.u18.y_4>=1)&&(i1.i0.u12.P_ify0_4_3>=1)))||((i0.i0.u14.y_2>=1)&&(i4.u13.P_ify0_4_7>=1)))||((i9.u17.y_1>=1)&&(i1.i0.u12.P_ify0_4_3>=1)))||((u16.y_7>=1)&&(i8.i0.u8.P_ify0_4_4>=1)))||((u16.y_7>=1)&&(i0.i0.u11.P_ify0_4_2>=1)))||((i9.u17.y_1>=1)&&(i2.i0.u9.P_ify0_4_5>=1)))||((i9.u17.y_1>=1)&&(i7.i0.u7.P_ify0_4_1>=1)))||((u16.y_7>=1)&&(i3.u10.P_ify0_4_6>=1)))||((i9.u17.y_1>=1)&&(i4.u13.P_ify0_4_7>=1)))||((i0.i0.u14.y_2>=1)&&(i7.i0.u7.P_ify0_4_1>=1)))||((u20.y_6>=1)&&(i3.u10.P_ify0_4_6>=1)))||((u20.y_6>=1)&&(i0.i0.u11.P_ify0_4_2>=1)))||((i0.i0.u14.y_2>=1)&&(i2.i0.u9.P_ify0_4_5>=1)))||((i0.i0.u14.y_2>=1)&&(i1.i0.u12.P_ify0_4_3>=1)))||((u20.y_6>=1)&&(i8.i0.u8.P_ify0_4_4>=1)))||((i8.i0.u18.y_4>=1)&&(i8.i0.u8.P_ify0_4_4>=1)))||((i8.i0.u18.y_4>=1)&&(i3.u10.P_ify0_4_6>=1)))||((i9.u15.y_3>=1)&&(i0.i0.u11.P_ify0_4_2>=1)))||((i2.i0.u19.y_5>=1)&&(i3.u10.P_ify0_4_6>=1)))||((i9.u15.y_3>=1)&&(i8.i0.u8.P_ify0_4_4>=1)))||((i2.i0.u19.y_5>=1)&&(i8.i0.u8.P_ify0_4_4>=1)))||((i9.u15.y_3>=1)&&(i3.u10.P_ify0_4_6>=1)))||((i2.i0.u19.y_5>=1)&&(i0.i0.u11.P_ify0_4_2>=1)))||((i8.i0.u18.y_4>=1)&&(i0.i0.u11.P_ify0_4_2>=1))))))
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * ((((((((i9.u17.y_1>=1)&&(i7.i0.u71.P_ifyi_15_1>=1))||((i8.i0.u18.y_4>=1)&&(i8.i0.u74.P_ifyi_15_4>=1)))||((i2.i0.u19.y_5>=1)&&(i2.i0.u70.P_ifyi_15_5>=1)))||((i0.i0.u14.y_2>=1)&&(i0.i0.u72.P_ifyi_15_2>=1)))||((i9.u15.y_3>=1)&&(i1.i0.u73.P_ifyi_15_3>=1)))||((u20.y_6>=1)&&(i3.u75.P_ifyi_15_6>=1)))||((u16.y_7>=1)&&(i4.u76.P_ifyi_15_7>=1))))] = FALSE * [(FwdU(Init,((((((((i7.i0.u7.x_1>=1)&&(i9.u17.P_ifxi_10_1>=1))||((i0.i0.u11.x_2>=1)&&(i0.i0.u14.P_ifxi_10_2>=1)))||((i1.i0.u12.x_3>=1)&&(i9.u15.P_ifxi_10_3>=1)))||((i8.i0.u8.x_4>=1)&&(i8.i0.u18.P_ifxi_10_4>=1)))||((i2.i0.u9.x_5>=1)&&(i2.i0.u19.P_ifxi_10_5>=1)))||((i3.u10.x_6>=1)&&(u20.P_ifxi_10_6>=1)))||((i4.u13.x_7>=1)&&(u16.P_ifxi_10_7>=1)))) * ((((((((((((((((((((((((((((((((((((((((((((((((((u20.y_6>=1)&&(i7.i0.u7.P_ify0_4_1>=1))||((i0.i0.u14.y_2>=1)&&(i3.u10.P_ify0_4_6>=1)))||((u16.y_7>=1)&&(i1.i0.u12.P_ify0_4_3>=1)))||((i9.u17.y_1>=1)&&(i8.i0.u8.P_ify0_4_4>=1)))||((u16.y_7>=1)&&(i7.i0.u7.P_ify0_4_1>=1)))||((i9.u17.y_1>=1)&&(i3.u10.P_ify0_4_6>=1)))||((u16.y_7>=1)&&(i4.u13.P_ify0_4_7>=1)))||((i9.u17.y_1>=1)&&(i0.i0.u11.P_ify0_4_2>=1)))||((u16.y_7>=1)&&(i2.i0.u9.P_ify0_4_5>=1)))||((u20.y_6>=1)&&(i4.u13.P_ify0_4_7>=1)))||((u20.y_6>=1)&&(i1.i0.u12.P_ify0_4_3>=1)))||((i0.i0.u14.y_2>=1)&&(i8.i0.u8.P_ify0_4_4>=1)))||((i0.i0.u14.y_2>=1)&&(i0.i0.u11.P_ify0_4_2>=1)))||((u20.y_6>=1)&&(i2.i0.u9.P_ify0_4_5>=1)))||((i8.i0.u18.y_4>=1)&&(i2.i0.u9.P_ify0_4_5>=1)))||((i8.i0.u18.y_4>=1)&&(i7.i0.u7.P_ify0_4_1>=1)))||((i8.i0.u18.y_4>=1)&&(i4.u13.P_ify0_4_7>=1)))||((i2.i0.u19.y_5>=1)&&(i4.u13.P_ify0_4_7>=1)))||((i2.i0.u19.y_5>=1)&&(i2.i0.u9.P_ify0_4_5>=1)))||((i9.u15.y_3>=1)&&(i7.i0.u7.P_ify0_4_1>=1)))||((i2.i0.u19.y_5>=1)&&(i1.i0.u12.P_ify0_4_3>=1)))||((i9.u15.y_3>=1)&&(i1.i0.u12.P_ify0_4_3>=1)))||((i2.i0.u19.y_5>=1)&&(i7.i0.u7.P_ify0_4_1>=1)))||((i9.u15.y_3>=1)&&(i2.i0.u9.P_ify0_4_5>=1)))||((i9.u15.y_3>=1)&&(i4.u13.P_ify0_4_7>=1)))||((i8.i0.u18.y_4>=1)&&(i1.i0.u12.P_ify0_4_3>=1)))||((i0.i0.u14.y_2>=1)&&(i4.u13.P_ify0_4_7>=1)))||((i9.u17.y_1>=1)&&(i1.i0.u12.P_ify0_4_3>=1)))||((u16.y_7>=1)&&(i8.i0.u8.P_ify0_4_4>=1)))||((u16.y_7>=1)&&(i0.i0.u11.P_ify0_4_2>=1)))||((i9.u17.y_1>=1)&&(i2.i0.u9.P_ify0_4_5>=1)))||((i9.u17.y_1>=1)&&(i7.i0.u7.P_ify0_4_1>=1)))||((u16.y_7>=1)&&(i3.u10.P_ify0_4_6>=1)))||((i9.u17.y_1>=1)&&(i4.u13.P_ify0_4_7>=1)))||((i0.i0.u14.y_2>=1)&&(i7.i0.u7.P_ify0_4_1>=1)))||((u20.y_6>=1)&&(i3.u10.P_ify0_4_6>=1)))||((u20.y_6>=1)&&(i0.i0.u11.P_ify0_4_2>=1)))||((i0.i0.u14.y_2>=1)&&(i2.i0.u9.P_ify0_4_5>=1)))||((i0.i0.u14.y_2>=1)&&(i1.i0.u12.P_ify0_4_3>=1)))||((u20.y_6>=1)&&(i8.i0.u8.P_ify0_4_4>=1)))||((i8.i0.u18.y_4>=1)&&(i8.i0.u8.P_ify0_4_4>=1)))||((i8.i0.u18.y_4>=1)&&(i3.u10.P_ify0_4_6>=1)))||((i9.u15.y_3>=1)&&(i0.i0.u11.P_ify0_4_2>=1)))||((i2.i0.u19.y_5>=1)&&(i3.u10.P_ify0_4_6>=1)))||((i9.u15.y_3>=1)&&(i8.i0.u8.P_ify0_4_4>=1)))||((i2.i0.u19.y_5>=1)&&(i8.i0.u8.P_ify0_4_4>=1)))||((i9.u15.y_3>=1)&&(i3.u10.P_ify0_4_6>=1)))||((i2.i0.u19.y_5>=1)&&(i0.i0.u11.P_ify0_4_2>=1)))||((i8.i0.u18.y_4>=1)&&(i0.i0.u11.P_ify0_4_2>=1))))] = FALSE)
(forward)formula 0,0,1139.83,10870780,1,0,1.53079e+07,409,1679,2.98915e+07,81,1482,732297
FORMULA LamportFastMutEx-PT-7-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i7.i0.u0.P_fordo_12_1<1)&&(i1.i0.u2.P_fordo_12_3<1))&&(i0.i0.u1.P_fordo_12_2<1))&&(i2.i0.u4.P_fordo_12_5<1))&&(i8.i0.u3.P_fordo_12_4<1))&&(i4.u6.P_fordo_12_7<1))&&(i3.u5.P_fordo_12_6<1))&&((i9.u82.y_0<1)||(i0.i0.u72.P_awaity_2<1)))&&((i9.u82.y_0<1)||(i1.i0.u73.P_awaity_3<1)))&&((i9.u82.y_0<1)||(i7.i0.u71.P_awaity_1<1)))&&((i9.u82.y_0<1)||(i3.u75.P_awaity_6<1)))&&((i9.u82.y_0<1)||(i4.u76.P_awaity_7<1)))&&((i9.u82.y_0<1)||(i8.i0.u74.P_awaity_4<1)))&&((i9.u82.y_0<1)||(i2.i0.u70.P_awaity_5<1)))&&((i9.u82.y_0<1)||(i1.i0.u73.P_ifyi_15_3<1)))&&((i2.i0.u19.y_5<1)||(i8.i0.u74.P_ifyi_15_4<1)))&&((i9.u82.y_0<1)||(i7.i0.u71.P_ifyi_15_1<1)))&&((i2.i0.u19.y_5<1)||(i3.u75.P_ifyi_15_6<1)))&&((i9.u82.y_0<1)||(i4.u76.P_ifyi_15_7<1)))&&((i9.u82.y_0<1)||(i2.i0.u70.P_ifyi_15_5<1)))&&((i9.u17.y_1<1)||(i4.u76.P_ifyi_15_7<1)))&&((i8.i0.u18.y_4<1)||(i0.i0.u72.P_ifyi_15_2<1)))&&((u20.y_6<1)||(i8.i0.u74.P_ifyi_15_4<1)))&&((u20.y_6<1)||(i0.i0.u72.P_ifyi_15_2<1)))&&((i0.i0.u14.y_2<1)||(i4.u76.P_ifyi_15_7<1)))&&((i9.u15.y_3<1)||(i0.i0.u72.P_ifyi_15_2<1)))&&((u16.y_7<1)||(i3.u75.P_ifyi_15_6<1)))&&((i9.u15.y_3<1)||(i8.i0.u74.P_ifyi_15_4<1)))&&((u16.y_7<1)||(i0.i0.u72.P_ifyi_15_2<1)))&&((u16.y_7<1)||(i8.i0.u74.P_ifyi_15_4<1)))&&((i9.u15.y_3<1)||(i3.u75.P_ifyi_15_6<1)))&&((i0.i0.u14.y_2<1)||(i2.i0.u70.P_ifyi_15_5<1)))&&((i0.i0.u14.y_2<1)||(i1.i0.u73.P_ifyi_15_3<1)))&&((i0.i0.u14.y_2<1)||(i7.i0.u71.P_ifyi_15_1<1)))&&((i8.i0.u18.y_4<1)||(i3.u75.P_ifyi_15_6<1)))&&((i9.u17.y_1<1)||(i1.i0.u73.P_ifyi_15_3<1)))&&((i9.u17.y_1<1)||(i2.i0.u70.P_ifyi_15_5<1)))&&((i2.i0.u19.y_5<1)||(i0.i0.u72.P_ifyi_15_2<1)))&&((i9.u82.y_0<1)||(i0.i0.u72.P_ifyi_15_2<1)))&&((i2.i0.u19.y_5<1)||(i1.i0.u73.P_ifyi_15_3<1)))&&((i9.u82.y_0<1)||(i3.u75.P_ifyi_15_6<1)))&&((i2.i0.u19.y_5<1)||(i4.u76.P_ifyi_15_7<1)))&&((i9.u82.y_0<1)||(i8.i0.u74.P_ifyi_15_4<1)))&&((u20.y_6<1)||(i4.u76.P_ifyi_15_7<1)))&&((i8.i0.u18.y_4<1)||(i1.i0.u73.P_ifyi_15_3<1)))&&((u20.y_6<1)||(i2.i0.u70.P_ifyi_15_5<1)))&&((i8.i0.u18.y_4<1)||(i7.i0.u71.P_ifyi_15_1<1)))&&((u20.y_6<1)||(i1.i0.u73.P_ifyi_15_3<1)))&&((i0.i0.u14.y_2<1)||(i3.u75.P_ifyi_15_6<1)))&&((i9.u15.y_3<1)||(i7.i0.u71.P_ifyi_15_1<1)))&&((u16.y_7<1)||(i2.i0.u70.P_ifyi_15_5<1)))&&((u16.y_7<1)||(i7.i0.u71.P_ifyi_15_1<1)))&&((u16.y_7<1)||(i1.i0.u73.P_ifyi_15_3<1)))&&((i9.u15.y_3<1)||(i2.i0.u70.P_ifyi_15_5<1)))&&((i9.u15.y_3<1)||(i4.u76.P_ifyi_15_7<1)))&&((i0.i0.u14.y_2<1)||(i8.i0.u74.P_ifyi_15_4<1)))&&((u20.y_6<1)||(i7.i0.u71.P_ifyi_15_1<1)))&&((i8.i0.u18.y_4<1)||(i4.u76.P_ifyi_15_7<1)))&&((i9.u17.y_1<1)||(i0.i0.u72.P_ifyi_15_2<1)))&&((i8.i0.u18.y_4<1)||(i2.i0.u70.P_ifyi_15_5<1)))&&((i9.u17.y_1<1)||(i8.i0.u74.P_ifyi_15_4<1)))&&((i9.u17.y_1<1)||(i3.u75.P_ifyi_15_6<1)))&&((i2.i0.u19.y_5<1)||(i7.i0.u71.P_ifyi_15_1<1))) U (((((((((((((((((((((((((((((((((((((((((((((((((((i3.u5.P_b_6_false>=1)&&(i0.i1.u29.P_wait_2_6>=1))&&(i0.i1.u27.P_await_13_2>=1))||(((i4.u6.P_b_7_false>=1)&&(i1.i1.u52.P_wait_3_7>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i1.i1.u33.P_wait_3_4>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i1.i1.u31.P_wait_3_1>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i4.u68.P_wait_7_4>=1))&&(i4.u66.P_await_13_7>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i0.i1.u49.P_wait_2_3>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i3.u5.P_b_6_false>=1)&&(i3.u42.P_wait_6_6>=1))&&(i3.u63.P_await_13_6>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i7.i1.u25.P_wait_1_5>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i4.u66.P_wait_7_2>=1))&&(i4.u66.P_await_13_7>=1)))||(((i3.u5.P_b_6_false>=1)&&(i2.i1.u60.P_wait_5_6>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i3.u64.P_wait_6_4>=1))&&(i3.u63.P_await_13_6>=1)))||(((i4.u6.P_b_7_false>=1)&&(i8.i1.u56.P_wait_4_7>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i2.i1.u57.P_wait_5_2>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i8.i0.u38.P_wait_4_4>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i4.u6.P_b_7_false>=1)&&(i0.i1.u30.P_wait_2_7>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i3.u5.P_b_6_false>=1)&&(i1.i1.u35.P_wait_3_6>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i3.u5.P_b_6_false>=1)&&(i7.i1.u26.P_wait_1_6>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i0.i1.u50.P_wait_2_4>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i4.u6.P_b_7_false>=1)&&(i3.u43.P_wait_6_7>=1))&&(i3.u63.P_await_13_6>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i4.u69.P_wait_7_5>=1))&&(i4.u66.P_await_13_7>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i7.i1.u22.P_wait_1_2>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i2.i0.u59.P_wait_5_5>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i3.u41.P_wait_6_3>=1))&&(i3.u63.P_await_13_6>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i4.u44.P_wait_7_1>=1))&&(i4.u66.P_await_13_7>=1)))||(((i3.u5.P_b_6_false>=1)&&(i4.u45.P_wait_7_6>=1))&&(i4.u66.P_await_13_7>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i2.i1.u40.P_wait_5_4>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i3.u63.P_wait_6_2>=1))&&(i3.u63.P_await_13_6>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i1.i1.u32.P_wait_3_2>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i1.i1.u34.P_wait_3_5>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i8.i1.u53.P_wait_4_3>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i2.i1.u39.P_wait_5_1>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i4.u6.P_b_7_false>=1)&&(i7.i1.u47.P_wait_1_7>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i3.u5.P_b_6_false>=1)&&(i8.i1.u55.P_wait_4_6>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i7.i1.u23.P_wait_1_3>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i0.i1.u27.P_wait_2_1>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i0.i1.u28.P_wait_2_5>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i1.i0.u51.P_wait_3_3>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i7.i1.u21.P_wait_1_1>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i3.u62.P_wait_6_1>=1))&&(i3.u63.P_await_13_6>=1)))||(((i4.u6.P_b_7_false>=1)&&(i4.u46.P_wait_7_7>=1))&&(i4.u66.P_await_13_7>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i8.i1.u36.P_wait_4_1>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i8.i1.u37.P_wait_4_2>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i2.i1.u58.P_wait_5_3>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i8.i1.u54.P_wait_4_5>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i4.u67.P_wait_7_3>=1))&&(i4.u66.P_await_13_7>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i0.i0.u48.P_wait_2_2>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i3.u65.P_wait_6_5>=1))&&(i3.u63.P_await_13_6>=1)))||(((i4.u6.P_b_7_false>=1)&&(i2.i1.u61.P_wait_5_7>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i7.i1.u24.P_wait_1_4>=1))&&(i7.i1.u21.P_await_13_1>=1))))
=> equivalent forward existential formula: [((Init * !(EG(!((((((((((((((((((((((((((((((((((((((((((((((((((((i3.u5.P_b_6_false>=1)&&(i0.i1.u29.P_wait_2_6>=1))&&(i0.i1.u27.P_await_13_2>=1))||(((i4.u6.P_b_7_false>=1)&&(i1.i1.u52.P_wait_3_7>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i1.i1.u33.P_wait_3_4>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i1.i1.u31.P_wait_3_1>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i4.u68.P_wait_7_4>=1))&&(i4.u66.P_await_13_7>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i0.i1.u49.P_wait_2_3>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i3.u5.P_b_6_false>=1)&&(i3.u42.P_wait_6_6>=1))&&(i3.u63.P_await_13_6>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i7.i1.u25.P_wait_1_5>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i4.u66.P_wait_7_2>=1))&&(i4.u66.P_await_13_7>=1)))||(((i3.u5.P_b_6_false>=1)&&(i2.i1.u60.P_wait_5_6>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i3.u64.P_wait_6_4>=1))&&(i3.u63.P_await_13_6>=1)))||(((i4.u6.P_b_7_false>=1)&&(i8.i1.u56.P_wait_4_7>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i2.i1.u57.P_wait_5_2>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i8.i0.u38.P_wait_4_4>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i4.u6.P_b_7_false>=1)&&(i0.i1.u30.P_wait_2_7>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i3.u5.P_b_6_false>=1)&&(i1.i1.u35.P_wait_3_6>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i3.u5.P_b_6_false>=1)&&(i7.i1.u26.P_wait_1_6>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i0.i1.u50.P_wait_2_4>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i4.u6.P_b_7_false>=1)&&(i3.u43.P_wait_6_7>=1))&&(i3.u63.P_await_13_6>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i4.u69.P_wait_7_5>=1))&&(i4.u66.P_await_13_7>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i7.i1.u22.P_wait_1_2>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i2.i0.u59.P_wait_5_5>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i3.u41.P_wait_6_3>=1))&&(i3.u63.P_await_13_6>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i4.u44.P_wait_7_1>=1))&&(i4.u66.P_await_13_7>=1)))||(((i3.u5.P_b_6_false>=1)&&(i4.u45.P_wait_7_6>=1))&&(i4.u66.P_await_13_7>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i2.i1.u40.P_wait_5_4>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i3.u63.P_wait_6_2>=1))&&(i3.u63.P_await_13_6>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i1.i1.u32.P_wait_3_2>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i1.i1.u34.P_wait_3_5>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i8.i1.u53.P_wait_4_3>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i2.i1.u39.P_wait_5_1>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i4.u6.P_b_7_false>=1)&&(i7.i1.u47.P_wait_1_7>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i3.u5.P_b_6_false>=1)&&(i8.i1.u55.P_wait_4_6>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i7.i1.u23.P_wait_1_3>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i0.i1.u27.P_wait_2_1>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i0.i1.u28.P_wait_2_5>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i1.i0.u51.P_wait_3_3>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i7.i1.u21.P_wait_1_1>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i3.u62.P_wait_6_1>=1))&&(i3.u63.P_await_13_6>=1)))||(((i4.u6.P_b_7_false>=1)&&(i4.u46.P_wait_7_7>=1))&&(i4.u66.P_await_13_7>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i8.i1.u36.P_wait_4_1>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i8.i1.u37.P_wait_4_2>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i2.i1.u58.P_wait_5_3>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i8.i1.u54.P_wait_4_5>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i4.u67.P_wait_7_3>=1))&&(i4.u66.P_await_13_7>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i0.i0.u48.P_wait_2_2>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i3.u65.P_wait_6_5>=1))&&(i3.u63.P_await_13_6>=1)))||(((i4.u6.P_b_7_false>=1)&&(i2.i1.u61.P_wait_5_7>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i7.i1.u24.P_wait_1_4>=1))&&(i7.i1.u21.P_await_13_1>=1))))))) * !(E(!((((((((((((((((((((((((((((((((((((((((((((((((((((i3.u5.P_b_6_false>=1)&&(i0.i1.u29.P_wait_2_6>=1))&&(i0.i1.u27.P_await_13_2>=1))||(((i4.u6.P_b_7_false>=1)&&(i1.i1.u52.P_wait_3_7>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i1.i1.u33.P_wait_3_4>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i1.i1.u31.P_wait_3_1>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i4.u68.P_wait_7_4>=1))&&(i4.u66.P_await_13_7>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i0.i1.u49.P_wait_2_3>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i3.u5.P_b_6_false>=1)&&(i3.u42.P_wait_6_6>=1))&&(i3.u63.P_await_13_6>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i7.i1.u25.P_wait_1_5>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i4.u66.P_wait_7_2>=1))&&(i4.u66.P_await_13_7>=1)))||(((i3.u5.P_b_6_false>=1)&&(i2.i1.u60.P_wait_5_6>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i3.u64.P_wait_6_4>=1))&&(i3.u63.P_await_13_6>=1)))||(((i4.u6.P_b_7_false>=1)&&(i8.i1.u56.P_wait_4_7>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i2.i1.u57.P_wait_5_2>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i8.i0.u38.P_wait_4_4>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i4.u6.P_b_7_false>=1)&&(i0.i1.u30.P_wait_2_7>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i3.u5.P_b_6_false>=1)&&(i1.i1.u35.P_wait_3_6>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i3.u5.P_b_6_false>=1)&&(i7.i1.u26.P_wait_1_6>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i0.i1.u50.P_wait_2_4>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i4.u6.P_b_7_false>=1)&&(i3.u43.P_wait_6_7>=1))&&(i3.u63.P_await_13_6>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i4.u69.P_wait_7_5>=1))&&(i4.u66.P_await_13_7>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i7.i1.u22.P_wait_1_2>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i2.i0.u59.P_wait_5_5>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i3.u41.P_wait_6_3>=1))&&(i3.u63.P_await_13_6>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i4.u44.P_wait_7_1>=1))&&(i4.u66.P_await_13_7>=1)))||(((i3.u5.P_b_6_false>=1)&&(i4.u45.P_wait_7_6>=1))&&(i4.u66.P_await_13_7>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i2.i1.u40.P_wait_5_4>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i3.u63.P_wait_6_2>=1))&&(i3.u63.P_await_13_6>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i1.i1.u32.P_wait_3_2>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i1.i1.u34.P_wait_3_5>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i8.i1.u53.P_wait_4_3>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i2.i1.u39.P_wait_5_1>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i4.u6.P_b_7_false>=1)&&(i7.i1.u47.P_wait_1_7>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i3.u5.P_b_6_false>=1)&&(i8.i1.u55.P_wait_4_6>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i7.i1.u23.P_wait_1_3>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i0.i1.u27.P_wait_2_1>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i0.i1.u28.P_wait_2_5>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i1.i0.u51.P_wait_3_3>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i7.i1.u21.P_wait_1_1>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i3.u62.P_wait_6_1>=1))&&(i3.u63.P_await_13_6>=1)))||(((i4.u6.P_b_7_false>=1)&&(i4.u46.P_wait_7_7>=1))&&(i4.u66.P_await_13_7>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i8.i1.u36.P_wait_4_1>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i8.i1.u37.P_wait_4_2>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i2.i1.u58.P_wait_5_3>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i8.i1.u54.P_wait_4_5>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i4.u67.P_wait_7_3>=1))&&(i4.u66.P_await_13_7>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i0.i0.u48.P_wait_2_2>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i3.u65.P_wait_6_5>=1))&&(i3.u63.P_await_13_6>=1)))||(((i4.u6.P_b_7_false>=1)&&(i2.i1.u61.P_wait_5_7>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i7.i1.u24.P_wait_1_4>=1))&&(i7.i1.u21.P_await_13_1>=1)))) U (!((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i7.i0.u0.P_fordo_12_1<1)&&(i1.i0.u2.P_fordo_12_3<1))&&(i0.i0.u1.P_fordo_12_2<1))&&(i2.i0.u4.P_fordo_12_5<1))&&(i8.i0.u3.P_fordo_12_4<1))&&(i4.u6.P_fordo_12_7<1))&&(i3.u5.P_fordo_12_6<1))&&((i9.u82.y_0<1)||(i0.i0.u72.P_awaity_2<1)))&&((i9.u82.y_0<1)||(i1.i0.u73.P_awaity_3<1)))&&((i9.u82.y_0<1)||(i7.i0.u71.P_awaity_1<1)))&&((i9.u82.y_0<1)||(i3.u75.P_awaity_6<1)))&&((i9.u82.y_0<1)||(i4.u76.P_awaity_7<1)))&&((i9.u82.y_0<1)||(i8.i0.u74.P_awaity_4<1)))&&((i9.u82.y_0<1)||(i2.i0.u70.P_awaity_5<1)))&&((i9.u82.y_0<1)||(i1.i0.u73.P_ifyi_15_3<1)))&&((i2.i0.u19.y_5<1)||(i8.i0.u74.P_ifyi_15_4<1)))&&((i9.u82.y_0<1)||(i7.i0.u71.P_ifyi_15_1<1)))&&((i2.i0.u19.y_5<1)||(i3.u75.P_ifyi_15_6<1)))&&((i9.u82.y_0<1)||(i4.u76.P_ifyi_15_7<1)))&&((i9.u82.y_0<1)||(i2.i0.u70.P_ifyi_15_5<1)))&&((i9.u17.y_1<1)||(i4.u76.P_ifyi_15_7<1)))&&((i8.i0.u18.y_4<1)||(i0.i0.u72.P_ifyi_15_2<1)))&&((u20.y_6<1)||(i8.i0.u74.P_ifyi_15_4<1)))&&((u20.y_6<1)||(i0.i0.u72.P_ifyi_15_2<1)))&&((i0.i0.u14.y_2<1)||(i4.u76.P_ifyi_15_7<1)))&&((i9.u15.y_3<1)||(i0.i0.u72.P_ifyi_15_2<1)))&&((u16.y_7<1)||(i3.u75.P_ifyi_15_6<1)))&&((i9.u15.y_3<1)||(i8.i0.u74.P_ifyi_15_4<1)))&&((u16.y_7<1)||(i0.i0.u72.P_ifyi_15_2<1)))&&((u16.y_7<1)||(i8.i0.u74.P_ifyi_15_4<1)))&&((i9.u15.y_3<1)||(i3.u75.P_ifyi_15_6<1)))&&((i0.i0.u14.y_2<1)||(i2.i0.u70.P_ifyi_15_5<1)))&&((i0.i0.u14.y_2<1)||(i1.i0.u73.P_ifyi_15_3<1)))&&((i0.i0.u14.y_2<1)||(i7.i0.u71.P_ifyi_15_1<1)))&&((i8.i0.u18.y_4<1)||(i3.u75.P_ifyi_15_6<1)))&&((i9.u17.y_1<1)||(i1.i0.u73.P_ifyi_15_3<1)))&&((i9.u17.y_1<1)||(i2.i0.u70.P_ifyi_15_5<1)))&&((i2.i0.u19.y_5<1)||(i0.i0.u72.P_ifyi_15_2<1)))&&((i9.u82.y_0<1)||(i0.i0.u72.P_ifyi_15_2<1)))&&((i2.i0.u19.y_5<1)||(i1.i0.u73.P_ifyi_15_3<1)))&&((i9.u82.y_0<1)||(i3.u75.P_ifyi_15_6<1)))&&((i2.i0.u19.y_5<1)||(i4.u76.P_ifyi_15_7<1)))&&((i9.u82.y_0<1)||(i8.i0.u74.P_ifyi_15_4<1)))&&((u20.y_6<1)||(i4.u76.P_ifyi_15_7<1)))&&((i8.i0.u18.y_4<1)||(i1.i0.u73.P_ifyi_15_3<1)))&&((u20.y_6<1)||(i2.i0.u70.P_ifyi_15_5<1)))&&((i8.i0.u18.y_4<1)||(i7.i0.u71.P_ifyi_15_1<1)))&&((u20.y_6<1)||(i1.i0.u73.P_ifyi_15_3<1)))&&((i0.i0.u14.y_2<1)||(i3.u75.P_ifyi_15_6<1)))&&((i9.u15.y_3<1)||(i7.i0.u71.P_ifyi_15_1<1)))&&((u16.y_7<1)||(i2.i0.u70.P_ifyi_15_5<1)))&&((u16.y_7<1)||(i7.i0.u71.P_ifyi_15_1<1)))&&((u16.y_7<1)||(i1.i0.u73.P_ifyi_15_3<1)))&&((i9.u15.y_3<1)||(i2.i0.u70.P_ifyi_15_5<1)))&&((i9.u15.y_3<1)||(i4.u76.P_ifyi_15_7<1)))&&((i0.i0.u14.y_2<1)||(i8.i0.u74.P_ifyi_15_4<1)))&&((u20.y_6<1)||(i7.i0.u71.P_ifyi_15_1<1)))&&((i8.i0.u18.y_4<1)||(i4.u76.P_ifyi_15_7<1)))&&((i9.u17.y_1<1)||(i0.i0.u72.P_ifyi_15_2<1)))&&((i8.i0.u18.y_4<1)||(i2.i0.u70.P_ifyi_15_5<1)))&&((i9.u17.y_1<1)||(i8.i0.u74.P_ifyi_15_4<1)))&&((i9.u17.y_1<1)||(i3.u75.P_ifyi_15_6<1)))&&((i2.i0.u19.y_5<1)||(i7.i0.u71.P_ifyi_15_1<1)))) * !((((((((((((((((((((((((((((((((((((((((((((((((((((i3.u5.P_b_6_false>=1)&&(i0.i1.u29.P_wait_2_6>=1))&&(i0.i1.u27.P_await_13_2>=1))||(((i4.u6.P_b_7_false>=1)&&(i1.i1.u52.P_wait_3_7>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i1.i1.u33.P_wait_3_4>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i1.i1.u31.P_wait_3_1>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i4.u68.P_wait_7_4>=1))&&(i4.u66.P_await_13_7>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i0.i1.u49.P_wait_2_3>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i3.u5.P_b_6_false>=1)&&(i3.u42.P_wait_6_6>=1))&&(i3.u63.P_await_13_6>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i7.i1.u25.P_wait_1_5>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i4.u66.P_wait_7_2>=1))&&(i4.u66.P_await_13_7>=1)))||(((i3.u5.P_b_6_false>=1)&&(i2.i1.u60.P_wait_5_6>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i3.u64.P_wait_6_4>=1))&&(i3.u63.P_await_13_6>=1)))||(((i4.u6.P_b_7_false>=1)&&(i8.i1.u56.P_wait_4_7>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i2.i1.u57.P_wait_5_2>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i8.i0.u38.P_wait_4_4>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i4.u6.P_b_7_false>=1)&&(i0.i1.u30.P_wait_2_7>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i3.u5.P_b_6_false>=1)&&(i1.i1.u35.P_wait_3_6>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i3.u5.P_b_6_false>=1)&&(i7.i1.u26.P_wait_1_6>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i0.i1.u50.P_wait_2_4>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i4.u6.P_b_7_false>=1)&&(i3.u43.P_wait_6_7>=1))&&(i3.u63.P_await_13_6>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i4.u69.P_wait_7_5>=1))&&(i4.u66.P_await_13_7>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i7.i1.u22.P_wait_1_2>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i2.i0.u59.P_wait_5_5>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i3.u41.P_wait_6_3>=1))&&(i3.u63.P_await_13_6>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i4.u44.P_wait_7_1>=1))&&(i4.u66.P_await_13_7>=1)))||(((i3.u5.P_b_6_false>=1)&&(i4.u45.P_wait_7_6>=1))&&(i4.u66.P_await_13_7>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i2.i1.u40.P_wait_5_4>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i3.u63.P_wait_6_2>=1))&&(i3.u63.P_await_13_6>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i1.i1.u32.P_wait_3_2>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i1.i1.u34.P_wait_3_5>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i8.i1.u53.P_wait_4_3>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i2.i1.u39.P_wait_5_1>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i4.u6.P_b_7_false>=1)&&(i7.i1.u47.P_wait_1_7>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i3.u5.P_b_6_false>=1)&&(i8.i1.u55.P_wait_4_6>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i7.i1.u23.P_wait_1_3>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i0.i1.u27.P_wait_2_1>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i0.i1.u28.P_wait_2_5>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i1.i0.u51.P_wait_3_3>=1))&&(i1.i1.u31.P_await_13_3>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i7.i1.u21.P_wait_1_1>=1))&&(i7.i1.u21.P_await_13_1>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i3.u62.P_wait_6_1>=1))&&(i3.u63.P_await_13_6>=1)))||(((i4.u6.P_b_7_false>=1)&&(i4.u46.P_wait_7_7>=1))&&(i4.u66.P_await_13_7>=1)))||(((i7.i0.u0.P_b_1_false>=1)&&(i8.i1.u36.P_wait_4_1>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i8.i1.u37.P_wait_4_2>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i2.i1.u58.P_wait_5_3>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i8.i1.u54.P_wait_4_5>=1))&&(i8.i1.u36.P_await_13_4>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i4.u67.P_wait_7_3>=1))&&(i4.u66.P_await_13_7>=1)))||(((i0.i0.u1.P_b_2_false>=1)&&(i0.i0.u48.P_wait_2_2>=1))&&(i0.i1.u27.P_await_13_2>=1)))||(((i2.i0.u4.P_b_5_false>=1)&&(i3.u65.P_wait_6_5>=1))&&(i3.u63.P_await_13_6>=1)))||(((i4.u6.P_b_7_false>=1)&&(i2.i1.u61.P_wait_5_7>=1))&&(i2.i1.u39.P_await_13_5>=1)))||(((i8.i0.u3.P_b_4_false>=1)&&(i7.i1.u24.P_wait_1_4>=1))&&(i7.i1.u21.P_await_13_1>=1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions T_setbi_2_4, T_setx_3_11, T_setx_3_12, T_setx_3_13, T_setx_3_14, T_setx_3_15, T_setx_3_16, T_setx_3_18, T_setx_3_20, T_setx_3_21, T_setx_3_22, T_setx_3_23, T_setx_3_24, T_setx_3_26, T_setx_3_27, T_setx_3_29, T_setx_3_30, T_setx_3_31, T_setx_3_32, T_setx_3_34, T_setx_3_35, T_setx_3_36, T_setx_3_38, T_setx_3_39, T_setx_3_40, T_setx_3_42, T_setx_3_43, T_setx_3_44, T_setx_3_45, T_setx_3_47, T_setx_3_48, T_setx_3_50, T_setx_3_51, T_setx_3_52, T_setx_3_53, T_setx_3_54, T_setx_3_56, T_setx_3_58, T_setx_3_59, T_setx_3_60, T_setx_3_61, T_setx_3_62, T_setx_3_63, T_awaity_2, T_awaity_3, T_awaity_4, T_awaity_5, T_awaity_6, T_awaity_7, T_awaity_8, T_sety_9_17, T_sety_9_18, T_sety_9_21, T_sety_9_22, T_sety_9_23, T_sety_9_24, T_sety_9_27, T_sety_9_29, T_sety_9_30, T_sety_9_31, T_sety_9_32, T_sety_9_33, T_sety_9_34, T_sety_9_35, T_sety_9_38, T_sety_9_39, T_sety_9_40, T_sety_9_41, T_sety_9_42, T_sety_9_43, T_sety_9_45, T_sety_9_47, T_sety_9_48, T_sety_9_49, T_sety_9_50, T_sety_9_51, T_sety_9_53, T_sety_9_54, T_sety_9_56, T_sety_9_57, T_sety_9_58, T_sety_9_59, T_sety_9_61, T_sety_9_62, T_sety_9_63, T_setbi_11_3, T_setbi_11_8, T_setbi_11_13, T_setbi_11_16, T_ynei_15_9, T_ynei_15_11, T_ynei_15_12, T_ynei_15_13, T_ynei_15_14, T_ynei_15_15, T_ynei_15_16, T_ynei_15_17, T_ynei_15_18, T_ynei_15_20, T_ynei_15_21, T_ynei_15_22, T_ynei_15_23, T_ynei_15_24, T_ynei_15_25, T_ynei_15_26, T_ynei_15_27, T_ynei_15_29, T_ynei_15_30, T_ynei_15_31, T_ynei_15_32, T_ynei_15_33, T_ynei_15_34, T_ynei_15_35, T_ynei_15_36, T_ynei_15_38, T_ynei_15_39, T_ynei_15_40, T_ynei_15_41, T_ynei_15_42, T_ynei_15_43, T_ynei_15_44, T_ynei_15_45, T_ynei_15_47, T_ynei_15_48, T_ynei_15_49, T_ynei_15_50, T_ynei_15_51, T_ynei_15_52, T_ynei_15_53, T_ynei_15_54, T_ynei_15_56, T_ynei_15_57, T_ynei_15_58, T_ynei_15_59, T_ynei_15_60, T_ynei_15_61, T_ynei_15_62, T_ynei_15_63, T_yeqi_15_10, T_yeqi_15_28, T_yeqi_15_55, T_yeqi_15_64, T_sety0_23_11, T_sety0_23_13, T_sety0_23_14, T_sety0_23_15, T_sety0_23_16, T_sety0_23_18, T_sety0_23_19, T_sety0_23_21, T_sety0_23_22, T_sety0_23_23, T_sety0_23_24, T_sety0_23_27, T_sety0_23_29, T_sety0_23_30, T_sety0_23_31, T_sety0_23_32, T_sety0_23_34, T_sety0_23_35, T_sety0_23_37, T_sety0_23_38, T_sety0_23_39, T_sety0_23_40, T_sety0_23_42, T_sety0_23_43, T_sety0_23_45, T_sety0_23_46, T_sety0_23_47, T_sety0_23_48, T_sety0_23_50, T_sety0_23_51, T_sety0_23_53, T_sety0_23_54, T_sety0_23_55, T_sety0_23_56, T_sety0_23_58, T_sety0_23_59, T_sety0_23_61, T_sety0_23_62, T_sety0_23_63, T_sety0_23_64, T_setbi_24_3, T_setbi_24_4, T_setbi_24_8, i0.i0.T_setbi_2_6, i0.i0.T_setbi_5_6, i0.i0.T_setbi_11_6, i0.i0.T_yeqi_15_19, i0.i0.T_setbi_24_6, i0.i0.u11.T_setx_3_17, i0.i0.u11.T_setx_3_19, i1.i0.T_setbi_2_8, i1.i0.T_setbi_5_8, i1.i0.u12.T_setx_3_28, i2.i0.T_setbi_2_11, i2.i0.T_setbi_5_12, i2.i0.T_setbi_11_12, i2.i0.T_yeqi_15_46, i2.i0.T_setbi_24_11, i2.i0.u9.T_setx_3_46, i3.T_setbi_24_14, i3.T_setbi_5_14, i3.T_setbi_2_13, i3.u10.T_setx_3_55, i4.T_setbi_24_16, i4.T_setbi_5_16, i4.T_setbi_2_15, i4.u13.T_setx_3_64, i7.i0.T_setbi_5_4, i7.i0.u7.T_setx_3_10, i8.i0.T_setbi_2_9, i8.i0.T_setbi_5_10, i8.i0.T_setbi_11_10, i8.i0.T_yeqi_15_37, i8.i0.T_setbi_24_10, i8.i0.u8.T_setx_3_37, i9.T_sety0_23_28, i9.T_sety0_23_26, i9.T_sety0_23_12, i9.T_sety0_23_10, i9.T_sety_9_26, i9.T_sety_9_25, i9.T_sety_9_12, i9.T_sety_9_9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :29/161/225/415
Detected timeout of ITS tools.
[2020-05-16 02:28:39] [INFO ] Flatten gal took : 55 ms
[2020-05-16 02:28:39] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 12 ms
[2020-05-16 02:28:39] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 3 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, --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/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
Detected timeout of ITS tools.
[2020-05-16 02:49:06] [INFO ] Flatten gal took : 310 ms
[2020-05-16 02:49:07] [INFO ] Input system was already deterministic with 462 transitions.
[2020-05-16 02:49:07] [INFO ] Transformed 219 places.
[2020-05-16 02:49:07] [INFO ] Transformed 462 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-16 02:49:07] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 2 ms
[2020-05-16 02:49:07] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 20 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, --load-order, /home/mcc/execution/model.ord, --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/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

--------------------
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="LamportFastMutEx-PT-7"
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 LamportFastMutEx-PT-7, 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 r096-oct2-158940145400684"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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