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-158940145400660.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-4, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940145400660
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.6K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 8.9K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.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 110K 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-4-CTLFireability-00
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-01
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-02
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-03
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-04
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-05
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-06
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-07
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-08
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-09
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-10
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-11
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-12
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-13
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-14
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589593089793

[2020-05-16 01:38:12] [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 01:38:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 01:38:12] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2020-05-16 01:38:12] [INFO ] Transformed 135 places.
[2020-05-16 01:38:12] [INFO ] Transformed 230 transitions.
[2020-05-16 01:38:12] [INFO ] Parsed PT model containing 135 places and 230 transitions in 162 ms.
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 50 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 77 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 394 ms. (steps per millisecond=253 ) properties seen :[1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1]
[2020-05-16 01:38:13] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2020-05-16 01:38:13] [INFO ] Computed 26 place invariants in 6 ms
[2020-05-16 01:38:13] [INFO ] [Real]Absence check using 26 positive place invariants in 21 ms returned sat
[2020-05-16 01:38:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:13] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2020-05-16 01:38:13] [INFO ] State equation strengthened by 48 read => feed constraints.
[2020-05-16 01:38:13] [INFO ] [Real]Added 48 Read/Feed constraints in 37 ms returned sat
[2020-05-16 01:38:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:38:13] [INFO ] [Nat]Absence check using 26 positive place invariants in 27 ms returned sat
[2020-05-16 01:38:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:14] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2020-05-16 01:38:14] [INFO ] [Nat]Added 48 Read/Feed constraints in 20 ms returned sat
[2020-05-16 01:38:14] [INFO ] Deduced a trap composed of 11 places in 162 ms
[2020-05-16 01:38:14] [INFO ] Deduced a trap composed of 9 places in 87 ms
[2020-05-16 01:38:14] [INFO ] Deduced a trap composed of 19 places in 144 ms
[2020-05-16 01:38:14] [INFO ] Deduced a trap composed of 14 places in 57 ms
[2020-05-16 01:38:14] [INFO ] Deduced a trap composed of 13 places in 141 ms
[2020-05-16 01:38:14] [INFO ] Deduced a trap composed of 14 places in 49 ms
[2020-05-16 01:38:14] [INFO ] Deduced a trap composed of 17 places in 32 ms
[2020-05-16 01:38:14] [INFO ] Deduced a trap composed of 17 places in 51 ms
[2020-05-16 01:38:14] [INFO ] Deduced a trap composed of 13 places in 49 ms
[2020-05-16 01:38:15] [INFO ] Deduced a trap composed of 17 places in 75 ms
[2020-05-16 01:38:15] [INFO ] Deduced a trap composed of 9 places in 23 ms
[2020-05-16 01:38:15] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 959 ms
[2020-05-16 01:38:15] [INFO ] Computed and/alt/rep : 176/848/140 causal constraints in 11 ms.
[2020-05-16 01:38:15] [INFO ] Added : 130 causal constraints over 27 iterations in 465 ms. Result :sat
[2020-05-16 01:38:15] [INFO ] [Real]Absence check using 26 positive place invariants in 159 ms returned sat
[2020-05-16 01:38:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:15] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2020-05-16 01:38:15] [INFO ] [Real]Added 48 Read/Feed constraints in 15 ms returned sat
[2020-05-16 01:38:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:38:15] [INFO ] [Nat]Absence check using 26 positive place invariants in 10 ms returned sat
[2020-05-16 01:38:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:15] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2020-05-16 01:38:16] [INFO ] [Nat]Added 48 Read/Feed constraints in 5 ms returned sat
[2020-05-16 01:38:16] [INFO ] Deduced a trap composed of 14 places in 53 ms
[2020-05-16 01:38:16] [INFO ] Deduced a trap composed of 14 places in 106 ms
[2020-05-16 01:38:16] [INFO ] Deduced a trap composed of 22 places in 141 ms
[2020-05-16 01:38:16] [INFO ] Deduced a trap composed of 16 places in 497 ms
[2020-05-16 01:38:17] [INFO ] Deduced a trap composed of 14 places in 178 ms
[2020-05-16 01:38:17] [INFO ] Deduced a trap composed of 8 places in 426 ms
[2020-05-16 01:38:17] [INFO ] Deduced a trap composed of 23 places in 68 ms
[2020-05-16 01:38:17] [INFO ] Deduced a trap composed of 20 places in 42 ms
[2020-05-16 01:38:17] [INFO ] Deduced a trap composed of 18 places in 51 ms
[2020-05-16 01:38:17] [INFO ] Deduced a trap composed of 8 places in 13 ms
[2020-05-16 01:38:17] [INFO ] Deduced a trap composed of 26 places in 35 ms
[2020-05-16 01:38:17] [INFO ] Deduced a trap composed of 13 places in 49 ms
[2020-05-16 01:38:17] [INFO ] Deduced a trap composed of 8 places in 14 ms
[2020-05-16 01:38:19] [INFO ] Deduced a trap composed of 15 places in 1616 ms
[2020-05-16 01:38:20] [INFO ] Deduced a trap composed of 14 places in 659 ms
[2020-05-16 01:38:20] [INFO ] Deduced a trap composed of 9 places in 54 ms
[2020-05-16 01:38:20] [INFO ] Deduced a trap composed of 13 places in 35 ms
[2020-05-16 01:38:20] [INFO ] Deduced a trap composed of 14 places in 418 ms
[2020-05-16 01:38:21] [INFO ] Deduced a trap composed of 9 places in 334 ms
[2020-05-16 01:38:21] [INFO ] Deduced a trap composed of 13 places in 532 ms
[2020-05-16 01:38:21] [INFO ] Deduced a trap composed of 23 places in 26 ms
[2020-05-16 01:38:22] [INFO ] Deduced a trap composed of 18 places in 757 ms
[2020-05-16 01:38:22] [INFO ] Deduced a trap composed of 14 places in 67 ms
[2020-05-16 01:38:22] [INFO ] Deduced a trap composed of 18 places in 41 ms
[2020-05-16 01:38:22] [INFO ] Deduced a trap composed of 13 places in 24 ms
[2020-05-16 01:38:22] [INFO ] Deduced a trap composed of 8 places in 19 ms
[2020-05-16 01:38:22] [INFO ] Deduced a trap composed of 25 places in 65 ms
[2020-05-16 01:38:22] [INFO ] Deduced a trap composed of 14 places in 80 ms
[2020-05-16 01:38:22] [INFO ] Deduced a trap composed of 22 places in 42 ms
[2020-05-16 01:38:23] [INFO ] Deduced a trap composed of 15 places in 112 ms
[2020-05-16 01:38:23] [INFO ] Deduced a trap composed of 17 places in 44 ms
[2020-05-16 01:38:23] [INFO ] Deduced a trap composed of 22 places in 44 ms
[2020-05-16 01:38:23] [INFO ] Deduced a trap composed of 14 places in 45 ms
[2020-05-16 01:38:23] [INFO ] Deduced a trap composed of 13 places in 44 ms
[2020-05-16 01:38:23] [INFO ] Deduced a trap composed of 13 places in 56 ms
[2020-05-16 01:38:23] [INFO ] Deduced a trap composed of 9 places in 135 ms
[2020-05-16 01:38:23] [INFO ] Deduced a trap composed of 14 places in 90 ms
[2020-05-16 01:38:23] [INFO ] Deduced a trap composed of 16 places in 41 ms
[2020-05-16 01:38:23] [INFO ] Deduced a trap composed of 21 places in 68 ms
[2020-05-16 01:38:23] [INFO ] Deduced a trap composed of 13 places in 42 ms
[2020-05-16 01:38:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 40 trap constraints in 7725 ms
[2020-05-16 01:38:23] [INFO ] [Real]Absence check using 26 positive place invariants in 29 ms returned sat
[2020-05-16 01:38:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:23] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2020-05-16 01:38:23] [INFO ] [Real]Added 48 Read/Feed constraints in 13 ms returned sat
[2020-05-16 01:38:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:38:23] [INFO ] [Nat]Absence check using 26 positive place invariants in 21 ms returned sat
[2020-05-16 01:38:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:23] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2020-05-16 01:38:23] [INFO ] [Nat]Added 48 Read/Feed constraints in 8 ms returned sat
[2020-05-16 01:38:24] [INFO ] Deduced a trap composed of 9 places in 56 ms
[2020-05-16 01:38:24] [INFO ] Deduced a trap composed of 11 places in 62 ms
[2020-05-16 01:38:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 151 ms
[2020-05-16 01:38:24] [INFO ] [Real]Absence check using 26 positive place invariants in 11 ms returned sat
[2020-05-16 01:38:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:24] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2020-05-16 01:38:24] [INFO ] [Real]Added 48 Read/Feed constraints in 8 ms returned sat
[2020-05-16 01:38:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:38:24] [INFO ] [Nat]Absence check using 26 positive place invariants in 7 ms returned sat
[2020-05-16 01:38:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:24] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2020-05-16 01:38:24] [INFO ] [Nat]Added 48 Read/Feed constraints in 5 ms returned sat
[2020-05-16 01:38:24] [INFO ] Deduced a trap composed of 8 places in 108 ms
[2020-05-16 01:38:24] [INFO ] Deduced a trap composed of 10 places in 74 ms
[2020-05-16 01:38:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 204 ms
[2020-05-16 01:38:24] [INFO ] [Real]Absence check using 26 positive place invariants in 30 ms returned sat
[2020-05-16 01:38:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:24] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2020-05-16 01:38:24] [INFO ] [Real]Added 48 Read/Feed constraints in 9 ms returned sat
[2020-05-16 01:38:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:38:24] [INFO ] [Nat]Absence check using 26 positive place invariants in 157 ms returned sat
[2020-05-16 01:38:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:25] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2020-05-16 01:38:25] [INFO ] [Nat]Added 48 Read/Feed constraints in 6 ms returned sat
[2020-05-16 01:38:25] [INFO ] Deduced a trap composed of 9 places in 54 ms
[2020-05-16 01:38:25] [INFO ] Deduced a trap composed of 19 places in 74 ms
[2020-05-16 01:38:26] [INFO ] Deduced a trap composed of 9 places in 1696 ms
[2020-05-16 01:38:27] [INFO ] Deduced a trap composed of 13 places in 859 ms
[2020-05-16 01:38:28] [INFO ] Deduced a trap composed of 15 places in 323 ms
[2020-05-16 01:38:28] [INFO ] Deduced a trap composed of 12 places in 61 ms
[2020-05-16 01:38:28] [INFO ] Deduced a trap composed of 12 places in 627 ms
[2020-05-16 01:38:28] [INFO ] Deduced a trap composed of 12 places in 63 ms
[2020-05-16 01:38:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 3869 ms
[2020-05-16 01:38:28] [INFO ] [Real]Absence check using 26 positive place invariants in 10 ms returned sat
[2020-05-16 01:38:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:29] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2020-05-16 01:38:29] [INFO ] [Real]Added 48 Read/Feed constraints in 7 ms returned sat
[2020-05-16 01:38:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:38:29] [INFO ] [Nat]Absence check using 26 positive place invariants in 12 ms returned sat
[2020-05-16 01:38:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:29] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2020-05-16 01:38:29] [INFO ] [Nat]Added 48 Read/Feed constraints in 9 ms returned sat
[2020-05-16 01:38:29] [INFO ] Deduced a trap composed of 11 places in 35 ms
[2020-05-16 01:38:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2020-05-16 01:38:29] [INFO ] [Real]Absence check using 26 positive place invariants in 6 ms returned sat
[2020-05-16 01:38:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:29] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2020-05-16 01:38:29] [INFO ] [Real]Added 48 Read/Feed constraints in 5 ms returned sat
[2020-05-16 01:38:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:38:29] [INFO ] [Nat]Absence check using 26 positive place invariants in 12 ms returned sat
[2020-05-16 01:38:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:29] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2020-05-16 01:38:29] [INFO ] [Nat]Added 48 Read/Feed constraints in 8 ms returned sat
[2020-05-16 01:38:29] [INFO ] Deduced a trap composed of 6 places in 109 ms
[2020-05-16 01:38:29] [INFO ] Deduced a trap composed of 8 places in 81 ms
[2020-05-16 01:38:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 222 ms
[2020-05-16 01:38:29] [INFO ] [Real]Absence check using 26 positive place invariants in 186 ms returned sat
[2020-05-16 01:38:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:30] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2020-05-16 01:38:30] [INFO ] [Real]Added 48 Read/Feed constraints in 17 ms returned sat
[2020-05-16 01:38:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:38:30] [INFO ] [Nat]Absence check using 26 positive place invariants in 9 ms returned sat
[2020-05-16 01:38:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:30] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2020-05-16 01:38:30] [INFO ] [Nat]Added 48 Read/Feed constraints in 8 ms returned sat
[2020-05-16 01:38:30] [INFO ] Deduced a trap composed of 6 places in 45 ms
[2020-05-16 01:38:30] [INFO ] Deduced a trap composed of 6 places in 54 ms
[2020-05-16 01:38:30] [INFO ] Deduced a trap composed of 8 places in 65 ms
[2020-05-16 01:38:30] [INFO ] Deduced a trap composed of 7 places in 55 ms
[2020-05-16 01:38:30] [INFO ] Deduced a trap composed of 6 places in 59 ms
[2020-05-16 01:38:30] [INFO ] Deduced a trap composed of 8 places in 303 ms
[2020-05-16 01:38:30] [INFO ] Deduced a trap composed of 16 places in 43 ms
[2020-05-16 01:38:30] [INFO ] Deduced a trap composed of 10 places in 70 ms
[2020-05-16 01:38:31] [INFO ] Deduced a trap composed of 11 places in 45 ms
[2020-05-16 01:38:31] [INFO ] Deduced a trap composed of 8 places in 805 ms
[2020-05-16 01:38:32] [INFO ] Deduced a trap composed of 6 places in 278 ms
[2020-05-16 01:38:32] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1927 ms
[2020-05-16 01:38:32] [INFO ] Computed and/alt/rep : 176/848/140 causal constraints in 9 ms.
[2020-05-16 01:38:32] [INFO ] Added : 20 causal constraints over 4 iterations in 63 ms. Result :unsat
[2020-05-16 01:38:32] [INFO ] [Real]Absence check using 26 positive place invariants in 16 ms returned sat
[2020-05-16 01:38:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:32] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2020-05-16 01:38:32] [INFO ] [Real]Added 48 Read/Feed constraints in 5 ms returned sat
[2020-05-16 01:38:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:38:32] [INFO ] [Nat]Absence check using 26 positive place invariants in 26 ms returned sat
[2020-05-16 01:38:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:32] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2020-05-16 01:38:32] [INFO ] [Nat]Added 48 Read/Feed constraints in 9 ms returned sat
[2020-05-16 01:38:32] [INFO ] Deduced a trap composed of 9 places in 61 ms
[2020-05-16 01:38:32] [INFO ] Deduced a trap composed of 10 places in 66 ms
[2020-05-16 01:38:32] [INFO ] Deduced a trap composed of 6 places in 184 ms
[2020-05-16 01:38:33] [INFO ] Deduced a trap composed of 6 places in 604 ms
[2020-05-16 01:38:34] [INFO ] Deduced a trap composed of 6 places in 761 ms
[2020-05-16 01:38:34] [INFO ] Deduced a trap composed of 9 places in 57 ms
[2020-05-16 01:38:34] [INFO ] Deduced a trap composed of 6 places in 48 ms
[2020-05-16 01:38:35] [INFO ] Deduced a trap composed of 9 places in 878 ms
[2020-05-16 01:38:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 2709 ms
[2020-05-16 01:38:35] [INFO ] [Real]Absence check using 26 positive place invariants in 6 ms returned sat
[2020-05-16 01:38:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:35] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-05-16 01:38:35] [INFO ] [Real]Added 48 Read/Feed constraints in 4 ms returned sat
[2020-05-16 01:38:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:38:35] [INFO ] [Nat]Absence check using 26 positive place invariants in 13 ms returned sat
[2020-05-16 01:38:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:35] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2020-05-16 01:38:35] [INFO ] [Nat]Added 48 Read/Feed constraints in 9 ms returned sat
[2020-05-16 01:38:35] [INFO ] Deduced a trap composed of 6 places in 50 ms
[2020-05-16 01:38:35] [INFO ] Deduced a trap composed of 6 places in 76 ms
[2020-05-16 01:38:35] [INFO ] Deduced a trap composed of 6 places in 109 ms
[2020-05-16 01:38:35] [INFO ] Deduced a trap composed of 6 places in 44 ms
[2020-05-16 01:38:35] [INFO ] Deduced a trap composed of 6 places in 41 ms
[2020-05-16 01:38:35] [INFO ] Deduced a trap composed of 17 places in 51 ms
[2020-05-16 01:38:35] [INFO ] Deduced a trap composed of 6 places in 53 ms
[2020-05-16 01:38:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 497 ms
[2020-05-16 01:38:36] [INFO ] [Real]Absence check using 26 positive place invariants in 57 ms returned sat
[2020-05-16 01:38:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:36] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2020-05-16 01:38:36] [INFO ] [Real]Added 48 Read/Feed constraints in 29 ms returned sat
[2020-05-16 01:38:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:38:36] [INFO ] [Nat]Absence check using 26 positive place invariants in 12 ms returned sat
[2020-05-16 01:38:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:36] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2020-05-16 01:38:36] [INFO ] [Nat]Added 48 Read/Feed constraints in 18 ms returned sat
[2020-05-16 01:38:36] [INFO ] Deduced a trap composed of 12 places in 85 ms
[2020-05-16 01:38:36] [INFO ] Deduced a trap composed of 10 places in 80 ms
[2020-05-16 01:38:36] [INFO ] Deduced a trap composed of 25 places in 115 ms
[2020-05-16 01:38:36] [INFO ] Deduced a trap composed of 24 places in 78 ms
[2020-05-16 01:38:36] [INFO ] Deduced a trap composed of 15 places in 44 ms
[2020-05-16 01:38:37] [INFO ] Deduced a trap composed of 9 places in 113 ms
[2020-05-16 01:38:37] [INFO ] Deduced a trap composed of 12 places in 490 ms
[2020-05-16 01:38:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 1057 ms
[2020-05-16 01:38:37] [INFO ] [Real]Absence check using 26 positive place invariants in 20 ms returned sat
[2020-05-16 01:38:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:37] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2020-05-16 01:38:37] [INFO ] [Real]Added 48 Read/Feed constraints in 6 ms returned sat
[2020-05-16 01:38:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:38:37] [INFO ] [Nat]Absence check using 26 positive place invariants in 12 ms returned sat
[2020-05-16 01:38:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:37] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2020-05-16 01:38:37] [INFO ] [Nat]Added 48 Read/Feed constraints in 8 ms returned sat
[2020-05-16 01:38:37] [INFO ] Deduced a trap composed of 12 places in 58 ms
[2020-05-16 01:38:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 74 ms
[2020-05-16 01:38:37] [INFO ] [Real]Absence check using 26 positive place invariants in 123 ms returned sat
[2020-05-16 01:38:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:38] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2020-05-16 01:38:38] [INFO ] [Real]Added 48 Read/Feed constraints in 5 ms returned sat
[2020-05-16 01:38:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:38:38] [INFO ] [Nat]Absence check using 26 positive place invariants in 8 ms returned sat
[2020-05-16 01:38:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:38] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2020-05-16 01:38:38] [INFO ] [Nat]Added 48 Read/Feed constraints in 8 ms returned sat
[2020-05-16 01:38:38] [INFO ] Deduced a trap composed of 9 places in 24 ms
[2020-05-16 01:38:38] [INFO ] Deduced a trap composed of 11 places in 64 ms
[2020-05-16 01:38:38] [INFO ] Deduced a trap composed of 12 places in 40 ms
[2020-05-16 01:38:38] [INFO ] Deduced a trap composed of 16 places in 28 ms
[2020-05-16 01:38:38] [INFO ] Deduced a trap composed of 11 places in 55 ms
[2020-05-16 01:38:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 312 ms
[2020-05-16 01:38:38] [INFO ] [Real]Absence check using 26 positive place invariants in 49 ms returned sat
[2020-05-16 01:38:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:38] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2020-05-16 01:38:38] [INFO ] [Real]Added 48 Read/Feed constraints in 5 ms returned sat
[2020-05-16 01:38:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:38:38] [INFO ] [Nat]Absence check using 26 positive place invariants in 12 ms returned sat
[2020-05-16 01:38:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:38] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2020-05-16 01:38:38] [INFO ] [Nat]Added 48 Read/Feed constraints in 8 ms returned sat
[2020-05-16 01:38:39] [INFO ] Deduced a trap composed of 17 places in 61 ms
[2020-05-16 01:38:39] [INFO ] Deduced a trap composed of 17 places in 58 ms
[2020-05-16 01:38:39] [INFO ] Deduced a trap composed of 10 places in 187 ms
[2020-05-16 01:38:39] [INFO ] Deduced a trap composed of 11 places in 18 ms
[2020-05-16 01:38:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 407 ms
[2020-05-16 01:38:39] [INFO ] [Real]Absence check using 26 positive place invariants in 187 ms returned sat
[2020-05-16 01:38:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:39] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2020-05-16 01:38:39] [INFO ] [Real]Added 48 Read/Feed constraints in 5 ms returned sat
[2020-05-16 01:38:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:38:39] [INFO ] [Nat]Absence check using 26 positive place invariants in 9 ms returned sat
[2020-05-16 01:38:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:39] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2020-05-16 01:38:39] [INFO ] [Nat]Added 48 Read/Feed constraints in 8 ms returned sat
[2020-05-16 01:38:39] [INFO ] Deduced a trap composed of 12 places in 42 ms
[2020-05-16 01:38:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2020-05-16 01:38:39] [INFO ] [Real]Absence check using 26 positive place invariants in 17 ms returned sat
[2020-05-16 01:38:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:39] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2020-05-16 01:38:39] [INFO ] [Real]Added 48 Read/Feed constraints in 5 ms returned sat
[2020-05-16 01:38:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:38:39] [INFO ] [Nat]Absence check using 26 positive place invariants in 13 ms returned sat
[2020-05-16 01:38:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:40] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2020-05-16 01:38:40] [INFO ] [Nat]Added 48 Read/Feed constraints in 7 ms returned sat
[2020-05-16 01:38:40] [INFO ] Deduced a trap composed of 20 places in 34 ms
[2020-05-16 01:38:40] [INFO ] Deduced a trap composed of 25 places in 546 ms
[2020-05-16 01:38:40] [INFO ] Deduced a trap composed of 12 places in 83 ms
[2020-05-16 01:38:41] [INFO ] Deduced a trap composed of 13 places in 540 ms
[2020-05-16 01:38:41] [INFO ] Deduced a trap composed of 10 places in 28 ms
[2020-05-16 01:38:41] [INFO ] Deduced a trap composed of 11 places in 30 ms
[2020-05-16 01:38:41] [INFO ] Deduced a trap composed of 9 places in 45 ms
[2020-05-16 01:38:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 1372 ms
[2020-05-16 01:38:41] [INFO ] [Real]Absence check using 26 positive place invariants in 28 ms returned sat
[2020-05-16 01:38:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:41] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2020-05-16 01:38:41] [INFO ] [Real]Added 48 Read/Feed constraints in 7 ms returned sat
[2020-05-16 01:38:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:38:41] [INFO ] [Nat]Absence check using 26 positive place invariants in 7 ms returned sat
[2020-05-16 01:38:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:41] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2020-05-16 01:38:41] [INFO ] [Nat]Added 48 Read/Feed constraints in 5 ms returned sat
[2020-05-16 01:38:41] [INFO ] Deduced a trap composed of 9 places in 108 ms
[2020-05-16 01:38:41] [INFO ] Deduced a trap composed of 19 places in 25 ms
[2020-05-16 01:38:42] [INFO ] Deduced a trap composed of 9 places in 772 ms
[2020-05-16 01:38:42] [INFO ] Deduced a trap composed of 13 places in 51 ms
[2020-05-16 01:38:42] [INFO ] Deduced a trap composed of 15 places in 46 ms
[2020-05-16 01:38:43] [INFO ] Deduced a trap composed of 12 places in 879 ms
[2020-05-16 01:38:43] [INFO ] Deduced a trap composed of 12 places in 29 ms
[2020-05-16 01:38:43] [INFO ] Deduced a trap composed of 12 places in 45 ms
[2020-05-16 01:38:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 2043 ms
[2020-05-16 01:38:43] [INFO ] [Real]Absence check using 26 positive place invariants in 11 ms returned sat
[2020-05-16 01:38:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:43] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2020-05-16 01:38:43] [INFO ] [Real]Added 48 Read/Feed constraints in 7 ms returned sat
[2020-05-16 01:38:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:38:44] [INFO ] [Nat]Absence check using 26 positive place invariants in 181 ms returned sat
[2020-05-16 01:38:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:38:44] [INFO ] [Nat]Absence check using state equation in 922 ms returned sat
[2020-05-16 01:38:44] [INFO ] [Nat]Added 48 Read/Feed constraints in 29 ms returned sat
[2020-05-16 01:38:45] [INFO ] Deduced a trap composed of 19 places in 38 ms
[2020-05-16 01:38:45] [INFO ] Deduced a trap composed of 22 places in 36 ms
[2020-05-16 01:38:46] [INFO ] Deduced a trap composed of 22 places in 1873 ms
[2020-05-16 01:38:47] [INFO ] Deduced a trap composed of 22 places in 27 ms
[2020-05-16 01:38:47] [INFO ] Deduced a trap composed of 15 places in 27 ms
[2020-05-16 01:38:47] [INFO ] Deduced a trap composed of 8 places in 27 ms
[2020-05-16 01:38:49] [INFO ] Deduced a trap composed of 22 places in 1879 ms
[2020-05-16 01:38:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4054 ms
[2020-05-16 01:38:49] [INFO ] Computed and/alt/rep : 176/848/140 causal constraints in 7 ms.
[2020-05-16 01:38:49] [INFO ] Added : 134 causal constraints over 27 iterations in 747 ms. Result :sat
Successfully simplified 16 atomic propositions for a total of 17 simplifications.
[2020-05-16 01:38:50] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-16 01:38:50] [INFO ] Flatten gal took : 132 ms
[2020-05-16 01:38:50] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-16 01:38:50] [INFO ] Flatten gal took : 23 ms
FORMULA LamportFastMutEx-PT-4-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-16 01:38:50] [INFO ] Applying decomposition
[2020-05-16 01:38:50] [INFO ] Flatten gal took : 11 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/graph154512444582209491.txt, -o, /tmp/graph154512444582209491.bin, -w, /tmp/graph154512444582209491.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/graph154512444582209491.bin, -l, -1, -v, -w, /tmp/graph154512444582209491.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-16 01:38:50] [INFO ] Decomposing Gal with order
[2020-05-16 01:38:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-16 01:38:50] [INFO ] Removed a total of 222 redundant transitions.
[2020-05-16 01:38:50] [INFO ] Flatten gal took : 91 ms
[2020-05-16 01:38:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 20 ms.
[2020-05-16 01:38:50] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 6 ms
[2020-05-16 01:38:50] [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], 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 11 CTL formulae.
built 25 ordering constraints for composite.
built 21 ordering constraints for composite.
built 18 ordering constraints for composite.
built 21 ordering constraints for composite.
built 10 ordering constraints for composite.
built 23 ordering constraints for composite.
built 33 ordering constraints for composite.
built 17 ordering constraints for composite.
built 16 ordering constraints for composite.
built 13 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91478e+06,3.08782,86584,1455,39,140938,369,485,279860,49,1289,0


Converting to forward existential form...Done !
original formula: AX(AG(((((((((((i5.i0.u0.P_b_1_false<1)||(i3.u8.P_setbi_11_1<1))&&((i1.i0.u2.P_b_3_false<1)||(u9.P_setbi_11_3<1)))&&((i5.i0.u0.P_b_1_true<1)||(i3.u8.P_setbi_11_1<1)))&&((i0.u1.P_b_2_false<1)||(i3.u10.P_setbi_11_2<1)))&&((i2.u3.P_b_4_true<1)||(u11.P_setbi_11_4<1)))&&((i0.u1.P_b_2_true<1)||(i3.u10.P_setbi_11_2<1)))&&((i1.i0.u2.P_b_3_true<1)||(u9.P_setbi_11_3<1)))&&((i2.u3.P_b_4_false<1)||(u11.P_setbi_11_4<1)))||((((((((((((((((((i1.i0.u2.P_b_3_false<1)||(i0.u14.P_wait_2_3<1))||(i0.u20.P_await_13_2<1))&&(((i1.i0.u2.P_b_3_false<1)||(i2.u17.P_wait_4_3<1))||(i2.u25.P_await_13_4<1)))&&(((i0.u1.P_b_2_false<1)||(i2.u26.P_wait_4_2<1))||(i2.u25.P_await_13_4<1)))&&(((i0.u1.P_b_2_false<1)||(i1.i1.u23.P_wait_3_2<1))||(i1.i1.u15.P_await_13_3<1)))&&(((i0.u1.P_b_2_false<1)||(i0.u21.P_wait_2_2<1))||(i0.u20.P_await_13_2<1)))&&(((i1.i0.u2.P_b_3_false<1)||(i5.i1.u12.P_wait_1_3<1))||(i5.i1.u18.P_await_13_1<1)))&&(((i2.u3.P_b_4_false<1)||(i1.i1.u24.P_wait_3_4<1))||(i1.i1.u15.P_await_13_3<1)))&&(((i2.u3.P_b_4_false<1)||(i5.i1.u13.P_wait_1_4<1))||(i5.i1.u18.P_await_13_1<1)))&&(((i2.u3.P_b_4_false<1)||(i0.u22.P_wait_2_4<1))||(i0.u20.P_await_13_2<1)))&&(((i2.u3.P_b_4_false<1)||(i2.u27.P_wait_4_4<1))||(i2.u25.P_await_13_4<1)))&&(((i5.i0.u0.P_b_1_false<1)||(i0.u20.P_wait_2_1<1))||(i0.u20.P_await_13_2<1)))&&(((i5.i0.u0.P_b_1_false<1)||(i1.i1.u15.P_wait_3_1<1))||(i1.i1.u15.P_await_13_3<1)))&&(((i5.i0.u0.P_b_1_false<1)||(i5.i1.u18.P_wait_1_1<1))||(i5.i1.u18.P_await_13_1<1)))&&(((i5.i0.u0.P_b_1_false<1)||(i2.u25.P_wait_4_1<1))||(i2.u25.P_await_13_4<1)))&&(((i0.u1.P_b_2_false<1)||(i5.i1.u19.P_wait_1_2<1))||(i5.i1.u18.P_await_13_1<1)))&&(((i1.i0.u2.P_b_3_false<1)||(i1.i0.u16.P_wait_3_3<1))||(i1.i1.u15.P_await_13_3<1))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(((((((((((i5.i0.u0.P_b_1_false<1)||(i3.u8.P_setbi_11_1<1))&&((i1.i0.u2.P_b_3_false<1)||(u9.P_setbi_11_3<1)))&&((i5.i0.u0.P_b_1_true<1)||(i3.u8.P_setbi_11_1<1)))&&((i0.u1.P_b_2_false<1)||(i3.u10.P_setbi_11_2<1)))&&((i2.u3.P_b_4_true<1)||(u11.P_setbi_11_4<1)))&&((i0.u1.P_b_2_true<1)||(i3.u10.P_setbi_11_2<1)))&&((i1.i0.u2.P_b_3_true<1)||(u9.P_setbi_11_3<1)))&&((i2.u3.P_b_4_false<1)||(u11.P_setbi_11_4<1)))||((((((((((((((((((i1.i0.u2.P_b_3_false<1)||(i0.u14.P_wait_2_3<1))||(i0.u20.P_await_13_2<1))&&(((i1.i0.u2.P_b_3_false<1)||(i2.u17.P_wait_4_3<1))||(i2.u25.P_await_13_4<1)))&&(((i0.u1.P_b_2_false<1)||(i2.u26.P_wait_4_2<1))||(i2.u25.P_await_13_4<1)))&&(((i0.u1.P_b_2_false<1)||(i1.i1.u23.P_wait_3_2<1))||(i1.i1.u15.P_await_13_3<1)))&&(((i0.u1.P_b_2_false<1)||(i0.u21.P_wait_2_2<1))||(i0.u20.P_await_13_2<1)))&&(((i1.i0.u2.P_b_3_false<1)||(i5.i1.u12.P_wait_1_3<1))||(i5.i1.u18.P_await_13_1<1)))&&(((i2.u3.P_b_4_false<1)||(i1.i1.u24.P_wait_3_4<1))||(i1.i1.u15.P_await_13_3<1)))&&(((i2.u3.P_b_4_false<1)||(i5.i1.u13.P_wait_1_4<1))||(i5.i1.u18.P_await_13_1<1)))&&(((i2.u3.P_b_4_false<1)||(i0.u22.P_wait_2_4<1))||(i0.u20.P_await_13_2<1)))&&(((i2.u3.P_b_4_false<1)||(i2.u27.P_wait_4_4<1))||(i2.u25.P_await_13_4<1)))&&(((i5.i0.u0.P_b_1_false<1)||(i0.u20.P_wait_2_1<1))||(i0.u20.P_await_13_2<1)))&&(((i5.i0.u0.P_b_1_false<1)||(i1.i1.u15.P_wait_3_1<1))||(i1.i1.u15.P_await_13_3<1)))&&(((i5.i0.u0.P_b_1_false<1)||(i5.i1.u18.P_wait_1_1<1))||(i5.i1.u18.P_await_13_1<1)))&&(((i5.i0.u0.P_b_1_false<1)||(i2.u25.P_wait_4_1<1))||(i2.u25.P_await_13_4<1)))&&(((i0.u1.P_b_2_false<1)||(i5.i1.u19.P_wait_1_2<1))||(i5.i1.u18.P_await_13_1<1)))&&(((i1.i0.u2.P_b_3_false<1)||(i1.i0.u16.P_wait_3_3<1))||(i1.i1.u15.P_await_13_3<1))))))] = FALSE
(forward)formula 0,0,5.09168,89152,1,0,147993,369,1208,288779,81,1376,398604
FORMULA LamportFastMutEx-PT-4-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((((((((((((((((((i3.u34.y_2>=1)&&(i5.i0.u28.P_ifyi_15_1>=1))||((i3.u34.y_2>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((i3.u34.y_0>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((i3.u34.y_0>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((i3.u34.y_2>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((u9.y_3>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((u9.y_3>=1)&&(i0.u29.P_ifyi_15_2>=1)))||((u9.y_3>=1)&&(i5.i0.u28.P_ifyi_15_1>=1)))||((i3.u8.y_1>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((i3.u8.y_1>=1)&&(i0.u29.P_ifyi_15_2>=1)))||((i3.u8.y_1>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((u11.y_4>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((i3.u34.y_0>=1)&&(i0.u29.P_ifyi_15_2>=1)))||((i3.u34.y_0>=1)&&(i5.i0.u28.P_ifyi_15_1>=1)))||((u11.y_4>=1)&&(i5.i0.u28.P_ifyi_15_1>=1)))||((u11.y_4>=1)&&(i0.u29.P_ifyi_15_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((((((((((((((((i3.u34.y_2>=1)&&(i5.i0.u28.P_ifyi_15_1>=1))||((i3.u34.y_2>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((i3.u34.y_0>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((i3.u34.y_0>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((i3.u34.y_2>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((u9.y_3>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((u9.y_3>=1)&&(i0.u29.P_ifyi_15_2>=1)))||((u9.y_3>=1)&&(i5.i0.u28.P_ifyi_15_1>=1)))||((i3.u8.y_1>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((i3.u8.y_1>=1)&&(i0.u29.P_ifyi_15_2>=1)))||((i3.u8.y_1>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((u11.y_4>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((i3.u34.y_0>=1)&&(i0.u29.P_ifyi_15_2>=1)))||((i3.u34.y_0>=1)&&(i5.i0.u28.P_ifyi_15_1>=1)))||((u11.y_4>=1)&&(i5.i0.u28.P_ifyi_15_1>=1)))||((u11.y_4>=1)&&(i0.u29.P_ifyi_15_2>=1))))] != FALSE
(forward)formula 1,1,5.11155,89680,1,0,148929,369,1283,290378,81,1376,401796
FORMULA LamportFastMutEx-PT-4-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((EF((((((((((((((((((((((i3.u8.y_1<1)||(i3.u8.P_sety_9_1<1))&&((i3.u8.y_1<1)||(i3.u10.P_sety_9_2<1)))&&((i3.u8.y_1<1)||(u9.P_sety_9_3<1)))&&((i3.u8.y_1<1)||(u11.P_sety_9_4<1)))&&((i3.u34.y_2<1)||(u11.P_sety_9_4<1)))&&((i3.u34.y_2<1)||(u9.P_sety_9_3<1)))&&((i3.u34.y_2<1)||(i3.u10.P_sety_9_2<1)))&&((i3.u34.y_2<1)||(i3.u8.P_sety_9_1<1)))&&((i3.u34.y_0<1)||(i3.u8.P_sety_9_1<1)))&&((i3.u34.y_0<1)||(u11.P_sety_9_4<1)))&&((i3.u34.y_0<1)||(i3.u10.P_sety_9_2<1)))&&((i3.u34.y_0<1)||(u9.P_sety_9_3<1)))&&((u11.y_4<1)||(u11.P_sety_9_4<1)))&&((u11.y_4<1)||(u9.P_sety_9_3<1)))&&((u11.y_4<1)||(i3.u10.P_sety_9_2<1)))&&((u11.y_4<1)||(i3.u8.P_sety_9_1<1)))&&((u9.y_3<1)||(u11.P_sety_9_4<1)))&&((u9.y_3<1)||(u9.P_sety_9_3<1)))&&((u9.y_3<1)||(i3.u10.P_sety_9_2<1)))&&((u9.y_3<1)||(i3.u8.P_sety_9_1<1)))) + AX(((((((((((((((((((i0.u5.x_2>=1)&&(u11.P_ifxi_10_4>=1))||((i2.u7.x_4>=1)&&(i3.u8.P_ifxi_10_1>=1)))||((i3.u10.x_0>=1)&&(i3.u10.P_ifxi_10_2>=1)))||((i3.u10.x_0>=1)&&(u9.P_ifxi_10_3>=1)))||((i3.u10.x_0>=1)&&(u11.P_ifxi_10_4>=1)))||((i2.u7.x_4>=1)&&(i3.u10.P_ifxi_10_2>=1)))||((i0.u5.x_2>=1)&&(i3.u8.P_ifxi_10_1>=1)))||((i2.u7.x_4>=1)&&(u9.P_ifxi_10_3>=1)))||((i3.u10.x_0>=1)&&(i3.u8.P_ifxi_10_1>=1)))||((i0.u5.x_2>=1)&&(u9.P_ifxi_10_3>=1)))||((i1.i0.u6.x_3>=1)&&(i3.u8.P_ifxi_10_1>=1)))||((i1.i0.u6.x_3>=1)&&(i3.u10.P_ifxi_10_2>=1)))||((i5.i0.u4.x_1>=1)&&(u9.P_ifxi_10_3>=1)))||((i5.i0.u4.x_1>=1)&&(u11.P_ifxi_10_4>=1)))||((i5.i0.u4.x_1>=1)&&(i3.u10.P_ifxi_10_2>=1)))||((i1.i0.u6.x_3>=1)&&(u11.P_ifxi_10_4>=1)))&&(((((((((((((((((i3.u8.y_1>=1)&&(i0.u5.P_ify0_4_2>=1))||((i3.u8.y_1>=1)&&(i1.i0.u6.P_ify0_4_3>=1)))||((i3.u8.y_1>=1)&&(i2.u7.P_ify0_4_4>=1)))||((u11.y_4>=1)&&(i0.u5.P_ify0_4_2>=1)))||((u11.y_4>=1)&&(i5.i0.u4.P_ify0_4_1>=1)))||((i3.u34.y_2>=1)&&(i1.i0.u6.P_ify0_4_3>=1)))||((i3.u34.y_2>=1)&&(i2.u7.P_ify0_4_4>=1)))||((i3.u34.y_2>=1)&&(i5.i0.u4.P_ify0_4_1>=1)))||((u11.y_4>=1)&&(i2.u7.P_ify0_4_4>=1)))||((i3.u34.y_2>=1)&&(i0.u5.P_ify0_4_2>=1)))||((u11.y_4>=1)&&(i1.i0.u6.P_ify0_4_3>=1)))||((u9.y_3>=1)&&(i2.u7.P_ify0_4_4>=1)))||((u9.y_3>=1)&&(i5.i0.u4.P_ify0_4_1>=1)))||((u9.y_3>=1)&&(i1.i0.u6.P_ify0_4_3>=1)))||((i3.u8.y_1>=1)&&(i5.i0.u4.P_ify0_4_1>=1)))||((u9.y_3>=1)&&(i0.u5.P_ify0_4_2>=1)))))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(E(TRUE U (((((((((((((((((((((i3.u8.y_1<1)||(i3.u8.P_sety_9_1<1))&&((i3.u8.y_1<1)||(i3.u10.P_sety_9_2<1)))&&((i3.u8.y_1<1)||(u9.P_sety_9_3<1)))&&((i3.u8.y_1<1)||(u11.P_sety_9_4<1)))&&((i3.u34.y_2<1)||(u11.P_sety_9_4<1)))&&((i3.u34.y_2<1)||(u9.P_sety_9_3<1)))&&((i3.u34.y_2<1)||(i3.u10.P_sety_9_2<1)))&&((i3.u34.y_2<1)||(i3.u8.P_sety_9_1<1)))&&((i3.u34.y_0<1)||(i3.u8.P_sety_9_1<1)))&&((i3.u34.y_0<1)||(u11.P_sety_9_4<1)))&&((i3.u34.y_0<1)||(i3.u10.P_sety_9_2<1)))&&((i3.u34.y_0<1)||(u9.P_sety_9_3<1)))&&((u11.y_4<1)||(u11.P_sety_9_4<1)))&&((u11.y_4<1)||(u9.P_sety_9_3<1)))&&((u11.y_4<1)||(i3.u10.P_sety_9_2<1)))&&((u11.y_4<1)||(i3.u8.P_sety_9_1<1)))&&((u9.y_3<1)||(u11.P_sety_9_4<1)))&&((u9.y_3<1)||(u9.P_sety_9_3<1)))&&((u9.y_3<1)||(i3.u10.P_sety_9_2<1)))&&((u9.y_3<1)||(i3.u8.P_sety_9_1<1))))))) * !(((((((((((((((((((i0.u5.x_2>=1)&&(u11.P_ifxi_10_4>=1))||((i2.u7.x_4>=1)&&(i3.u8.P_ifxi_10_1>=1)))||((i3.u10.x_0>=1)&&(i3.u10.P_ifxi_10_2>=1)))||((i3.u10.x_0>=1)&&(u9.P_ifxi_10_3>=1)))||((i3.u10.x_0>=1)&&(u11.P_ifxi_10_4>=1)))||((i2.u7.x_4>=1)&&(i3.u10.P_ifxi_10_2>=1)))||((i0.u5.x_2>=1)&&(i3.u8.P_ifxi_10_1>=1)))||((i2.u7.x_4>=1)&&(u9.P_ifxi_10_3>=1)))||((i3.u10.x_0>=1)&&(i3.u8.P_ifxi_10_1>=1)))||((i0.u5.x_2>=1)&&(u9.P_ifxi_10_3>=1)))||((i1.i0.u6.x_3>=1)&&(i3.u8.P_ifxi_10_1>=1)))||((i1.i0.u6.x_3>=1)&&(i3.u10.P_ifxi_10_2>=1)))||((i5.i0.u4.x_1>=1)&&(u9.P_ifxi_10_3>=1)))||((i5.i0.u4.x_1>=1)&&(u11.P_ifxi_10_4>=1)))||((i5.i0.u4.x_1>=1)&&(i3.u10.P_ifxi_10_2>=1)))||((i1.i0.u6.x_3>=1)&&(u11.P_ifxi_10_4>=1)))&&(((((((((((((((((i3.u8.y_1>=1)&&(i0.u5.P_ify0_4_2>=1))||((i3.u8.y_1>=1)&&(i1.i0.u6.P_ify0_4_3>=1)))||((i3.u8.y_1>=1)&&(i2.u7.P_ify0_4_4>=1)))||((u11.y_4>=1)&&(i0.u5.P_ify0_4_2>=1)))||((u11.y_4>=1)&&(i5.i0.u4.P_ify0_4_1>=1)))||((i3.u34.y_2>=1)&&(i1.i0.u6.P_ify0_4_3>=1)))||((i3.u34.y_2>=1)&&(i2.u7.P_ify0_4_4>=1)))||((i3.u34.y_2>=1)&&(i5.i0.u4.P_ify0_4_1>=1)))||((u11.y_4>=1)&&(i2.u7.P_ify0_4_4>=1)))||((i3.u34.y_2>=1)&&(i0.u5.P_ify0_4_2>=1)))||((u11.y_4>=1)&&(i1.i0.u6.P_ify0_4_3>=1)))||((u9.y_3>=1)&&(i2.u7.P_ify0_4_4>=1)))||((u9.y_3>=1)&&(i5.i0.u4.P_ify0_4_1>=1)))||((u9.y_3>=1)&&(i1.i0.u6.P_ify0_4_3>=1)))||((i3.u8.y_1>=1)&&(i5.i0.u4.P_ify0_4_1>=1)))||((u9.y_3>=1)&&(i0.u5.P_ify0_4_2>=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions T_setx_3_6, T_setx_3_8, T_setx_3_9, T_setx_3_10, T_setx_3_11, T_setx_3_12, T_setx_3_14, T_setx_3_15, T_setx_3_16, T_setx_3_17, 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_awaity_2, T_awaity_3, T_awaity_4, T_awaity_5, T_sety_9_9, T_sety_9_10, T_sety_9_14, T_sety_9_15, T_sety_9_16, T_sety_9_17, T_sety_9_20, T_sety_9_21, T_sety_9_22, T_sety_9_24, T_setbi_11_3, T_setbi_11_6, T_setbi_11_8, T_setbi_11_10, T_ynei_15_6, T_ynei_15_8, T_ynei_15_9, T_ynei_15_10, T_ynei_15_11, T_ynei_15_12, 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_yeqi_15_7, T_yeqi_15_13, T_yeqi_15_19, T_yeqi_15_25, T_sety0_23_9, T_sety0_23_10, T_sety0_23_17, T_sety0_23_18, T_sety0_23_19, T_sety0_23_20, T_sety0_23_22, T_sety0_23_23, T_sety0_23_24, T_sety0_23_25, T_setbi_24_4, T_setbi_24_6, i0.T_setbi_5_6, i0.T_setbi_2_6, i0.u5.T_setx_3_13, i1.i0.T_setbi_2_8, i1.i0.T_setbi_5_8, i1.i0.T_setbi_24_7, i1.i0.u6.T_setx_3_19, i2.T_setbi_24_10, i2.T_setbi_5_10, i2.T_setbi_2_9, i2.u7.T_setx_3_25, i3.T_sety0_23_12, i3.T_sety0_23_8, i3.T_sety0_23_7, i3.T_sety_9_12, i3.T_sety_9_11, i3.T_sety_9_8, i3.u34.T_sety0_23_13, i5.i0.T_setbi_2_4, i5.i0.T_setbi_5_4, i5.i0.u4.T_setx_3_7, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :20/56/87/163
(forward)formula 2,1,6.42314,133240,1,0,221793,507,2999,473413,208,2346,582366
FORMULA LamportFastMutEx-PT-4-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(EF(((((((((((((((((((i1.i0.u2.P_b_3_false>=1)&&(i0.u14.P_wait_2_3>=1))&&(i0.u20.P_await_13_2>=1))||(((i1.i0.u2.P_b_3_false>=1)&&(i2.u17.P_wait_4_3>=1))&&(i2.u25.P_await_13_4>=1)))||(((i0.u1.P_b_2_false>=1)&&(i2.u26.P_wait_4_2>=1))&&(i2.u25.P_await_13_4>=1)))||(((i0.u1.P_b_2_false>=1)&&(i1.i1.u23.P_wait_3_2>=1))&&(i1.i1.u15.P_await_13_3>=1)))||(((i0.u1.P_b_2_false>=1)&&(i0.u21.P_wait_2_2>=1))&&(i0.u20.P_await_13_2>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i5.i1.u12.P_wait_1_3>=1))&&(i5.i1.u18.P_await_13_1>=1)))||(((i2.u3.P_b_4_false>=1)&&(i1.i1.u24.P_wait_3_4>=1))&&(i1.i1.u15.P_await_13_3>=1)))||(((i2.u3.P_b_4_false>=1)&&(i5.i1.u13.P_wait_1_4>=1))&&(i5.i1.u18.P_await_13_1>=1)))||(((i2.u3.P_b_4_false>=1)&&(i0.u22.P_wait_2_4>=1))&&(i0.u20.P_await_13_2>=1)))||(((i2.u3.P_b_4_false>=1)&&(i2.u27.P_wait_4_4>=1))&&(i2.u25.P_await_13_4>=1)))||(((i5.i0.u0.P_b_1_false>=1)&&(i0.u20.P_wait_2_1>=1))&&(i0.u20.P_await_13_2>=1)))||(((i5.i0.u0.P_b_1_false>=1)&&(i1.i1.u15.P_wait_3_1>=1))&&(i1.i1.u15.P_await_13_3>=1)))||(((i5.i0.u0.P_b_1_false>=1)&&(i5.i1.u18.P_wait_1_1>=1))&&(i5.i1.u18.P_await_13_1>=1)))||(((i5.i0.u0.P_b_1_false>=1)&&(i2.u25.P_wait_4_1>=1))&&(i2.u25.P_await_13_4>=1)))||(((i0.u1.P_b_2_false>=1)&&(i5.i1.u19.P_wait_1_2>=1))&&(i5.i1.u18.P_await_13_1>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i1.i0.u16.P_wait_3_3>=1))&&(i1.i1.u15.P_await_13_3>=1)))) U (((((((((((((((((i3.u34.y_2>=1)&&(i5.i0.u28.P_ifyi_15_1>=1))||((i3.u34.y_2>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((i3.u34.y_0>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((i3.u34.y_0>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((i3.u34.y_2>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((u9.y_3>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((u9.y_3>=1)&&(i0.u29.P_ifyi_15_2>=1)))||((u9.y_3>=1)&&(i5.i0.u28.P_ifyi_15_1>=1)))||((i3.u8.y_1>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((i3.u8.y_1>=1)&&(i0.u29.P_ifyi_15_2>=1)))||((i3.u8.y_1>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((u11.y_4>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((i3.u34.y_0>=1)&&(i0.u29.P_ifyi_15_2>=1)))||((i3.u34.y_0>=1)&&(i5.i0.u28.P_ifyi_15_1>=1)))||((u11.y_4>=1)&&(i5.i0.u28.P_ifyi_15_1>=1)))||((u11.y_4>=1)&&(i0.u29.P_ifyi_15_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U ((((((((((((((((((i1.i0.u2.P_b_3_false>=1)&&(i0.u14.P_wait_2_3>=1))&&(i0.u20.P_await_13_2>=1))||(((i1.i0.u2.P_b_3_false>=1)&&(i2.u17.P_wait_4_3>=1))&&(i2.u25.P_await_13_4>=1)))||(((i0.u1.P_b_2_false>=1)&&(i2.u26.P_wait_4_2>=1))&&(i2.u25.P_await_13_4>=1)))||(((i0.u1.P_b_2_false>=1)&&(i1.i1.u23.P_wait_3_2>=1))&&(i1.i1.u15.P_await_13_3>=1)))||(((i0.u1.P_b_2_false>=1)&&(i0.u21.P_wait_2_2>=1))&&(i0.u20.P_await_13_2>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i5.i1.u12.P_wait_1_3>=1))&&(i5.i1.u18.P_await_13_1>=1)))||(((i2.u3.P_b_4_false>=1)&&(i1.i1.u24.P_wait_3_4>=1))&&(i1.i1.u15.P_await_13_3>=1)))||(((i2.u3.P_b_4_false>=1)&&(i5.i1.u13.P_wait_1_4>=1))&&(i5.i1.u18.P_await_13_1>=1)))||(((i2.u3.P_b_4_false>=1)&&(i0.u22.P_wait_2_4>=1))&&(i0.u20.P_await_13_2>=1)))||(((i2.u3.P_b_4_false>=1)&&(i2.u27.P_wait_4_4>=1))&&(i2.u25.P_await_13_4>=1)))||(((i5.i0.u0.P_b_1_false>=1)&&(i0.u20.P_wait_2_1>=1))&&(i0.u20.P_await_13_2>=1)))||(((i5.i0.u0.P_b_1_false>=1)&&(i1.i1.u15.P_wait_3_1>=1))&&(i1.i1.u15.P_await_13_3>=1)))||(((i5.i0.u0.P_b_1_false>=1)&&(i5.i1.u18.P_wait_1_1>=1))&&(i5.i1.u18.P_await_13_1>=1)))||(((i5.i0.u0.P_b_1_false>=1)&&(i2.u25.P_wait_4_1>=1))&&(i2.u25.P_await_13_4>=1)))||(((i0.u1.P_b_2_false>=1)&&(i5.i1.u19.P_wait_1_2>=1))&&(i5.i1.u18.P_await_13_1>=1)))||(((i1.i0.u2.P_b_3_false>=1)&&(i1.i0.u16.P_wait_3_3>=1))&&(i1.i1.u15.P_await_13_3>=1))))) * (((((((((((((((((i3.u34.y_2>=1)&&(i5.i0.u28.P_ifyi_15_1>=1))||((i3.u34.y_2>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((i3.u34.y_0>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((i3.u34.y_0>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((i3.u34.y_2>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((u9.y_3>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((u9.y_3>=1)&&(i0.u29.P_ifyi_15_2>=1)))||((u9.y_3>=1)&&(i5.i0.u28.P_ifyi_15_1>=1)))||((i3.u8.y_1>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((i3.u8.y_1>=1)&&(i0.u29.P_ifyi_15_2>=1)))||((i3.u8.y_1>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((u11.y_4>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((i3.u34.y_0>=1)&&(i0.u29.P_ifyi_15_2>=1)))||((i3.u34.y_0>=1)&&(i5.i0.u28.P_ifyi_15_1>=1)))||((u11.y_4>=1)&&(i5.i0.u28.P_ifyi_15_1>=1)))||((u11.y_4>=1)&&(i0.u29.P_ifyi_15_2>=1))))] != FALSE
(forward)formula 3,1,8.08785,195016,1,0,322390,510,3181,759309,210,2360,765924
FORMULA LamportFastMutEx-PT-4-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((((((((((((((((((i3.u34.y_2>=1)&&(i5.i0.u28.P_ifyi_15_1>=1))||((i3.u34.y_2>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((i3.u34.y_0>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((i3.u34.y_0>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((i3.u34.y_2>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((u9.y_3>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((u9.y_3>=1)&&(i0.u29.P_ifyi_15_2>=1)))||((u9.y_3>=1)&&(i5.i0.u28.P_ifyi_15_1>=1)))||((i3.u8.y_1>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((i3.u8.y_1>=1)&&(i0.u29.P_ifyi_15_2>=1)))||((i3.u8.y_1>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((u11.y_4>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((i3.u34.y_0>=1)&&(i0.u29.P_ifyi_15_2>=1)))||((i3.u34.y_0>=1)&&(i5.i0.u28.P_ifyi_15_1>=1)))||((u11.y_4>=1)&&(i5.i0.u28.P_ifyi_15_1>=1)))||((u11.y_4>=1)&&(i0.u29.P_ifyi_15_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((((((((((((((((i3.u34.y_2>=1)&&(i5.i0.u28.P_ifyi_15_1>=1))||((i3.u34.y_2>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((i3.u34.y_0>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((i3.u34.y_0>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((i3.u34.y_2>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((u9.y_3>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((u9.y_3>=1)&&(i0.u29.P_ifyi_15_2>=1)))||((u9.y_3>=1)&&(i5.i0.u28.P_ifyi_15_1>=1)))||((i3.u8.y_1>=1)&&(i2.u31.P_ifyi_15_4>=1)))||((i3.u8.y_1>=1)&&(i0.u29.P_ifyi_15_2>=1)))||((i3.u8.y_1>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((u11.y_4>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))||((i3.u34.y_0>=1)&&(i0.u29.P_ifyi_15_2>=1)))||((i3.u34.y_0>=1)&&(i5.i0.u28.P_ifyi_15_1>=1)))||((u11.y_4>=1)&&(i5.i0.u28.P_ifyi_15_1>=1)))||((u11.y_4>=1)&&(i0.u29.P_ifyi_15_2>=1))))] != FALSE
(forward)formula 4,1,8.10507,195280,1,0,322390,510,3181,759309,210,2360,765924
FORMULA LamportFastMutEx-PT-4-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(((AG((((((i3.u34.y_0>=1)&&(i1.i0.u6.P_ify0_4_3>=1))||((i3.u34.y_0>=1)&&(i2.u7.P_ify0_4_4>=1)))||((i3.u34.y_0>=1)&&(i5.i0.u4.P_ify0_4_1>=1)))||((i3.u34.y_0>=1)&&(i0.u5.P_ify0_4_2>=1)))) + (((((((((i5.i0.u0.P_start_1_1<1)||(i5.i0.u0.P_b_1_true<1))&&((i5.i0.u0.P_start_1_1<1)||(i5.i0.u0.P_b_1_false<1)))&&((i2.u3.P_start_1_4<1)||(i2.u3.P_b_4_true<1)))&&((i0.u1.P_start_1_2<1)||(i0.u1.P_b_2_false<1)))&&((i2.u3.P_start_1_4<1)||(i2.u3.P_b_4_false<1)))&&((i1.i0.u2.P_start_1_3<1)||(i1.i0.u2.P_b_3_true<1)))&&((i0.u1.P_start_1_2<1)||(i0.u1.P_b_2_true<1)))&&((i1.i0.u2.P_start_1_3<1)||(i1.i0.u2.P_b_3_false<1)))) + (((((i3.u34.y_0<1)||(i0.u29.P_awaity_2<1))&&((i3.u34.y_0<1)||(i1.i0.u30.P_awaity_3<1)))&&((i3.u34.y_0<1)||(i2.u31.P_awaity_4<1)))&&((i3.u34.y_0<1)||(i5.i0.u28.P_awaity_1<1)))) U EG((((((((((((((((((((((((((((((u9.y_3>=1)&&(i2.u33.P_CS_21_4>=1))||((u9.y_3>=1)&&(i3.u34.P_CS_21_2>=1)))||((u9.y_3>=1)&&(i1.i0.u35.P_CS_21_3>=1)))||((u9.y_3>=1)&&(i3.u32.P_CS_21_1>=1)))||((i3.u34.y_2>=1)&&(i3.u32.P_CS_21_1>=1)))||((i3.u34.y_2>=1)&&(i3.u34.P_CS_21_2>=1)))||((i3.u34.y_2>=1)&&(i1.i0.u35.P_CS_21_3>=1)))||((i3.u34.y_2>=1)&&(i2.u33.P_CS_21_4>=1)))||((u11.y_4>=1)&&(i3.u32.P_CS_21_1>=1)))||((u11.y_4>=1)&&(i3.u34.P_CS_21_2>=1)))||((u11.y_4>=1)&&(i1.i0.u35.P_CS_21_3>=1)))||((u11.y_4>=1)&&(i2.u33.P_CS_21_4>=1)))||((i3.u34.y_0>=1)&&(i3.u32.P_CS_21_1>=1)))||((i3.u34.y_0>=1)&&(i3.u34.P_CS_21_2>=1)))||((i3.u34.y_0>=1)&&(i1.i0.u35.P_CS_21_3>=1)))||((i3.u34.y_0>=1)&&(i2.u33.P_CS_21_4>=1)))||((i3.u8.y_1>=1)&&(i3.u34.P_CS_21_2>=1)))||((i3.u8.y_1>=1)&&(i1.i0.u35.P_CS_21_3>=1)))||((i3.u8.y_1>=1)&&(i3.u32.P_CS_21_1>=1)))||((i3.u8.y_1>=1)&&(i2.u33.P_CS_21_4>=1)))||((i2.u3.P_b_4_false>=1)&&(i2.u7.P_setbi_5_4>=1)))||((i5.i0.u0.P_b_1_true>=1)&&(i5.i0.u4.P_setbi_5_1>=1)))||((i0.u1.P_b_2_false>=1)&&(i0.u5.P_setbi_5_2>=1)))||((i2.u3.P_b_4_true>=1)&&(i2.u7.P_setbi_5_4>=1)))||((i5.i0.u0.P_b_1_false>=1)&&(i5.i0.u4.P_setbi_5_1>=1)))||((i0.u1.P_b_2_true>=1)&&(i0.u5.P_setbi_5_2>=1)))||((i1.i0.u2.P_b_3_false>=1)&&(i1.i0.u6.P_setbi_5_3>=1)))||((i1.i0.u2.P_b_3_true>=1)&&(i1.i0.u6.P_setbi_5_3>=1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG((((((((((((((((((((((((((((((u9.y_3>=1)&&(i2.u33.P_CS_21_4>=1))||((u9.y_3>=1)&&(i3.u34.P_CS_21_2>=1)))||((u9.y_3>=1)&&(i1.i0.u35.P_CS_21_3>=1)))||((u9.y_3>=1)&&(i3.u32.P_CS_21_1>=1)))||((i3.u34.y_2>=1)&&(i3.u32.P_CS_21_1>=1)))||((i3.u34.y_2>=1)&&(i3.u34.P_CS_21_2>=1)))||((i3.u34.y_2>=1)&&(i1.i0.u35.P_CS_21_3>=1)))||((i3.u34.y_2>=1)&&(i2.u33.P_CS_21_4>=1)))||((u11.y_4>=1)&&(i3.u32.P_CS_21_1>=1)))||((u11.y_4>=1)&&(i3.u34.P_CS_21_2>=1)))||((u11.y_4>=1)&&(i1.i0.u35.P_CS_21_3>=1)))||((u11.y_4>=1)&&(i2.u33.P_CS_21_4>=1)))||((i3.u34.y_0>=1)&&(i3.u32.P_CS_21_1>=1)))||((i3.u34.y_0>=1)&&(i3.u34.P_CS_21_2>=1)))||((i3.u34.y_0>=1)&&(i1.i0.u35.P_CS_21_3>=1)))||((i3.u34.y_0>=1)&&(i2.u33.P_CS_21_4>=1)))||((i3.u8.y_1>=1)&&(i3.u34.P_CS_21_2>=1)))||((i3.u8.y_1>=1)&&(i1.i0.u35.P_CS_21_3>=1)))||((i3.u8.y_1>=1)&&(i3.u32.P_CS_21_1>=1)))||((i3.u8.y_1>=1)&&(i2.u33.P_CS_21_4>=1)))||((i2.u3.P_b_4_false>=1)&&(i2.u7.P_setbi_5_4>=1)))||((i5.i0.u0.P_b_1_true>=1)&&(i5.i0.u4.P_setbi_5_1>=1)))||((i0.u1.P_b_2_false>=1)&&(i0.u5.P_setbi_5_2>=1)))||((i2.u3.P_b_4_true>=1)&&(i2.u7.P_setbi_5_4>=1)))||((i5.i0.u0.P_b_1_false>=1)&&(i5.i0.u4.P_setbi_5_1>=1)))||((i0.u1.P_b_2_true>=1)&&(i0.u5.P_setbi_5_2>=1)))||((i1.i0.u2.P_b_3_false>=1)&&(i1.i0.u6.P_setbi_5_3>=1)))||((i1.i0.u2.P_b_3_true>=1)&&(i1.i0.u6.P_setbi_5_3>=1)))))))) * !(E(!(EG((((((((((((((((((((((((((((((u9.y_3>=1)&&(i2.u33.P_CS_21_4>=1))||((u9.y_3>=1)&&(i3.u34.P_CS_21_2>=1)))||((u9.y_3>=1)&&(i1.i0.u35.P_CS_21_3>=1)))||((u9.y_3>=1)&&(i3.u32.P_CS_21_1>=1)))||((i3.u34.y_2>=1)&&(i3.u32.P_CS_21_1>=1)))||((i3.u34.y_2>=1)&&(i3.u34.P_CS_21_2>=1)))||((i3.u34.y_2>=1)&&(i1.i0.u35.P_CS_21_3>=1)))||((i3.u34.y_2>=1)&&(i2.u33.P_CS_21_4>=1)))||((u11.y_4>=1)&&(i3.u32.P_CS_21_1>=1)))||((u11.y_4>=1)&&(i3.u34.P_CS_21_2>=1)))||((u11.y_4>=1)&&(i1.i0.u35.P_CS_21_3>=1)))||((u11.y_4>=1)&&(i2.u33.P_CS_21_4>=1)))||((i3.u34.y_0>=1)&&(i3.u32.P_CS_21_1>=1)))||((i3.u34.y_0>=1)&&(i3.u34.P_CS_21_2>=1)))||((i3.u34.y_0>=1)&&(i1.i0.u35.P_CS_21_3>=1)))||((i3.u34.y_0>=1)&&(i2.u33.P_CS_21_4>=1)))||((i3.u8.y_1>=1)&&(i3.u34.P_CS_21_2>=1)))||((i3.u8.y_1>=1)&&(i1.i0.u35.P_CS_21_3>=1)))||((i3.u8.y_1>=1)&&(i3.u32.P_CS_21_1>=1)))||((i3.u8.y_1>=1)&&(i2.u33.P_CS_21_4>=1)))||((i2.u3.P_b_4_false>=1)&&(i2.u7.P_setbi_5_4>=1)))||((i5.i0.u0.P_b_1_true>=1)&&(i5.i0.u4.P_setbi_5_1>=1)))||((i0.u1.P_b_2_false>=1)&&(i0.u5.P_setbi_5_2>=1)))||((i2.u3.P_b_4_true>=1)&&(i2.u7.P_setbi_5_4>=1)))||((i5.i0.u0.P_b_1_false>=1)&&(i5.i0.u4.P_setbi_5_1>=1)))||((i0.u1.P_b_2_true>=1)&&(i0.u5.P_setbi_5_2>=1)))||((i1.i0.u2.P_b_3_false>=1)&&(i1.i0.u6.P_setbi_5_3>=1)))||((i1.i0.u2.P_b_3_true>=1)&&(i1.i0.u6.P_setbi_5_3>=1))))) U (!(((!(E(TRUE U !((((((i3.u34.y_0>=1)&&(i1.i0.u6.P_ify0_4_3>=1))||((i3.u34.y_0>=1)&&(i2.u7.P_ify0_4_4>=1)))||((i3.u34.y_0>=1)&&(i5.i0.u4.P_ify0_4_1>=1)))||((i3.u34.y_0>=1)&&(i0.u5.P_ify0_4_2>=1)))))) + (((((((((i5.i0.u0.P_start_1_1<1)||(i5.i0.u0.P_b_1_true<1))&&((i5.i0.u0.P_start_1_1<1)||(i5.i0.u0.P_b_1_false<1)))&&((i2.u3.P_start_1_4<1)||(i2.u3.P_b_4_true<1)))&&((i0.u1.P_start_1_2<1)||(i0.u1.P_b_2_false<1)))&&((i2.u3.P_start_1_4<1)||(i2.u3.P_b_4_false<1)))&&((i1.i0.u2.P_start_1_3<1)||(i1.i0.u2.P_b_3_true<1)))&&((i0.u1.P_start_1_2<1)||(i0.u1.P_b_2_true<1)))&&((i1.i0.u2.P_start_1_3<1)||(i1.i0.u2.P_b_3_false<1)))) + (((((i3.u34.y_0<1)||(i0.u29.P_awaity_2<1))&&((i3.u34.y_0<1)||(i1.i0.u30.P_awaity_3<1)))&&((i3.u34.y_0<1)||(i2.u31.P_awaity_4<1)))&&((i3.u34.y_0<1)||(i5.i0.u28.P_awaity_1<1))))) * !(EG((((((((((((((((((((((((((((((u9.y_3>=1)&&(i2.u33.P_CS_21_4>=1))||((u9.y_3>=1)&&(i3.u34.P_CS_21_2>=1)))||((u9.y_3>=1)&&(i1.i0.u35.P_CS_21_3>=1)))||((u9.y_3>=1)&&(i3.u32.P_CS_21_1>=1)))||((i3.u34.y_2>=1)&&(i3.u32.P_CS_21_1>=1)))||((i3.u34.y_2>=1)&&(i3.u34.P_CS_21_2>=1)))||((i3.u34.y_2>=1)&&(i1.i0.u35.P_CS_21_3>=1)))||((i3.u34.y_2>=1)&&(i2.u33.P_CS_21_4>=1)))||((u11.y_4>=1)&&(i3.u32.P_CS_21_1>=1)))||((u11.y_4>=1)&&(i3.u34.P_CS_21_2>=1)))||((u11.y_4>=1)&&(i1.i0.u35.P_CS_21_3>=1)))||((u11.y_4>=1)&&(i2.u33.P_CS_21_4>=1)))||((i3.u34.y_0>=1)&&(i3.u32.P_CS_21_1>=1)))||((i3.u34.y_0>=1)&&(i3.u34.P_CS_21_2>=1)))||((i3.u34.y_0>=1)&&(i1.i0.u35.P_CS_21_3>=1)))||((i3.u34.y_0>=1)&&(i2.u33.P_CS_21_4>=1)))||((i3.u8.y_1>=1)&&(i3.u34.P_CS_21_2>=1)))||((i3.u8.y_1>=1)&&(i1.i0.u35.P_CS_21_3>=1)))||((i3.u8.y_1>=1)&&(i3.u32.P_CS_21_1>=1)))||((i3.u8.y_1>=1)&&(i2.u33.P_CS_21_4>=1)))||((i2.u3.P_b_4_false>=1)&&(i2.u7.P_setbi_5_4>=1)))||((i5.i0.u0.P_b_1_true>=1)&&(i5.i0.u4.P_setbi_5_1>=1)))||((i0.u1.P_b_2_false>=1)&&(i0.u5.P_setbi_5_2>=1)))||((i2.u3.P_b_4_true>=1)&&(i2.u7.P_setbi_5_4>=1)))||((i5.i0.u0.P_b_1_false>=1)&&(i5.i0.u4.P_setbi_5_1>=1)))||((i0.u1.P_b_2_true>=1)&&(i0.u5.P_setbi_5_2>=1)))||((i1.i0.u2.P_b_3_false>=1)&&(i1.i0.u6.P_setbi_5_3>=1)))||((i1.i0.u2.P_b_3_true>=1)&&(i1.i0.u6.P_setbi_5_3>=1)))))))))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 5,0,30.1087,860420,1,0,1.46605e+06,552,3534,3.12873e+06,226,2568,2535325
FORMULA LamportFastMutEx-PT-4-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EF(((((((((((((((i3.u8.y_1<1)||(i0.u5.P_ify0_4_2<1))&&((i3.u8.y_1<1)||(i1.i0.u6.P_ify0_4_3<1)))&&((i3.u8.y_1<1)||(i2.u7.P_ify0_4_4<1)))&&((u11.y_4<1)||(i0.u5.P_ify0_4_2<1)))&&((u11.y_4<1)||(i5.i0.u4.P_ify0_4_1<1)))&&((i3.u34.y_2<1)||(i1.i0.u6.P_ify0_4_3<1)))&&((i3.u34.y_2<1)||(i2.u7.P_ify0_4_4<1)))&&((i3.u34.y_2<1)||(i5.i0.u4.P_ify0_4_1<1)))&&((u11.y_4<1)||(i1.i0.u6.P_ify0_4_3<1)))&&((u9.y_3<1)||(i2.u7.P_ify0_4_4<1)))&&((u9.y_3<1)||(i5.i0.u4.P_ify0_4_1<1)))&&((u9.y_3<1)||(i0.u5.P_ify0_4_2<1))) * AG((((((((((i5.i0.u0.P_start_1_1>=1)&&(i5.i0.u0.P_b_1_true>=1))||((i5.i0.u0.P_start_1_1>=1)&&(i5.i0.u0.P_b_1_false>=1)))||((i2.u3.P_start_1_4>=1)&&(i2.u3.P_b_4_true>=1)))||((i0.u1.P_start_1_2>=1)&&(i0.u1.P_b_2_false>=1)))||((i2.u3.P_start_1_4>=1)&&(i2.u3.P_b_4_false>=1)))||((i1.i0.u2.P_start_1_3>=1)&&(i1.i0.u2.P_b_3_true>=1)))||((i0.u1.P_start_1_2>=1)&&(i0.u1.P_b_2_true>=1)))||((i1.i0.u2.P_start_1_3>=1)&&(i1.i0.u2.P_b_3_false>=1)))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (((((((((((((i3.u8.y_1<1)||(i0.u5.P_ify0_4_2<1))&&((i3.u8.y_1<1)||(i1.i0.u6.P_ify0_4_3<1)))&&((i3.u8.y_1<1)||(i2.u7.P_ify0_4_4<1)))&&((u11.y_4<1)||(i0.u5.P_ify0_4_2<1)))&&((u11.y_4<1)||(i5.i0.u4.P_ify0_4_1<1)))&&((i3.u34.y_2<1)||(i1.i0.u6.P_ify0_4_3<1)))&&((i3.u34.y_2<1)||(i2.u7.P_ify0_4_4<1)))&&((i3.u34.y_2<1)||(i5.i0.u4.P_ify0_4_1<1)))&&((u11.y_4<1)||(i1.i0.u6.P_ify0_4_3<1)))&&((u9.y_3<1)||(i2.u7.P_ify0_4_4<1)))&&((u9.y_3<1)||(i5.i0.u4.P_ify0_4_1<1)))&&((u9.y_3<1)||(i0.u5.P_ify0_4_2<1)))) * !(E(TRUE U !((((((((((i5.i0.u0.P_start_1_1>=1)&&(i5.i0.u0.P_b_1_true>=1))||((i5.i0.u0.P_start_1_1>=1)&&(i5.i0.u0.P_b_1_false>=1)))||((i2.u3.P_start_1_4>=1)&&(i2.u3.P_b_4_true>=1)))||((i0.u1.P_start_1_2>=1)&&(i0.u1.P_b_2_false>=1)))||((i2.u3.P_start_1_4>=1)&&(i2.u3.P_b_4_false>=1)))||((i1.i0.u2.P_start_1_3>=1)&&(i1.i0.u2.P_b_3_true>=1)))||((i0.u1.P_start_1_2>=1)&&(i0.u1.P_b_2_true>=1)))||((i1.i0.u2.P_start_1_3>=1)&&(i1.i0.u2.P_b_3_false>=1)))))))] = FALSE
(forward)formula 6,1,30.6721,873620,1,0,1.48993e+06,553,3584,3.1692e+06,229,2570,2577606
FORMULA LamportFastMutEx-PT-4-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(EF(((i1.i0.u2.P_b_3_false>=1)&&(i1.i0.u35.P_setbi_24_3>=1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((i1.i0.u2.P_b_3_false>=1)&&(i1.i0.u35.P_setbi_24_3>=1))))] != FALSE
(forward)formula 7,1,36.9884,987860,1,0,1.69085e+06,569,3587,3.50809e+06,229,2609,2952229
FORMULA LamportFastMutEx-PT-4-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(EF(((i3.u34.y_0>=1)&&(i1.i0.u30.P_ifyi_15_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i3.u34.y_0>=1)&&(i1.i0.u30.P_ifyi_15_3>=1)))] = FALSE
(forward)formula 8,0,37.012,988124,1,0,1.69088e+06,569,3587,3.50819e+06,229,2609,2952613
FORMULA LamportFastMutEx-PT-4-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(AX(((((i3.u34.y_2>=1)&&(i1.i0.u35.P_CS_21_3>=1))&&(i3.u34.y_2>=1))&&(i0.u29.P_ifyi_15_2>=1))))
=> equivalent forward existential formula: [(EY(Init) * !(((((i3.u34.y_2>=1)&&(i1.i0.u35.P_CS_21_3>=1))&&(i3.u34.y_2>=1))&&(i0.u29.P_ifyi_15_2>=1))))] != FALSE
(forward)formula 9,1,37.0141,988124,1,0,1.69088e+06,569,3598,3.50819e+06,231,2609,2953373
FORMULA LamportFastMutEx-PT-4-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(EF(((i3.u34.y_2<1)||(i0.u29.P_ifyi_15_2<1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i3.u34.y_2<1)||(i0.u29.P_ifyi_15_2<1)))))] = FALSE
(forward)formula 10,1,37.0534,988652,1,0,1.69185e+06,569,3601,3.50936e+06,231,2609,2955509
FORMULA LamportFastMutEx-PT-4-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1589593168721

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

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