Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r126-tajo-158961390000236.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PhilosophersDyn-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390000236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.2K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 87K Apr 27 15:14 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-00
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-01
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-02
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-03
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-04
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-05
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-06
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-07
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-08
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-09
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-10
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-11
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-12
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-13
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-14
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589795507466

[2020-05-18 09:51:49] [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-18 09:51:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 09:51:49] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2020-05-18 09:51:49] [INFO ] Transformed 30 places.
[2020-05-18 09:51:49] [INFO ] Transformed 84 transitions.
[2020-05-18 09:51:49] [INFO ] Parsed PT model containing 30 places and 84 transitions in 93 ms.
[2020-05-18 09:51:49] [INFO ] Reduced 5 identical enabling conditions.
[2020-05-18 09:51:49] [INFO ] Reduced 5 identical enabling conditions.
[2020-05-18 09:51:49] [INFO ] Reduced 5 identical enabling conditions.
[2020-05-18 09:51:49] [INFO ] Reduced 5 identical enabling conditions.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Incomplete random walk after 100000 steps, including 14320 resets, run finished after 362 ms. (steps per millisecond=276 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1]
[2020-05-18 09:51:49] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2020-05-18 09:51:49] [INFO ] Computed 11 place invariants in 4 ms
[2020-05-18 09:51:49] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned unsat
[2020-05-18 09:51:49] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-05-18 09:51:49] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-18 09:51:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 09:51:49] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-05-18 09:51:49] [INFO ] State equation strengthened by 36 read => feed constraints.
[2020-05-18 09:51:49] [INFO ] [Real]Added 36 Read/Feed constraints in 21 ms returned sat
[2020-05-18 09:51:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 09:51:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-05-18 09:51:49] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-18 09:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 09:51:50] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2020-05-18 09:51:50] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 12 ms.
[2020-05-18 09:51:50] [INFO ] Added : 36 causal constraints over 8 iterations in 121 ms. Result :sat
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 10 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Real]Added 36 Read/Feed constraints in 6 ms returned sat
[2020-05-18 09:51:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 09:51:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 09:51:50] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2020-05-18 09:51:50] [INFO ] Deduced a trap composed of 14 places in 36 ms
[2020-05-18 09:51:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2020-05-18 09:51:50] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 6 ms.
[2020-05-18 09:51:50] [INFO ] Added : 42 causal constraints over 9 iterations in 114 ms. Result :sat
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Real]Added 36 Read/Feed constraints in 5 ms returned sat
[2020-05-18 09:51:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 09:51:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 09:51:50] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2020-05-18 09:51:50] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 7 ms.
[2020-05-18 09:51:50] [INFO ] Added : 36 causal constraints over 8 iterations in 87 ms. Result :sat
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Real]Added 36 Read/Feed constraints in 4 ms returned sat
[2020-05-18 09:51:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 09:51:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 09:51:50] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Nat]Added 36 Read/Feed constraints in 3 ms returned sat
[2020-05-18 09:51:50] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 6 ms.
[2020-05-18 09:51:50] [INFO ] Added : 33 causal constraints over 7 iterations in 63 ms. Result :sat
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Real]Added 36 Read/Feed constraints in 4 ms returned sat
[2020-05-18 09:51:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 09:51:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 09:51:50] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2020-05-18 09:51:50] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 8 ms.
[2020-05-18 09:51:50] [INFO ] Added : 29 causal constraints over 6 iterations in 74 ms. Result :sat
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned unsat
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-05-18 09:51:50] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 9 simplifications.
[2020-05-18 09:51:51] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-18 09:51:51] [INFO ] Flatten gal took : 43 ms
[2020-05-18 09:51:51] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-18 09:51:51] [INFO ] Flatten gal took : 14 ms
FORMULA PhilosophersDyn-PT-03-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 09:51:51] [INFO ] Applying decomposition
[2020-05-18 09:51:51] [INFO ] Flatten gal took : 12 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/graph10677394747448206736.txt, -o, /tmp/graph10677394747448206736.bin, -w, /tmp/graph10677394747448206736.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/graph10677394747448206736.bin, -l, -1, -v, -w, /tmp/graph10677394747448206736.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 09:51:51] [INFO ] Decomposing Gal with order
[2020-05-18 09:51:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 09:51:51] [INFO ] Removed a total of 39 redundant transitions.
[2020-05-18 09:51:51] [INFO ] Flatten gal took : 39 ms
[2020-05-18 09:51:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-18 09:51:51] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 3 ms
[2020-05-18 09:51:51] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 7 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
built 4 ordering constraints for composite.
built 31 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,325,0.038289,5504,94,254,881,833,294,1194,146,2085,0


