About the Execution of ITS-Tools for JoinFreeModules-PT-0004
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
264.844 | 8120.00 | 12772.00 | 276.60 | TFFFFTFFTTFTTFTT | normal |
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.r121-tall-162075406900394.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 JoinFreeModules-PT-0004, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406900394
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 26 06:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 26 06:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 24 10:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 24 10:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 23K 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 JoinFreeModules-PT-0004-CTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0004-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1620841036132
Running Version 0
[2021-05-12 17:37:17] [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-12 17:37:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 17:37:17] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2021-05-12 17:37:17] [INFO ] Transformed 21 places.
[2021-05-12 17:37:17] [INFO ] Transformed 33 transitions.
[2021-05-12 17:37:17] [INFO ] Parsed PT model containing 21 places and 33 transitions in 65 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Reduce places removed 1 places and 0 transitions.
Support contains 20 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 8 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:37:18] [INFO ] Computed 4 place invariants in 8 ms
[2021-05-12 17:37:18] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:37:18] [INFO ] Computed 4 place invariants in 6 ms
[2021-05-12 17:37:18] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:37:18] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:37:18] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 33 rows 20 cols
[2021-05-12 17:37:18] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-12 17:37:18] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
[2021-05-12 17:37:18] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-12 17:37:18] [INFO ] Flatten gal took : 23 ms
FORMULA JoinFreeModules-PT-0004-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 17:37:18] [INFO ] Flatten gal took : 7 ms
[2021-05-12 17:37:18] [INFO ] Input system was already deterministic with 33 transitions.
Finished random walk after 1177 steps, including 6 resets, run visited all 71 properties in 14 ms. (steps per millisecond=84 )
Applied a total of 0 rules in 9 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2021-05-12 17:37:18] [INFO ] Flatten gal took : 3 ms
[2021-05-12 17:37:18] [INFO ] Flatten gal took : 3 ms
[2021-05-12 17:37:18] [INFO ] Input system was already deterministic with 33 transitions.
[2021-05-12 17:37:18] [INFO ] Flatten gal took : 3 ms
[2021-05-12 17:37:18] [INFO ] Flatten gal took : 3 ms
[2021-05-12 17:37:18] [INFO ] Time to serialize gal into /tmp/CTLFireability2090315215434003721.gal : 1 ms
[2021-05-12 17:37:18] [INFO ] Time to serialize properties into /tmp/CTLFireability9124424542428263762.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/CTLFireability2090315215434003721.gal, -t, CGAL, -ctl, /tmp/CTLFireability9124424542428263762.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/CTLFireability2090315215434003721.gal -t CGAL -ctl /tmp/CTLFireability9124424542428263762.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,1.47763e+07,0.012161,4312,2,128,5,1441,6,0,176,1196,0
Converting to forward existential form...Done !
original formula: !(AG(AF(((((((((((p6>=5)||(p3>=2))||(p7>=2))||(p9>=3))||(p8>=2))||(p1>=5))||(p13>=1)) + !(AF((((((((((p17>=2)||(p19>=4))||(p2>=2))||(p6>=3))||(p9>=4))||(p9>=3))||(p8>=1))||(p15>=5))||(p13>=1))))) + A((((p20>=5)||((((p3>=4)&&(p8>=4))&&(p13>=4))&&(p18>=4)))||(p14>=3)) U (((p5>=5)||(p11>=5))||(p13>=1)))) + ((((((p20>=5)||(p5>=5))||(p15>=5))||(p14>=3))||(p13>=1))&&(((((((p4>=4)||(p4>=3))||(p6>=3))||(p10>=5))||(p9>=4))||(p16>=5))||(p16>=3)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((((((((((p6>=5)||(p3>=2))||(p7>=2))||(p9>=3))||(p8>=2))||(p1>=5))||(p13>=1)) + !(!(EG(!((((((((((p17>=2)||(p19>=4))||(p2>=2))||(p6>=3))||(p9>=4))||(p9>=3))||(p8>=1))||(p15>=5))||(p13>=1))))))) + !((E(!((((p5>=5)||(p11>=5))||(p13>=1))) U (!((((p20>=5)||((((p3>=4)&&(p8>=4))&&(p13>=4))&&(p18>=4)))||(p14>=3))) * !((((p5>=5)||(p11>=5))||(p13>=1))))) + EG(!((((p5>=5)||(p11>=5))||(p13>=1))))))) + ((((((p20>=5)||(p5>=5))||(p15>=5))||(p14>=3))||(p13>=1))&&(((((((p4>=4)||(p4>=3))||(p6>=3))||(p10>=5))||(p9>=4))||(p16>=5))||(p16>=3))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t10, t11, t12, t18, t19, t20, t26, t27, t28, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/12/33
(forward)formula 0,1,0.470748,21768,1,0,535,97469,104,267,1068,141893,547
FORMULA JoinFreeModules-PT-0004-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2021-05-12 17:37:19] [INFO ] Flatten gal took : 2 ms
[2021-05-12 17:37:19] [INFO ] Flatten gal took : 2 ms
[2021-05-12 17:37:19] [INFO ] Input system was already deterministic with 33 transitions.
[2021-05-12 17:37:19] [INFO ] Flatten gal took : 2 ms
[2021-05-12 17:37:19] [INFO ] Flatten gal took : 2 ms
[2021-05-12 17:37:19] [INFO ] Time to serialize gal into /tmp/CTLFireability12116181603141177234.gal : 0 ms
[2021-05-12 17:37:19] [INFO ] Time to serialize properties into /tmp/CTLFireability13330812877707068209.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/CTLFireability12116181603141177234.gal, -t, CGAL, -ctl, /tmp/CTLFireability13330812877707068209.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/CTLFireability12116181603141177234.gal -t CGAL -ctl /tmp/CTLFireability13330812877707068209.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,1.47763e+07,0.008539,4372,2,128,5,1441,6,0,176,1196,0
Converting to forward existential form...Done !
original formula: EG(A(A(((AF(((((((((((p4>=3)||(p6>=5))||(p3>=2))||(p7>=2))||(p9>=4))||(p8>=2))||(p9>=3))||(p14>=3))||(p1>=5))||(p16>=3))) * ((p10>=5)||(p16>=5))) * (((((((((p18>=2)||(p3>=2))||(p6>=5))||(p9>=4))||(p9>=3))||(p11>=5))||(p12>=2))||(p15>=5))||(p1>=3))) U EG(((((p4>=4)||(p4>=3))||(p3>=2))||(p16>=5)))) U (AF((p19>=4)) * ((((((((p2>=2)||(p18>=1))||(p4>=3))||(p11>=3))||(p12>=2))||(p16>=5))||(p1>=3))||((((p3>=4)&&(p8>=4))&&(p13>=4))&&(p18>=4))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!((!(EG(!((p19>=4)))) * ((((((((p2>=2)||(p18>=1))||(p4>=3))||(p11>=3))||(p12>=2))||(p16>=5))||(p1>=3))||((((p3>=4)&&(p8>=4))&&(p13>=4))&&(p18>=4))))) U (!(!((E(!(EG(((((p4>=4)||(p4>=3))||(p3>=2))||(p16>=5)))) U (!(((!(EG(!(((((((((((p4>=3)||(p6>=5))||(p3>=2))||(p7>=2))||(p9>=4))||(p8>=2))||(p9>=3))||(p14>=3))||(p1>=5))||(p16>=3))))) * ((p10>=5)||(p16>=5))) * (((((((((p18>=2)||(p3>=2))||(p6>=5))||(p9>=4))||(p9>=3))||(p11>=5))||(p12>=2))||(p15>=5))||(p1>=3)))) * !(EG(((((p4>=4)||(p4>=3))||(p3>=2))||(p16>=5)))))) + EG(!(EG(((((p4>=4)||(p4>=3))||(p3>=2))||(p16>=5)))))))) * !((!(EG(!((p19>=4)))) * ((((((((p2>=2)||(p18>=1))||(p4>=3))||(p11>=3))||(p12>=2))||(p16>=5))||(p1>=3))||((((p3>=4)&&(p8>=4))&&(p13>=4))&&(p18>=4))))))) + EG(!((!(EG(!((p19>=4)))) * ((((((((p2>=2)||(p18>=1))||(p4>=3))||(p11>=3))||(p12>=2))||(p16>=5))||(p1>=3))||((((p3>=4)&&(p8>=4))&&(p13>=4))&&(p18>=4)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t10, t11, t12, t18, t19, t20, t26, t27, t28, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/12/33
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.70354,54300,1,0,1412,274275,115,835,1078,427330,1370
FORMULA JoinFreeModules-PT-0004-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2021-05-12 17:37:20] [INFO ] Flatten gal took : 5 ms
[2021-05-12 17:37:20] [INFO ] Flatten gal took : 9 ms
[2021-05-12 17:37:20] [INFO ] Applying decomposition
[2021-05-12 17:37:20] [INFO ] Flatten gal took : 4 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/graph17541026491284489916.txt, -o, /tmp/graph17541026491284489916.bin, -w, /tmp/graph17541026491284489916.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/graph17541026491284489916.bin, -l, -1, -v, -w, /tmp/graph17541026491284489916.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 17:37:20] [INFO ] Decomposing Gal with order
[2021-05-12 17:37:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 17:37:20] [INFO ] Flatten gal took : 23 ms
[2021-05-12 17:37:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 17:37:20] [INFO ] Time to serialize gal into /tmp/CTLFireability4041550986886437825.gal : 1 ms
[2021-05-12 17:37:20] [INFO ] Time to serialize properties into /tmp/CTLFireability8041656034362352507.ctl : 5 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/CTLFireability4041550986886437825.gal, -t, CGAL, -ctl, /tmp/CTLFireability8041656034362352507.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/CTLFireability4041550986886437825.gal -t CGAL -ctl /tmp/CTLFireability8041656034362352507.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,1.47763e+07,0.009042,4544,43,40,368,294,81,547,45,764,0
Converting to forward existential form...Done !
original formula: AF((((AF((((((i0.u1.p2<2)&&((((i0.u1.p3<4)||(i1.u2.p8<4))||(i2.u5.p13<4))||(i3.u7.p18<4)))&&(i2.u5.p12<2))&&(i0.u0.p1<5))||(((((((((i3.u6.p19<4)&&(i0.u0.p5<5))&&(i3.u7.p18<2))&&(i1.u3.p6<3))&&(i1.u3.p9<4))&&(i2.u4.p14<3))&&(i3.u6.p16<5))&&(i2.u5.p13<2))&&(i2.u5.p13<1)))) + E(EF((((((((i0.u1.p2>=2)||(i0.u0.p4>=3))||(i0.u1.p3>=1))||(i1.u3.p9>=3))||(i2.u4.p15>=5))||(i3.u6.p16>=5))||(i2.u5.p13>=1))) U (((((((E((((((((((i3.u6.p20>=5)||(i3.u7.p18>=1))||(i0.u1.p3>=2))||(i1.u3.p10>=5))||(i1.u3.p9>=3))||(i1.u2.p8>=2))||(i2.u4.p11>=3))||(i3.u6.p16>=5))||(i3.u6.p16>=3)) U (((i2.u4.p11>=5)||(i1.u3.p9>=3))||(i3.u6.p16>=3))) * (i0.u1.p3<2)) * ((((i0.u1.p3<4)||(i1.u2.p8<4))||(i2.u5.p13<4))||(i3.u7.p18<4))) * (i2.u5.p12<2)) * (i2.u4.p14<4)) * (i2.u4.p15<5)) * (i3.u6.p16<5)) * (i2.u5.p13<1)))) + !(EX((((((i0.u0.p4>=4)||(i0.u0.p5>=5))||(i3.u7.p18>=1))||(i1.u3.p6>=5))||(i1.u2.p8>=2))))) + !(AF((((((((((((((i0.u1.p3>=1)||(i1.u3.p10>=5))||(i1.u2.p7>=2))||(i2.u4.p15>=5))||(i3.u6.p16>=5))||(i2.u5.p13>=2))||(i3.u6.p16>=3))||(i0.u0.p1>=3))||(i1.u2.p7>=2))||(i2.u4.p11>=5))||(i2.u4.p11>=3))||((((i0.u0.p4<4)&&(i0.u0.p4<3))&&(i3.u7.p18<1))&&(i0.u1.p3<1)))||((((i3.u7.p18<1)&&(i1.u3.p6<5))&&(i0.u1.p3<1))&&(i1.u3.p9<3)))))))
=> equivalent forward existential formula: [FwdG(Init,!((((!(EG(!((((((i0.u1.p2<2)&&((((i0.u1.p3<4)||(i1.u2.p8<4))||(i2.u5.p13<4))||(i3.u7.p18<4)))&&(i2.u5.p12<2))&&(i0.u0.p1<5))||(((((((((i3.u6.p19<4)&&(i0.u0.p5<5))&&(i3.u7.p18<2))&&(i1.u3.p6<3))&&(i1.u3.p9<4))&&(i2.u4.p14<3))&&(i3.u6.p16<5))&&(i2.u5.p13<2))&&(i2.u5.p13<1)))))) + E(E(TRUE U (((((((i0.u1.p2>=2)||(i0.u0.p4>=3))||(i0.u1.p3>=1))||(i1.u3.p9>=3))||(i2.u4.p15>=5))||(i3.u6.p16>=5))||(i2.u5.p13>=1))) U (((((((E((((((((((i3.u6.p20>=5)||(i3.u7.p18>=1))||(i0.u1.p3>=2))||(i1.u3.p10>=5))||(i1.u3.p9>=3))||(i1.u2.p8>=2))||(i2.u4.p11>=3))||(i3.u6.p16>=5))||(i3.u6.p16>=3)) U (((i2.u4.p11>=5)||(i1.u3.p9>=3))||(i3.u6.p16>=3))) * (i0.u1.p3<2)) * ((((i0.u1.p3<4)||(i1.u2.p8<4))||(i2.u5.p13<4))||(i3.u7.p18<4))) * (i2.u5.p12<2)) * (i2.u4.p14<4)) * (i2.u4.p15<5)) * (i3.u6.p16<5)) * (i2.u5.p13<1)))) + !(EX((((((i0.u0.p4>=4)||(i0.u0.p5>=5))||(i3.u7.p18>=1))||(i1.u3.p6>=5))||(i1.u2.p8>=2))))) + !(!(EG(!((((((((((((((i0.u1.p3>=1)||(i1.u3.p10>=5))||(i1.u2.p7>=2))||(i2.u4.p15>=5))||(i3.u6.p16>=5))||(i2.u5.p13>=2))||(i3.u6.p16>=3))||(i0.u0.p1>=3))||(i1.u2.p7>=2))||(i2.u4.p11>=5))||(i2.u4.p11>=3))||((((i0.u0.p4<4)&&(i0.u0.p4<3))&&(i3.u7.p18<1))&&(i0.u1.p3<1)))||((((i3.u7.p18<1)&&(i1.u3.p6<5))&&(i0.u1.p3<1))&&(i1.u3.p9<3))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.t4, i0.t3, i0.u1.t2, i1.t12, i1.t11, i1.u2.t10, i2.t20, i2.t19, i2.u5.t18, i3.t28, i3.t27, i3.u7.t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/12/33
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
(forward)formula 0,1,0.300768,15804,1,0,18071,4413,621,48708,213,16964,12808
FORMULA JoinFreeModules-PT-0004-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (!(EG(AX(((((((((i3.u6.p20>=5)||(i0.u0.p5>=5))||(i0.u0.p4>=4))||(i0.u0.p4>=3))||(i0.u1.p3>=1))||(i1.u3.p6>=3))||(i2.u5.p12>=2))||(i3.u6.p16>=5))))) * (EF(((((i3.u6.p20>=5)||(i2.u4.p11>=3))||(i2.u4.p14>=4))||(i2.u4.p15>=5))) + !(EG(((EX(((i0.u0.p5>=5)||(i1.u2.p8>=1))) * (EX(((i3.u7.p18>=1)||(i1.u2.p8>=1))) + EF(((((((((i0.u0.p5>=5)||(i0.u0.p4>=4))||(i0.u0.p4>=3))||(i2.u5.p12>=2))||(i2.u5.p13>=2))||(i3.u6.p16>=5))||(i0.u0.p1>=5))||(i0.u0.p1>=3))))) * (((((i0.u0.p4>=3)||(i2.u4.p14>=4))||(i2.u4.p14>=3))||(((i0.u0.p5<5)&&(i1.u3.p10<5))&&(i1.u2.p7<2)))||(i2.u4.p11<3)))))))
=> equivalent forward existential formula: ([FwdG(Init,!(EX(!(((((((((i3.u6.p20>=5)||(i0.u0.p5>=5))||(i0.u0.p4>=4))||(i0.u0.p4>=3))||(i0.u1.p3>=1))||(i1.u3.p6>=3))||(i2.u5.p12>=2))||(i3.u6.p16>=5))))))] = FALSE * [FwdG((Init * !(E(TRUE U ((((i3.u6.p20>=5)||(i2.u4.p11>=3))||(i2.u4.p14>=4))||(i2.u4.p15>=5))))),((EX(((i0.u0.p5>=5)||(i1.u2.p8>=1))) * (EX(((i3.u7.p18>=1)||(i1.u2.p8>=1))) + E(TRUE U ((((((((i0.u0.p5>=5)||(i0.u0.p4>=4))||(i0.u0.p4>=3))||(i2.u5.p12>=2))||(i2.u5.p13>=2))||(i3.u6.p16>=5))||(i0.u0.p1>=5))||(i0.u0.p1>=3))))) * (((((i0.u0.p4>=3)||(i2.u4.p14>=4))||(i2.u4.p14>=3))||(((i0.u0.p5<5)&&(i1.u3.p10<5))&&(i1.u2.p7<2)))||(i2.u4.p11<3))))] = FALSE)
(forward)formula 1,0,0.771241,26892,1,0,33445,6208,703,100247,222,25161,19816
FORMULA JoinFreeModules-PT-0004-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: E(((((((((i0.u0.p5<5)&&(i0.u0.p4<3))&&(i1.u3.p6<3))&&(i1.u3.p10<5))&&(i1.u2.p7<2))&&(i1.u2.p8<2))&&(i2.u4.p14<3))&&(i0.u0.p1<3)) U (EX((((((((((i3.u6.p19>=4)||(i3.u7.p17>=2))||(i0.u0.p5>=5))||(i3.u7.p18>=1))||(i1.u3.p6>=3))||(i1.u2.p7>=2))||(i2.u4.p11>=3))||(i2.u4.p14>=3))||(i0.u0.p1>=3))) * AF((((((((i3.u7.p18<1)&&(i2.u4.p15<5))&&(i3.u6.p20<5))&&(i1.u3.p9<3))&&(i2.u4.p15<5))&&(i2.u5.p13<2))&&(i0.u0.p1<5)))))
=> equivalent forward existential formula: [((FwdU(Init,((((((((i0.u0.p5<5)&&(i0.u0.p4<3))&&(i1.u3.p6<3))&&(i1.u3.p10<5))&&(i1.u2.p7<2))&&(i1.u2.p8<2))&&(i2.u4.p14<3))&&(i0.u0.p1<3))) * EX((((((((((i3.u6.p19>=4)||(i3.u7.p17>=2))||(i0.u0.p5>=5))||(i3.u7.p18>=1))||(i1.u3.p6>=3))||(i1.u2.p7>=2))||(i2.u4.p11>=3))||(i2.u4.p14>=3))||(i0.u0.p1>=3)))) * !(EG(!((((((((i3.u7.p18<1)&&(i2.u4.p15<5))&&(i3.u6.p20<5))&&(i1.u3.p9<3))&&(i2.u4.p15<5))&&(i2.u5.p13<2))&&(i0.u0.p1<5))))))] != FALSE
(forward)formula 2,0,0.801538,28212,1,0,34943,6389,813,104282,233,26143,21016
FORMULA JoinFreeModules-PT-0004-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (!(AF((((((((((i3.u6.p19>=4)||(i3.u7.p18>=2))||(i0.u1.p2>=2))||(i0.u0.p5>=5))||(i1.u3.p6>=5))||(i0.u0.p4>=3))||(i1.u3.p9>=4))||(i1.u3.p9>=3))||(i3.u6.p16>=5)))) + !(EG(AX(A(AX(((((((((i3.u6.p19>=4)||(i0.u1.p2>=2))||(i0.u1.p3>=2))||(i1.u3.p10>=5))||(i2.u5.p12>=2))||(i2.u4.p14>=4))||(i2.u4.p15>=5))||(i3.u6.p16>=5))) U ((((((i0.u0.p4>=4)||((((i0.u1.p3>=4)&&(i1.u2.p8>=4))&&(i2.u5.p13>=4))&&(i3.u7.p18>=4)))||(i2.u4.p11>=5))||(i1.u2.p8>=1))||(i3.u6.p16>=5))||(i2.u5.p13>=1)))))))
=> equivalent forward existential formula: [FwdG((Init * !(!(!(EG(!((((((((((i3.u6.p19>=4)||(i3.u7.p18>=2))||(i0.u1.p2>=2))||(i0.u0.p5>=5))||(i1.u3.p6>=5))||(i0.u0.p4>=3))||(i1.u3.p9>=4))||(i1.u3.p9>=3))||(i3.u6.p16>=5)))))))),!(EX(!(!((E(!(((((((i0.u0.p4>=4)||((((i0.u1.p3>=4)&&(i1.u2.p8>=4))&&(i2.u5.p13>=4))&&(i3.u7.p18>=4)))||(i2.u4.p11>=5))||(i1.u2.p8>=1))||(i3.u6.p16>=5))||(i2.u5.p13>=1))) U (!(!(EX(!(((((((((i3.u6.p19>=4)||(i0.u1.p2>=2))||(i0.u1.p3>=2))||(i1.u3.p10>=5))||(i2.u5.p12>=2))||(i2.u4.p14>=4))||(i2.u4.p15>=5))||(i3.u6.p16>=5)))))) * !(((((((i0.u0.p4>=4)||((((i0.u1.p3>=4)&&(i1.u2.p8>=4))&&(i2.u5.p13>=4))&&(i3.u7.p18>=4)))||(i2.u4.p11>=5))||(i1.u2.p8>=1))||(i3.u6.p16>=5))||(i2.u5.p13>=1))))) + EG(!(((((((i0.u0.p4>=4)||((((i0.u1.p3>=4)&&(i1.u2.p8>=4))&&(i2.u5.p13>=4))&&(i3.u7.p18>=4)))||(i2.u4.p11>=5))||(i1.u2.p8>=1))||(i3.u6.p16>=5))||(i2.u5.p13>=1))))))))))] = FALSE
(forward)formula 3,0,1.46114,44052,1,0,57756,8049,892,185483,235,33736,34514
FORMULA JoinFreeModules-PT-0004-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EX(((i3.u7.p18>=1)||(i0.u1.p3>=1)))
=> equivalent forward existential formula: [(EY(Init) * ((i3.u7.p18>=1)||(i0.u1.p3>=1)))] != FALSE
(forward)formula 4,1,1.46179,44580,1,0,57765,8049,893,185492,235,33736,34519
FORMULA JoinFreeModules-PT-0004-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG((A(((((((i1.u3.p6>=5)||(i1.u2.p8>=2))||(i1.u2.p8>=1))||(i2.u4.p11>=3))||(i2.u4.p14>=3))||(i0.u0.p1>=3)) U E(((((i3.u7.p18>=2)||(i1.u3.p9>=4))||(i2.u4.p11>=5))||(i2.u4.p11>=3)) U (((i0.u0.p4>=3)||(i1.u3.p9>=4))||(i1.u3.p9>=3)))) * A(((((AF((((i0.u1.p2>=2)||(i0.u1.p3>=1))||(i1.u2.p7>=2))) * (i2.u4.p11>=5)) * (((((((i0.u1.p2>=2)||(i0.u0.p4>=4))||(i0.u0.p5>=5))||(i0.u0.p4>=3))||(i1.u3.p6>=3))||(i1.u2.p8>=1))||(i2.u5.p12>=2))) + (i3.u6.p20<5)) + EX((((((((((((i0.u0.p5>=5)||(i0.u0.p4>=3))||(i1.u2.p7>=2))||(i1.u3.p9>=4))||(i2.u4.p11>=3))||(i2.u5.p12>=2))||(i2.u4.p14>=3))||(i0.u0.p1>=5))||(i3.u6.p16>=3))||(i0.u0.p1>=3))&&((i0.u0.p4>=4)||(i3.u7.p18>=1))))) U ((EX(((((((((((i0.u0.p5>=5)||(i0.u0.p4>=4))||(i3.u7.p18>=1))||((((i0.u1.p3>=4)&&(i1.u2.p8>=4))&&(i2.u5.p13>=4))&&(i3.u7.p18>=4)))||(i1.u2.p8>=2))||(i2.u4.p11>=5))||(i2.u5.p12>=2))||(i2.u4.p15>=5))||(i3.u6.p16>=5))&&(((((((((i3.u7.p17>=2)||(i3.u6.p19>=4))||(i0.u0.p5>=5))||(i0.u0.p4>=3))||(i1.u3.p6>=3))||(i2.u4.p15>=5))||(i2.u5.p13>=1))||(i0.u0.p1>=5))||(i3.u6.p16>=3)))) * ((((i3.u6.p19>=3)||(i0.u1.p2>=2))||(i3.u7.p18>=2))||(i0.u0.p4>=3))) * EG(((((((((((i3.u6.p19>=3)||(i0.u1.p3>=2))||(i0.u0.p4>=3))||((((i0.u1.p3>=4)&&(i1.u2.p8>=4))&&(i2.u5.p13>=4))&&(i3.u7.p18>=4)))||(i1.u3.p9>=4))||(i2.u4.p11>=5))||(i1.u2.p8>=2))||(i2.u4.p11>=3))||(i2.u4.p14>=3))||(i2.u5.p13>=1)))))))
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,TRUE),!(E(((((i3.u7.p18>=2)||(i1.u3.p9>=4))||(i2.u4.p11>=5))||(i2.u4.p11>=3)) U (((i0.u0.p4>=3)||(i1.u3.p9>=4))||(i1.u3.p9>=3))))) * !(((((((i1.u3.p6>=5)||(i1.u2.p8>=2))||(i1.u2.p8>=1))||(i2.u4.p11>=3))||(i2.u4.p14>=3))||(i0.u0.p1>=3)))) * !(E(((((i3.u7.p18>=2)||(i1.u3.p9>=4))||(i2.u4.p11>=5))||(i2.u4.p11>=3)) U (((i0.u0.p4>=3)||(i1.u3.p9>=4))||(i1.u3.p9>=3)))))] = FALSE * [FwdG(FwdU(Init,TRUE),!(E(((((i3.u7.p18>=2)||(i1.u3.p9>=4))||(i2.u4.p11>=5))||(i2.u4.p11>=3)) U (((i0.u0.p4>=3)||(i1.u3.p9>=4))||(i1.u3.p9>=3)))))] = FALSE) * ((([((FwdU(FwdU(Init,TRUE),!(((EX(((((((((((i0.u0.p5>=5)||(i0.u0.p4>=4))||(i3.u7.p18>=1))||((((i0.u1.p3>=4)&&(i1.u2.p8>=4))&&(i2.u5.p13>=4))&&(i3.u7.p18>=4)))||(i1.u2.p8>=2))||(i2.u4.p11>=5))||(i2.u5.p12>=2))||(i2.u4.p15>=5))||(i3.u6.p16>=5))&&(((((((((i3.u7.p17>=2)||(i3.u6.p19>=4))||(i0.u0.p5>=5))||(i0.u0.p4>=3))||(i1.u3.p6>=3))||(i2.u4.p15>=5))||(i2.u5.p13>=1))||(i0.u0.p1>=5))||(i3.u6.p16>=3)))) * ((((i3.u6.p19>=3)||(i0.u1.p2>=2))||(i3.u7.p18>=2))||(i0.u0.p4>=3))) * EG(((((((((((i3.u6.p19>=3)||(i0.u1.p3>=2))||(i0.u0.p4>=3))||((((i0.u1.p3>=4)&&(i1.u2.p8>=4))&&(i2.u5.p13>=4))&&(i3.u7.p18>=4)))||(i1.u3.p9>=4))||(i2.u4.p11>=5))||(i1.u2.p8>=2))||(i2.u4.p11>=3))||(i2.u4.p14>=3))||(i2.u5.p13>=1)))))) * !(((((!(EG(!((((i0.u1.p2>=2)||(i0.u1.p3>=1))||(i1.u2.p7>=2))))) * (i2.u4.p11>=5)) * (((((((i0.u1.p2>=2)||(i0.u0.p4>=4))||(i0.u0.p5>=5))||(i0.u0.p4>=3))||(i1.u3.p6>=3))||(i1.u2.p8>=1))||(i2.u5.p12>=2))) + (i3.u6.p20<5)) + EX((((((((((((i0.u0.p5>=5)||(i0.u0.p4>=3))||(i1.u2.p7>=2))||(i1.u3.p9>=4))||(i2.u4.p11>=3))||(i2.u5.p12>=2))||(i2.u4.p14>=3))||(i0.u0.p1>=5))||(i3.u6.p16>=3))||(i0.u0.p1>=3))&&((i0.u0.p4>=4)||(i3.u7.p18>=1))))))) * !(EX(((((((((((i0.u0.p5>=5)||(i0.u0.p4>=4))||(i3.u7.p18>=1))||((((i0.u1.p3>=4)&&(i1.u2.p8>=4))&&(i2.u5.p13>=4))&&(i3.u7.p18>=4)))||(i1.u2.p8>=2))||(i2.u4.p11>=5))||(i2.u5.p12>=2))||(i2.u4.p15>=5))||(i3.u6.p16>=5))&&(((((((((i3.u7.p17>=2)||(i3.u6.p19>=4))||(i0.u0.p5>=5))||(i0.u0.p4>=3))||(i1.u3.p6>=3))||(i2.u4.p15>=5))||(i2.u5.p13>=1))||(i0.u0.p1>=5))||(i3.u6.p16>=3))))))] = FALSE * [((FwdU(FwdU(Init,TRUE),!(((EX(((((((((((i0.u0.p5>=5)||(i0.u0.p4>=4))||(i3.u7.p18>=1))||((((i0.u1.p3>=4)&&(i1.u2.p8>=4))&&(i2.u5.p13>=4))&&(i3.u7.p18>=4)))||(i1.u2.p8>=2))||(i2.u4.p11>=5))||(i2.u5.p12>=2))||(i2.u4.p15>=5))||(i3.u6.p16>=5))&&(((((((((i3.u7.p17>=2)||(i3.u6.p19>=4))||(i0.u0.p5>=5))||(i0.u0.p4>=3))||(i1.u3.p6>=3))||(i2.u4.p15>=5))||(i2.u5.p13>=1))||(i0.u0.p1>=5))||(i3.u6.p16>=3)))) * ((((i3.u6.p19>=3)||(i0.u1.p2>=2))||(i3.u7.p18>=2))||(i0.u0.p4>=3))) * EG(((((((((((i3.u6.p19>=3)||(i0.u1.p3>=2))||(i0.u0.p4>=3))||((((i0.u1.p3>=4)&&(i1.u2.p8>=4))&&(i2.u5.p13>=4))&&(i3.u7.p18>=4)))||(i1.u3.p9>=4))||(i2.u4.p11>=5))||(i1.u2.p8>=2))||(i2.u4.p11>=3))||(i2.u4.p14>=3))||(i2.u5.p13>=1)))))) * !(((((!(EG(!((((i0.u1.p2>=2)||(i0.u1.p3>=1))||(i1.u2.p7>=2))))) * (i2.u4.p11>=5)) * (((((((i0.u1.p2>=2)||(i0.u0.p4>=4))||(i0.u0.p5>=5))||(i0.u0.p4>=3))||(i1.u3.p6>=3))||(i1.u2.p8>=1))||(i2.u5.p12>=2))) + (i3.u6.p20<5)) + EX((((((((((((i0.u0.p5>=5)||(i0.u0.p4>=3))||(i1.u2.p7>=2))||(i1.u3.p9>=4))||(i2.u4.p11>=3))||(i2.u5.p12>=2))||(i2.u4.p14>=3))||(i0.u0.p1>=5))||(i3.u6.p16>=3))||(i0.u0.p1>=3))&&((i0.u0.p4>=4)||(i3.u7.p18>=1))))))) * !(((((i3.u6.p19>=3)||(i0.u1.p2>=2))||(i3.u7.p18>=2))||(i0.u0.p4>=3))))] = FALSE) * [((FwdU(FwdU(Init,TRUE),!(((EX(((((((((((i0.u0.p5>=5)||(i0.u0.p4>=4))||(i3.u7.p18>=1))||((((i0.u1.p3>=4)&&(i1.u2.p8>=4))&&(i2.u5.p13>=4))&&(i3.u7.p18>=4)))||(i1.u2.p8>=2))||(i2.u4.p11>=5))||(i2.u5.p12>=2))||(i2.u4.p15>=5))||(i3.u6.p16>=5))&&(((((((((i3.u7.p17>=2)||(i3.u6.p19>=4))||(i0.u0.p5>=5))||(i0.u0.p4>=3))||(i1.u3.p6>=3))||(i2.u4.p15>=5))||(i2.u5.p13>=1))||(i0.u0.p1>=5))||(i3.u6.p16>=3)))) * ((((i3.u6.p19>=3)||(i0.u1.p2>=2))||(i3.u7.p18>=2))||(i0.u0.p4>=3))) * EG(((((((((((i3.u6.p19>=3)||(i0.u1.p3>=2))||(i0.u0.p4>=3))||((((i0.u1.p3>=4)&&(i1.u2.p8>=4))&&(i2.u5.p13>=4))&&(i3.u7.p18>=4)))||(i1.u3.p9>=4))||(i2.u4.p11>=5))||(i1.u2.p8>=2))||(i2.u4.p11>=3))||(i2.u4.p14>=3))||(i2.u5.p13>=1)))))) * !(((((!(EG(!((((i0.u1.p2>=2)||(i0.u1.p3>=1))||(i1.u2.p7>=2))))) * (i2.u4.p11>=5)) * (((((((i0.u1.p2>=2)||(i0.u0.p4>=4))||(i0.u0.p5>=5))||(i0.u0.p4>=3))||(i1.u3.p6>=3))||(i1.u2.p8>=1))||(i2.u5.p12>=2))) + (i3.u6.p20<5)) + EX((((((((((((i0.u0.p5>=5)||(i0.u0.p4>=3))||(i1.u2.p7>=2))||(i1.u3.p9>=4))||(i2.u4.p11>=3))||(i2.u5.p12>=2))||(i2.u4.p14>=3))||(i0.u0.p1>=5))||(i3.u6.p16>=3))||(i0.u0.p1>=3))&&((i0.u0.p4>=4)||(i3.u7.p18>=1))))))) * !(EG(((((((((((i3.u6.p19>=3)||(i0.u1.p3>=2))||(i0.u0.p4>=3))||((((i0.u1.p3>=4)&&(i1.u2.p8>=4))&&(i2.u5.p13>=4))&&(i3.u7.p18>=4)))||(i1.u3.p9>=4))||(i2.u4.p11>=5))||(i1.u2.p8>=2))||(i2.u4.p11>=3))||(i2.u4.p14>=3))||(i2.u5.p13>=1)))))] = FALSE) * [FwdG(FwdU(Init,TRUE),!(((EX(((((((((((i0.u0.p5>=5)||(i0.u0.p4>=4))||(i3.u7.p18>=1))||((((i0.u1.p3>=4)&&(i1.u2.p8>=4))&&(i2.u5.p13>=4))&&(i3.u7.p18>=4)))||(i1.u2.p8>=2))||(i2.u4.p11>=5))||(i2.u5.p12>=2))||(i2.u4.p15>=5))||(i3.u6.p16>=5))&&(((((((((i3.u7.p17>=2)||(i3.u6.p19>=4))||(i0.u0.p5>=5))||(i0.u0.p4>=3))||(i1.u3.p6>=3))||(i2.u4.p15>=5))||(i2.u5.p13>=1))||(i0.u0.p1>=5))||(i3.u6.p16>=3)))) * ((((i3.u6.p19>=3)||(i0.u1.p2>=2))||(i3.u7.p18>=2))||(i0.u0.p4>=3))) * EG(((((((((((i3.u6.p19>=3)||(i0.u1.p3>=2))||(i0.u0.p4>=3))||((((i0.u1.p3>=4)&&(i1.u2.p8>=4))&&(i2.u5.p13>=4))&&(i3.u7.p18>=4)))||(i1.u3.p9>=4))||(i2.u4.p11>=5))||(i1.u2.p8>=2))||(i2.u4.p11>=3))||(i2.u4.p14>=3))||(i2.u5.p13>=1))))))] = FALSE))
(forward)formula 5,0,1.63556,49596,1,0,65876,9257,955,208891,238,39137,39637
FORMULA JoinFreeModules-PT-0004-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (!(AX((((((i1.u3.p6>=3)||(i1.u3.p9>=4))||(i2.u4.p14>=4))||(i2.u4.p15>=5))&&(i2.u5.p12>=2)))) + AF(AX(EF((((((i3.u7.p17>=2)||(i0.u0.p4>=4))||(i3.u7.p18>=2))||(i1.u3.p9>=3))||(i2.u4.p14>=3))))))
=> equivalent forward existential formula: [FwdG((Init * !(!(!(EX(!((((((i1.u3.p6>=3)||(i1.u3.p9>=4))||(i2.u4.p14>=4))||(i2.u4.p15>=5))&&(i2.u5.p12>=2)))))))),!(!(EX(!(E(TRUE U (((((i3.u7.p17>=2)||(i0.u0.p4>=4))||(i3.u7.p18>=2))||(i1.u3.p9>=3))||(i2.u4.p14>=3))))))))] = FALSE
(forward)formula 6,1,1.64419,50124,1,0,66295,9339,973,209675,238,39367,40014
FORMULA JoinFreeModules-PT-0004-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (EX(((((i0.u0.p4>=3)||(i1.u3.p9>=4))||(i2.u5.p12>=2)) + (((((((((((i3.u7.p18>=2)||(i0.u0.p5>=5))||(i2.u5.p13>=2))&&(i3.u6.p20<5))&&(i3.u6.p19<3))&&(i0.u0.p4<3))&&((((i0.u1.p3<4)||(i1.u2.p8<4))||(i2.u5.p13<4))||(i3.u7.p18<4)))&&(i2.u5.p12<2))&&(i2.u5.p13<2))&&(i0.u0.p1<5)) * EG((((((((i1.u3.p6>=5)||(i0.u1.p3>=1))||(i1.u3.p6>=3))||(i2.u4.p11>=3))||(i2.u5.p12>=2))||(i2.u4.p15>=5)) * AF((((((((((i3.u6.p20>=5)||(i3.u6.p19>=3))||(i0.u1.p3>=2))||(i3.u7.p18>=1))||(i1.u3.p6>=3))||(i1.u3.p9>=4))||(i2.u4.p15>=5))||(i2.u4.p14>=3))||(i0.u0.p1>=3)))))))) + (E((((i1.u2.p8<1) * (((((((((((i3.u6.p20<5)&&(i0.u1.p2<2))&&(i0.u0.p5<5))&&(i3.u6.p19<3))&&(i0.u0.p4<4))&&(i3.u7.p18<1))&&((((i0.u1.p3<4)||(i1.u2.p8<4))||(i2.u5.p13<4))||(i3.u7.p18<4)))&&(i1.u2.p7<2))&&(i3.u6.p16<5))&&(i3.u6.p16<3)) + !(AX(((i3.u7.p18>=2)||(i2.u4.p14>=4)))))) + AX(((((((((((((((((i3.u6.p20<5)&&(i3.u7.p18<1))&&(i1.u3.p6<3))&&((((i0.u1.p3<4)||(i1.u2.p8<4))||(i2.u5.p13<4))||(i3.u7.p18<4)))&&(i1.u3.p9<4))&&(i1.u2.p7<2))&&(i0.u0.p1<3))&&(i3.u6.p20<5))&&(i3.u6.p19<3))&&(i1.u3.p6<5))&&(i0.u1.p3<1))&&(i1.u3.p6<3))&&(i1.u3.p9<3))&&(i2.u4.p11<3))&&(i2.u4.p15<5))&&(i3.u6.p16<3)))) U EG((EF(((((((((i0.u1.p2>=2)||(i3.u6.p19>=3))||(i0.u0.p5>=5))||(i1.u3.p9>=4))||(i2.u4.p15>=5))||(i2.u4.p14>=4))||(i2.u5.p12>=2))||(i2.u4.p14>=3))) + (AF(((((((((i1.u3.p6>=5)||(i0.u1.p3>=1))||(i1.u3.p10>=5))||(i1.u2.p8>=2))||(i2.u5.p12>=2))||(i2.u4.p14>=3))||(i2.u5.p13>=1))||(i0.u0.p1>=3))) * EG(((((((i3.u7.p17>=2)||(i0.u1.p3>=2))||(i0.u1.p3>=1))||(i2.u5.p13>=2))||(i3.u6.p16>=5))||(i3.u6.p16>=3))))))) * EX((!(AG((((((((((i3.u6.p19>=3)||(i1.u3.p6>=5))||(i0.u1.p3>=1))||(i1.u3.p9>=4))||(i1.u2.p8>=2))||(i3.u6.p16>=5))||(i2.u5.p13>=2))||(i0.u0.p1>=5))||(i2.u5.p13>=1)))) * !(A((((i0.u0.p5<5)&&(i2.u4.p14<3))&&(i0.u0.p1<5)) U ((((((((i3.u6.p19<4)&&(i3.u6.p20<5))&&(i0.u0.p4<4))&&(i0.u1.p3<1))&&(i1.u2.p8<1))&&(i2.u5.p13<2))&&(i3.u6.p16<5))&&(i2.u5.p13<1))))))))
=> equivalent forward existential formula: (([(EY(Init) * (((i0.u0.p4>=3)||(i1.u3.p9>=4))||(i2.u5.p12>=2)))] != FALSE + [FwdG((EY(Init) * ((((((((((i3.u7.p18>=2)||(i0.u0.p5>=5))||(i2.u5.p13>=2))&&(i3.u6.p20<5))&&(i3.u6.p19<3))&&(i0.u0.p4<3))&&((((i0.u1.p3<4)||(i1.u2.p8<4))||(i2.u5.p13<4))||(i3.u7.p18<4)))&&(i2.u5.p12<2))&&(i2.u5.p13<2))&&(i0.u0.p1<5))),(((((((i1.u3.p6>=5)||(i0.u1.p3>=1))||(i1.u3.p6>=3))||(i2.u4.p11>=3))||(i2.u5.p12>=2))||(i2.u4.p15>=5)) * !(EG(!((((((((((i3.u6.p20>=5)||(i3.u6.p19>=3))||(i0.u1.p3>=2))||(i3.u7.p18>=1))||(i1.u3.p6>=3))||(i1.u3.p9>=4))||(i2.u4.p15>=5))||(i2.u4.p14>=3))||(i0.u0.p1>=3)))))))] != FALSE) + ([(FwdU((EY((Init * E((((i1.u2.p8<1) * (((((((((((i3.u6.p20<5)&&(i0.u1.p2<2))&&(i0.u0.p5<5))&&(i3.u6.p19<3))&&(i0.u0.p4<4))&&(i3.u7.p18<1))&&((((i0.u1.p3<4)||(i1.u2.p8<4))||(i2.u5.p13<4))||(i3.u7.p18<4)))&&(i1.u2.p7<2))&&(i3.u6.p16<5))&&(i3.u6.p16<3)) + !(!(EX(!(((i3.u7.p18>=2)||(i2.u4.p14>=4)))))))) + !(EX(!(((((((((((((((((i3.u6.p20<5)&&(i3.u7.p18<1))&&(i1.u3.p6<3))&&((((i0.u1.p3<4)||(i1.u2.p8<4))||(i2.u5.p13<4))||(i3.u7.p18<4)))&&(i1.u3.p9<4))&&(i1.u2.p7<2))&&(i0.u0.p1<3))&&(i3.u6.p20<5))&&(i3.u6.p19<3))&&(i1.u3.p6<5))&&(i0.u1.p3<1))&&(i1.u3.p6<3))&&(i1.u3.p9<3))&&(i2.u4.p11<3))&&(i2.u4.p15<5))&&(i3.u6.p16<3)))))) U EG((E(TRUE U ((((((((i0.u1.p2>=2)||(i3.u6.p19>=3))||(i0.u0.p5>=5))||(i1.u3.p9>=4))||(i2.u4.p15>=5))||(i2.u4.p14>=4))||(i2.u5.p12>=2))||(i2.u4.p14>=3))) + (!(EG(!(((((((((i1.u3.p6>=5)||(i0.u1.p3>=1))||(i1.u3.p10>=5))||(i1.u2.p8>=2))||(i2.u5.p12>=2))||(i2.u4.p14>=3))||(i2.u5.p13>=1))||(i0.u0.p1>=3))))) * EG(((((((i3.u7.p17>=2)||(i0.u1.p3>=2))||(i0.u1.p3>=1))||(i2.u5.p13>=2))||(i3.u6.p16>=5))||(i3.u6.p16>=3))))))))) * !(!(E(TRUE U !((((((((((i3.u6.p19>=3)||(i1.u3.p6>=5))||(i0.u1.p3>=1))||(i1.u3.p9>=4))||(i1.u2.p8>=2))||(i3.u6.p16>=5))||(i2.u5.p13>=2))||(i0.u0.p1>=5))||(i2.u5.p13>=1))))))),!(((((((((i3.u6.p19<4)&&(i3.u6.p20<5))&&(i0.u0.p4<4))&&(i0.u1.p3<1))&&(i1.u2.p8<1))&&(i2.u5.p13<2))&&(i3.u6.p16<5))&&(i2.u5.p13<1)))) * (!((((i0.u0.p5<5)&&(i2.u4.p14<3))&&(i0.u0.p1<5))) * !(((((((((i3.u6.p19<4)&&(i3.u6.p20<5))&&(i0.u0.p4<4))&&(i0.u1.p3<1))&&(i1.u2.p8<1))&&(i2.u5.p13<2))&&(i3.u6.p16<5))&&(i2.u5.p13<1)))))] != FALSE + [FwdG((EY((Init * E((((i1.u2.p8<1) * (((((((((((i3.u6.p20<5)&&(i0.u1.p2<2))&&(i0.u0.p5<5))&&(i3.u6.p19<3))&&(i0.u0.p4<4))&&(i3.u7.p18<1))&&((((i0.u1.p3<4)||(i1.u2.p8<4))||(i2.u5.p13<4))||(i3.u7.p18<4)))&&(i1.u2.p7<2))&&(i3.u6.p16<5))&&(i3.u6.p16<3)) + !(!(EX(!(((i3.u7.p18>=2)||(i2.u4.p14>=4)))))))) + !(EX(!(((((((((((((((((i3.u6.p20<5)&&(i3.u7.p18<1))&&(i1.u3.p6<3))&&((((i0.u1.p3<4)||(i1.u2.p8<4))||(i2.u5.p13<4))||(i3.u7.p18<4)))&&(i1.u3.p9<4))&&(i1.u2.p7<2))&&(i0.u0.p1<3))&&(i3.u6.p20<5))&&(i3.u6.p19<3))&&(i1.u3.p6<5))&&(i0.u1.p3<1))&&(i1.u3.p6<3))&&(i1.u3.p9<3))&&(i2.u4.p11<3))&&(i2.u4.p15<5))&&(i3.u6.p16<3)))))) U EG((E(TRUE U ((((((((i0.u1.p2>=2)||(i3.u6.p19>=3))||(i0.u0.p5>=5))||(i1.u3.p9>=4))||(i2.u4.p15>=5))||(i2.u4.p14>=4))||(i2.u5.p12>=2))||(i2.u4.p14>=3))) + (!(EG(!(((((((((i1.u3.p6>=5)||(i0.u1.p3>=1))||(i1.u3.p10>=5))||(i1.u2.p8>=2))||(i2.u5.p12>=2))||(i2.u4.p14>=3))||(i2.u5.p13>=1))||(i0.u0.p1>=3))))) * EG(((((((i3.u7.p17>=2)||(i0.u1.p3>=2))||(i0.u1.p3>=1))||(i2.u5.p13>=2))||(i3.u6.p16>=5))||(i3.u6.p16>=3))))))))) * !(!(E(TRUE U !((((((((((i3.u6.p19>=3)||(i1.u3.p6>=5))||(i0.u1.p3>=1))||(i1.u3.p9>=4))||(i1.u2.p8>=2))||(i3.u6.p16>=5))||(i2.u5.p13>=2))||(i0.u0.p1>=5))||(i2.u5.p13>=1))))))),!(((((((((i3.u6.p19<4)&&(i3.u6.p20<5))&&(i0.u0.p4<4))&&(i0.u1.p3<1))&&(i1.u2.p8<1))&&(i2.u5.p13<2))&&(i3.u6.p16<5))&&(i2.u5.p13<1))))] != FALSE))
(forward)formula 7,1,1.64481,50124,1,0,66306,9339,975,209692,238,39367,40019
FORMULA JoinFreeModules-PT-0004-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: A((((((i3.u7.p18<1) * !(AX(A(((((((i0.u1.p3>=1)||(i1.u3.p6>=3))||(i1.u2.p8>=1))||(i3.u6.p16>=5))||(i0.u0.p1>=5))||(i3.u6.p16>=3)) U ((((((i3.u6.p19>=4)||(i3.u7.p18>=2))||(i0.u0.p5>=5))||(i1.u2.p8>=2))||(i2.u4.p11>=5))||(i1.u2.p8>=1)))))) * !(E(AF((((((i0.u1.p3>=1)||(i2.u4.p11>=3))||(i2.u4.p14>=4))||(i2.u5.p13>=2))||(i0.u0.p1>=3))) U ((((((i3.u7.p17<2)&&(i3.u6.p20<5))&&(i0.u1.p2<2))&&(i1.u3.p6<3))&&(i1.u3.p9<4))&&(i0.u0.p1<3))))) * ((((i3.u6.p20>=5)||(i0.u0.p4>=3))||(i1.u2.p8>=1))||((((i0.u1.p3>=4)&&(i1.u2.p8>=4))&&(i2.u5.p13>=4))&&(i3.u7.p18>=4)))) * ((((i0.u1.p3<4)||(i1.u2.p8<4))||(i2.u5.p13<4))||(i3.u7.p18<4))) U (!(EF(((((((((i3.u6.p19>=4)||(i0.u0.p4>=4))||(i3.u7.p18>=2))||(i0.u1.p2>=2))||((((i0.u1.p3>=4)&&(i1.u2.p8>=4))&&(i2.u5.p13>=4))&&(i3.u7.p18>=4)))||(i2.u4.p11>=5))||(i2.u4.p15>=5)) * A(((((((i3.u6.p20>=5)||(i0.u0.p4>=4))||(i1.u3.p9>=4))||(i1.u2.p8>=2))||(i2.u4.p15>=5))||(i0.u0.p1>=5)) U ((((((((((i3.u6.p20>=5)||(i3.u7.p17>=2))||(i0.u1.p3>=2))||(i0.u0.p4>=3))||(i0.u1.p3>=1))||(i1.u3.p9>=3))||(i1.u2.p8>=1))||(i2.u4.p14>=3))||(i2.u5.p13>=2))||(i3.u6.p16>=3)))))) + ((AX((((i3.u6.p19>=4)||(i0.u1.p2>=2))||(i2.u4.p11>=3))) * !(EX(AG(((((((i3.u6.p19>=4)||(i0.u1.p2>=2))||(i1.u3.p6>=5))||(i1.u3.p10>=5))||(i2.u4.p11>=3))||(i2.u5.p13>=1)))))) * EF((((((((i3.u7.p18>=2)||(i1.u3.p6>=5))||(i1.u3.p10>=5))||(i1.u2.p7>=2))||(i2.u4.p11>=5))||(i2.u4.p15>=5))&&((((((i3.u7.p17>=2)||(i3.u6.p19>=4))||(i0.u0.p5>=5))||(i0.u1.p3>=2))||(i1.u3.p10>=5))||(i3.u6.p16>=5)))))))
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(TRUE U ((((((((i3.u6.p19>=4)||(i0.u0.p4>=4))||(i3.u7.p18>=2))||(i0.u1.p2>=2))||((((i0.u1.p3>=4)&&(i1.u2.p8>=4))&&(i2.u5.p13>=4))&&(i3.u7.p18>=4)))||(i2.u4.p11>=5))||(i2.u4.p15>=5)) * !((E(!(((((((((((i3.u6.p20>=5)||(i3.u7.p17>=2))||(i0.u1.p3>=2))||(i0.u0.p4>=3))||(i0.u1.p3>=1))||(i1.u3.p9>=3))||(i1.u2.p8>=1))||(i2.u4.p14>=3))||(i2.u5.p13>=2))||(i3.u6.p16>=3))) U (!(((((((i3.u6.p20>=5)||(i0.u0.p4>=4))||(i1.u3.p9>=4))||(i1.u2.p8>=2))||(i2.u4.p15>=5))||(i0.u0.p1>=5))) * !(((((((((((i3.u6.p20>=5)||(i3.u7.p17>=2))||(i0.u1.p3>=2))||(i0.u0.p4>=3))||(i0.u1.p3>=1))||(i1.u3.p9>=3))||(i1.u2.p8>=1))||(i2.u4.p14>=3))||(i2.u5.p13>=2))||(i3.u6.p16>=3))))) + EG(!(((((((((((i3.u6.p20>=5)||(i3.u7.p17>=2))||(i0.u1.p3>=2))||(i0.u0.p4>=3))||(i0.u1.p3>=1))||(i1.u3.p9>=3))||(i1.u2.p8>=1))||(i2.u4.p14>=3))||(i2.u5.p13>=2))||(i3.u6.p16>=3))))))))) + ((!(EX(!((((i3.u6.p19>=4)||(i0.u1.p2>=2))||(i2.u4.p11>=3))))) * !(EX(!(E(TRUE U !(((((((i3.u6.p19>=4)||(i0.u1.p2>=2))||(i1.u3.p6>=5))||(i1.u3.p10>=5))||(i2.u4.p11>=3))||(i2.u5.p13>=1)))))))) * E(TRUE U (((((((i3.u7.p18>=2)||(i1.u3.p6>=5))||(i1.u3.p10>=5))||(i1.u2.p7>=2))||(i2.u4.p11>=5))||(i2.u4.p15>=5))&&((((((i3.u7.p17>=2)||(i3.u6.p19>=4))||(i0.u0.p5>=5))||(i0.u1.p3>=2))||(i1.u3.p10>=5))||(i3.u6.p16>=5)))))))))) * !(E(!((!(E(TRUE U ((((((((i3.u6.p19>=4)||(i0.u0.p4>=4))||(i3.u7.p18>=2))||(i0.u1.p2>=2))||((((i0.u1.p3>=4)&&(i1.u2.p8>=4))&&(i2.u5.p13>=4))&&(i3.u7.p18>=4)))||(i2.u4.p11>=5))||(i2.u4.p15>=5)) * !((E(!(((((((((((i3.u6.p20>=5)||(i3.u7.p17>=2))||(i0.u1.p3>=2))||(i0.u0.p4>=3))||(i0.u1.p3>=1))||(i1.u3.p9>=3))||(i1.u2.p8>=1))||(i2.u4.p14>=3))||(i2.u5.p13>=2))||(i3.u6.p16>=3))) U (!(((((((i3.u6.p20>=5)||(i0.u0.p4>=4))||(i1.u3.p9>=4))||(i1.u2.p8>=2))||(i2.u4.p15>=5))||(i0.u0.p1>=5))) * !(((((((((((i3.u6.p20>=5)||(i3.u7.p17>=2))||(i0.u1.p3>=2))||(i0.u0.p4>=3))||(i0.u1.p3>=1))||(i1.u3.p9>=3))||(i1.u2.p8>=1))||(i2.u4.p14>=3))||(i2.u5.p13>=2))||(i3.u6.p16>=3))))) + EG(!(((((((((((i3.u6.p20>=5)||(i3.u7.p17>=2))||(i0.u1.p3>=2))||(i0.u0.p4>=3))||(i0.u1.p3>=1))||(i1.u3.p9>=3))||(i1.u2.p8>=1))||(i2.u4.p14>=3))||(i2.u5.p13>=2))||(i3.u6.p16>=3))))))))) + ((!(EX(!((((i3.u6.p19>=4)||(i0.u1.p2>=2))||(i2.u4.p11>=3))))) * !(EX(!(E(TRUE U !(((((((i3.u6.p19>=4)||(i0.u1.p2>=2))||(i1.u3.p6>=5))||(i1.u3.p10>=5))||(i2.u4.p11>=3))||(i2.u5.p13>=1)))))))) * E(TRUE U (((((((i3.u7.p18>=2)||(i1.u3.p6>=5))||(i1.u3.p10>=5))||(i1.u2.p7>=2))||(i2.u4.p11>=5))||(i2.u4.p15>=5))&&((((((i3.u7.p17>=2)||(i3.u6.p19>=4))||(i0.u0.p5>=5))||(i0.u1.p3>=2))||(i1.u3.p10>=5))||(i3.u6.p16>=5))))))) U (!((((((i3.u7.p18<1) * !(!(EX(!(!((E(!(((((((i3.u6.p19>=4)||(i3.u7.p18>=2))||(i0.u0.p5>=5))||(i1.u2.p8>=2))||(i2.u4.p11>=5))||(i1.u2.p8>=1))) U (!(((((((i0.u1.p3>=1)||(i1.u3.p6>=3))||(i1.u2.p8>=1))||(i3.u6.p16>=5))||(i0.u0.p1>=5))||(i3.u6.p16>=3))) * !(((((((i3.u6.p19>=4)||(i3.u7.p18>=2))||(i0.u0.p5>=5))||(i1.u2.p8>=2))||(i2.u4.p11>=5))||(i1.u2.p8>=1))))) + EG(!(((((((i3.u6.p19>=4)||(i3.u7.p18>=2))||(i0.u0.p5>=5))||(i1.u2.p8>=2))||(i2.u4.p11>=5))||(i1.u2.p8>=1))))))))))) * !(E(!(EG(!((((((i0.u1.p3>=1)||(i2.u4.p11>=3))||(i2.u4.p14>=4))||(i2.u5.p13>=2))||(i0.u0.p1>=3))))) U ((((((i3.u7.p17<2)&&(i3.u6.p20<5))&&(i0.u1.p2<2))&&(i1.u3.p6<3))&&(i1.u3.p9<4))&&(i0.u0.p1<3))))) * ((((i3.u6.p20>=5)||(i0.u0.p4>=3))||(i1.u2.p8>=1))||((((i0.u1.p3>=4)&&(i1.u2.p8>=4))&&(i2.u5.p13>=4))&&(i3.u7.p18>=4)))) * ((((i0.u1.p3<4)||(i1.u2.p8<4))||(i2.u5.p13<4))||(i3.u7.p18<4)))) * !((!(E(TRUE U ((((((((i3.u6.p19>=4)||(i0.u0.p4>=4))||(i3.u7.p18>=2))||(i0.u1.p2>=2))||((((i0.u1.p3>=4)&&(i1.u2.p8>=4))&&(i2.u5.p13>=4))&&(i3.u7.p18>=4)))||(i2.u4.p11>=5))||(i2.u4.p15>=5)) * !((E(!(((((((((((i3.u6.p20>=5)||(i3.u7.p17>=2))||(i0.u1.p3>=2))||(i0.u0.p4>=3))||(i0.u1.p3>=1))||(i1.u3.p9>=3))||(i1.u2.p8>=1))||(i2.u4.p14>=3))||(i2.u5.p13>=2))||(i3.u6.p16>=3))) U (!(((((((i3.u6.p20>=5)||(i0.u0.p4>=4))||(i1.u3.p9>=4))||(i1.u2.p8>=2))||(i2.u4.p15>=5))||(i0.u0.p1>=5))) * !(((((((((((i3.u6.p20>=5)||(i3.u7.p17>=2))||(i0.u1.p3>=2))||(i0.u0.p4>=3))||(i0.u1.p3>=1))||(i1.u3.p9>=3))||(i1.u2.p8>=1))||(i2.u4.p14>=3))||(i2.u5.p13>=2))||(i3.u6.p16>=3))))) + EG(!(((((((((((i3.u6.p20>=5)||(i3.u7.p17>=2))||(i0.u1.p3>=2))||(i0.u0.p4>=3))||(i0.u1.p3>=1))||(i1.u3.p9>=3))||(i1.u2.p8>=1))||(i2.u4.p14>=3))||(i2.u5.p13>=2))||(i3.u6.p16>=3))))))))) + ((!(EX(!((((i3.u6.p19>=4)||(i0.u1.p2>=2))||(i2.u4.p11>=3))))) * !(EX(!(E(TRUE U !(((((((i3.u6.p19>=4)||(i0.u1.p2>=2))||(i1.u3.p6>=5))||(i1.u3.p10>=5))||(i2.u4.p11>=3))||(i2.u5.p13>=1)))))))) * E(TRUE U (((((((i3.u7.p18>=2)||(i1.u3.p6>=5))||(i1.u3.p10>=5))||(i1.u2.p7>=2))||(i2.u4.p11>=5))||(i2.u4.p15>=5))&&((((((i3.u7.p17>=2)||(i3.u6.p19>=4))||(i0.u0.p5>=5))||(i0.u1.p3>=2))||(i1.u3.p10>=5))||(i3.u6.p16>=5)))))))))))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
(forward)formula 8,0,1.97762,58044,1,0,80356,10936,1139,241895,243,44872,49824
FORMULA JoinFreeModules-PT-0004-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EX((((((((((i1.u3.p6>=5)||(i1.u3.p6>=3))||(i1.u2.p8>=1))||(i2.u4.p11>=3))||(i2.u4.p15>=5))||(i2.u5.p13>=2))||(i0.u0.p1>=5))||(i2.u5.p13>=1))||(i0.u0.p1>=3)))
=> equivalent forward existential formula: [(EY(Init) * (((((((((i1.u3.p6>=5)||(i1.u3.p6>=3))||(i1.u2.p8>=1))||(i2.u4.p11>=3))||(i2.u4.p15>=5))||(i2.u5.p13>=2))||(i0.u0.p1>=5))||(i2.u5.p13>=1))||(i0.u0.p1>=3)))] != FALSE
(forward)formula 9,1,1.97892,58308,1,0,80365,10936,1156,241906,243,44872,49836
FORMULA JoinFreeModules-PT-0004-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: E(!(A((((((((((((((i0.u1.p3<4)||(i1.u2.p8<4))||(i2.u5.p13<4))||(i3.u7.p18<4))&&(i1.u2.p7<2))&&(i2.u4.p11<3))&&(i2.u5.p12<2))&&(i2.u4.p15<5))&&(i0.u0.p1<5))&&(i2.u5.p13<1))&&(i3.u6.p16<3))&&(i0.u0.p1<3))||((((((((i0.u0.p4<4)&&(i1.u3.p10<5))&&(i1.u2.p8<1))&&(i2.u4.p11<3))&&(i2.u4.p14<4))&&(i2.u5.p13<2))&&(i0.u0.p1<5))&&(i3.u6.p16<3))) U AX((((((((i3.u6.p19>=4)||(i3.u6.p20>=5))||(i3.u7.p18>=2))||(i0.u0.p4>=4))||(i2.u4.p14>=4))||(i0.u0.p1>=5))||(i2.u5.p13>=1))))) U (AX((((((((i3.u7.p17>=2)||(i1.u3.p6>=5))||(i1.u3.p10>=5))||(i1.u2.p7>=2))||(i1.u2.p8>=2))||(i2.u4.p15>=5))||(i3.u6.p16>=3))) + ((((((((i3.u7.p18<1)&&(i0.u0.p4<3))&&(i1.u3.p6<3))&&(i1.u3.p9<4))&&(i1.u2.p8<2))&&(i2.u4.p11<5))&&(i2.u4.p14<3))&&(i0.u0.p1<3))))
=> equivalent forward existential formula: ([(FwdU(Init,!(!((E(!(!(EX(!((((((((i3.u6.p19>=4)||(i3.u6.p20>=5))||(i3.u7.p18>=2))||(i0.u0.p4>=4))||(i2.u4.p14>=4))||(i0.u0.p1>=5))||(i2.u5.p13>=1)))))) U (!((((((((((((((i0.u1.p3<4)||(i1.u2.p8<4))||(i2.u5.p13<4))||(i3.u7.p18<4))&&(i1.u2.p7<2))&&(i2.u4.p11<3))&&(i2.u5.p12<2))&&(i2.u4.p15<5))&&(i0.u0.p1<5))&&(i2.u5.p13<1))&&(i3.u6.p16<3))&&(i0.u0.p1<3))||((((((((i0.u0.p4<4)&&(i1.u3.p10<5))&&(i1.u2.p8<1))&&(i2.u4.p11<3))&&(i2.u4.p14<4))&&(i2.u5.p13<2))&&(i0.u0.p1<5))&&(i3.u6.p16<3)))) * !(!(EX(!((((((((i3.u6.p19>=4)||(i3.u6.p20>=5))||(i3.u7.p18>=2))||(i0.u0.p4>=4))||(i2.u4.p14>=4))||(i0.u0.p1>=5))||(i2.u5.p13>=1)))))))) + EG(!(!(EX(!((((((((i3.u6.p19>=4)||(i3.u6.p20>=5))||(i3.u7.p18>=2))||(i0.u0.p4>=4))||(i2.u4.p14>=4))||(i0.u0.p1>=5))||(i2.u5.p13>=1))))))))))) * !(EX(!((((((((i3.u7.p17>=2)||(i1.u3.p6>=5))||(i1.u3.p10>=5))||(i1.u2.p7>=2))||(i1.u2.p8>=2))||(i2.u4.p15>=5))||(i3.u6.p16>=3))))))] != FALSE + [(FwdU(Init,!(!((E(!(!(EX(!((((((((i3.u6.p19>=4)||(i3.u6.p20>=5))||(i3.u7.p18>=2))||(i0.u0.p4>=4))||(i2.u4.p14>=4))||(i0.u0.p1>=5))||(i2.u5.p13>=1)))))) U (!((((((((((((((i0.u1.p3<4)||(i1.u2.p8<4))||(i2.u5.p13<4))||(i3.u7.p18<4))&&(i1.u2.p7<2))&&(i2.u4.p11<3))&&(i2.u5.p12<2))&&(i2.u4.p15<5))&&(i0.u0.p1<5))&&(i2.u5.p13<1))&&(i3.u6.p16<3))&&(i0.u0.p1<3))||((((((((i0.u0.p4<4)&&(i1.u3.p10<5))&&(i1.u2.p8<1))&&(i2.u4.p11<3))&&(i2.u4.p14<4))&&(i2.u5.p13<2))&&(i0.u0.p1<5))&&(i3.u6.p16<3)))) * !(!(EX(!((((((((i3.u6.p19>=4)||(i3.u6.p20>=5))||(i3.u7.p18>=2))||(i0.u0.p4>=4))||(i2.u4.p14>=4))||(i0.u0.p1>=5))||(i2.u5.p13>=1)))))))) + EG(!(!(EX(!((((((((i3.u6.p19>=4)||(i3.u6.p20>=5))||(i3.u7.p18>=2))||(i0.u0.p4>=4))||(i2.u4.p14>=4))||(i0.u0.p1>=5))||(i2.u5.p13>=1))))))))))) * ((((((((i3.u7.p18<1)&&(i0.u0.p4<3))&&(i1.u3.p6<3))&&(i1.u3.p9<4))&&(i1.u2.p8<2))&&(i2.u4.p11<5))&&(i2.u4.p14<3))&&(i0.u0.p1<3)))] != FALSE)
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
(forward)formula 10,1,2.0996,62004,1,0,86551,11609,1253,257800,245,47879,53270
FORMULA JoinFreeModules-PT-0004-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
BK_STOP 1620841044252
--------------------
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="JoinFreeModules-PT-0004"
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 JoinFreeModules-PT-0004, 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 r121-tall-162075406900394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0004.tgz
mv JoinFreeModules-PT-0004 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 '
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 ;