About the Execution of ITS-Tools for UtahNoC-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 776.619 | 60956.00 | 79190.00 | 720.00 | TTFTTTTTFTTTFTTF | 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.r273-smll-162123879800202.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 UtahNoC-PT-none, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r273-smll-162123879800202
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 14:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 14:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 26 05:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 26 05:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 205K May 5 16:52 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 UtahNoC-PT-none-CTLFireability-00
FORMULA_NAME UtahNoC-PT-none-CTLFireability-01
FORMULA_NAME UtahNoC-PT-none-CTLFireability-02
FORMULA_NAME UtahNoC-PT-none-CTLFireability-03
FORMULA_NAME UtahNoC-PT-none-CTLFireability-04
FORMULA_NAME UtahNoC-PT-none-CTLFireability-05
FORMULA_NAME UtahNoC-PT-none-CTLFireability-06
FORMULA_NAME UtahNoC-PT-none-CTLFireability-07
FORMULA_NAME UtahNoC-PT-none-CTLFireability-08
FORMULA_NAME UtahNoC-PT-none-CTLFireability-09
FORMULA_NAME UtahNoC-PT-none-CTLFireability-10
FORMULA_NAME UtahNoC-PT-none-CTLFireability-11
FORMULA_NAME UtahNoC-PT-none-CTLFireability-12
FORMULA_NAME UtahNoC-PT-none-CTLFireability-13
FORMULA_NAME UtahNoC-PT-none-CTLFireability-14
FORMULA_NAME UtahNoC-PT-none-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1621477348150
Running Version 0
[2021-05-20 02:22:31] [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-20 02:22:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-20 02:22:31] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2021-05-20 02:22:31] [INFO ] Transformed 216 places.
[2021-05-20 02:22:31] [INFO ] Transformed 977 transitions.
[2021-05-20 02:22:31] [INFO ] Found NUPN structural information;
[2021-05-20 02:22:31] [INFO ] Parsed PT model containing 216 places and 977 transitions in 307 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 37 ms.
[2021-05-20 02:22:31] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-20 02:22:31] [INFO ] Reduced 1 identical enabling conditions.
Ensure Unique test removed 148 transitions
Reduce redundant transitions removed 148 transitions.
Support contains 174 out of 216 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 216/216 places, 829/829 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 210 transition count 823
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 210 transition count 823
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 20 place count 210 transition count 815
Applied a total of 20 rules in 68 ms. Remains 210 /216 variables (removed 6) and now considering 815/829 (removed 14) transitions.
[2021-05-20 02:22:32] [INFO ] Flow matrix only has 413 transitions (discarded 402 similar events)
// Phase 1: matrix 413 rows 210 cols
[2021-05-20 02:22:32] [INFO ] Computed 8 place invariants in 29 ms
[2021-05-20 02:22:32] [INFO ] Implicit Places using invariants in 376 ms returned []
[2021-05-20 02:22:32] [INFO ] Flow matrix only has 413 transitions (discarded 402 similar events)
// Phase 1: matrix 413 rows 210 cols
[2021-05-20 02:22:32] [INFO ] Computed 8 place invariants in 11 ms
[2021-05-20 02:22:32] [INFO ] State equation strengthened by 41 read => feed constraints.
[2021-05-20 02:22:32] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
[2021-05-20 02:22:33] [INFO ] Flow matrix only has 413 transitions (discarded 402 similar events)
// Phase 1: matrix 413 rows 210 cols
[2021-05-20 02:22:33] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-20 02:22:33] [INFO ] Dead Transitions using invariants and state equation in 790 ms returned []
Finished structural reductions, in 1 iterations. Remains : 210/216 places, 815/829 transitions.
[2021-05-20 02:22:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-20 02:22:34] [INFO ] Flatten gal took : 173 ms
FORMULA UtahNoC-PT-none-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-20 02:22:34] [INFO ] Flatten gal took : 95 ms
[2021-05-20 02:22:34] [INFO ] Input system was already deterministic with 815 transitions.
Finished random walk after 21229 steps, including 0 resets, run visited all 53 properties in 142 ms. (steps per millisecond=149 )
Graph (trivial) has 261 edges and 210 vertex of which 51 / 210 are part of one of the 13 SCC in 4 ms
Free SCC test removed 38 places
Ensure Unique test removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 34 place count 139 transition count 558
Iterating global reduction 0 with 33 rules applied. Total rules applied 67 place count 139 transition count 558
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 100 place count 139 transition count 525
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 107 place count 132 transition count 504
Iterating global reduction 1 with 7 rules applied. Total rules applied 114 place count 132 transition count 504
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 121 place count 132 transition count 497
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 130 transition count 495
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 129 place count 130 transition count 491
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 131 place count 128 transition count 485
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 128 transition count 485
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 127 transition count 483
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 127 transition count 483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 136 place count 127 transition count 482
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 138 place count 126 transition count 487
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 150 place count 126 transition count 475
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 153 place count 126 transition count 475
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 156 place count 126 transition count 472
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 159 place count 123 transition count 469
Iterating global reduction 5 with 3 rules applied. Total rules applied 162 place count 123 transition count 469
Applied a total of 162 rules in 145 ms. Remains 123 /210 variables (removed 87) and now considering 469/815 (removed 346) transitions.
[2021-05-20 02:22:35] [INFO ] Flatten gal took : 25 ms
[2021-05-20 02:22:35] [INFO ] Flatten gal took : 27 ms
[2021-05-20 02:22:35] [INFO ] Input system was already deterministic with 469 transitions.
[2021-05-20 02:22:35] [INFO ] Flatten gal took : 23 ms
[2021-05-20 02:22:35] [INFO ] Flatten gal took : 23 ms
[2021-05-20 02:22:35] [INFO ] Time to serialize gal into /tmp/CTLFireability16729011368153100395.gal : 14 ms
[2021-05-20 02:22:35] [INFO ] Time to serialize properties into /tmp/CTLFireability10668588820712082887.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/CTLFireability16729011368153100395.gal, -t, CGAL, -ctl, /tmp/CTLFireability10668588820712082887.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/CTLFireability16729011368153100395.gal -t CGAL -ctl /tmp/CTLFireability10668588820712082887.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,7.72723e+07,1.32291,37656,2,4846,5,153321,6,0,889,127453,0
Converting to forward existential form...Done !
original formula: !(EF(((((((((p97==1)&&(p189==1))||((p120==1)&&(p174==1)))||(p84==1))||(p88==1))||((p4==1)&&(p95==1)))||(p61==1)) * E(((((p48==1)&&(p189==1)) * AG((((p97==1)||(p160==1))||(p99==1)))) * E((((((((p9==1)&&(p189==1))||((p33==1)&&(p189==1)))||((p60==1)&&(p160==1)))||(p72==1))||(p91==1))||(p79==1)) U (((((((p41==1)&&(p160==1))||(p167==1))||(p123==1))||((p79==1)&&(p189==1)))||(p79==1))||(p188==1)))) U (((p67==1)&&(p213==1))||(p53==1))))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * (((((((p97==1)&&(p189==1))||((p120==1)&&(p174==1)))||(p84==1))||(p88==1))||((p4==1)&&(p95==1)))||(p61==1))),((((p48==1)&&(p189==1)) * !(E(TRUE U !((((p97==1)||(p160==1))||(p99==1)))))) * E((((((((p9==1)&&(p189==1))||((p33==1)&&(p189==1)))||((p60==1)&&(p160==1)))||(p72==1))||(p91==1))||(p79==1)) U (((((((p41==1)&&(p160==1))||(p167==1))||(p123==1))||((p79==1)&&(p189==1)))||(p79==1))||(p188==1))))) * (((p67==1)&&(p213==1))||(p53==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t22, t24, t26, t30, t33, t35, t40, t42, t44, t54, t55, t56, t61, t62, t63, t455, t456, t457, t458, t459, t460, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/448/21/469
(forward)formula 0,0,22.767,536496,1,0,767,3.04911e+06,900,437,6203,2.45869e+06,1034
FORMULA UtahNoC-PT-none-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Graph (trivial) has 301 edges and 210 vertex of which 60 / 210 are part of one of the 14 SCC in 1 ms
Free SCC test removed 46 places
Ensure Unique test removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 36 place count 129 transition count 518
Iterating global reduction 0 with 35 rules applied. Total rules applied 71 place count 129 transition count 518
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 104 place count 129 transition count 485
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 114 place count 119 transition count 455
Iterating global reduction 1 with 10 rules applied. Total rules applied 124 place count 119 transition count 455
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 133 place count 119 transition count 446
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 117 transition count 436
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 117 transition count 436
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 139 place count 117 transition count 434
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 145 place count 114 transition count 431
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 149 place count 114 transition count 427
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 151 place count 112 transition count 421
Iterating global reduction 4 with 2 rules applied. Total rules applied 153 place count 112 transition count 421
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 155 place count 112 transition count 419
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 112 transition count 419
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 157 place count 112 transition count 418
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 158 place count 111 transition count 417
Iterating global reduction 6 with 1 rules applied. Total rules applied 159 place count 111 transition count 417
Applied a total of 159 rules in 109 ms. Remains 111 /210 variables (removed 99) and now considering 417/815 (removed 398) transitions.
[2021-05-20 02:22:58] [INFO ] Flatten gal took : 19 ms
[2021-05-20 02:22:58] [INFO ] Flatten gal took : 20 ms
[2021-05-20 02:22:58] [INFO ] Input system was already deterministic with 417 transitions.
[2021-05-20 02:22:58] [INFO ] Flatten gal took : 18 ms
[2021-05-20 02:22:58] [INFO ] Flatten gal took : 19 ms
[2021-05-20 02:22:58] [INFO ] Time to serialize gal into /tmp/CTLFireability3938689168499393134.gal : 5 ms
[2021-05-20 02:22:58] [INFO ] Time to serialize properties into /tmp/CTLFireability16575966030148784356.ctl : 0 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/CTLFireability3938689168499393134.gal, -t, CGAL, -ctl, /tmp/CTLFireability16575966030148784356.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/CTLFireability3938689168499393134.gal -t CGAL -ctl /tmp/CTLFireability16575966030148784356.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,3.93084e+07,1.17737,32664,2,4583,5,131069,6,0,798,104278,0
Converting to forward existential form...Done !
original formula: A(EF(((((p66==1)||((p1==1)&&(p211==1)))||((p112==1)&&(p147==1)))||((p81==1)&&(p210==1)))) U (((p98==0) * !(AF((((((((p144==0)&&(p22==0))&&(p132==0))&&((p99==0)||(p160==0)))&&(p88==0))&&(p47==0))&&(p172==0))))) * ((p126==0)||(p160==0))))
=> equivalent forward existential formula: [((Init * !(EG(!((((p98==0) * !(!(EG(!((((((((p144==0)&&(p22==0))&&(p132==0))&&((p99==0)||(p160==0)))&&(p88==0))&&(p47==0))&&(p172==0))))))) * ((p126==0)||(p160==0))))))) * !(E(!((((p98==0) * !(!(EG(!((((((((p144==0)&&(p22==0))&&(p132==0))&&((p99==0)||(p160==0)))&&(p88==0))&&(p47==0))&&(p172==0))))))) * ((p126==0)||(p160==0)))) U (!(E(TRUE U ((((p66==1)||((p1==1)&&(p211==1)))||((p112==1)&&(p147==1)))||((p81==1)&&(p210==1))))) * !((((p98==0) * !(!(EG(!((((((((p144==0)&&(p22==0))&&(p132==0))&&((p99==0)||(p160==0)))&&(p88==0))&&(p47==0))&&(p172==0))))))) * ((p126==0)||(p160==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t20, t22, t24, t27, t29, t31, t33, t35, t37, t43, t45, t47, t54, t56, t57, t62, t63, t64, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/399/18/417
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,9.32081,200716,1,0,596,1.04915e+06,803,350,5930,846336,814
FORMULA UtahNoC-PT-none-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Graph (trivial) has 334 edges and 210 vertex of which 81 / 210 are part of one of the 16 SCC in 1 ms
Free SCC test removed 65 places
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 220 edges and 143 vertex of which 21 / 143 are part of one of the 6 SCC in 1 ms
Free SCC test removed 15 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 128 transition count 610
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 52 place count 128 transition count 561
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 88 place count 92 transition count 393
Iterating global reduction 2 with 36 rules applied. Total rules applied 124 place count 92 transition count 393
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 2 with 51 rules applied. Total rules applied 175 place count 92 transition count 342
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 185 place count 82 transition count 319
Iterating global reduction 3 with 10 rules applied. Total rules applied 195 place count 82 transition count 319
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 206 place count 82 transition count 308
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 207 place count 81 transition count 303
Iterating global reduction 4 with 1 rules applied. Total rules applied 208 place count 81 transition count 303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 209 place count 81 transition count 302
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 215 place count 78 transition count 299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 219 place count 78 transition count 295
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 221 place count 76 transition count 289
Iterating global reduction 6 with 2 rules applied. Total rules applied 223 place count 76 transition count 289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 225 place count 76 transition count 287
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 234 place count 76 transition count 278
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 235 place count 76 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 236 place count 76 transition count 277
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 237 place count 75 transition count 276
Iterating global reduction 8 with 1 rules applied. Total rules applied 238 place count 75 transition count 276
Applied a total of 238 rules in 67 ms. Remains 75 /210 variables (removed 135) and now considering 276/815 (removed 539) transitions.
[2021-05-20 02:23:08] [INFO ] Flatten gal took : 10 ms
[2021-05-20 02:23:08] [INFO ] Flatten gal took : 12 ms
[2021-05-20 02:23:08] [INFO ] Input system was already deterministic with 276 transitions.
[2021-05-20 02:23:08] [INFO ] Flatten gal took : 11 ms
[2021-05-20 02:23:08] [INFO ] Flatten gal took : 11 ms
[2021-05-20 02:23:08] [INFO ] Time to serialize gal into /tmp/CTLFireability17917093832830172602.gal : 3 ms
[2021-05-20 02:23:08] [INFO ] Time to serialize properties into /tmp/CTLFireability15792568008283178027.ctl : 0 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/CTLFireability17917093832830172602.gal, -t, CGAL, -ctl, /tmp/CTLFireability15792568008283178027.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/CTLFireability17917093832830172602.gal -t CGAL -ctl /tmp/CTLFireability15792568008283178027.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,5.9347e+06,0.795498,19628,2,2611,5,64548,6,0,531,67845,0
Converting to forward existential form...Done !
original formula: EF(!(EG(EF((((p131==1)&&(p202==1))||((p62==1)&&(p189==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EG(E(TRUE U (((p131==1)&&(p202==1))||((p62==1)&&(p189==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t13, t15, t18, t20, t22, t26, t28, t30, t33, t34, t35, t37, t38, t39, t41, t42, t43, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/258/18/276
(forward)formula 0,0,3.00028,66496,1,0,417,304412,528,242,3737,299374,533
FORMULA UtahNoC-PT-none-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Graph (trivial) has 316 edges and 210 vertex of which 75 / 210 are part of one of the 17 SCC in 1 ms
Free SCC test removed 58 places
Ensure Unique test removed 189 transitions
Reduce isomorphic transitions removed 189 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 215 edges and 150 vertex of which 24 / 150 are part of one of the 4 SCC in 1 ms
Free SCC test removed 20 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 130 transition count 625
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 78 place count 130 transition count 550
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 114 place count 94 transition count 388
Iterating global reduction 2 with 36 rules applied. Total rules applied 150 place count 94 transition count 388
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 2 with 49 rules applied. Total rules applied 199 place count 94 transition count 339
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 209 place count 84 transition count 319
Iterating global reduction 3 with 10 rules applied. Total rules applied 219 place count 84 transition count 319
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 232 place count 84 transition count 306
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 236 place count 82 transition count 304
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 238 place count 82 transition count 302
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 239 place count 81 transition count 299
Iterating global reduction 5 with 1 rules applied. Total rules applied 240 place count 81 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 241 place count 81 transition count 298
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 243 place count 81 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 245 place count 81 transition count 296
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 247 place count 79 transition count 294
Iterating global reduction 7 with 2 rules applied. Total rules applied 249 place count 79 transition count 294
Applied a total of 249 rules in 44 ms. Remains 79 /210 variables (removed 131) and now considering 294/815 (removed 521) transitions.
[2021-05-20 02:23:11] [INFO ] Flatten gal took : 16 ms
[2021-05-20 02:23:11] [INFO ] Flatten gal took : 11 ms
[2021-05-20 02:23:11] [INFO ] Input system was already deterministic with 294 transitions.
[2021-05-20 02:23:11] [INFO ] Flatten gal took : 11 ms
[2021-05-20 02:23:11] [INFO ] Flatten gal took : 14 ms
[2021-05-20 02:23:11] [INFO ] Time to serialize gal into /tmp/CTLFireability15544622273649730856.gal : 3 ms
[2021-05-20 02:23:11] [INFO ] Time to serialize properties into /tmp/CTLFireability512547579533305422.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/CTLFireability15544622273649730856.gal, -t, CGAL, -ctl, /tmp/CTLFireability512547579533305422.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/CTLFireability15544622273649730856.gal -t CGAL -ctl /tmp/CTLFireability512547579533305422.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,8.35581e+06,0.524374,14160,2,2082,5,47027,6,0,565,41289,0
Converting to forward existential form...Done !
original formula: AG(EF(((((((p119==1)||(p172==1))||((p1==1)&&(p195==1)))||((p1==1)&&(p211==1)))||((p101==1)&&(p160==1)))||((p12==1)&&(p189==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((p119==1)||(p172==1))||((p1==1)&&(p195==1)))||((p1==1)&&(p211==1)))||((p101==1)&&(p160==1)))||((p12==1)&&(p189==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t13, t15, t19, t21, t23, t27, t29, t31, t35, t36, t37, t39, t40, t41, t42, t43, t44, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/276/18/294
(forward)formula 0,1,2.65377,61024,1,0,420,274537,555,240,3811,252282,553
FORMULA UtahNoC-PT-none-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Graph (trivial) has 323 edges and 210 vertex of which 75 / 210 are part of one of the 16 SCC in 1 ms
Free SCC test removed 59 places
Ensure Unique test removed 180 transitions
Reduce isomorphic transitions removed 180 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 217 edges and 149 vertex of which 23 / 149 are part of one of the 3 SCC in 1 ms
Free SCC test removed 20 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 129 transition count 634
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 86 place count 129 transition count 551
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 121 place count 94 transition count 387
Iterating global reduction 2 with 35 rules applied. Total rules applied 156 place count 94 transition count 387
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 2 with 46 rules applied. Total rules applied 202 place count 94 transition count 341
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 213 place count 83 transition count 314
Iterating global reduction 3 with 11 rules applied. Total rules applied 224 place count 83 transition count 314
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 237 place count 83 transition count 301
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 243 place count 80 transition count 298
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 247 place count 80 transition count 294
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 249 place count 78 transition count 288
Iterating global reduction 5 with 2 rules applied. Total rules applied 251 place count 78 transition count 288
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 253 place count 78 transition count 286
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 262 place count 78 transition count 277
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 263 place count 78 transition count 277
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 264 place count 78 transition count 276
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 265 place count 77 transition count 275
Iterating global reduction 7 with 1 rules applied. Total rules applied 266 place count 77 transition count 275
Applied a total of 266 rules in 39 ms. Remains 77 /210 variables (removed 133) and now considering 275/815 (removed 540) transitions.
[2021-05-20 02:23:14] [INFO ] Flatten gal took : 9 ms
[2021-05-20 02:23:14] [INFO ] Flatten gal took : 15 ms
[2021-05-20 02:23:14] [INFO ] Input system was already deterministic with 275 transitions.
[2021-05-20 02:23:14] [INFO ] Flatten gal took : 15 ms
[2021-05-20 02:23:14] [INFO ] Flatten gal took : 10 ms
[2021-05-20 02:23:14] [INFO ] Time to serialize gal into /tmp/CTLFireability8731402149319183873.gal : 2 ms
[2021-05-20 02:23:14] [INFO ] Time to serialize properties into /tmp/CTLFireability2939303840977144607.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/CTLFireability8731402149319183873.gal, -t, CGAL, -ctl, /tmp/CTLFireability2939303840977144607.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/CTLFireability8731402149319183873.gal -t CGAL -ctl /tmp/CTLFireability2939303840977144607.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,7.10491e+06,0.374394,14180,2,2362,5,40849,6,0,540,42043,0
Converting to forward existential form...Done !
original formula: EG((((((p122==0)&&(p77==0))&&((p20==0)||(p189==0)))&&((p112==0)||(p149==0)))&&((p45==0)||(p141==0))))
=> equivalent forward existential formula: [FwdG(Init,(((((p122==0)&&(p77==0))&&((p20==0)||(p189==0)))&&((p112==0)||(p149==0)))&&((p45==0)||(p141==0))))] != FALSE
Hit Full ! (commute/partial/dont) 185/165/90
(forward)formula 0,1,2.27416,53344,1,0,8,221742,19,2,2766,196684,8
FORMULA UtahNoC-PT-none-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2021-05-20 02:23:16] [INFO ] Flatten gal took : 31 ms
[2021-05-20 02:23:16] [INFO ] Flatten gal took : 30 ms
[2021-05-20 02:23:16] [INFO ] Applying decomposition
[2021-05-20 02:23:16] [INFO ] Flatten gal took : 34 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/graph14625378247392374765.txt, -o, /tmp/graph14625378247392374765.bin, -w, /tmp/graph14625378247392374765.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/graph14625378247392374765.bin, -l, -1, -v, -w, /tmp/graph14625378247392374765.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-20 02:23:16] [INFO ] Decomposing Gal with order
[2021-05-20 02:23:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-20 02:23:16] [INFO ] Removed a total of 779 redundant transitions.
[2021-05-20 02:23:17] [INFO ] Flatten gal took : 173 ms
[2021-05-20 02:23:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 341 labels/synchronizations in 59 ms.
[2021-05-20 02:23:17] [INFO ] Time to serialize gal into /tmp/CTLFireability3901851804973084781.gal : 12 ms
[2021-05-20 02:23:17] [INFO ] Time to serialize properties into /tmp/CTLFireability8828734678917332456.ctl : 7 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/CTLFireability3901851804973084781.gal, -t, CGAL, -ctl, /tmp/CTLFireability8828734678917332456.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/CTLFireability3901851804973084781.gal -t CGAL -ctl /tmp/CTLFireability8828734678917332456.ctl
No direction supplied, using forward translation only.
Parsed 10 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,3.76973e+09,0.525888,14992,630,40,21850,2302,718,26260,154,5303,0
Converting to forward existential form...Done !
original formula: (!(EX(AG(EX((((((((i7.i0.u60.p211==0)&&(i0.u6.p20==0))&&(i7.i1.u62.p214==0))&&(i9.u44.p148==0))&&((i7.i1.u0.p1==0)||(i7.i1.u59.p207==0)))&&(i7.i1.u58.p203==0))&&((i12.u37.p115==0)||(i10.u47.p160==0))))))) * !(AG(E((((i7.i0.u29.p85==0)&&(i1.i0.u2.p8==0))&&(i6.u46.p158==0)) U (((i0.u5.p16==0)||(u55.p189==0))&&((i8.u35.p105==0)||(u55.p189==0)))))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !(EX((((((((i7.i0.u60.p211==0)&&(i0.u6.p20==0))&&(i7.i1.u62.p214==0))&&(i9.u44.p148==0))&&((i7.i1.u0.p1==0)||(i7.i1.u59.p207==0)))&&(i7.i1.u58.p203==0))&&((i12.u37.p115==0)||(i10.u47.p160==0))))))))] = FALSE * [(Init * !(E(TRUE U !(E((((i7.i0.u29.p85==0)&&(i1.i0.u2.p8==0))&&(i6.u46.p158==0)) U (((i0.u5.p16==0)||(u55.p189==0))&&((i8.u35.p105==0)||(u55.p189==0))))))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t52, t59, t63, t65, t72, t76, t78, t89, t91, t99, t103, t111, t113, i1.i1.t115, i7.t46, i7.i1.t50, i8.t87, i13.i1.t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/472/18/490
(forward)formula 0,1,1.93394,52072,1,0,93160,2302,4584,139341,816,5303,365540
FORMULA UtahNoC-PT-none-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF(AG((((EF((((((((i14.u13.p40==1)&&(i10.u47.p160==1))||(i13.i0.u17.p52==1))||(i10.u42.p138==1))||((i9.u40.p131==1)&&(i12.u52.p174==1)))||((i9.u44.p111==1)&&(i10.u47.p160==1)))||((i7.i0.u29.p85==1)&&(u61.p212==1)))) + (i6.u23.p68==1)) + EX(((i6.u24.p71==1)&&(i10.u47.p160==1)))) + ((i1.i1.u7.p23==1)&&(u55.p189==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((E(TRUE U (((((((i14.u13.p40==1)&&(i10.u47.p160==1))||(i13.i0.u17.p52==1))||(i10.u42.p138==1))||((i9.u40.p131==1)&&(i12.u52.p174==1)))||((i9.u44.p111==1)&&(i10.u47.p160==1)))||((i7.i0.u29.p85==1)&&(u61.p212==1)))) + (i6.u23.p68==1)) + EX(((i6.u24.p71==1)&&(i10.u47.p160==1)))) + ((i1.i1.u7.p23==1)&&(u55.p189==1)))))))] != FALSE
(forward)formula 1,1,2.01977,54712,1,0,97831,2302,4632,146884,822,5303,378678
FORMULA UtahNoC-PT-none-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: !(AG(E(A(((((((i3.u11.p32==1)&&(u55.p189==1))||((i0.u4.p15==1)&&(u55.p189==1)))||((i1.i0.u2.p8==1)&&(u55.p189==1)))||((i1.i1.u8.p26==1)&&(i10.u47.p144==1))) + AX(((((((i1.i1.u7.p23==1)&&(u61.p213==1))||(i13.i1.u31.p89==1))||(i1.i0.u2.p10==1))||(i1.i1.u9.p28==1))||(i11.u49.p190==1)))) U A((((((((i0.u6.p19==1)&&(u55.p189==1))||((i13.i1.u18.p88==1)&&(i10.u47.p160==1)))||(i10.u42.p138==1))||(i11.u49.p190==1))||(i13.i1.u27.p79==1))||(i3.u10.p31==1)) U ((((i13.i1.u18.p88==1)&&(i13.i1.u54.p184==1))||((i3.u10.p30==1)&&(i3.u51.p170==1)))||(i1.i1.u8.p24==1)))) U EX(((((((i8.u38.p123==0)&&((i1.i1.u3.p45==0)||(u55.p173==0)))&&(i11.u49.p190==0))&&((i13.i0.u17.p51==0)||(u61.p213==0)))&&(i13.i0.u17.p52==0))&&(i7.i0.u30.p86==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!((E(!(!((E(!(((((i13.i1.u18.p88==1)&&(i13.i1.u54.p184==1))||((i3.u10.p30==1)&&(i3.u51.p170==1)))||(i1.i1.u8.p24==1))) U (!((((((((i0.u6.p19==1)&&(u55.p189==1))||((i13.i1.u18.p88==1)&&(i10.u47.p160==1)))||(i10.u42.p138==1))||(i11.u49.p190==1))||(i13.i1.u27.p79==1))||(i3.u10.p31==1))) * !(((((i13.i1.u18.p88==1)&&(i13.i1.u54.p184==1))||((i3.u10.p30==1)&&(i3.u51.p170==1)))||(i1.i1.u8.p24==1))))) + EG(!(((((i13.i1.u18.p88==1)&&(i13.i1.u54.p184==1))||((i3.u10.p30==1)&&(i3.u51.p170==1)))||(i1.i1.u8.p24==1))))))) U (!(((((((i3.u11.p32==1)&&(u55.p189==1))||((i0.u4.p15==1)&&(u55.p189==1)))||((i1.i0.u2.p8==1)&&(u55.p189==1)))||((i1.i1.u8.p26==1)&&(i10.u47.p144==1))) + !(EX(!(((((((i1.i1.u7.p23==1)&&(u61.p213==1))||(i13.i1.u31.p89==1))||(i1.i0.u2.p10==1))||(i1.i1.u9.p28==1))||(i11.u49.p190==1))))))) * !(!((E(!(((((i13.i1.u18.p88==1)&&(i13.i1.u54.p184==1))||((i3.u10.p30==1)&&(i3.u51.p170==1)))||(i1.i1.u8.p24==1))) U (!((((((((i0.u6.p19==1)&&(u55.p189==1))||((i13.i1.u18.p88==1)&&(i10.u47.p160==1)))||(i10.u42.p138==1))||(i11.u49.p190==1))||(i13.i1.u27.p79==1))||(i3.u10.p31==1))) * !(((((i13.i1.u18.p88==1)&&(i13.i1.u54.p184==1))||((i3.u10.p30==1)&&(i3.u51.p170==1)))||(i1.i1.u8.p24==1))))) + EG(!(((((i13.i1.u18.p88==1)&&(i13.i1.u54.p184==1))||((i3.u10.p30==1)&&(i3.u51.p170==1)))||(i1.i1.u8.p24==1))))))))) + EG(!(!((E(!(((((i13.i1.u18.p88==1)&&(i13.i1.u54.p184==1))||((i3.u10.p30==1)&&(i3.u51.p170==1)))||(i1.i1.u8.p24==1))) U (!((((((((i0.u6.p19==1)&&(u55.p189==1))||((i13.i1.u18.p88==1)&&(i10.u47.p160==1)))||(i10.u42.p138==1))||(i11.u49.p190==1))||(i13.i1.u27.p79==1))||(i3.u10.p31==1))) * !(((((i13.i1.u18.p88==1)&&(i13.i1.u54.p184==1))||((i3.u10.p30==1)&&(i3.u51.p170==1)))||(i1.i1.u8.p24==1))))) + EG(!(((((i13.i1.u18.p88==1)&&(i13.i1.u54.p184==1))||((i3.u10.p30==1)&&(i3.u51.p170==1)))||(i1.i1.u8.p24==1)))))))))) U EX(((((((i8.u38.p123==0)&&((i1.i1.u3.p45==0)||(u55.p173==0)))&&(i11.u49.p190==0))&&((i13.i0.u17.p51==0)||(u61.p213==0)))&&(i13.i0.u17.p52==0))&&(i7.i0.u30.p86==0))))))] != 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
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
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
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 2,1,2.72781,75568,1,0,147560,2302,5017,220309,823,5303,471486
FORMULA UtahNoC-PT-none-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: !(E(EG(EF(AG((((((i6.u24.p71==1)||((i8.u39.p127==1)&&(i10.u47.p160==1)))||((i3.u11.p34==1)&&(i3.u51.p169==1)))||(i8.u33.p95==1))||((i6.u23.p68==1)&&(u61.p213==1)))))) U EX((((((((((((((((((((i3.u11.p33==1)||(i11.u49.p163==1))||(i6.u23.p69==1))||((i12.u52.p120==1)&&(i12.u52.p174==1)))||((i3.u12.p36==1)&&(i10.u47.p160==1)))||(i13.i1.u31.p89==1))||((i3.u10.p30==1)&&(i3.u51.p169==1)))||((i12.u37.p115==1)&&(u55.p189==1)))||(i13.i1.u27.p79==1))||((i7.i0.u28.p80==1)&&(i10.u47.p160==1)))&&(i7.i0.u60.p211==0))&&(i0.u5.p17==0))&&(i11.u50.p164==0))&&(i8.u35.p102==0))&&(i5.u20.p59==0))&&(i13.i0.u16.p50==0))&&((i6.u22.p65==0)||(i6.u46.p156==0)))&&(i6.u46.p158==0)) * AX(((((((((((i6.u22.p64==1)&&(u55.p189==1))||((i1.i1.u3.p45==1)&&(u55.p189==1)))||(i13.i1.u31.p89==1))||((i0.u5.p16==1)&&(i10.u47.p160==1)))||(i13.i1.u26.p75==1))||(i12.u52.p121==1))||((i8.u32.p93==1)&&(u55.p189==1)))||(i1.i1.u15.p47==1))||(i13.i1.u27.p78==1)))))))
=> equivalent forward existential formula: [((EY(FwdU(Init,EG(E(TRUE U !(E(TRUE U !((((((i6.u24.p71==1)||((i8.u39.p127==1)&&(i10.u47.p160==1)))||((i3.u11.p34==1)&&(i3.u51.p169==1)))||(i8.u33.p95==1))||((i6.u23.p68==1)&&(u61.p213==1)))))))))) * ((((((((((((((((((i3.u11.p33==1)||(i11.u49.p163==1))||(i6.u23.p69==1))||((i12.u52.p120==1)&&(i12.u52.p174==1)))||((i3.u12.p36==1)&&(i10.u47.p160==1)))||(i13.i1.u31.p89==1))||((i3.u10.p30==1)&&(i3.u51.p169==1)))||((i12.u37.p115==1)&&(u55.p189==1)))||(i13.i1.u27.p79==1))||((i7.i0.u28.p80==1)&&(i10.u47.p160==1)))&&(i7.i0.u60.p211==0))&&(i0.u5.p17==0))&&(i11.u50.p164==0))&&(i8.u35.p102==0))&&(i5.u20.p59==0))&&(i13.i0.u16.p50==0))&&((i6.u22.p65==0)||(i6.u46.p156==0)))&&(i6.u46.p158==0))) * !(EX(!(((((((((((i6.u22.p64==1)&&(u55.p189==1))||((i1.i1.u3.p45==1)&&(u55.p189==1)))||(i13.i1.u31.p89==1))||((i0.u5.p16==1)&&(i10.u47.p160==1)))||(i13.i1.u26.p75==1))||(i12.u52.p121==1))||((i8.u32.p93==1)&&(u55.p189==1)))||(i1.i1.u15.p47==1))||(i13.i1.u27.p78==1))))))] = FALSE
(forward)formula 3,1,2.82815,79528,1,0,157085,2302,5228,232943,840,5303,490547
FORMULA UtahNoC-PT-none-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF(EX(AX((((((i7.i0.u30.p86==1)||(i1.i1.u3.p45==1))||((i0.u4.p15==1)&&(i10.u47.p160==1)))||((i8.u33.p94==1)&&(u61.p213==1)))||((i1.i0.u1.p5==1)&&(i10.u47.p160==1))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EX(!((((((i7.i0.u30.p86==1)||(i1.i1.u3.p45==1))||((i0.u4.p15==1)&&(i10.u47.p160==1)))||((i8.u33.p94==1)&&(u61.p213==1)))||((i1.i0.u1.p5==1)&&(i10.u47.p160==1)))))))] != FALSE
(forward)formula 4,1,2.90109,82432,1,0,163589,2302,5260,244909,840,5338,504428
FORMULA UtahNoC-PT-none-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (EX(EF((!(EX((((((((i13.i0.u17.p51==1)||(i11.u50.p167==1))||(i8.u41.p133==1))||(i1.i1.u3.p12==1))||((i8.u39.p128==1)&&(i7.i1.u58.p202==1)))||(i3.u51.p172==1))||(i13.i1.u27.p78==1)))) + AG(((((((i13.i1.u26.p75==0)||(u61.p213==0))&&((i5.u21.p62==0)||(u55.p189==0)))&&(i8.u32.p91==0))&&(i13.i1.u25.p74==0))&&((i6.u22.p64==0)||(i10.u47.p160==0))))))) * E(AG(AF(!(AG((((((i10.u48.p162==1)||(i10.u45.p150==1))||(i13.i0.u17.p53==1))||(i12.u52.p120==1))||(i0.u4.p15==1)))))) U (((((((i8.u35.p104==1)||(i12.u52.p121==1))||(i8.u39.p126==1))||((i1.i1.u8.p25==1)&&(i10.u47.p160==1)))||(i13.i1.u27.p79==1))||((i9.u40.p98==1)&&(i10.u47.p160==1))) * AF((((((((i7.i1.u0.p1==1)&&(i7.i0.u60.p211==1))||((i8.u33.p94==1)&&(u61.p213==1)))||(i13.i1.u26.p75==1))||((i1.i1.u7.p21==1)&&(u61.p213==1)))||(i9.u44.p110==1))||((i12.u37.p115==1)&&(u55.p189==1)))))))
=> equivalent forward existential formula: [((FwdU((Init * EX(E(TRUE U (!(EX((((((((i13.i0.u17.p51==1)||(i11.u50.p167==1))||(i8.u41.p133==1))||(i1.i1.u3.p12==1))||((i8.u39.p128==1)&&(i7.i1.u58.p202==1)))||(i3.u51.p172==1))||(i13.i1.u27.p78==1)))) + !(E(TRUE U !(((((((i13.i1.u26.p75==0)||(u61.p213==0))&&((i5.u21.p62==0)||(u55.p189==0)))&&(i8.u32.p91==0))&&(i13.i1.u25.p74==0))&&((i6.u22.p64==0)||(i10.u47.p160==0)))))))))),!(E(TRUE U !(!(EG(!(!(!(E(TRUE U !((((((i10.u48.p162==1)||(i10.u45.p150==1))||(i13.i0.u17.p53==1))||(i12.u52.p120==1))||(i0.u4.p15==1))))))))))))) * ((((((i8.u35.p104==1)||(i12.u52.p121==1))||(i8.u39.p126==1))||((i1.i1.u8.p25==1)&&(i10.u47.p160==1)))||(i13.i1.u27.p79==1))||((i9.u40.p98==1)&&(i10.u47.p160==1)))) * !(EG(!((((((((i7.i1.u0.p1==1)&&(i7.i0.u60.p211==1))||((i8.u33.p94==1)&&(u61.p213==1)))||(i13.i1.u26.p75==1))||((i1.i1.u7.p21==1)&&(u61.p213==1)))||(i9.u44.p110==1))||((i12.u37.p115==1)&&(u55.p189==1)))))))] != FALSE
(forward)formula 5,1,3.53067,101440,1,0,206396,3816,5970,305581,911,10252,604645
FORMULA UtahNoC-PT-none-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG((EF(((!(AG((((i3.u12.p36==1)&&(i10.u47.p160==1))||((i14.u13.p42==1)&&(u61.p200==1))))) * ((((A((((((((i7.i1.u0.p1==1)&&(i7.i1.u56.p195==1))||((i12.u52.p120==1)&&(i12.u52.p175==1)))||(i14.u13.p38==1))||((i1.i1.u3.p11==1)&&(i10.u47.p160==1)))||((i13.i1.u25.p73==1)&&(u55.p188==1)))||((i14.u14.p44==1)&&(i10.u47.p160==1))) U ((((((i8.u35.p103==1)||(i6.u24.p71==1))||((i6.u23.p69==1)&&(i10.u47.p159==1)))||(i10.u42.p138==1))||(i6.u46.p158==1))||(i13.i1.u27.p79==1))) + (i11.u53.p181==1)) + ((i13.i1.u26.p75==1)&&(u61.p213==1))) + (i13.i1.u26.p75==1)) + ((i1.i0.u2.p9==1)&&(i10.u47.p160==1)))) + AX(((((((((i6.u23.p69==1)&&(i6.u46.p155==1))||(i14.u57.p199==1))||(i7.i1.u62.p214==1))||((i9.u40.p131==1)&&(i9.u44.p146==1)))||((i6.u22.p66==1)&&(i10.u47.p160==1)))||(i5.u20.p61==1))||(i3.u10.p29==1))))) * (E(EF((((((((((((((i9.u40.p131==1)||(i12.u52.p119==1))||(i11.u53.p182==1))||((i13.i1.u18.p54==1)&&(i10.u47.p160==1)))||((i9.u40.p131==1)&&(i12.u52.p174==1)))||((i6.u22.p66==1)&&(u61.p213==1)))||((i7.i1.u0.p1==1)&&(i7.i1.u62.p215==1)))||((i13.i1.u18.p55==1)&&(u61.p213==1)))||((i9.u44.p112==1)&&(i10.u47.p149==1)))||(i12.u52.p119==1))||(i13.i1.u31.p89==1))||(i1.i1.u3.p11==1))||((i9.u40.p98==1)&&(i10.u47.p160==1)))) U (((((((((i8.u34.p101==0)&&(i8.u34.p100==0))&&((i6.u23.p67==0)||(u55.p189==0)))&&(i8.u38.p123==0))&&((i8.u33.p97==0)||(u61.p213==0)))&&((i8.u33.p4==0)||(i9.u40.p130==0)))&&(i8.u35.p105==0))&&((i1.i0.u2.p8==0)||(u55.p189==0)))&&((i8.u35.p102==0)||(u61.p213==0)))) + AF(E(((i13.i0.u17.p53==1)&&(((((((((i6.u23.p69==1)&&(i6.u46.p156==1))||((i9.u40.p98==1)&&(u55.p189==1)))||(i7.i0.u28.p82==1))||((i8.u34.p99==1)&&(u61.p213==1)))||(i1.i1.u7.p21==1))||(i7.i0.u30.p86==1))||(i5.u21.p63==1))||(i3.u10.p31==1))) U ((((((((i9.u44.p112==1)&&(i9.u44.p147==1))||((i7.i1.u0.p1==1)&&(i7.i0.u60.p211==1)))||((i13.i1.u26.p77==1)&&(i13.i1.u54.p185==1)))||(i9.u36.p107==1))||(i10.u45.p153==1))||((i1.i1.u8.p26==1)&&(i1.i1.u43.p142==1)))||((i1.i1.u8.p25==1)&&(u55.p189==1))))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U ((!(!(E(TRUE U !((((i3.u12.p36==1)&&(i10.u47.p160==1))||((i14.u13.p42==1)&&(u61.p200==1))))))) * ((((!((E(!(((((((i8.u35.p103==1)||(i6.u24.p71==1))||((i6.u23.p69==1)&&(i10.u47.p159==1)))||(i10.u42.p138==1))||(i6.u46.p158==1))||(i13.i1.u27.p79==1))) U (!((((((((i7.i1.u0.p1==1)&&(i7.i1.u56.p195==1))||((i12.u52.p120==1)&&(i12.u52.p175==1)))||(i14.u13.p38==1))||((i1.i1.u3.p11==1)&&(i10.u47.p160==1)))||((i13.i1.u25.p73==1)&&(u55.p188==1)))||((i14.u14.p44==1)&&(i10.u47.p160==1)))) * !(((((((i8.u35.p103==1)||(i6.u24.p71==1))||((i6.u23.p69==1)&&(i10.u47.p159==1)))||(i10.u42.p138==1))||(i6.u46.p158==1))||(i13.i1.u27.p79==1))))) + EG(!(((((((i8.u35.p103==1)||(i6.u24.p71==1))||((i6.u23.p69==1)&&(i10.u47.p159==1)))||(i10.u42.p138==1))||(i6.u46.p158==1))||(i13.i1.u27.p79==1)))))) + (i11.u53.p181==1)) + ((i13.i1.u26.p75==1)&&(u61.p213==1))) + (i13.i1.u26.p75==1)) + ((i1.i0.u2.p9==1)&&(i10.u47.p160==1)))) + !(EX(!(((((((((i6.u23.p69==1)&&(i6.u46.p155==1))||(i14.u57.p199==1))||(i7.i1.u62.p214==1))||((i9.u40.p131==1)&&(i9.u44.p146==1)))||((i6.u22.p66==1)&&(i10.u47.p160==1)))||(i5.u20.p61==1))||(i3.u10.p29==1)))))))))] = FALSE * [FwdG((FwdU(Init,TRUE) * !(E(E(TRUE U (((((((((((((i9.u40.p131==1)||(i12.u52.p119==1))||(i11.u53.p182==1))||((i13.i1.u18.p54==1)&&(i10.u47.p160==1)))||((i9.u40.p131==1)&&(i12.u52.p174==1)))||((i6.u22.p66==1)&&(u61.p213==1)))||((i7.i1.u0.p1==1)&&(i7.i1.u62.p215==1)))||((i13.i1.u18.p55==1)&&(u61.p213==1)))||((i9.u44.p112==1)&&(i10.u47.p149==1)))||(i12.u52.p119==1))||(i13.i1.u31.p89==1))||(i1.i1.u3.p11==1))||((i9.u40.p98==1)&&(i10.u47.p160==1)))) U (((((((((i8.u34.p101==0)&&(i8.u34.p100==0))&&((i6.u23.p67==0)||(u55.p189==0)))&&(i8.u38.p123==0))&&((i8.u33.p97==0)||(u61.p213==0)))&&((i8.u33.p4==0)||(i9.u40.p130==0)))&&(i8.u35.p105==0))&&((i1.i0.u2.p8==0)||(u55.p189==0)))&&((i8.u35.p102==0)||(u61.p213==0)))))),!(E(((i13.i0.u17.p53==1)&&(((((((((i6.u23.p69==1)&&(i6.u46.p156==1))||((i9.u40.p98==1)&&(u55.p189==1)))||(i7.i0.u28.p82==1))||((i8.u34.p99==1)&&(u61.p213==1)))||(i1.i1.u7.p21==1))||(i7.i0.u30.p86==1))||(i5.u21.p63==1))||(i3.u10.p31==1))) U ((((((((i9.u44.p112==1)&&(i9.u44.p147==1))||((i7.i1.u0.p1==1)&&(i7.i0.u60.p211==1)))||((i13.i1.u26.p77==1)&&(i13.i1.u54.p185==1)))||(i9.u36.p107==1))||(i10.u45.p153==1))||((i1.i1.u8.p26==1)&&(i1.i1.u43.p142==1)))||((i1.i1.u8.p25==1)&&(u55.p189==1))))))] = FALSE)
(forward)formula 6,1,5.29322,148960,1,0,300012,4836,6332,484112,920,15341,788492
FORMULA UtahNoC-PT-none-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EG(EX(((EX((i9.u40.p131==1)) * !(EG(((i10.u42.p138==1)||(i1.i0.u2.p9==1))))) * (!(EX((((((((i7.i0.u29.p85==1)&&(i7.i0.u60.p210==1))||(i8.u39.p129==1))||(i1.i0.u2.p9==1))||(i8.u38.p123==1))||(i8.u33.p95==1))||(i1.i1.u15.p46==1)))) + (((((((((((((i6.u23.p69==0)&&(i8.u35.p104==0))&&(i8.u32.p91==0))&&(i0.u4.p14==0))&&(i8.u39.p129==0))&&(i12.u52.p118==0))&&(i14.u13.p39==0))&&((i0.u4.p15==0)||(i10.u47.p160==0)))&&((i1.i1.u3.p45==0)||(i1.i1.u43.p140==0)))&&((i9.u44.p110==0)||(u55.p189==0)))&&((i9.u36.p107==0)||(i10.u47.p160==0)))&&((i3.u10.p30==0)||(i3.u51.p169==0)))&&((i7.i0.u28.p80==0)||(u61.p213==0)))))))
=> equivalent forward existential formula: [FwdG(Init,EX(((EX((i9.u40.p131==1)) * !(EG(((i10.u42.p138==1)||(i1.i0.u2.p9==1))))) * (!(EX((((((((i7.i0.u29.p85==1)&&(i7.i0.u60.p210==1))||(i8.u39.p129==1))||(i1.i0.u2.p9==1))||(i8.u38.p123==1))||(i8.u33.p95==1))||(i1.i1.u15.p46==1)))) + (((((((((((((i6.u23.p69==0)&&(i8.u35.p104==0))&&(i8.u32.p91==0))&&(i0.u4.p14==0))&&(i8.u39.p129==0))&&(i12.u52.p118==0))&&(i14.u13.p39==0))&&((i0.u4.p15==0)||(i10.u47.p160==0)))&&((i1.i1.u3.p45==0)||(i1.i1.u43.p140==0)))&&((i9.u44.p110==0)||(u55.p189==0)))&&((i9.u36.p107==0)||(i10.u47.p160==0)))&&((i3.u10.p30==0)||(i3.u51.p169==0)))&&((i7.i0.u28.p80==0)||(u61.p213==0)))))))] != FALSE
(forward)formula 7,1,10.446,249544,1,0,501674,4860,6435,859473,920,15884,1011559
FORMULA UtahNoC-PT-none-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: !(AX((((((((((i12.u52.p177==1)||(i14.u57.p199==1))||(i12.u52.p118==1))||((i9.u44.p113==1)&&(u61.p213==1)))||((i8.u33.p95==1)&&(u61.p213==1)))||(i10.u47.p154==1))||((i3.u11.p34==1)&&(u55.p173==1)))||(i1.i0.u2.p10==1)) * A((!(AG(((((((((((i1.i1.u7.p23==1)&&(u61.p213==1))||((i9.u44.p114==1)&&(u55.p189==1)))||((i8.u38.p123==1)&&(u55.p189==1)))||((i9.u36.p108==1)&&(i9.u44.p147==1)))||(i7.i0.u30.p86==1))||(i13.i1.u31.p89==1))||((i1.i1.u7.p23==1)&&(i10.u47.p160==1)))||(i6.u46.p158==1))||(i8.u33.p94==1)))) + AG(((((((((i7.i0.u28.p80==1)||((i8.u38.p123==1)&&(u55.p189==1)))||(i6.u24.p71==1))||(i7.i0.u30.p86==1))||((i12.u52.p120==1)&&(u55.p178==1)))||((i8.u39.p126==1)&&(i10.u47.p160==1)))||(i8.u38.p123==1))||((i8.u41.p132==1)&&(i10.u47.p160==1))))) U ((((i10.u48.p161==1)||(i1.i1.u7.p23==1))||((i7.i0.u28.p82==1)&&(i10.u47.p160==1)))||((i7.i0.u28.p82==1)&&(u61.p213==1)))))))
=> equivalent forward existential formula: ([(EY(Init) * !(((((((((i12.u52.p177==1)||(i14.u57.p199==1))||(i12.u52.p118==1))||((i9.u44.p113==1)&&(u61.p213==1)))||((i8.u33.p95==1)&&(u61.p213==1)))||(i10.u47.p154==1))||((i3.u11.p34==1)&&(u55.p173==1)))||(i1.i0.u2.p10==1))))] != FALSE + ([(FwdU(((FwdU(EY(Init),!(((((i10.u48.p161==1)||(i1.i1.u7.p23==1))||((i7.i0.u28.p82==1)&&(i10.u47.p160==1)))||((i7.i0.u28.p82==1)&&(u61.p213==1))))) * !(((((i10.u48.p161==1)||(i1.i1.u7.p23==1))||((i7.i0.u28.p82==1)&&(i10.u47.p160==1)))||((i7.i0.u28.p82==1)&&(u61.p213==1))))) * !(!(!(E(TRUE U !(((((((((((i1.i1.u7.p23==1)&&(u61.p213==1))||((i9.u44.p114==1)&&(u55.p189==1)))||((i8.u38.p123==1)&&(u55.p189==1)))||((i9.u36.p108==1)&&(i9.u44.p147==1)))||(i7.i0.u30.p86==1))||(i13.i1.u31.p89==1))||((i1.i1.u7.p23==1)&&(i10.u47.p160==1)))||(i6.u46.p158==1))||(i8.u33.p94==1)))))))),TRUE) * !(((((((((i7.i0.u28.p80==1)||((i8.u38.p123==1)&&(u55.p189==1)))||(i6.u24.p71==1))||(i7.i0.u30.p86==1))||((i12.u52.p120==1)&&(u55.p178==1)))||((i8.u39.p126==1)&&(i10.u47.p160==1)))||(i8.u38.p123==1))||((i8.u41.p132==1)&&(i10.u47.p160==1)))))] != FALSE + [FwdG(EY(Init),!(((((i10.u48.p161==1)||(i1.i1.u7.p23==1))||((i7.i0.u28.p82==1)&&(i10.u47.p160==1)))||((i7.i0.u28.p82==1)&&(u61.p213==1)))))] != FALSE))
(forward)formula 8,1,10.455,250072,1,0,502452,4876,6466,860465,921,15939,1012590
FORMULA UtahNoC-PT-none-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (EG((EX((((((((((i0.u5.p17==1)||(i12.u52.p177==1))||((i8.u39.p129==1)&&(u61.p213==1)))||((i5.u19.p56==1)&&(u61.p213==1)))||(i11.u53.p180==1))||((i12.u52.p120==1)&&(i12.u52.p176==1)))||((i8.u33.p94==1)&&(i10.u47.p160==1)))||((i5.u19.p58==1)&&(u55.p189==1)))||(i0.u4.p15==1))) + (AF((((i14.u13.p40==1)&&(u61.p213==1))||((i1.i1.u3.p12==1)&&(i10.u47.p160==1)))) * ((i7.i1.u58.p203==1)||(i5.u20.p60==1))))) + EG((((((((((i14.u13.p39==1)&&(u61.p213==1))||(i6.u22.p66==1))||(i0.u6.p19==1))||((i9.u36.p108==1)&&(i10.u47.p149==1)))||((i9.u40.p131==1)&&(i9.u44.p145==1)))||(i5.u20.p60==1))||((i7.i1.u0.p1==1)&&(i14.u57.p199==1)))||((i14.u14.p43==1)&&(u55.p189==1)))))
=> equivalent forward existential formula: ([FwdG(Init,(EX((((((((((i0.u5.p17==1)||(i12.u52.p177==1))||((i8.u39.p129==1)&&(u61.p213==1)))||((i5.u19.p56==1)&&(u61.p213==1)))||(i11.u53.p180==1))||((i12.u52.p120==1)&&(i12.u52.p176==1)))||((i8.u33.p94==1)&&(i10.u47.p160==1)))||((i5.u19.p58==1)&&(u55.p189==1)))||(i0.u4.p15==1))) + (!(EG(!((((i14.u13.p40==1)&&(u61.p213==1))||((i1.i1.u3.p12==1)&&(i10.u47.p160==1)))))) * ((i7.i1.u58.p203==1)||(i5.u20.p60==1)))))] != FALSE + [FwdG(Init,(((((((((i14.u13.p39==1)&&(u61.p213==1))||(i6.u22.p66==1))||(i0.u6.p19==1))||((i9.u36.p108==1)&&(i10.u47.p149==1)))||((i9.u40.p131==1)&&(i9.u44.p145==1)))||(i5.u20.p60==1))||((i7.i1.u0.p1==1)&&(i14.u57.p199==1)))||((i14.u14.p43==1)&&(u55.p189==1))))] != FALSE)
(forward)formula 9,0,10.5709,254560,1,0,513142,4920,6572,876876,922,16179,1033040
FORMULA UtahNoC-PT-none-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
BK_STOP 1621477409106
--------------------
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="UtahNoC-PT-none"
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 UtahNoC-PT-none, 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 r273-smll-162123879800202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtahNoC-PT-none.tgz
mv UtahNoC-PT-none 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 ;