Converting to forward existential form...Done !
original formula: A(AF((((((((((((((((((((((((((((((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1))&&(u2.Neighbourhood_2_1>=1))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=2)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(u1.Neighbourhood_3_1>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(i2.u3.Think_1>=1))&&(u2.Neighbourhood_2_1>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1))&&(u1.Neighbourhood_3_1>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(u2.Neighbourhood_2_3>=1)))||((((u2.Think_2>=1)&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1))&&(u1.Neighbourhood_3_2>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(i2.u3.Think_1>=1))&&(u1.Neighbourhood_3_1>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_3>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(u2.Neighbourhood_2_2>=1))&&(u2.Think_2>=1))&&(u2.Forks_2>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1))&&(u1.Neighbourhood_3_1>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1))&&(u1.Neighbourhood_3_2>=1)))||((((u2.Neighbourhood_2_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1)))||((((u2.Think_2>=1)&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_3>=1))&&(u1.Neighbourhood_3_2>=1)))||((((u2.Neighbourhood_2_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_3>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Neighbourhood_2_2>=2)&&(u2.Think_2>=1))&&(u2.Forks_2>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(u2.Neighbourhood_2_1>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=2)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_3>=1))&&(u1.Neighbourhood_3_1>=1)))||((((u2.Neighbourhood_2_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u1.Neighbourhood_3_2>=1)))&&((((i2.u3.Forks_1>=1)&&(i2.u3.WaitLeft_1>=1))||((u1.Forks_3>=1)&&(u1.WaitLeft_3>=1)))||((u2.WaitLeft_2>=1)&&(u2.Forks_2>=1))))) U (((((((((((((((((((((((((((((((((((((((((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1))&&(u2.Neighbourhood_2_1>=1))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=2)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(u1.Neighbourhood_3_1>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(i2.u3.Think_1>=1))&&(u2.Neighbourhood_2_1>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1))&&(u1.Neighbourhood_3_1>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(u2.Neighbourhood_2_3>=1)))||((((u2.Think_2>=1)&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1))&&(u1.Neighbourhood_3_2>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(i2.u3.Think_1>=1))&&(u1.Neighbourhood_3_1>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_3>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(u2.Neighbourhood_2_2>=1))&&(u2.Think_2>=1))&&(u2.Forks_2>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1))&&(u1.Neighbourhood_3_1>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1))&&(u1.Neighbourhood_3_2>=1)))||((((u2.Neighbourhood_2_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1)))||((((u2.Think_2>=1)&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_3>=1))&&(u1.Neighbourhood_3_2>=1)))||((((u2.Neighbourhood_2_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_3>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Neighbourhood_2_2>=2)&&(u2.Think_2>=1))&&(u2.Forks_2>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(u2.Neighbourhood_2_1>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=2)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_3>=1))&&(u1.Neighbourhood_3_1>=1)))||((((u2.Neighbourhood_2_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u1.Neighbourhood_3_2>=1)))||((i2.u3.Forks_1>=1)&&(i2.u3.WaitLeft_1>=1)))||((u1.Forks_3>=1)&&(u1.WaitLeft_3>=1)))||((u2.WaitLeft_2>=1)&&(u2.Forks_2>=1)))||(((u2.Neighbourhood_2_2>=1)&&(u2.WaitRight_2>=1))&&(u2.Forks_2>=1)))||(((i2.u0.WaitRight_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||(((i2.u3.Forks_1>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Forks_2>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Forks_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.WaitRight_3>=1)))||(((u2.WaitRight_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.WaitRight_1>=1))&&(u2.Forks_2>=1)))||(((i2.u3.Forks_1>=1)&&(u2.WaitRight_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u0.WaitRight_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))&&(((((i2.u3.Forks_1>=1)&&(i2.u3.WaitLeft_1>=1))||((u1.Forks_3>=1)&&(u1.WaitLeft_3>=1)))||((u2.WaitLeft_2>=1)&&(u2.Forks_2>=1)))||((((u1.Think_3>=1)||(u2.Think_2>=1))||(i2.u3.Think_1>=1))&&(((((((((((u2.Neighbourhood_2_2>=1)&&(u2.WaitRight_2>=1))&&(u2.Forks_2>=1))||(((i2.u0.WaitRight_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||(((i2.u3.Forks_1>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Forks_2>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Forks_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.WaitRight_3>=1)))||(((u2.WaitRight_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.WaitRight_1>=1))&&(u2.Forks_2>=1)))||(((i2.u3.Forks_1>=1)&&(u2.WaitRight_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u0.WaitRight_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!((((((((((((((((((((((((((((((((((((((((((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1))&&(u2.Neighbourhood_2_1>=1))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=2)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(u1.Neighbourhood_3_1>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(i2.u3.Think_1>=1))&&(u2.Neighbourhood_2_1>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1))&&(u1.Neighbourhood_3_1>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(u2.Neighbourhood_2_3>=1)))||((((u2.Think_2>=1)&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1))&&(u1.Neighbourhood_3_2>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(i2.u3.Think_1>=1))&&(u1.Neighbourhood_3_1>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_3>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(u2.Neighbourhood_2_2>=1))&&(u2.Think_2>=1))&&(u2.Forks_2>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1))&&(u1.Neighbourhood_3_1>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1))&&(u1.Neighbourhood_3_2>=1)))||((((u2.Neighbourhood_2_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1)))||((((u2.Think_2>=1)&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_3>=1))&&(u1.Neighbourhood_3_2>=1)))||((((u2.Neighbourhood_2_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_3>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Neighbourhood_2_2>=2)&&(u2.Think_2>=1))&&(u2.Forks_2>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(u2.Neighbourhood_2_1>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=2)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_3>=1))&&(u1.Neighbourhood_3_1>=1)))||((((u2.Neighbourhood_2_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u1.Neighbourhood_3_2>=1)))||((i2.u3.Forks_1>=1)&&(i2.u3.WaitLeft_1>=1)))||((u1.Forks_3>=1)&&(u1.WaitLeft_3>=1)))||((u2.WaitLeft_2>=1)&&(u2.Forks_2>=1)))||(((u2.Neighbourhood_2_2>=1)&&(u2.WaitRight_2>=1))&&(u2.Forks_2>=1)))||(((i2.u0.WaitRight_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||(((i2.u3.Forks_1>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Forks_2>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Forks_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.WaitRight_3>=1)))||(((u2.WaitRight_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.WaitRight_1>=1))&&(u2.Forks_2>=1)))||(((i2.u3.Forks_1>=1)&&(u2.WaitRight_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u0.WaitRight_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))&&(((((i2.u3.Forks_1>=1)&&(i2.u3.WaitLeft_1>=1))||((u1.Forks_3>=1)&&(u1.WaitLeft_3>=1)))||((u2.WaitLeft_2>=1)&&(u2.Forks_2>=1)))||((((u1.Think_3>=1)||(u2.Think_2>=1))||(i2.u3.Think_1>=1))&&(((((((((((u2.Neighbourhood_2_2>=1)&&(u2.WaitRight_2>=1))&&(u2.Forks_2>=1))||(((i2.u0.WaitRight_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||(((i2.u3.Forks_1>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Forks_2>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Forks_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.WaitRight_3>=1)))||(((u2.WaitRight_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.WaitRight_1>=1))&&(u2.Forks_2>=1)))||(((i2.u3.Forks_1>=1)&&(u2.WaitRight_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u0.WaitRight_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))))))))) * !(E(!((((((((((((((((((((((((((((((((((((((((((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1))&&(u2.Neighbourhood_2_1>=1))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=2)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(u1.Neighbourhood_3_1>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(i2.u3.Think_1>=1))&&(u2.Neighbourhood_2_1>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1))&&(u1.Neighbourhood_3_1>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(u2.Neighbourhood_2_3>=1)))||((((u2.Think_2>=1)&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1))&&(u1.Neighbourhood_3_2>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(i2.u3.Think_1>=1))&&(u1.Neighbourhood_3_1>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_3>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(u2.Neighbourhood_2_2>=1))&&(u2.Think_2>=1))&&(u2.Forks_2>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1))&&(u1.Neighbourhood_3_1>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1))&&(u1.Neighbourhood_3_2>=1)))||((((u2.Neighbourhood_2_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1)))||((((u2.Think_2>=1)&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_3>=1))&&(u1.Neighbourhood_3_2>=1)))||((((u2.Neighbourhood_2_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_3>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Neighbourhood_2_2>=2)&&(u2.Think_2>=1))&&(u2.Forks_2>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(u2.Neighbourhood_2_1>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=2)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_3>=1))&&(u1.Neighbourhood_3_1>=1)))||((((u2.Neighbourhood_2_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u1.Neighbourhood_3_2>=1)))||((i2.u3.Forks_1>=1)&&(i2.u3.WaitLeft_1>=1)))||((u1.Forks_3>=1)&&(u1.WaitLeft_3>=1)))||((u2.WaitLeft_2>=1)&&(u2.Forks_2>=1)))||(((u2.Neighbourhood_2_2>=1)&&(u2.WaitRight_2>=1))&&(u2.Forks_2>=1)))||(((i2.u0.WaitRight_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||(((i2.u3.Forks_1>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Forks_2>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Forks_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.WaitRight_3>=1)))||(((u2.WaitRight_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.WaitRight_1>=1))&&(u2.Forks_2>=1)))||(((i2.u3.Forks_1>=1)&&(u2.WaitRight_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u0.WaitRight_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))&&(((((i2.u3.Forks_1>=1)&&(i2.u3.WaitLeft_1>=1))||((u1.Forks_3>=1)&&(u1.WaitLeft_3>=1)))||((u2.WaitLeft_2>=1)&&(u2.Forks_2>=1)))||((((u1.Think_3>=1)||(u2.Think_2>=1))||(i2.u3.Think_1>=1))&&(((((((((((u2.Neighbourhood_2_2>=1)&&(u2.WaitRight_2>=1))&&(u2.Forks_2>=1))||(((i2.u0.WaitRight_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||(((i2.u3.Forks_1>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Forks_2>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Forks_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.WaitRight_3>=1)))||(((u2.WaitRight_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.WaitRight_1>=1))&&(u2.Forks_2>=1)))||(((i2.u3.Forks_1>=1)&&(u2.WaitRight_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u0.WaitRight_1>=1))&&(i2.u3.Neighbourhood_1_1>=1))))))) U (!(!(EG(!((((((((((((((((((((((((((((((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1))&&(u2.Neighbourhood_2_1>=1))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=2)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(u1.Neighbourhood_3_1>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(i2.u3.Think_1>=1))&&(u2.Neighbourhood_2_1>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1))&&(u1.Neighbourhood_3_1>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(u2.Neighbourhood_2_3>=1)))||((((u2.Think_2>=1)&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1))&&(u1.Neighbourhood_3_2>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(i2.u3.Think_1>=1))&&(u1.Neighbourhood_3_1>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_3>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(u2.Neighbourhood_2_2>=1))&&(u2.Think_2>=1))&&(u2.Forks_2>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1))&&(u1.Neighbourhood_3_1>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1))&&(u1.Neighbourhood_3_2>=1)))||((((u2.Neighbourhood_2_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1)))||((((u2.Think_2>=1)&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_3>=1))&&(u1.Neighbourhood_3_2>=1)))||((((u2.Neighbourhood_2_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_3>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Neighbourhood_2_2>=2)&&(u2.Think_2>=1))&&(u2.Forks_2>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(u2.Neighbourhood_2_1>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=2)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_3>=1))&&(u1.Neighbourhood_3_1>=1)))||((((u2.Neighbourhood_2_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u1.Neighbourhood_3_2>=1)))&&((((i2.u3.Forks_1>=1)&&(i2.u3.WaitLeft_1>=1))||((u1.Forks_3>=1)&&(u1.WaitLeft_3>=1)))||((u2.WaitLeft_2>=1)&&(u2.Forks_2>=1)))))))) * !((((((((((((((((((((((((((((((((((((((((((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1))&&(u2.Neighbourhood_2_1>=1))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=2)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(u1.Neighbourhood_3_1>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(i2.u3.Think_1>=1))&&(u2.Neighbourhood_2_1>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1))&&(u1.Neighbourhood_3_1>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(u2.Neighbourhood_2_3>=1)))||((((u2.Think_2>=1)&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1))&&(u1.Neighbourhood_3_2>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(i2.u3.Think_1>=1))&&(u1.Neighbourhood_3_1>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_3>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(u2.Neighbourhood_2_2>=1))&&(u2.Think_2>=1))&&(u2.Forks_2>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1))&&(u1.Neighbourhood_3_1>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1))&&(u1.Neighbourhood_3_2>=1)))||((((u2.Neighbourhood_2_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1)))||((((u2.Think_2>=1)&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_3>=1))&&(u1.Neighbourhood_3_2>=1)))||((((u2.Neighbourhood_2_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_3>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Neighbourhood_2_2>=2)&&(u2.Think_2>=1))&&(u2.Forks_2>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(u2.Neighbourhood_2_1>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_3>=2)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))||((((i2.u3.Forks_1>=1)&&(i2.u3.Think_1>=1))&&(i2.u3.Neighbourhood_1_3>=1))&&(u1.Neighbourhood_3_1>=1)))||((((u2.Neighbourhood_2_2>=1)&&(u2.Think_2>=1))&&(u2.Forks_2>=1))&&(u1.Neighbourhood_3_2>=1)))||((i2.u3.Forks_1>=1)&&(i2.u3.WaitLeft_1>=1)))||((u1.Forks_3>=1)&&(u1.WaitLeft_3>=1)))||((u2.WaitLeft_2>=1)&&(u2.Forks_2>=1)))||(((u2.Neighbourhood_2_2>=1)&&(u2.WaitRight_2>=1))&&(u2.Forks_2>=1)))||(((i2.u0.WaitRight_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||(((i2.u3.Forks_1>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Forks_2>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Forks_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.WaitRight_3>=1)))||(((u2.WaitRight_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.WaitRight_1>=1))&&(u2.Forks_2>=1)))||(((i2.u3.Forks_1>=1)&&(u2.WaitRight_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u0.WaitRight_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))&&(((((i2.u3.Forks_1>=1)&&(i2.u3.WaitLeft_1>=1))||((u1.Forks_3>=1)&&(u1.WaitLeft_3>=1)))||((u2.WaitLeft_2>=1)&&(u2.Forks_2>=1)))||((((u1.Think_3>=1)||(u2.Think_2>=1))||(i2.u3.Think_1>=1))&&(((((((((((u2.Neighbourhood_2_2>=1)&&(u2.WaitRight_2>=1))&&(u2.Forks_2>=1))||(((i2.u0.WaitRight_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||(((i2.u3.Forks_1>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Forks_2>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Forks_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.WaitRight_3>=1)))||(((u2.WaitRight_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.WaitRight_1>=1))&&(u2.Forks_2>=1)))||(((i2.u3.Forks_1>=1)&&(u2.WaitRight_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u0.WaitRight_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions Leave_2_1_1, Leave_3_1_1, Leave_2_3_3, Leave_1_3_2, Leave_2_3_1, Leave_1_3_3, Leave_1_2_2, Leave_3_2_1, Leave_2_1_3, Leave_3_2_2, Leave_3_1_2, Leave_1_2_3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :39/30/12/81
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 2
(forward)formula 0,0,0.178271,9112,1,0,5611,2709,1350,8524,1041,6948,21333
FORMULA PhilosophersDyn-PT-03-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EG(((((((((((((u1.Outside_3>=1)&&(u2.Outside_2>=1))&&(i2.u3.Outside_1>=1))||(((u2.Neighbourhood_2_2>=1)&&(u2.WaitRight_2>=1))&&(u2.Forks_2>=1)))||(((i2.u0.WaitRight_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||(((i2.u3.Forks_1>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Forks_2>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Forks_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.WaitRight_3>=1)))||(((u2.WaitRight_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.WaitRight_1>=1))&&(u2.Forks_2>=1)))||(((i2.u3.Forks_1>=1)&&(u2.WaitRight_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u0.WaitRight_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))) + (EF(((((((((((((u2.HasRight_2>=1)&&(u2.HasLeft_2>=1))&&(u2.Neighbourhood_2_3>=1))||(((i2.u3.Neighbourhood_1_1>=1)&&(i2.u0.HasRight_1>=1))&&(i2.u3.HasLeft_1>=1)))||(((i2.u0.HasRight_1>=1)&&(i2.u3.Neighbourhood_1_3>=1))&&(i2.u3.HasLeft_1>=1)))||(((u2.HasRight_2>=1)&&(u2.Neighbourhood_2_2>=1))&&(u2.HasLeft_2>=1)))||(((u1.HasLeft_3>=1)&&(u1.HasRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u1.HasLeft_3>=1)&&(u1.Neighbourhood_3_2>=1))&&(u1.HasRight_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.HasRight_1>=1))&&(i2.u3.HasLeft_1>=1)))||(((u1.HasLeft_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.HasRight_3>=1)))||(((u2.HasRight_2>=1)&&(u2.HasLeft_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((u1.Outside_3>=1)&&(u2.Outside_2>=1))&&(i2.u3.Outside_1>=1)))) * AF((((((((((((u2.Neighbourhood_2_2>=1)&&(u2.WaitRight_2>=1))&&(u2.Forks_2>=1))||(((i2.u0.WaitRight_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||(((i2.u3.Forks_1>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Forks_2>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Forks_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.WaitRight_3>=1)))||(((u2.WaitRight_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.WaitRight_1>=1))&&(u2.Forks_2>=1)))||(((i2.u3.Forks_1>=1)&&(u2.WaitRight_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u0.WaitRight_1>=1))&&(i2.u3.Neighbourhood_1_1>=1))))))
=> equivalent forward existential formula: ([((Init * !(EG(((((((((((((u1.Outside_3>=1)&&(u2.Outside_2>=1))&&(i2.u3.Outside_1>=1))||(((u2.Neighbourhood_2_2>=1)&&(u2.WaitRight_2>=1))&&(u2.Forks_2>=1)))||(((i2.u0.WaitRight_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||(((i2.u3.Forks_1>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Forks_2>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Forks_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.WaitRight_3>=1)))||(((u2.WaitRight_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.WaitRight_1>=1))&&(u2.Forks_2>=1)))||(((i2.u3.Forks_1>=1)&&(u2.WaitRight_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u0.WaitRight_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))))) * !(E(TRUE U ((((((((((((u2.HasRight_2>=1)&&(u2.HasLeft_2>=1))&&(u2.Neighbourhood_2_3>=1))||(((i2.u3.Neighbourhood_1_1>=1)&&(i2.u0.HasRight_1>=1))&&(i2.u3.HasLeft_1>=1)))||(((i2.u0.HasRight_1>=1)&&(i2.u3.Neighbourhood_1_3>=1))&&(i2.u3.HasLeft_1>=1)))||(((u2.HasRight_2>=1)&&(u2.Neighbourhood_2_2>=1))&&(u2.HasLeft_2>=1)))||(((u1.HasLeft_3>=1)&&(u1.HasRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u1.HasLeft_3>=1)&&(u1.Neighbourhood_3_2>=1))&&(u1.HasRight_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.HasRight_1>=1))&&(i2.u3.HasLeft_1>=1)))||(((u1.HasLeft_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.HasRight_3>=1)))||(((u2.HasRight_2>=1)&&(u2.HasLeft_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((u1.Outside_3>=1)&&(u2.Outside_2>=1))&&(i2.u3.Outside_1>=1))))))] = FALSE * [FwdG((Init * !(EG(((((((((((((u1.Outside_3>=1)&&(u2.Outside_2>=1))&&(i2.u3.Outside_1>=1))||(((u2.Neighbourhood_2_2>=1)&&(u2.WaitRight_2>=1))&&(u2.Forks_2>=1)))||(((i2.u0.WaitRight_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||(((i2.u3.Forks_1>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Forks_2>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Forks_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.WaitRight_3>=1)))||(((u2.WaitRight_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.WaitRight_1>=1))&&(u2.Forks_2>=1)))||(((i2.u3.Forks_1>=1)&&(u2.WaitRight_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u0.WaitRight_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))))),!((((((((((((u2.Neighbourhood_2_2>=1)&&(u2.WaitRight_2>=1))&&(u2.Forks_2>=1))||(((i2.u0.WaitRight_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||(((i2.u3.Forks_1>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Forks_2>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Forks_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.WaitRight_3>=1)))||(((u2.WaitRight_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.WaitRight_1>=1))&&(u2.Forks_2>=1)))||(((i2.u3.Forks_1>=1)&&(u2.WaitRight_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u0.WaitRight_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))))] = FALSE)
(forward)formula 1,0,0.202059,10168,1,0,7494,2762,1378,10282,1044,7487,30464
FORMULA PhilosophersDyn-PT-03-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(A(((((((((((((((((((((((((((((((i2.u3.Forks_1<1)||(i2.u3.Think_1<1))||(i2.u3.Neighbourhood_1_1<1))||(u2.Neighbourhood_2_1<1))&&((((u1.Think_3<1)||(u1.Forks_3<1))||(u1.Neighbourhood_3_3<1))||(u1.Neighbourhood_3_2<1)))&&(((i2.u3.Forks_1<1)||(i2.u3.Think_1<1))||(i2.u3.Neighbourhood_1_1<2)))&&((((u1.Think_3<1)||(u1.Forks_3<1))||(u1.Neighbourhood_3_3<1))||(u1.Neighbourhood_3_1<1)))&&((((i2.u3.Forks_1<1)||(i2.u3.Think_1<1))||(i2.u3.Neighbourhood_1_1<1))||(i2.u3.Neighbourhood_1_3<1)))&&((((i2.u3.Neighbourhood_1_2<1)||(i2.u3.Forks_1<1))||(i2.u3.Think_1<1))||(u2.Neighbourhood_2_1<1)))&&((((i2.u3.Forks_1<1)||(i2.u3.Think_1<1))||(i2.u3.Neighbourhood_1_1<1))||(u1.Neighbourhood_3_1<1)))&&((((u1.Think_3<1)||(u1.Forks_3<1))||(u1.Neighbourhood_3_3<1))||(u2.Neighbourhood_2_3<1)))&&((((u2.Think_2<1)||(u2.Forks_2<1))||(u2.Neighbourhood_2_1<1))||(u1.Neighbourhood_3_2<1)))&&((((u1.Think_3<1)||(u1.Forks_3<1))||(u1.Neighbourhood_3_3<1))||(i2.u3.Neighbourhood_1_3<1)))&&((((i2.u3.Neighbourhood_1_2<1)||(i2.u3.Forks_1<1))||(i2.u3.Think_1<1))||(u1.Neighbourhood_3_1<1)))&&((((i2.u3.Neighbourhood_1_2<1)||(u2.Think_2<1))||(u2.Forks_2<1))||(u2.Neighbourhood_2_3<1)))&&((((i2.u3.Neighbourhood_1_2<1)||(u2.Neighbourhood_2_2<1))||(u2.Think_2<1))||(u2.Forks_2<1)))&&((((i2.u3.Neighbourhood_1_2<1)||(u2.Think_2<1))||(u2.Forks_2<1))||(u2.Neighbourhood_2_1<1)))&&((((u1.Think_3<1)||(u1.Forks_3<1))||(i2.u3.Neighbourhood_1_3<1))||(u1.Neighbourhood_3_1<1)))&&((((u1.Think_3<1)||(u1.Forks_3<1))||(i2.u3.Neighbourhood_1_3<1))||(u1.Neighbourhood_3_2<1)))&&((((u2.Neighbourhood_2_2<1)||(u2.Think_2<1))||(u2.Forks_2<1))||(u2.Neighbourhood_2_1<1)))&&((((u2.Think_2<1)||(u2.Forks_2<1))||(u2.Neighbourhood_2_3<1))||(u1.Neighbourhood_3_2<1)))&&((((u2.Neighbourhood_2_2<1)||(u2.Think_2<1))||(u2.Forks_2<1))||(u2.Neighbourhood_2_3<1)))&&((((u1.Think_3<1)||(u1.Forks_3<1))||(u2.Neighbourhood_2_3<1))||(u1.Neighbourhood_3_1<1)))&&(((u2.Neighbourhood_2_2<2)||(u2.Think_2<1))||(u2.Forks_2<1)))&&((((i2.u3.Forks_1<1)||(i2.u3.Think_1<1))||(u2.Neighbourhood_2_1<1))||(i2.u3.Neighbourhood_1_3<1)))&&((((u1.Think_3<1)||(u1.Forks_3<1))||(u2.Neighbourhood_2_3<1))||(u1.Neighbourhood_3_2<1)))&&(((u1.Think_3<1)||(u1.Forks_3<1))||(u1.Neighbourhood_3_3<2)))&&((((i2.u3.Neighbourhood_1_2<1)||(i2.u3.Forks_1<1))||(i2.u3.Think_1<1))||(i2.u3.Neighbourhood_1_1<1)))&&((((i2.u3.Forks_1<1)||(i2.u3.Think_1<1))||(i2.u3.Neighbourhood_1_3<1))||(u1.Neighbourhood_3_1<1)))&&((((u2.Neighbourhood_2_2<1)||(u2.Think_2<1))||(u2.Forks_2<1))||(u1.Neighbourhood_3_2<1))) U ((((i2.u3.Forks_1<1)||(i2.u3.WaitLeft_1<1))&&((u1.Forks_3<1)||(u1.WaitLeft_3<1)))&&((u2.WaitLeft_2<1)||(u2.Forks_2<1))))) + AF(((((((((i2.u3.Forks_1>=1)&&(i2.u3.WaitLeft_1>=1))||((u1.Forks_3>=1)&&(u1.WaitLeft_3>=1)))||((u2.WaitLeft_2>=1)&&(u2.Forks_2>=1)))||(u1.Outside_3<1))||(u2.Outside_2<1))||(i2.u3.Outside_1<1)) * EX((((((((((((u2.HasRight_2>=1)&&(u2.HasLeft_2>=1))&&(u2.Neighbourhood_2_3>=1))||(((i2.u3.Neighbourhood_1_1>=1)&&(i2.u0.HasRight_1>=1))&&(i2.u3.HasLeft_1>=1)))||(((i2.u0.HasRight_1>=1)&&(i2.u3.Neighbourhood_1_3>=1))&&(i2.u3.HasLeft_1>=1)))||(((u2.HasRight_2>=1)&&(u2.Neighbourhood_2_2>=1))&&(u2.HasLeft_2>=1)))||(((u1.HasLeft_3>=1)&&(u1.HasRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u1.HasLeft_3>=1)&&(u1.Neighbourhood_3_2>=1))&&(u1.HasRight_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.HasRight_1>=1))&&(i2.u3.HasLeft_1>=1)))||(((u1.HasLeft_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.HasRight_3>=1)))||(((u2.HasRight_2>=1)&&(u2.HasLeft_2>=1))&&(u2.Neighbourhood_2_1>=1)))))))
=> equivalent forward existential formula: [FwdG((Init * !(!(!((E(!(((((i2.u3.Forks_1<1)||(i2.u3.WaitLeft_1<1))&&((u1.Forks_3<1)||(u1.WaitLeft_3<1)))&&((u2.WaitLeft_2<1)||(u2.Forks_2<1)))) U (!(((((((((((((((((((((((((((((((i2.u3.Forks_1<1)||(i2.u3.Think_1<1))||(i2.u3.Neighbourhood_1_1<1))||(u2.Neighbourhood_2_1<1))&&((((u1.Think_3<1)||(u1.Forks_3<1))||(u1.Neighbourhood_3_3<1))||(u1.Neighbourhood_3_2<1)))&&(((i2.u3.Forks_1<1)||(i2.u3.Think_1<1))||(i2.u3.Neighbourhood_1_1<2)))&&((((u1.Think_3<1)||(u1.Forks_3<1))||(u1.Neighbourhood_3_3<1))||(u1.Neighbourhood_3_1<1)))&&((((i2.u3.Forks_1<1)||(i2.u3.Think_1<1))||(i2.u3.Neighbourhood_1_1<1))||(i2.u3.Neighbourhood_1_3<1)))&&((((i2.u3.Neighbourhood_1_2<1)||(i2.u3.Forks_1<1))||(i2.u3.Think_1<1))||(u2.Neighbourhood_2_1<1)))&&((((i2.u3.Forks_1<1)||(i2.u3.Think_1<1))||(i2.u3.Neighbourhood_1_1<1))||(u1.Neighbourhood_3_1<1)))&&((((u1.Think_3<1)||(u1.Forks_3<1))||(u1.Neighbourhood_3_3<1))||(u2.Neighbourhood_2_3<1)))&&((((u2.Think_2<1)||(u2.Forks_2<1))||(u2.Neighbourhood_2_1<1))||(u1.Neighbourhood_3_2<1)))&&((((u1.Think_3<1)||(u1.Forks_3<1))||(u1.Neighbourhood_3_3<1))||(i2.u3.Neighbourhood_1_3<1)))&&((((i2.u3.Neighbourhood_1_2<1)||(i2.u3.Forks_1<1))||(i2.u3.Think_1<1))||(u1.Neighbourhood_3_1<1)))&&((((i2.u3.Neighbourhood_1_2<1)||(u2.Think_2<1))||(u2.Forks_2<1))||(u2.Neighbourhood_2_3<1)))&&((((i2.u3.Neighbourhood_1_2<1)||(u2.Neighbourhood_2_2<1))||(u2.Think_2<1))||(u2.Forks_2<1)))&&((((i2.u3.Neighbourhood_1_2<1)||(u2.Think_2<1))||(u2.Forks_2<1))||(u2.Neighbourhood_2_1<1)))&&((((u1.Think_3<1)||(u1.Forks_3<1))||(i2.u3.Neighbourhood_1_3<1))||(u1.Neighbourhood_3_1<1)))&&((((u1.Think_3<1)||(u1.Forks_3<1))||(i2.u3.Neighbourhood_1_3<1))||(u1.Neighbourhood_3_2<1)))&&((((u2.Neighbourhood_2_2<1)||(u2.Think_2<1))||(u2.Forks_2<1))||(u2.Neighbourhood_2_1<1)))&&((((u2.Think_2<1)||(u2.Forks_2<1))||(u2.Neighbourhood_2_3<1))||(u1.Neighbourhood_3_2<1)))&&((((u2.Neighbourhood_2_2<1)||(u2.Think_2<1))||(u2.Forks_2<1))||(u2.Neighbourhood_2_3<1)))&&((((u1.Think_3<1)||(u1.Forks_3<1))||(u2.Neighbourhood_2_3<1))||(u1.Neighbourhood_3_1<1)))&&(((u2.Neighbourhood_2_2<2)||(u2.Think_2<1))||(u2.Forks_2<1)))&&((((i2.u3.Forks_1<1)||(i2.u3.Think_1<1))||(u2.Neighbourhood_2_1<1))||(i2.u3.Neighbourhood_1_3<1)))&&((((u1.Think_3<1)||(u1.Forks_3<1))||(u2.Neighbourhood_2_3<1))||(u1.Neighbourhood_3_2<1)))&&(((u1.Think_3<1)||(u1.Forks_3<1))||(u1.Neighbourhood_3_3<2)))&&((((i2.u3.Neighbourhood_1_2<1)||(i2.u3.Forks_1<1))||(i2.u3.Think_1<1))||(i2.u3.Neighbourhood_1_1<1)))&&((((i2.u3.Forks_1<1)||(i2.u3.Think_1<1))||(i2.u3.Neighbourhood_1_3<1))||(u1.Neighbourhood_3_1<1)))&&((((u2.Neighbourhood_2_2<1)||(u2.Think_2<1))||(u2.Forks_2<1))||(u1.Neighbourhood_3_2<1)))) * !(((((i2.u3.Forks_1<1)||(i2.u3.WaitLeft_1<1))&&((u1.Forks_3<1)||(u1.WaitLeft_3<1)))&&((u2.WaitLeft_2<1)||(u2.Forks_2<1)))))) + EG(!(((((i2.u3.Forks_1<1)||(i2.u3.WaitLeft_1<1))&&((u1.Forks_3<1)||(u1.WaitLeft_3<1)))&&((u2.WaitLeft_2<1)||(u2.Forks_2<1)))))))))),!(((((((((i2.u3.Forks_1>=1)&&(i2.u3.WaitLeft_1>=1))||((u1.Forks_3>=1)&&(u1.WaitLeft_3>=1)))||((u2.WaitLeft_2>=1)&&(u2.Forks_2>=1)))||(u1.Outside_3<1))||(u2.Outside_2<1))||(i2.u3.Outside_1<1)) * EX((((((((((((u2.HasRight_2>=1)&&(u2.HasLeft_2>=1))&&(u2.Neighbourhood_2_3>=1))||(((i2.u3.Neighbourhood_1_1>=1)&&(i2.u0.HasRight_1>=1))&&(i2.u3.HasLeft_1>=1)))||(((i2.u0.HasRight_1>=1)&&(i2.u3.Neighbourhood_1_3>=1))&&(i2.u3.HasLeft_1>=1)))||(((u2.HasRight_2>=1)&&(u2.Neighbourhood_2_2>=1))&&(u2.HasLeft_2>=1)))||(((u1.HasLeft_3>=1)&&(u1.HasRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u1.HasLeft_3>=1)&&(u1.Neighbourhood_3_2>=1))&&(u1.HasRight_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.HasRight_1>=1))&&(i2.u3.HasLeft_1>=1)))||(((u1.HasLeft_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.HasRight_3>=1)))||(((u2.HasRight_2>=1)&&(u2.HasLeft_2>=1))&&(u2.Neighbourhood_2_1>=1)))))))] = FALSE
(forward)formula 2,0,0.248279,11488,1,0,9747,2875,1717,12870,1141,8582,38710
FORMULA PhilosophersDyn-PT-03-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: ((EG(EX(((((((((((((u2.Neighbourhood_2_2>=1)&&(u2.WaitRight_2>=1))&&(u2.Forks_2>=1))||(((i2.u0.WaitRight_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||(((i2.u3.Forks_1>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Forks_2>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Forks_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.WaitRight_3>=1)))||(((u2.WaitRight_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.WaitRight_1>=1))&&(u2.Forks_2>=1)))||(((i2.u3.Forks_1>=1)&&(u2.WaitRight_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u0.WaitRight_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))&&((((i2.u3.Forks_1>=1)&&(i2.u3.WaitLeft_1>=1))||((u1.Forks_3>=1)&&(u1.WaitLeft_3>=1)))||((u2.WaitLeft_2>=1)&&(u2.Forks_2>=1)))))) + AF(((((i2.u3.Forks_1>=1)&&(i2.u3.WaitLeft_1>=1))||((u1.Forks_3>=1)&&(u1.WaitLeft_3>=1)))||((u2.WaitLeft_2>=1)&&(u2.Forks_2>=1))))) + AX((((((((((((u2.Neighbourhood_2_2>=1)&&(u2.WaitRight_2>=1))&&(u2.Forks_2>=1))||(((i2.u0.WaitRight_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||(((i2.u3.Forks_1>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Forks_2>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Forks_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.WaitRight_3>=1)))||(((u2.WaitRight_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.WaitRight_1>=1))&&(u2.Forks_2>=1)))||(((i2.u3.Forks_1>=1)&&(u2.WaitRight_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u0.WaitRight_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))))
=> equivalent forward existential formula: [(EY((Init * !((EG(EX(((((((((((((u2.Neighbourhood_2_2>=1)&&(u2.WaitRight_2>=1))&&(u2.Forks_2>=1))||(((i2.u0.WaitRight_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||(((i2.u3.Forks_1>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Forks_2>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Forks_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.WaitRight_3>=1)))||(((u2.WaitRight_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.WaitRight_1>=1))&&(u2.Forks_2>=1)))||(((i2.u3.Forks_1>=1)&&(u2.WaitRight_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u0.WaitRight_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))&&((((i2.u3.Forks_1>=1)&&(i2.u3.WaitLeft_1>=1))||((u1.Forks_3>=1)&&(u1.WaitLeft_3>=1)))||((u2.WaitLeft_2>=1)&&(u2.Forks_2>=1)))))) + !(EG(!(((((i2.u3.Forks_1>=1)&&(i2.u3.WaitLeft_1>=1))||((u1.Forks_3>=1)&&(u1.WaitLeft_3>=1)))||((u2.WaitLeft_2>=1)&&(u2.Forks_2>=1)))))))))) * !((((((((((((u2.Neighbourhood_2_2>=1)&&(u2.WaitRight_2>=1))&&(u2.Forks_2>=1))||(((i2.u0.WaitRight_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||(((i2.u3.Forks_1>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Forks_2>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Forks_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.WaitRight_3>=1)))||(((u2.WaitRight_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.WaitRight_1>=1))&&(u2.Forks_2>=1)))||(((i2.u3.Forks_1>=1)&&(u2.WaitRight_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u0.WaitRight_1>=1))&&(i2.u3.Neighbourhood_1_1>=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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 3,0,0.274047,12280,1,0,11106,2933,1743,14348,1148,8808,43298
FORMULA PhilosophersDyn-PT-03-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX((AF((((((((((((((i2.u3.Forks_1>=1)&&(i2.u3.WaitLeft_1>=1))||((u1.Forks_3>=1)&&(u1.WaitLeft_3>=1)))||((u2.WaitLeft_2>=1)&&(u2.Forks_2>=1)))||(((u2.Neighbourhood_2_2>=1)&&(u2.WaitRight_2>=1))&&(u2.Forks_2>=1)))||(((i2.u0.WaitRight_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||(((i2.u3.Forks_1>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Forks_2>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Forks_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.WaitRight_3>=1)))||(((u2.WaitRight_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.WaitRight_1>=1))&&(u2.Forks_2>=1)))||(((i2.u3.Forks_1>=1)&&(u2.WaitRight_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u0.WaitRight_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))) * ((((((((((((((((((((((((((((((u1.Outside_3>=1)&&(u2.Forks_2>=1))&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1))||((((i2.u3.Forks_1>=1)&&(u1.Outside_3>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1)))||((((u1.Outside_3>=1)&&(u2.Forks_2>=1))&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((i2.u3.Forks_1>=2)&&(i2.u3.Neighbourhood_1_1>=1))&&(u2.Outside_2>=1)))||(((u1.Outside_3>=1)&&(u1.Forks_3>=2))&&(u1.Neighbourhood_3_3>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(u1.Outside_3>=1))&&(u2.Forks_2>=1)))||(((u2.Neighbourhood_2_2>=1)&&(u1.Outside_3>=1))&&(u2.Forks_2>=2)))||(((i2.u3.Forks_1>=2)&&(i2.u3.Neighbourhood_1_1>=1))&&(i2.u3.Outside_1>=1)))||((((i2.u3.Forks_1>=1)&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1))&&(u2.Outside_2>=1)))||((((i2.u3.Forks_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1))&&(i2.u3.Outside_1>=1)))||((((i2.u3.Forks_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1))&&(u2.Outside_2>=1)))||((((u2.Forks_2>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_2>=1))&&(u2.Outside_2>=1)))||((((i2.u3.Forks_1>=1)&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1))&&(i2.u3.Outside_1>=1)))||(((u2.Neighbourhood_2_2>=1)&&(u2.Forks_2>=2))&&(u2.Outside_2>=1)))||(((u2.Neighbourhood_2_2>=1)&&(u2.Forks_2>=2))&&(i2.u3.Outside_1>=1)))||((((i2.u3.Forks_1>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_1>=1))&&(u2.Outside_2>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(u2.Forks_2>=1))&&(u2.Outside_2>=1)))||(((i2.u3.Forks_1>=2)&&(u1.Outside_3>=1))&&(i2.u3.Neighbourhood_1_1>=1)))||(((u1.Forks_3>=2)&&(u1.Neighbourhood_3_3>=1))&&(u2.Outside_2>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(u2.Forks_2>=1))&&(i2.u3.Outside_1>=1)))||((((i2.u3.Forks_1>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_1>=1))&&(i2.u3.Outside_1>=1)))||(((u1.Forks_3>=2)&&(u1.Neighbourhood_3_3>=1))&&(i2.u3.Outside_1>=1)))||((((u2.Forks_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1))&&(i2.u3.Outside_1>=1)))||((((i2.u3.Forks_1>=1)&&(u1.Outside_3>=1))&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||((((u2.Forks_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1))&&(u2.Outside_2>=1)))||((((i2.u3.Forks_1>=1)&&(u1.Outside_3>=1))&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_1>=1)))||((((u2.Forks_2>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_2>=1))&&(i2.u3.Outside_1>=1)))))
=> equivalent forward existential formula: ([FwdG(EY(Init),!((((((((((((((i2.u3.Forks_1>=1)&&(i2.u3.WaitLeft_1>=1))||((u1.Forks_3>=1)&&(u1.WaitLeft_3>=1)))||((u2.WaitLeft_2>=1)&&(u2.Forks_2>=1)))||(((u2.Neighbourhood_2_2>=1)&&(u2.WaitRight_2>=1))&&(u2.Forks_2>=1)))||(((i2.u0.WaitRight_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||(((i2.u3.Forks_1>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Forks_2>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Forks_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.WaitRight_3>=1)))||(((u2.WaitRight_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.WaitRight_1>=1))&&(u2.Forks_2>=1)))||(((i2.u3.Forks_1>=1)&&(u2.WaitRight_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u0.WaitRight_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))))] = FALSE * [(EY(Init) * !(((((((((((((((((((((((((((((((u1.Outside_3>=1)&&(u2.Forks_2>=1))&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1))||((((i2.u3.Forks_1>=1)&&(u1.Outside_3>=1))&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1)))||((((u1.Outside_3>=1)&&(u2.Forks_2>=1))&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((i2.u3.Forks_1>=2)&&(i2.u3.Neighbourhood_1_1>=1))&&(u2.Outside_2>=1)))||(((u1.Outside_3>=1)&&(u1.Forks_3>=2))&&(u1.Neighbourhood_3_3>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(u1.Outside_3>=1))&&(u2.Forks_2>=1)))||(((u2.Neighbourhood_2_2>=1)&&(u1.Outside_3>=1))&&(u2.Forks_2>=2)))||(((i2.u3.Forks_1>=2)&&(i2.u3.Neighbourhood_1_1>=1))&&(i2.u3.Outside_1>=1)))||((((i2.u3.Forks_1>=1)&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1))&&(u2.Outside_2>=1)))||((((i2.u3.Forks_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1))&&(i2.u3.Outside_1>=1)))||((((i2.u3.Forks_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1))&&(u2.Outside_2>=1)))||((((u2.Forks_2>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_2>=1))&&(u2.Outside_2>=1)))||((((i2.u3.Forks_1>=1)&&(u2.Forks_2>=1))&&(u2.Neighbourhood_2_1>=1))&&(i2.u3.Outside_1>=1)))||(((u2.Neighbourhood_2_2>=1)&&(u2.Forks_2>=2))&&(u2.Outside_2>=1)))||(((u2.Neighbourhood_2_2>=1)&&(u2.Forks_2>=2))&&(i2.u3.Outside_1>=1)))||((((i2.u3.Forks_1>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_1>=1))&&(u2.Outside_2>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(u2.Forks_2>=1))&&(u2.Outside_2>=1)))||(((i2.u3.Forks_1>=2)&&(u1.Outside_3>=1))&&(i2.u3.Neighbourhood_1_1>=1)))||(((u1.Forks_3>=2)&&(u1.Neighbourhood_3_3>=1))&&(u2.Outside_2>=1)))||((((i2.u3.Neighbourhood_1_2>=1)&&(i2.u3.Forks_1>=1))&&(u2.Forks_2>=1))&&(i2.u3.Outside_1>=1)))||((((i2.u3.Forks_1>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_1>=1))&&(i2.u3.Outside_1>=1)))||(((u1.Forks_3>=2)&&(u1.Neighbourhood_3_3>=1))&&(i2.u3.Outside_1>=1)))||((((u2.Forks_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1))&&(i2.u3.Outside_1>=1)))||((((i2.u3.Forks_1>=1)&&(u1.Outside_3>=1))&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||((((u2.Forks_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1))&&(u2.Outside_2>=1)))||((((i2.u3.Forks_1>=1)&&(u1.Outside_3>=1))&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_1>=1)))||((((u2.Forks_2>=1)&&(u1.Forks_3>=1))&&(u1.Neighbourhood_3_2>=1))&&(i2.u3.Outside_1>=1)))))] = FALSE)
(forward)formula 4,0,0.289868,12808,1,0,11400,2942,1989,14617,1183,8848,45894
FORMULA PhilosophersDyn-PT-03-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((((((((((((u2.Neighbourhood_2_2>=1)&&(u2.WaitRight_2>=1))&&(u2.Forks_2>=1))||(((i2.u0.WaitRight_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||(((i2.u3.Forks_1>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Forks_2>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Forks_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.WaitRight_3>=1)))||(((u2.WaitRight_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.WaitRight_1>=1))&&(u2.Forks_2>=1)))||(((i2.u3.Forks_1>=1)&&(u2.WaitRight_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u0.WaitRight_1>=1))&&(i2.u3.Neighbourhood_1_1>=1))))
=> equivalent forward existential formula: [FwdG(Init,!((((((((((((u2.Neighbourhood_2_2>=1)&&(u2.WaitRight_2>=1))&&(u2.Forks_2>=1))||(((i2.u0.WaitRight_1>=1)&&(u1.Forks_3>=1))&&(i2.u3.Neighbourhood_1_3>=1)))||(((i2.u3.Forks_1>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_1>=1)))||(((u2.Forks_2>=1)&&(u1.WaitRight_3>=1))&&(u1.Neighbourhood_3_2>=1)))||(((u1.Forks_3>=1)&&(u1.Neighbourhood_3_3>=1))&&(u1.WaitRight_3>=1)))||(((u2.WaitRight_2>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1)))||(((i2.u3.Neighbourhood_1_2>=1)&&(i2.u0.WaitRight_1>=1))&&(u2.Forks_2>=1)))||(((i2.u3.Forks_1>=1)&&(u2.WaitRight_2>=1))&&(u2.Neighbourhood_2_1>=1)))||(((i2.u3.Forks_1>=1)&&(i2.u0.WaitRight_1>=1))&&(i2.u3.Neighbourhood_1_1>=1)))))] = FALSE
(forward)formula 5,0,0.291695,13072,1,0,11400,2942,1989,14617,1183,8848,45894
FORMULA PhilosophersDyn-PT-03-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(((((i2.u3.Forks_1>=1)&&(i2.u3.WaitLeft_1>=1))||((u1.Forks_3>=1)&&(u1.WaitLeft_3>=1)))||((u2.WaitLeft_2>=1)&&(u2.Forks_2>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(((((i2.u3.Forks_1>=1)&&(i2.u3.WaitLeft_1>=1))||((u1.Forks_3>=1)&&(u1.WaitLeft_3>=1)))||((u2.WaitLeft_2>=1)&&(u2.Forks_2>=1)))))] = FALSE
(forward)formula 6,0,0.299483,13336,1,0,12306,2954,1992,15324,1183,8954,49681
FORMULA PhilosophersDyn-PT-03-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 7,0,0.299562,13336,1,0,12306,2954,1992,15327,1183,8954,49681
FORMULA PhilosophersDyn-PT-03-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(AX(((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1))&&(u1.Neighbourhood_3_2>=1))))
=> equivalent forward existential formula: [(EY(Init) * !(((((u1.Think_3>=1)&&(u1.Forks_3>=1))&&(u2.Neighbourhood_2_3>=1))&&(u1.Neighbourhood_3_2>=1))))] != FALSE
(forward)formula 8,1,0.30075,13600,1,0,12311,2954,1993,15345,1183,8971,49706
FORMULA PhilosophersDyn-PT-03-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(A((((u1.Forks_3<2)||(u1.Neighbourhood_3_3<1))||(u2.Outside_2<1)) U AF((((u2.Neighbourhood_2_2>=1)&&(u1.Outside_3>=1))&&(u2.Forks_2>=2)))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(!(EG(!((((u2.Neighbourhood_2_2>=1)&&(u1.Outside_3>=1))&&(u2.Forks_2>=2))))))) * !((((u1.Forks_3<2)||(u1.Neighbourhood_3_3<1))||(u2.Outside_2<1)))),!((((u2.Neighbourhood_2_2>=1)&&(u1.Outside_3>=1))&&(u2.Forks_2>=2))))] != FALSE + [FwdG(Init,!(!(EG(!((((u2.Neighbourhood_2_2>=1)&&(u1.Outside_3>=1))&&(u2.Forks_2>=2)))))))] != FALSE)
(forward)formula 9,1,0.325751,13864,1,0,13134,3111,2323,16672,1216,9834,54756
FORMULA PhilosophersDyn-PT-03-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((((i2.u0.WaitRight_1<1)||(u1.Forks_3<1))||(i2.u3.Neighbourhood_1_3<1)))
=> equivalent forward existential formula: [FwdG(Init,(((i2.u0.WaitRight_1<1)||(u1.Forks_3<1))||(i2.u3.Neighbourhood_1_3<1)))] != FALSE
(forward)formula 10,1,0.33107,14128,1,0,13683,3118,2339,17246,1216,9949,57065
FORMULA PhilosophersDyn-PT-03-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1589795511964

--------------------
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="PhilosophersDyn-PT-03"
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 PhilosophersDyn-PT-03, 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 r126-tajo-158961390000236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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