Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r193-csrt-159033389000594.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033389000594
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 3.2K Apr 12 20:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 20:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 23:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 23:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 15 10:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 15 10:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 10 22:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 10 07:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 10 07:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 205K Mar 24 05:38 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-00
FORMULA_NAME UtahNoC-PT-none-01
FORMULA_NAME UtahNoC-PT-none-02
FORMULA_NAME UtahNoC-PT-none-03
FORMULA_NAME UtahNoC-PT-none-04
FORMULA_NAME UtahNoC-PT-none-05
FORMULA_NAME UtahNoC-PT-none-06
FORMULA_NAME UtahNoC-PT-none-07
FORMULA_NAME UtahNoC-PT-none-08
FORMULA_NAME UtahNoC-PT-none-09
FORMULA_NAME UtahNoC-PT-none-10
FORMULA_NAME UtahNoC-PT-none-11
FORMULA_NAME UtahNoC-PT-none-12
FORMULA_NAME UtahNoC-PT-none-13
FORMULA_NAME UtahNoC-PT-none-14
FORMULA_NAME UtahNoC-PT-none-15

=== Now, execution of the tool begins

BK_START 1590538307267

[2020-05-27 00:11:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 00:11:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 00:11:51] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2020-05-27 00:11:51] [INFO ] Transformed 216 places.
[2020-05-27 00:11:51] [INFO ] Transformed 977 transitions.
[2020-05-27 00:11:51] [INFO ] Found NUPN structural information;
[2020-05-27 00:11:51] [INFO ] Parsed PT model containing 216 places and 977 transitions in 303 ms.
Ensure Unique test removed 148 transitions
Reduce redundant transitions removed 148 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 458 ms. (steps per millisecond=218 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-27 00:11:52] [INFO ] Flow matrix only has 427 transitions (discarded 402 similar events)
// Phase 1: matrix 427 rows 216 cols
[2020-05-27 00:11:52] [INFO ] Computed 8 place invariants in 28 ms
[2020-05-27 00:11:52] [INFO ] [Real]Absence check using 8 positive place invariants in 83 ms returned sat
[2020-05-27 00:11:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 00:11:53] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2020-05-27 00:11:53] [INFO ] State equation strengthened by 43 read => feed constraints.
[2020-05-27 00:11:53] [INFO ] [Real]Added 43 Read/Feed constraints in 40 ms returned sat
[2020-05-27 00:11:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 00:11:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 64 ms returned sat
[2020-05-27 00:11:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 00:11:54] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2020-05-27 00:11:54] [INFO ] [Nat]Added 43 Read/Feed constraints in 17 ms returned sat
[2020-05-27 00:11:54] [INFO ] Computed and/alt/rep : 828/4432/426 causal constraints in 88 ms.
[2020-05-27 00:12:02] [INFO ] Added : 426 causal constraints over 86 iterations in 7651 ms. Result :sat
[2020-05-27 00:12:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-27 00:12:02] [INFO ] Flatten gal took : 180 ms
FORMULA UtahNoC-PT-none-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 00:12:02] [INFO ] Flatten gal took : 73 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 00:12:03] [INFO ] Applying decomposition
[2020-05-27 00:12:03] [INFO ] Flatten gal took : 109 ms
[2020-05-27 00:12:03] [INFO ] Input system was already deterministic with 829 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph8975438768889029829.txt, -o, /tmp/graph8975438768889029829.bin, -w, /tmp/graph8975438768889029829.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph8975438768889029829.bin, -l, -1, -v, -w, /tmp/graph8975438768889029829.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 00:12:03] [INFO ] Decomposing Gal with order
[2020-05-27 00:12:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 00:12:04] [INFO ] Removed a total of 785 redundant transitions.
[2020-05-27 00:12:04] [INFO ] Flatten gal took : 293 ms
[2020-05-27 00:12:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 373 labels/synchronizations in 64 ms.
[2020-05-27 00:12:04] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 8 ms
[2020-05-27 00:12:04] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 15 LTL properties
Checking formula 0 : !((!(F(X(((("(i6.u20.p58==1)")U(("((i0.u30.p86==1)&&(i14.u54.p189==1))")U("(i7.u26.p74==1)")))&&("(i0.u30.p86==1)"))&&("(i14.u54.p189==1)"))))))
Formula 0 simplified : FX("(i0.u30.p86==1)" & "(i14.u54.p189==1)" & ("(i6.u20.p58==1)" U ("((i0.u30.p86==1)&&(i14.u54.p189==1))" U "(i7.u26.p74==1)")))
built 54 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 20 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 20 ordering constraints for composite.
built 7 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 16 ordering constraints for composite.
built 12 ordering constraints for composite.
built 15 ordering constraints for composite.
built 14 ordering constraints for composite.
built 19 ordering constraints for composite.
built 18 ordering constraints for composite.
built 19 ordering constraints for composite.
built 12 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 427 out of 829 initially.
// Phase 1: matrix 427 rows 216 cols
[2020-05-27 00:12:04] [INFO ] Computed 8 place invariants in 4 ms
inv : p0 + p4 = 1
inv : p0 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 = 1
inv : p0 + p1 + p2 + p3 = 1
inv : p0 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 = 1
inv : p0 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 = 1
inv : p0 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 = 1
inv : p0 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 = 1
inv : p0 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 = 1
Total of 8 invariants.
[2020-05-27 00:12:04] [INFO ] Computed 8 place invariants in 5 ms
Reverse transition relation is NOT exact ! Due to transitions t80, t86, t96, t100, t102, t112, t116, t118, t129, t131, t141, t143, t153, t155, i3.i1.t157, i5.i1.t145, i10.t84, i11.t133, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/489/18/507
[2020-05-27 00:12:06] [INFO ] Proved 216 variables to be positive in 1522 ms
[2020-05-27 00:12:06] [INFO ] Computing symmetric may disable matrix : 829 transitions.
[2020-05-27 00:12:06] [INFO ] Computation of disable matrix completed :0/829 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:12:06] [INFO ] Computation of Complete disable matrix. took 201 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 00:12:06] [INFO ] Computing symmetric may enable matrix : 829 transitions.
[2020-05-27 00:12:06] [INFO ] Computation of Complete enable matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
3 unique states visited
0 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
696 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.09276,188620,1,0,372828,3806,4863,443878,749,9929,998705
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtahNoC-PT-none-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(((!(F(("(i5.i1.u24.p68==1)")U("(i13.u11.p34==1)"))))U("(i4.u14.p41==1)"))U("(i5.i1.u31.p89==1)")))))
Formula 1 simplified : !XX((!F("(i5.i1.u24.p68==1)" U "(i13.u11.p34==1)") U "(i4.u14.p41==1)") U "(i5.i1.u31.p89==1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
248 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.58573,255232,1,0,537360,4131,5166,634661,756,11133,1345232
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((("((i5.i1.u23.p66==1)&&(u61.p213==1))")U(!(X(G((G(F(G("((i5.i1.u23.p66==1)&&(u61.p213==1))"))))&&(G(F("(u44.p139==1)")))))))))
Formula 2 simplified : !("((i5.i1.u23.p66==1)&&(u61.p213==1))" U !XG(GFG"((i5.i1.u23.p66==1)&&(u61.p213==1))" & GF"(u44.p139==1)"))
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
46 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.0623,267392,1,0,564897,4660,5251,672412,756,15591,1405512
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((("(i11.i1.u45.p113==1)")U("(i10.i0.u56.p193==1)"))U(G(!(X(X(G(X("(i7.u27.p77==1)")))))))))
Formula 3 simplified : !(("(i11.i1.u45.p113==1)" U "(i10.i0.u56.p193==1)") U G!XXGX"(i7.u27.p77==1)")
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.1228,269176,1,0,569299,4660,5304,677460,756,15591,1415989
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X((!(G(F((!(F(G("((i3.i1.u8.p25==1)&&(u44.p160==1))"))))||(!(F("(i11.i0.u33.p94==1)")))))))U(X("((i2.u5.p16==1)&&(i14.u54.p189==1))"))))))
Formula 4 simplified : !GX(!GF(!FG"((i3.i1.u8.p25==1)&&(u44.p160==1))" | !F"(i11.i0.u33.p94==1)") U X"((i2.u5.p16==1)&&(i14.u54.p189==1))")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.1823,270476,1,0,571600,4660,5365,680987,756,15591,1422418
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(X(!(G((F("(i14.u49.p167==1)"))||("(i5.i1.u23.p64!=1)")))))))
Formula 5 simplified : !XX!G("(i5.i1.u23.p64!=1)" | F"(i14.u49.p167==1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
355 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.7373,356848,1,0,771014,4660,5431,919605,756,15648,1854596
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((!(("(i11.i0.u35.p104==1)")U("(i0.u29.p83==1)")))U(G("((i11.i0.u35.p104==1)&&(i0.u29.p83==1))"))))
Formula 6 simplified : !(!("(i11.i0.u35.p104==1)" U "(i0.u29.p83==1)") U G"((i11.i0.u35.p104==1)&&(i0.u29.p83==1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
65 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.3847,375852,1,0,817858,4664,5531,970145,760,15730,1966067
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(F((F("(i5.i1.u31.p89==1)"))||("(i14.u54.p178==1)")))))
Formula 7 simplified : F("(i14.u54.p178==1)" | F"(i5.i1.u31.p89==1)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
164 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,16.019,409116,1,0,899410,4664,5554,1.05798e+06,760,15734,2130444
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(X((!(F("(i2.u5.p18==1)")))||("(i14.u52.p182!=1)")))))
Formula 8 simplified : !XX("(i14.u52.p182!=1)" | !F"(i2.u5.p18==1)")
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,16.0206,409380,1,0,899410,4664,5565,1.05798e+06,760,15734,2130476
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA UtahNoC-PT-none-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((("(i14.u55.p163==1)")U((X("(i11.i0.u33.p96==1)"))||("(i11.i0.u33.p96==1)"))))
Formula 9 simplified : !("(i14.u55.p163==1)" U ("(i11.i0.u33.p96==1)" | X"(i11.i0.u33.p96==1)"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,16.0226,409380,1,0,899428,4664,5580,1.05801e+06,760,15734,2130632
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((("((i11.i0.u33.p95==1)&&(u44.p160==1))")U(!(X("(i13.u11.p34==1)")))))
Formula 10 simplified : !("((i11.i0.u33.p95==1)&&(u44.p160==1))" U !X"(i13.u11.p34==1)")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,16.0235,409380,1,0,899428,4664,5590,1.05801e+06,760,15734,2130649
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA UtahNoC-PT-none-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((F(((F("((i2.u4.p15==1)&&(u44.p160==1))"))||("(i11.i1.u45.p113==1)"))U("((i5.i1.u19.p88==1)&&(i0.u60.p210==1))")))U(G("(i11.i1.u45.p111==1)"))))
Formula 11 simplified : !(F(("(i11.i1.u45.p113==1)" | F"((i2.u4.p15==1)&&(u44.p160==1))") U "((i5.i1.u19.p88==1)&&(i0.u60.p210==1))") U G"(i11.i1.u45.p111==1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,16.0651,409640,1,0,900485,4777,5616,1.05975e+06,760,16163,2133711
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((G("(i14.u49.p167==1)"))||(G(X((F("(i9.u51.p121==1)"))||(G((((G("(i9.u51.p121==1)"))&&("(i7.u26.p72==1)"))&&("(i0.u29.p85==1)"))&&("(u61.p212==1)"))))))))
Formula 12 simplified : !(G"(i14.u49.p167==1)" | GX(F"(i9.u51.p121==1)" | G("(i0.u29.p85==1)" & "(i7.u26.p72==1)" & "(u61.p212==1)" & G"(i9.u51.p121==1)")))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,16.0691,409904,1,0,900537,4777,5639,1.05989e+06,760,16191,2133927
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(("(((i4.u14.p41!=1)||(i14.u54.p189!=1))&&((i7.u27.p77!=1)||(i7.u53.p186!=1)))")U(((((G(((X("((i0.u29.p85==1)&&(i0.u60.p210==1))"))&&("(i7.u27.p77==1)"))&&("(i7.u53.p186==1)")))&&("(i3.i1.u7.p21==1)"))&&("(i14.u54.p189==1)"))&&("(i2.u4.p15==1)"))&&("(u44.p160==1)")))))
Formula 13 simplified : !G("(((i4.u14.p41!=1)||(i14.u54.p189!=1))&&((i7.u27.p77!=1)||(i7.u53.p186!=1)))" U ("(i2.u4.p15==1)" & "(i3.i1.u7.p21==1)" & "(i14.u54.p189==1)" & "(u44.p160==1)" & G("(i7.u27.p77==1)" & "(i7.u53.p186==1)" & X"((i0.u29.p85==1)&&(i0.u60.p210==1))")))
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
674 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,22.8492,603532,1,0,1.3427e+06,4799,5761,1.58158e+06,760,16521,3015932
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((X(!(("(i10.i1.u58.p203==1)")U(G("(i10.i1.u58.p203==1)")))))U(X("(i10.i1.u58.p203==1)"))))
Formula 14 simplified : !(X!("(i10.i1.u58.p203==1)" U G"(i10.i1.u58.p203==1)") U X"(i10.i1.u58.p203==1)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
41 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,23.2609,613564,1,0,1.36914e+06,4801,5791,1.60695e+06,760,16542,3072909
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-27 00:12:34] [WARNING] Script execution failed on command (assert (and (and (>= (select s0 21) 1) (>= (select s0 160) 1)) (= (store (store s0 144 (+ (select s0 144) 1)) 160 (- (select s0 160) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (>= (select s0 21) 1) (>= (select s0 160) 1)) (= (store (store s0 144 (+ (select s0 144) 1)) 160 (- (select s0 160) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-27 00:12:34] [INFO ] Built C files in 31063ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590538355562

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtahNoC-PT-none"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is UtahNoC-PT-none, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r193-csrt-159033389000594"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;