Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r197-smll-162089451700018.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 RobotManipulation-PT-00002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-162089451700018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 10:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 10:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 14:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 6.3K May 5 16:51 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 RobotManipulation-PT-00002-CTLFireability-00
FORMULA_NAME RobotManipulation-PT-00002-CTLFireability-01
FORMULA_NAME RobotManipulation-PT-00002-CTLFireability-02
FORMULA_NAME RobotManipulation-PT-00002-CTLFireability-03
FORMULA_NAME RobotManipulation-PT-00002-CTLFireability-04
FORMULA_NAME RobotManipulation-PT-00002-CTLFireability-05
FORMULA_NAME RobotManipulation-PT-00002-CTLFireability-06
FORMULA_NAME RobotManipulation-PT-00002-CTLFireability-07
FORMULA_NAME RobotManipulation-PT-00002-CTLFireability-08
FORMULA_NAME RobotManipulation-PT-00002-CTLFireability-09
FORMULA_NAME RobotManipulation-PT-00002-CTLFireability-10
FORMULA_NAME RobotManipulation-PT-00002-CTLFireability-11
FORMULA_NAME RobotManipulation-PT-00002-CTLFireability-12
FORMULA_NAME RobotManipulation-PT-00002-CTLFireability-13
FORMULA_NAME RobotManipulation-PT-00002-CTLFireability-14
FORMULA_NAME RobotManipulation-PT-00002-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620947024991

Running Version 0
[2021-05-13 23:03:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 23:03:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 23:03:48] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2021-05-13 23:03:48] [INFO ] Transformed 15 places.
[2021-05-13 23:03:48] [INFO ] Transformed 11 transitions.
[2021-05-13 23:03:48] [INFO ] Parsed PT model containing 15 places and 11 transitions in 123 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 38 ms.
Support contains 15 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 12 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2021-05-13 23:03:48] [INFO ] Computed 6 place invariants in 9 ms
[2021-05-13 23:03:48] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 11 rows 15 cols
[2021-05-13 23:03:48] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 23:03:48] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 15 cols
[2021-05-13 23:03:48] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 23:03:48] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 11/11 transitions.
[2021-05-13 23:03:49] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-13 23:03:49] [INFO ] Flatten gal took : 47 ms
FORMULA RobotManipulation-PT-00002-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00002-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00002-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00002-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 23:03:49] [INFO ] Flatten gal took : 15 ms
[2021-05-13 23:03:49] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 100001 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=328 ) properties (out of 70) seen :68
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 15 cols
[2021-05-13 23:03:49] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 23:03:49] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-13 23:03:49] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 9 ms returned sat
[2021-05-13 23:03:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:03:49] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-13 23:03:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:03:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-13 23:03:49] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned unsat
[2021-05-13 23:03:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-13 23:03:49] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 23:03:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:03:49] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 23:03:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:03:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-13 23:03:49] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Applied a total of 0 rules in 5 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2021-05-13 23:03:49] [INFO ] Flatten gal took : 2 ms
[2021-05-13 23:03:49] [INFO ] Flatten gal took : 3 ms
[2021-05-13 23:03:49] [INFO ] Input system was already deterministic with 11 transitions.
[2021-05-13 23:03:49] [INFO ] Flatten gal took : 3 ms
[2021-05-13 23:03:49] [INFO ] Flatten gal took : 3 ms
[2021-05-13 23:03:49] [INFO ] Time to serialize gal into /tmp/CTLFireability13540476488597927859.gal : 2 ms
[2021-05-13 23:03:49] [INFO ] Time to serialize properties into /tmp/CTLFireability15344043206809193632.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability13540476488597927859.gal, -t, CGAL, -ctl, /tmp/CTLFireability15344043206809193632.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability13540476488597927859.gal -t CGAL -ctl /tmp/CTLFireability15344043206809193632.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1430,0.023055,4592,2,218,5,1959,6,0,74,1848,0


Converting to forward existential form...Done !
original formula: AG((!(A(((((((initialize<1)||(r_stopped<1))&&((moved<1)||(p_m<1)))&&((move<1)||(r_active<1)))&&((p_rdy<1)||(access<1))) + AF((((off>=1)&&(r_active>=1))||((moved>=1)&&(p_m>=1))))) U EF(((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||(r_moving>=1))||((off>=1)&&(r_active>=1)))||(p_sc>=1))||(p_rel>=1))||((moved>=1)&&(p_m>=1)))))) + (((((((r_moving<1) * (!(AF((((p_rdy>=1)||(p_sc>=1))||(p_i1>=1)))) + !(AG((((((((r_moving>=1)||((off>=1)&&(r_active>=1)))||((initialized>=1)&&(p_i2>=1)))||(p_rdy>=1))||(p_sc>=1))||((p_rdy>=1)&&(access>=1)))||(p_rel>=1)))))) * (((p_sc>=1)||(p_rel>=1))||((off>=1)&&(r_active>=1)))) * (((((p_rdy>=1)||(p_sc>=1))||(p_rel>=1))||((initialize>=1)&&(r_stopped>=1)))||((move>=1)&&(r_active>=1)))) * ((moved<1)||(p_m<1))) * ((p_rdy<1)||(access<1))) * (((((((r_moving>=1)||(p_rdy>=1))||(p_sc>=1))||(p_i1>=1))||((initialize>=1)&&(r_stopped>=1)))||((off>=1)&&(r_active>=1)))||((moved>=1)&&(p_m>=1))))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((((((((r_moving<1) * (!(!(EG(!((((p_rdy>=1)||(p_sc>=1))||(p_i1>=1)))))) + !(!(E(TRUE U !((((((((r_moving>=1)||((off>=1)&&(r_active>=1)))||((initialized>=1)&&(p_i2>=1)))||(p_rdy>=1))||(p_sc>=1))||((p_rdy>=1)&&(access>=1)))||(p_rel>=1)))))))) * (((p_sc>=1)||(p_rel>=1))||((off>=1)&&(r_active>=1)))) * (((((p_rdy>=1)||(p_sc>=1))||(p_rel>=1))||((initialize>=1)&&(r_stopped>=1)))||((move>=1)&&(r_active>=1)))) * ((moved<1)||(p_m<1))) * ((p_rdy<1)||(access<1))) * (((((((r_moving>=1)||(p_rdy>=1))||(p_sc>=1))||(p_i1>=1))||((initialize>=1)&&(r_stopped>=1)))||((off>=1)&&(r_active>=1)))||((moved>=1)&&(p_m>=1)))))) * !(EG(!(E(TRUE U ((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||(r_moving>=1))||((off>=1)&&(r_active>=1)))||(p_sc>=1))||(p_rel>=1))||((moved>=1)&&(p_m>=1)))))))) * !(E(!(E(TRUE U ((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||(r_moving>=1))||((off>=1)&&(r_active>=1)))||(p_sc>=1))||(p_rel>=1))||((moved>=1)&&(p_m>=1))))) U (!(((((((initialize<1)||(r_stopped<1))&&((moved<1)||(p_m<1)))&&((move<1)||(r_active<1)))&&((p_rdy<1)||(access<1))) + !(EG(!((((off>=1)&&(r_active>=1))||((moved>=1)&&(p_m>=1)))))))) * !(E(TRUE U ((((((((initialize>=1)&&(r_stopped>=1))||((move>=1)&&(r_active>=1)))||(r_moving>=1))||((off>=1)&&(r_active>=1)))||(p_sc>=1))||(p_rel>=1))||((moved>=1)&&(p_m>=1)))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.072622,5968,1,0,20,7364,40,8,453,6203,17
FORMULA RobotManipulation-PT-00002-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2021-05-13 23:03:50] [INFO ] Flatten gal took : 6 ms
[2021-05-13 23:03:50] [INFO ] Flatten gal took : 6 ms
[2021-05-13 23:03:50] [INFO ] Applying decomposition
[2021-05-13 23:03:50] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3533778821527477172.txt, -o, /tmp/graph3533778821527477172.bin, -w, /tmp/graph3533778821527477172.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3533778821527477172.bin, -l, -1, -v, -w, /tmp/graph3533778821527477172.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 23:03:50] [INFO ] Decomposing Gal with order
[2021-05-13 23:03:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 23:03:50] [INFO ] Flatten gal took : 43 ms
[2021-05-13 23:03:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-13 23:03:50] [INFO ] Time to serialize gal into /tmp/CTLFireability7133465989079405316.gal : 1 ms
[2021-05-13 23:03:50] [INFO ] Time to serialize properties into /tmp/CTLFireability9218422592493329101.ctl : 8 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability7133465989079405316.gal, -t, CGAL, -ctl, /tmp/CTLFireability9218422592493329101.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability7133465989079405316.gal -t CGAL -ctl /tmp/CTLFireability9218422592493329101.ctl
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1430,0.036496,4940,157,150,1343,693,60,1596,35,2146,0


Converting to forward existential form...Done !
original formula: A(E(AX(((((((((!(E(((((u3.initialize>=1)&&(u0.r_stopped>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(u3.p_i1>=1)) U ((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1))))) + (u3.p_rdy>=1)) + (i1.u2.p_rel>=1)) + (u3.p_i1>=1)) + ((u3.initialize>=1)&&(u0.r_stopped>=1))) + ((i1.u1.move>=1)&&(u0.r_active>=1))) + ((u3.initialized>=1)&&(u3.p_i2>=1))) + ((u0.off>=1)&&(u0.r_active>=1))) + ((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))) U ((E(AX((((((i1.u1.move>=1)&&(u0.r_active>=1))||(u3.p_rdy>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(i1.u1.p_sc>=1))) U (A(((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1)) U ((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u0.r_moving>=1))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1))) * (((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1)))) + ((u3.p_rdy>=1)&&(i1.u1.access>=1))) + ((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))) U A(E((((((((((u0.r_moving>=1)||(u3.p_rdy>=1))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||(u3.p_i1>=1))||((u3.initialize>=1)&&(u0.r_stopped>=1)))||((i1.u1.move>=1)&&(u0.r_active>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1))) U (((((((((((u0.r_moving>=1)||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||(u3.p_i1>=1))||((u3.initialize>=1)&&(u0.r_stopped>=1)))||((i1.u1.move>=1)&&(u0.r_active>=1)))||((u3.initialized>=1)&&(u3.p_i2>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))&&(((u0.r_moving>=1)||(i1.u1.p_sc>=1))||((u3.initialize>=1)&&(u0.r_stopped>=1))))) U ((i1.u1.p_sc>=1)||(i1.u2.p_rel>=1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(((i1.u1.p_sc>=1)||(i1.u2.p_rel>=1))) U (!(E((((((((((u0.r_moving>=1)||(u3.p_rdy>=1))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||(u3.p_i1>=1))||((u3.initialize>=1)&&(u0.r_stopped>=1)))||((i1.u1.move>=1)&&(u0.r_active>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1))) U (((((((((((u0.r_moving>=1)||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||(u3.p_i1>=1))||((u3.initialize>=1)&&(u0.r_stopped>=1)))||((i1.u1.move>=1)&&(u0.r_active>=1)))||((u3.initialized>=1)&&(u3.p_i2>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))&&(((u0.r_moving>=1)||(i1.u1.p_sc>=1))||((u3.initialize>=1)&&(u0.r_stopped>=1)))))) * !(((i1.u1.p_sc>=1)||(i1.u2.p_rel>=1))))) + EG(!(((i1.u1.p_sc>=1)||(i1.u2.p_rel>=1)))))))))) * !(E(!(!((E(!(((i1.u1.p_sc>=1)||(i1.u2.p_rel>=1))) U (!(E((((((((((u0.r_moving>=1)||(u3.p_rdy>=1))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||(u3.p_i1>=1))||((u3.initialize>=1)&&(u0.r_stopped>=1)))||((i1.u1.move>=1)&&(u0.r_active>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1))) U (((((((((((u0.r_moving>=1)||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||(u3.p_i1>=1))||((u3.initialize>=1)&&(u0.r_stopped>=1)))||((i1.u1.move>=1)&&(u0.r_active>=1)))||((u3.initialized>=1)&&(u3.p_i2>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))&&(((u0.r_moving>=1)||(i1.u1.p_sc>=1))||((u3.initialize>=1)&&(u0.r_stopped>=1)))))) * !(((i1.u1.p_sc>=1)||(i1.u2.p_rel>=1))))) + EG(!(((i1.u1.p_sc>=1)||(i1.u2.p_rel>=1))))))) U (!(E(!(EX(!(((((((((!(E(((((u3.initialize>=1)&&(u0.r_stopped>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(u3.p_i1>=1)) U ((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1))))) + (u3.p_rdy>=1)) + (i1.u2.p_rel>=1)) + (u3.p_i1>=1)) + ((u3.initialize>=1)&&(u0.r_stopped>=1))) + ((i1.u1.move>=1)&&(u0.r_active>=1))) + ((u3.initialized>=1)&&(u3.p_i2>=1))) + ((u0.off>=1)&&(u0.r_active>=1))) + ((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))))) U ((E(!(EX(!((((((i1.u1.move>=1)&&(u0.r_active>=1))||(u3.p_rdy>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(i1.u1.p_sc>=1))))) U (!((E(!(((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u0.r_moving>=1))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1))) U (!(((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1))) * !(((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u0.r_moving>=1))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1))))) + EG(!(((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u0.r_moving>=1))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1)))))) * (((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1)))) + ((u3.p_rdy>=1)&&(i1.u1.access>=1))) + ((i1.u2.moved>=1)&&(i1.u2.p_m>=1))))) * !(!((E(!(((i1.u1.p_sc>=1)||(i1.u2.p_rel>=1))) U (!(E((((((((((u0.r_moving>=1)||(u3.p_rdy>=1))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||(u3.p_i1>=1))||((u3.initialize>=1)&&(u0.r_stopped>=1)))||((i1.u1.move>=1)&&(u0.r_active>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1))) U (((((((((((u0.r_moving>=1)||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||(u3.p_i1>=1))||((u3.initialize>=1)&&(u0.r_stopped>=1)))||((i1.u1.move>=1)&&(u0.r_active>=1)))||((u3.initialized>=1)&&(u3.p_i2>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))&&(((u0.r_moving>=1)||(i1.u1.p_sc>=1))||((u3.initialize>=1)&&(u0.r_stopped>=1)))))) * !(((i1.u1.p_sc>=1)||(i1.u2.p_rel>=1))))) + EG(!(((i1.u1.p_sc>=1)||(i1.u2.p_rel>=1)))))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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
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 0,0,0.386236,10340,1,0,7006,3556,348,21645,198,21937,9611
FORMULA RobotManipulation-PT-00002-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(((((((u0.r_moving<1)&&(u3.p_rdy<1))&&(i1.u1.p_sc<1))&&((i1.u1.move<1)||(u0.r_active<1)))&&((u3.initialized<1)||(u3.p_i2<1)))&&((u0.off<1)||(u0.r_active<1))) U (EG(((((EX(TRUE) * (((((((((((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||(u3.p_i1>=1))||((u3.initialize>=1)&&(u0.r_stopped>=1)))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(i1.u1.p_sc>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(i1.u2.p_rel>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||(u3.p_i1>=1))) * ((u0.r_moving>=1)||((u3.p_rdy>=1)&&(i1.u1.access>=1)))) * (((u3.p_rdy>=1)||(i1.u1.p_sc>=1))||(u3.p_i1>=1))) * (((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u0.r_moving>=1))||(i1.u1.p_sc>=1)))) + (E((i1.u1.p_sc>=1) U (((((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u0.r_moving>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1))&&(u3.p_i1<1))) * (!(AG((((u0.r_moving<1)&&((u3.initialized<1)||(u3.p_i2<1)))&&((i1.u2.moved<1)||(i1.u2.p_m<1))))) + !(EX(((u0.r_moving>=1)||(u3.p_rdy>=1))))))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,((((((u0.r_moving<1)&&(u3.p_rdy<1))&&(i1.u1.p_sc<1))&&((i1.u1.move<1)||(u0.r_active<1)))&&((u3.initialized<1)||(u3.p_i2<1)))&&((u0.off<1)||(u0.r_active<1)))),((((EX(TRUE) * (((((((((((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||(u3.p_i1>=1))||((u3.initialize>=1)&&(u0.r_stopped>=1)))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(i1.u1.p_sc>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(i1.u2.p_rel>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||(u3.p_i1>=1))) * ((u0.r_moving>=1)||((u3.p_rdy>=1)&&(i1.u1.access>=1)))) * (((u3.p_rdy>=1)||(i1.u1.p_sc>=1))||(u3.p_i1>=1))) * (((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u0.r_moving>=1))||(i1.u1.p_sc>=1))))] != FALSE + ([(FwdU((FwdU(Init,((((((u0.r_moving<1)&&(u3.p_rdy<1))&&(i1.u1.p_sc<1))&&((i1.u1.move<1)||(u0.r_active<1)))&&((u3.initialized<1)||(u3.p_i2<1)))&&((u0.off<1)||(u0.r_active<1)))) * E((i1.u1.p_sc>=1) U (((((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u0.r_moving>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1))&&(u3.p_i1<1)))),TRUE) * !((((u0.r_moving<1)&&((u3.initialized<1)||(u3.p_i2<1)))&&((i1.u2.moved<1)||(i1.u2.p_m<1)))))] != FALSE + [((FwdU(Init,((((((u0.r_moving<1)&&(u3.p_rdy<1))&&(i1.u1.p_sc<1))&&((i1.u1.move<1)||(u0.r_active<1)))&&((u3.initialized<1)||(u3.p_i2<1)))&&((u0.off<1)||(u0.r_active<1)))) * E((i1.u1.p_sc>=1) U (((((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u0.r_moving>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1))&&(u3.p_i1<1)))) * !(EX(((u0.r_moving>=1)||(u3.p_rdy>=1)))))] != FALSE))
(forward)formula 1,1,0.444702,10868,1,0,7937,3827,480,25036,215,25663,12722
FORMULA RobotManipulation-PT-00002-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((AX(EX(EX(AG((i1.u2.p_rel>=1))))) * AF(EX((((((((((((i1.u1.move<1)||(u0.r_active<1))&&(u0.r_moving<1))&&(u3.p_rdy<1))&&((u0.off<1)||(u0.r_active<1)))&&((u3.initialized<1)||(u3.p_i2<1)))&&(i1.u1.p_sc<1))&&(i1.u2.p_rel<1))&&((u3.p_rdy<1)||(i1.u1.access<1)))&&((i1.u2.moved<1)||(i1.u2.p_m<1)))&&(u3.p_i1<1))))) * E(((((u3.initialize<1)||(u0.r_stopped<1))&&((i1.u1.move<1)||(u0.r_active<1)))&&((u0.off<1)||(u0.r_active<1))) U EF(AX(AF(((u0.r_moving>=1)||(i1.u2.p_rel>=1)))))))
=> equivalent forward existential formula: (([(EY(Init) * !(EX(EX(!(E(TRUE U !((i1.u2.p_rel>=1))))))))] = FALSE * [FwdG(Init,!(EX((((((((((((i1.u1.move<1)||(u0.r_active<1))&&(u0.r_moving<1))&&(u3.p_rdy<1))&&((u0.off<1)||(u0.r_active<1)))&&((u3.initialized<1)||(u3.p_i2<1)))&&(i1.u1.p_sc<1))&&(i1.u2.p_rel<1))&&((u3.p_rdy<1)||(i1.u1.access<1)))&&((i1.u2.moved<1)||(i1.u2.p_m<1)))&&(u3.p_i1<1)))))] = FALSE) * [(Init * !(E(((((u3.initialize<1)||(u0.r_stopped<1))&&((i1.u1.move<1)||(u0.r_active<1)))&&((u0.off<1)||(u0.r_active<1))) U E(TRUE U !(EX(!(!(EG(!(((u0.r_moving>=1)||(i1.u2.p_rel>=1))))))))))))] = FALSE)
(forward)formula 2,0,0.686349,15620,1,0,13712,4921,563,50559,220,50321,17631
FORMULA RobotManipulation-PT-00002-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(!(EG((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||(u3.p_rdy>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||(u3.p_rdy>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1))))))] != FALSE
(forward)formula 3,0,0.69859,16148,1,0,13918,4961,569,51513,220,51200,17898
FORMULA RobotManipulation-PT-00002-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((((!(E(EG(((((((((((i1.u1.move>=1)&&(u0.r_active>=1))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(i1.u1.p_sc>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1))) U AX(((((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||((u3.initialized>=1)&&(u3.p_i2>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||(i1.u1.p_sc>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(i1.u2.p_rel>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))))) * E(((((((u3.initialized>=1)&&(u3.p_i2>=1))||(u3.p_rdy>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||(i1.u2.p_rel>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1))) U ((((((u0.r_moving>=1)||((u3.initialized>=1)&&(u3.p_i2>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||(u3.p_i1>=1)))) * (((((((u3.p_rdy>=1)||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||(u3.p_i1>=1))||((u3.initialize>=1)&&(u0.r_stopped>=1)))||((i1.u1.move>=1)&&(u0.r_active>=1)))||((u3.initialized>=1)&&(u3.p_i2>=1)))) * (AG(EF(((u0.r_moving>=1)||(i1.u1.p_sc>=1)))) + EF((((((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u0.r_moving>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(i1.u2.p_rel>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||(u3.p_i1>=1))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((!(E(EG(((((((((((i1.u1.move>=1)&&(u0.r_active>=1))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(i1.u1.p_sc>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1))) U !(EX(!(((((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||((u3.initialized>=1)&&(u3.p_i2>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||(i1.u1.p_sc>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(i1.u2.p_rel>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))))))) * E(((((((u3.initialized>=1)&&(u3.p_i2>=1))||(u3.p_rdy>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||(i1.u2.p_rel>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1))) U ((((((u0.r_moving>=1)||((u3.initialized>=1)&&(u3.p_i2>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||(u3.p_i1>=1)))) * (((((((u3.p_rdy>=1)||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||(u3.p_i1>=1))||((u3.initialize>=1)&&(u0.r_stopped>=1)))||((i1.u1.move>=1)&&(u0.r_active>=1)))||((u3.initialized>=1)&&(u3.p_i2>=1))))) * !(E(TRUE U !(E(TRUE U ((u0.r_moving>=1)||(i1.u1.p_sc>=1)))))))] != FALSE + [(FwdU((FwdU(Init,TRUE) * ((!(E(EG(((((((((((i1.u1.move>=1)&&(u0.r_active>=1))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(i1.u1.p_sc>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1))) U !(EX(!(((((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||((u3.initialized>=1)&&(u3.p_i2>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||(i1.u1.p_sc>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(i1.u2.p_rel>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))))))) * E(((((((u3.initialized>=1)&&(u3.p_i2>=1))||(u3.p_rdy>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||(i1.u2.p_rel>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1))) U ((((((u0.r_moving>=1)||((u3.initialized>=1)&&(u3.p_i2>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||(u3.p_i1>=1)))) * (((((((u3.p_rdy>=1)||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||(u3.p_i1>=1))||((u3.initialize>=1)&&(u0.r_stopped>=1)))||((i1.u1.move>=1)&&(u0.r_active>=1)))||((u3.initialized>=1)&&(u3.p_i2>=1))))),TRUE) * (((((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u0.r_moving>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(i1.u2.p_rel>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||(u3.p_i1>=1)))] != FALSE)
(forward)formula 4,0,0.780143,16772,1,0,14582,5131,625,53392,221,52394,19072
FORMULA RobotManipulation-PT-00002-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AX(((u0.r_moving>=1)||(i1.u1.p_sc>=1))) + (EG((AG((((((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(i1.u1.p_sc>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(i1.u2.p_rel>=1))||(u3.p_i1>=1))) * ((((((i1.u1.move>=1)&&(u0.r_active>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(i1.u2.p_rel>=1)))) * AF(!(AG(!(EF((u0.r_moving>=1))))))))
=> equivalent forward existential formula: ([((Init * !(!(EX(!(((u0.r_moving>=1)||(i1.u1.p_sc>=1))))))) * !(EG((!(E(TRUE U !((((((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(i1.u1.p_sc>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(i1.u2.p_rel>=1))||(u3.p_i1>=1))))) * ((((((i1.u1.move>=1)&&(u0.r_active>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(i1.u2.p_rel>=1))))))] = FALSE * [FwdG((Init * !(!(EX(!(((u0.r_moving>=1)||(i1.u1.p_sc>=1))))))),!(!(!(E(TRUE U !(!(E(TRUE U (u0.r_moving>=1)))))))))] = FALSE)
(forward)formula 5,0,0.828133,17300,1,0,15287,5258,644,54634,221,52903,20294
FORMULA RobotManipulation-PT-00002-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX((((((((((u3.p_rdy>=1)||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1)) + (EG((((i1.u1.move>=1)&&(u0.r_active>=1))||(i1.u1.p_sc>=1))) * (EX((((((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(u3.p_rdy>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||(i1.u2.p_rel>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1))) + AX((((((((((i1.u1.move>=1)&&(u0.r_active>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(u3.p_rdy>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||(i1.u2.p_rel>=1))||(u3.p_i1>=1)))))) + ((u3.initialize>=1)&&(u0.r_stopped>=1))) + ((i1.u1.move>=1)&&(u0.r_active>=1))) + ((i1.u2.moved>=1)&&(i1.u2.p_m>=1))) * (EG((((u3.p_rdy<1)||(i1.u1.access<1))&&((((((((i1.u1.move>=1)&&(u0.r_active>=1))||(u3.p_rdy>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1)))) + !(E(AG((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||(i1.u1.p_sc>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(i1.u2.p_rel>=1))) U (((((u3.initialized>=1)&&(u3.p_i2>=1))||(u0.r_moving>=1))||(u3.p_rdy>=1))||(i1.u1.p_sc>=1)))))) * (!(AF((((((((i1.u1.move>=1)&&(u0.r_active>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||(u3.p_i1>=1))&&(((u0.r_moving>=1)||((u0.off>=1)&&(u0.r_active>=1)))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))))) + !(AX(E(((((((i1.u1.move>=1)&&(u0.r_active>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1))) U (((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1))))))))
=> equivalent forward existential formula: ((([(((((EY(Init) * !(((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))) * !(((i1.u1.move>=1)&&(u0.r_active>=1)))) * !(((u3.initialize>=1)&&(u0.r_stopped>=1)))) * !((((u3.p_rdy>=1)||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1)))) * !(EG((((i1.u1.move>=1)&&(u0.r_active>=1))||(i1.u1.p_sc>=1)))))] = FALSE * [(EY((((((EY(Init) * !(((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))) * !(((i1.u1.move>=1)&&(u0.r_active>=1)))) * !(((u3.initialize>=1)&&(u0.r_stopped>=1)))) * !((((u3.p_rdy>=1)||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1)))) * !(EX((((((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(u3.p_rdy>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||(i1.u2.p_rel>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1)))))) * !((((((((((i1.u1.move>=1)&&(u0.r_active>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(u3.p_rdy>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||(i1.u2.p_rel>=1))||(u3.p_i1>=1))))] = FALSE) * [(FwdU((EY(Init) * !(EG((((u3.p_rdy<1)||(i1.u1.access<1))&&((((((((i1.u1.move>=1)&&(u0.r_active>=1))||(u3.p_rdy>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1)))))),!(E(TRUE U !((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||(i1.u1.p_sc>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(i1.u2.p_rel>=1)))))) * (((((u3.initialized>=1)&&(u3.p_i2>=1))||(u0.r_moving>=1))||(u3.p_rdy>=1))||(i1.u1.p_sc>=1)))] = FALSE) * [((EY(Init) * !(!(!(EX(!(E(((((((i1.u1.move>=1)&&(u0.r_active>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1))) U (((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1))))))))) * !(EG(!((((((((i1.u1.move>=1)&&(u0.r_active>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||(u3.p_i1>=1))&&(((u0.r_moving>=1)||((u0.off>=1)&&(u0.r_active>=1)))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1))))))))] = FALSE)
(forward)formula 6,1,1.0302,21128,1,0,20619,6158,714,70048,221,64262,28533
FORMULA RobotManipulation-PT-00002-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((E((((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1)) U (((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||(i1.u2.p_rel>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1))) * EF(EX(((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E((((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1)) U (((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||(i1.u2.p_rel>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1)))))] = FALSE * [(FwdU(Init,TRUE) * !(E(TRUE U EX(((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))))))] = FALSE)
(forward)formula 7,0,1.04625,21128,1,0,20929,6271,729,70731,221,64727,28853
FORMULA RobotManipulation-PT-00002-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EX(E(((EG(((i1.u1.move>=1)&&(u0.r_active>=1))) + (i1.u1.p_sc>=1)) + (i1.u2.p_rel>=1)) U AF((((((((((((((((((((((((i1.u1.move<1)||(u0.r_active<1))&&(u0.r_moving<1))&&(u3.p_rdy<1))&&((u0.off<1)||(u0.r_active<1)))&&((u3.initialized<1)||(u3.p_i2<1)))&&(i1.u1.p_sc<1))&&((i1.u2.moved<1)||(i1.u2.p_m<1)))&&((u3.p_rdy<1)||(i1.u1.access<1)))&&(u3.p_i1<1))||((u3.initialize>=1)&&(u0.r_stopped>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.initialize>=1)&&(u0.r_stopped>=1)))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||(i1.u1.p_sc>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(i1.u2.p_rel>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||(u3.p_i1>=1))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),((EG(((i1.u1.move>=1)&&(u0.r_active>=1))) + (i1.u1.p_sc>=1)) + (i1.u2.p_rel>=1))) * !(EG(!((((((((((((((((((((((((i1.u1.move<1)||(u0.r_active<1))&&(u0.r_moving<1))&&(u3.p_rdy<1))&&((u0.off<1)||(u0.r_active<1)))&&((u3.initialized<1)||(u3.p_i2<1)))&&(i1.u1.p_sc<1))&&((i1.u2.moved<1)||(i1.u2.p_m<1)))&&((u3.p_rdy<1)||(i1.u1.access<1)))&&(u3.p_i1<1))||((u3.initialize>=1)&&(u0.r_stopped>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.initialize>=1)&&(u0.r_stopped>=1)))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||(i1.u1.p_sc>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(i1.u2.p_rel>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||(u3.p_i1>=1))))))] = FALSE
(forward)formula 8,0,1.05885,21656,1,0,21058,6271,767,70997,221,64727,29121
FORMULA RobotManipulation-PT-00002-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(AX(((!(AG((((((((((((u0.off>=1)&&(u0.r_active>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||((u3.initialize>=1)&&(u0.r_stopped>=1)))||((i1.u1.move>=1)&&(u0.r_active>=1)))||((u3.initialized>=1)&&(u3.p_i2>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(i1.u2.p_rel>=1)))) + ((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(u3.p_rdy>=1))||(u3.p_i1>=1))&&((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1)))) + (((((u3.initialize<1)||(u0.r_stopped<1))&&((i1.u1.move<1)||(u0.r_active<1)))||(((((((((((u3.initialize<1)||(u0.r_stopped<1))&&(u0.r_moving<1))&&((u0.off<1)||(u0.r_active<1)))&&((u3.initialized<1)||(u3.p_i2<1)))&&(u3.p_rdy<1))&&(i1.u1.p_sc<1))&&((u3.p_rdy<1)||(i1.u1.access<1)))&&(i1.u2.p_rel<1))&&((i1.u2.moved<1)||(i1.u2.p_m<1)))&&(u3.p_i1<1)))&&(((((u3.initialize>=1)&&(u0.r_stopped>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1)))))) * (!(AX((AG(((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))) + A(EX(((((((u0.r_moving>=1)||((u3.initialized>=1)&&(u3.p_i2>=1)))||(u3.p_rdy>=1))||(i1.u2.p_rel>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))) U (((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1))))))) + !(AX(((((i1.u1.move>=1)&&(u0.r_active>=1))||(u3.p_rdy>=1))||(i1.u1.p_sc>=1))))))
=> equivalent forward existential formula: ([(FwdU((EY((Init * !(!(EX(!(((!(!(E(TRUE U !((((((((((((u0.off>=1)&&(u0.r_active>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||((u3.initialize>=1)&&(u0.r_stopped>=1)))||((i1.u1.move>=1)&&(u0.r_active>=1)))||((u3.initialized>=1)&&(u3.p_i2>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(i1.u2.p_rel>=1)))))) + ((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(u3.p_rdy>=1))||(u3.p_i1>=1))&&((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1)))) + (((((u3.initialize<1)||(u0.r_stopped<1))&&((i1.u1.move<1)||(u0.r_active<1)))||(((((((((((u3.initialize<1)||(u0.r_stopped<1))&&(u0.r_moving<1))&&((u0.off<1)||(u0.r_active<1)))&&((u3.initialized<1)||(u3.p_i2<1)))&&(u3.p_rdy<1))&&(i1.u1.p_sc<1))&&((u3.p_rdy<1)||(i1.u1.access<1)))&&(i1.u2.p_rel<1))&&((i1.u2.moved<1)||(i1.u2.p_m<1)))&&(u3.p_i1<1)))&&(((((u3.initialize>=1)&&(u0.r_stopped>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1)))))))))) * !(!((E(!((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))) U (!(EX(((((((u0.r_moving>=1)||((u3.initialized>=1)&&(u3.p_i2>=1)))||(u3.p_rdy>=1))||(i1.u2.p_rel>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1))))) * !((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))))) + EG(!((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1))))))))),TRUE) * !(((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((i1.u1.move>=1)&&(u0.r_active>=1)))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))))] != FALSE + [(EY((Init * !(!(EX(!(((!(!(E(TRUE U !((((((((((((u0.off>=1)&&(u0.r_active>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||((u3.initialize>=1)&&(u0.r_stopped>=1)))||((i1.u1.move>=1)&&(u0.r_active>=1)))||((u3.initialized>=1)&&(u3.p_i2>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(i1.u2.p_rel>=1)))))) + ((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(u3.p_rdy>=1))||(u3.p_i1>=1))&&((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1)))) + (((((u3.initialize<1)||(u0.r_stopped<1))&&((i1.u1.move<1)||(u0.r_active<1)))||(((((((((((u3.initialize<1)||(u0.r_stopped<1))&&(u0.r_moving<1))&&((u0.off<1)||(u0.r_active<1)))&&((u3.initialized<1)||(u3.p_i2<1)))&&(u3.p_rdy<1))&&(i1.u1.p_sc<1))&&((u3.p_rdy<1)||(i1.u1.access<1)))&&(i1.u2.p_rel<1))&&((i1.u2.moved<1)||(i1.u2.p_m<1)))&&(u3.p_i1<1)))&&(((((u3.initialize>=1)&&(u0.r_stopped>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1)))))))))) * !(((((i1.u1.move>=1)&&(u0.r_active>=1))||(u3.p_rdy>=1))||(i1.u1.p_sc>=1))))] != FALSE)
(forward)formula 9,0,1.10214,21920,1,0,21554,6403,832,72588,225,65942,30486
FORMULA RobotManipulation-PT-00002-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EX((A((AX(((i1.u1.move>=1)&&(u0.r_active>=1))) * (((((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(u3.p_rdy>=1))||(i1.u1.p_sc>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(i1.u2.p_rel>=1))||(u3.p_i1>=1))) U E(AG(((i1.u2.moved>=1)&&(i1.u2.p_m>=1))) U EG(((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||(i1.u2.p_rel>=1))))) + A(((((u0.r_moving>=1)||(u3.p_rdy>=1))||((u0.off>=1)&&(u0.r_active>=1)))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1))) U AG((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1))))))) * !(EG(((((((u0.r_moving>=1)||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1)) * EX(E(((((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||(i1.u2.p_rel>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||(u3.p_i1>=1)) U ((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(i1.u1.p_sc>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(i1.u2.p_rel>=1))))))))
=> equivalent forward existential formula: ([(Init * !(EX((!((E(!(E(!(E(TRUE U !(((i1.u2.moved>=1)&&(i1.u2.p_m>=1))))) U EG(((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||(i1.u2.p_rel>=1))))) U (!((!(EX(!(((i1.u1.move>=1)&&(u0.r_active>=1))))) * (((((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(u3.p_rdy>=1))||(i1.u1.p_sc>=1))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(i1.u2.p_rel>=1))||(u3.p_i1>=1)))) * !(E(!(E(TRUE U !(((i1.u2.moved>=1)&&(i1.u2.p_m>=1))))) U EG(((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||(i1.u2.p_rel>=1))))))) + EG(!(E(!(E(TRUE U !(((i1.u2.moved>=1)&&(i1.u2.p_m>=1))))) U EG(((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||(i1.u2.p_rel>=1)))))))) + !((E(!(!(E(TRUE U !((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1))))))) U (!(((((u0.r_moving>=1)||(u3.p_rdy>=1))||((u0.off>=1)&&(u0.r_active>=1)))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))) * !(!(E(TRUE U !((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1))))))))) + EG(!(!(E(TRUE U !((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||((u0.off>=1)&&(u0.r_active>=1)))||((u3.p_rdy>=1)&&(i1.u1.access>=1))))))))))))))] = FALSE * [FwdG(Init,((((((u0.r_moving>=1)||(i1.u1.p_sc>=1))||(i1.u2.p_rel>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(u3.p_i1>=1)) * EX(E(((((((((((u3.initialize>=1)&&(u0.r_stopped>=1))||(u0.r_moving>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||((u0.off>=1)&&(u0.r_active>=1)))||(u3.p_rdy>=1))||(i1.u2.p_rel>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||((i1.u2.moved>=1)&&(i1.u2.p_m>=1)))||(u3.p_i1>=1)) U ((((((u3.initialize>=1)&&(u0.r_stopped>=1))||((u3.initialized>=1)&&(u3.p_i2>=1)))||(i1.u1.p_sc>=1))||((u3.p_rdy>=1)&&(i1.u1.access>=1)))||(i1.u2.p_rel>=1))))))] = FALSE)
(forward)formula 10,0,1.20837,23768,1,0,23398,6743,848,85534,225,76920,32836
FORMULA RobotManipulation-PT-00002-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1620947032597

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="RobotManipulation-PT-00002"
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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 RobotManipulation-PT-00002, 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 r197-smll-162089451700018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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