fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r212-smll-152732263700738
Last Updated
June 26, 2018

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
15754.960 27914.00 58678.00 697.20 FFFFFFFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..................
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 205K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
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 r212-smll-152732263700738
=====================================================================


--------------------
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-LTLFireability-00
FORMULA_NAME UtahNoC-PT-none-LTLFireability-01
FORMULA_NAME UtahNoC-PT-none-LTLFireability-02
FORMULA_NAME UtahNoC-PT-none-LTLFireability-03
FORMULA_NAME UtahNoC-PT-none-LTLFireability-04
FORMULA_NAME UtahNoC-PT-none-LTLFireability-05
FORMULA_NAME UtahNoC-PT-none-LTLFireability-06
FORMULA_NAME UtahNoC-PT-none-LTLFireability-07
FORMULA_NAME UtahNoC-PT-none-LTLFireability-08
FORMULA_NAME UtahNoC-PT-none-LTLFireability-09
FORMULA_NAME UtahNoC-PT-none-LTLFireability-10
FORMULA_NAME UtahNoC-PT-none-LTLFireability-11
FORMULA_NAME UtahNoC-PT-none-LTLFireability-12
FORMULA_NAME UtahNoC-PT-none-LTLFireability-13
FORMULA_NAME UtahNoC-PT-none-LTLFireability-14
FORMULA_NAME UtahNoC-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1527954845650

Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/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.201805151631/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 16 LTL properties
Checking formula 0 : !(("(u5.p105>=1)"))
Formula 0 simplified : !"(u5.p105>=1)"
built 12 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 427
// Phase 1: matrix 427 rows 216 cols
invariant :u5:p91 + u5:p92 + u5:p93 + u5:p94 + u5:p95 + u5:p96 + u5:p97 + u5:p98 + u5:p99 + u5:p100 + u5:p101 + u5:p102 + u5:p103 + u5:p104 + u5:p105 + u5:p106 + u5:p107 + u5:p108 + u5:p109 + u5:p110 + u5:p111 + u5:p112 + u5:p113 + u5:p114 + u5:p115 + u5:p116 + u5:p117 + u5:p118 + u5:p119 + u5:p120 + u5:p121 + u5:p122 + u5:p123 + u5:p124 + u5:p125 + u5:p126 + u5:p127 + u5:p128 + u5:p129 + u5:p130 + u5:p131 + u5:p132 + u5:p133 + u9:p0 = 1
invariant :u2:p4 + u9:p0 = 1
invariant :u4:p48 + u4:p49 + u4:p50 + u4:p51 + u4:p52 + u4:p53 + u4:p54 + u4:p55 + u4:p56 + u4:p57 + u4:p58 + u4:p59 + u4:p60 + u4:p61 + u4:p62 + u4:p63 + u4:p64 + u4:p65 + u4:p66 + u4:p67 + u4:p68 + u4:p69 + u4:p70 + u4:p71 + u4:p72 + u4:p73 + u4:p74 + u4:p75 + u4:p76 + u4:p77 + u4:p78 + u4:p79 + u4:p80 + u4:p81 + u4:p82 + u4:p83 + u4:p84 + u4:p85 + u4:p86 + u4:p87 + u4:p88 + u4:p89 + u4:p90 + u9:p0 = 1
invariant :u1:p1 + u1:p2 + u1:p3 + u9:p0 = 1
invariant :u3:p5 + u3:p6 + u3:p7 + u3:p8 + u3:p9 + u3:p10 + u3:p11 + u3:p12 + u3:p13 + u3:p14 + u3:p15 + u3:p16 + u3:p17 + u3:p18 + u3:p19 + u3:p20 + u3:p21 + u3:p22 + u3:p23 + u3:p24 + u3:p25 + u3:p26 + u3:p27 + u3:p28 + u3:p29 + u3:p30 + u3:p31 + u3:p32 + u3:p33 + u3:p34 + u3:p35 + u3:p36 + u3:p37 + u3:p38 + u3:p39 + u3:p40 + u3:p41 + u3:p42 + u3:p43 + u3:p44 + u3:p45 + u3:p46 + u3:p47 + u9:p0 = 1
invariant :u6:p134 + u6:p135 + u6:p136 + u6:p137 + u6:p138 + u6:p139 + u6:p140 + u6:p141 + u6:p142 + u6:p143 + u6:p144 + u6:p145 + u6:p146 + u6:p147 + u6:p148 + u6:p149 + u6:p150 + u6:p151 + u6:p152 + u6:p153 + u6:p154 + u6:p155 + u6:p156 + u6:p157 + u6:p158 + u6:p159 + u6:p160 + u6:p161 + u6:p162 + u9:p0 = 1
invariant :u7:p163 + u7:p164 + u7:p165 + u7:p166 + u7:p167 + u7:p168 + u7:p169 + u7:p170 + u7:p171 + u7:p172 + u7:p173 + u7:p174 + u7:p175 + u7:p176 + u7:p177 + u7:p178 + u7:p179 + u7:p180 + u7:p181 + u7:p182 + u7:p183 + u7:p184 + u7:p185 + u7:p186 + u7:p187 + u7:p188 + u7:p189 + u7:p190 + u7:p191 + u9:p0 = 1
invariant :u8:p192 + u8:p193 + u8:p194 + u8:p195 + u8:p196 + u8:p197 + u8:p198 + u8:p199 + u8:p200 + u8:p201 + u8:p202 + u8:p203 + u8:p204 + u8:p205 + u8:p206 + u8:p207 + u8:p208 + u8:p209 + u8:p210 + u8:p211 + u8:p212 + u8:p213 + u8:p214 + u8:p215 + u9:p0 = 1
Reverse transition relation is NOT exact ! Due to transitions u3.t11, u3.t15, u3.t19, u3.t153, u3.t155, u3.t157, u4.t31, u4.t35, u4.t39, u4.t141, u4.t143, u4.t145, u5.t51, u5.t55, u5.t59, u5.t129, u5.t131, u5.t133, u6.t62, u6.t63, u6.t65, u6.t112, u6.t116, u6.t118, u7.t68, u7.t69, u7.t71, u7.t96, u7.t100, u7.t102, u8.t74, u8.t75, u8.t77, u8.t80, u8.t84, u8.t86, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :148/811/18/977
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
170 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,1.75223,48532,1,0,40667,24164,4096,67661,2746,136808,121155
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("((u3.p40>=1)&&(u8.p213>=1))"))
Formula 1 simplified : !"((u3.p40>=1)&&(u8.p213>=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,1.75309,48960,1,0,40667,24164,4101,67661,2746,136808,121161
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((F("(u5.p110>=1)"))U(F(X(X("(u6.p138>=1)"))))))
Formula 2 simplified : !(F"(u5.p110>=1)" U FXX"(u6.p138>=1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
53 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,2.2867,64120,1,0,65389,31257,4123,105103,2747,193907,163140
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((X(F("(u3.p33>=1)")))U(F(X("(u3.p42>=1)"))))))
Formula 3 simplified : !X(XF"(u3.p33>=1)" U FX"(u3.p42>=1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
43 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,2.71656,75992,1,0,86050,35466,4155,138966,2748,227686,201754
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(F(G(G(F("((u3.p17>=1)&&(u7.p189>=1))")))))))
Formula 4 simplified : !FGF"((u3.p17>=1)&&(u7.p189>=1))"
4 unique states visited
4 strongly connected components in search stack
5 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,2.73078,76584,1,0,86416,35950,4178,139548,2748,229580,202881
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("((u4.p55>=1)&&(u6.p160>=1))"))
Formula 5 simplified : !"((u4.p55>=1)&&(u6.p160>=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,2.73159,76848,1,0,86416,35950,4183,139548,2748,229580,202888
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(G(G(G("(u5.p112>=1)"))))))
Formula 6 simplified : !XG"(u5.p112>=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,2.73488,76848,1,0,86417,35950,4202,139548,2749,229580,202919
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X((X(X("(u5.p99>=1)")))U(F(G("(u3.p9>=1)"))))))
Formula 7 simplified : !X(XX"(u5.p99>=1)" U FG"(u3.p9>=1)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1501 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,17.7494,385452,1,0,451787,263519,4222,615580,2750,1.93234e+06,437128
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G((("(u5.p102>=1)")U("(u5.p130>=1)"))U(F(X("(u4.p80>=1)"))))))
Formula 8 simplified : !G(("(u5.p102>=1)" U "(u5.p130>=1)") U FX"(u4.p80>=1)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
2 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,17.7691,386644,1,0,452924,263564,4250,617362,2751,1.93294e+06,439658
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("((u5.p132>=1)&&(u6.p160>=1))"))
Formula 9 simplified : !"((u5.p132>=1)&&(u6.p160>=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,17.7698,386908,1,0,452924,263564,4254,617362,2751,1.93294e+06,439664
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(X((F("((u4.p67>=1)&&(u6.p160>=1))"))U(X("(u3.p10>=1)"))))))
Formula 10 simplified : !FX(F"((u4.p67>=1)&&(u6.p160>=1))" U X"(u3.p10>=1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
40 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,18.1679,399572,1,0,476288,268216,4271,655042,2752,1.96718e+06,481132
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(G(X(G(X("((u5.p121>=1)&&(u8.p213>=1))")))))))
Formula 11 simplified : !GXGX"((u5.p121>=1)&&(u8.p213>=1))"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,18.1721,400088,1,0,476291,268216,4291,655042,2752,1.96718e+06,481170
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F((("((u4.p83>=1)&&(u8.p213>=1))")U("(u5.p105>=1)"))U(G(F("(u8.p208>=1)"))))))
Formula 12 simplified : !F(("((u4.p83>=1)&&(u8.p213>=1))" U "(u5.p105>=1)") U GF"(u8.p208>=1)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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,18.1754,400088,1,0,476320,268251,4310,655103,2753,1.96736e+06,481238
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(X(X(("((u3.p40>=1)&&(u8.p213>=1))")U("((u4.p77>=1)&&(u7.p186>=1))"))))))
Formula 13 simplified : !GXX("((u3.p40>=1)&&(u8.p213>=1))" U "((u4.p77>=1)&&(u7.p186>=1))")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
2 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,18.2002,400572,1,0,477503,268961,4349,656630,2753,1.97149e+06,483566
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((((G("(u5.p127>=1)"))U(X("((u3.p20>=1)&&(u6.p160>=1))")))U(F("((u3.p45>=1)&&(u7.p173>=1))"))))
Formula 14 simplified : !((G"(u5.p127>=1)" U X"((u3.p20>=1)&&(u6.p160>=1))") U F"((u3.p45>=1)&&(u7.p173>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
69 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,18.8867,423348,1,0,514741,276553,4367,719765,2753,2.05876e+06,551716
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((F(X(F(G(X("(u1.p2>=1)")))))))
Formula 15 simplified : !FXFGX"(u1.p2>=1)"
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
2 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,18.9073,424112,1,0,515965,276556,4393,722164,2754,2.05882e+06,554498
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA UtahNoC-PT-none-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527954873564

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -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/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 02, 2018 3:54:08 PM fr.lip6.move.gal.application.Application start
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/, -smt]
Jun 02, 2018 3:54:08 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 3:54:08 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 154 ms
Jun 02, 2018 3:54:08 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 216 places.
Jun 02, 2018 3:54:09 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 977 transitions.
Jun 02, 2018 3:54:09 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Jun 02, 2018 3:54:09 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 38 ms
Jun 02, 2018 3:54:09 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 02, 2018 3:54:09 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 02, 2018 3:54:09 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 317 ms
Jun 02, 2018 3:54:09 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 02, 2018 3:54:10 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 728 redundant transitions.
Jun 02, 2018 3:54:10 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 12 ms
Jun 02, 2018 3:54:10 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 02, 2018 3:54:10 PM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 148 identical transitions.
Jun 02, 2018 3:54:10 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 829 transitions.
Jun 02, 2018 3:54:11 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 8 place invariants in 119 ms
Jun 02, 2018 3:54:11 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 216 variables to be positive in 925 ms
Jun 02, 2018 3:54:11 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 829 transitions.
Jun 02, 2018 3:54:11 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/829 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 3:54:12 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 131 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 3:54:12 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 829 transitions.
Jun 02, 2018 3:54:12 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 49 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 3:54:15 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 829 transitions.
Jun 02, 2018 3:54:15 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/829) took 420 ms. Total solver calls (SAT/UNSAT): 828(0/828)
Jun 02, 2018 3:54:20 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(1/829) took 5155 ms. Total solver calls (SAT/UNSAT): 1192(79/1113)
Jun 02, 2018 3:54:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(2/829) took 9496 ms. Total solver calls (SAT/UNSAT): 1555(150/1405)
Jun 02, 2018 3:54:29 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(3/829) took 13757 ms. Total solver calls (SAT/UNSAT): 1917(221/1696)
Skipping mayMatrices nes/nds SMT solver raised an exception on push().
java.lang.RuntimeException: SMT solver raised an exception on push().
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:464)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Jun 02, 2018 3:54:32 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 21878ms conformant to PINS in folder :/home/mcc/execution

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

tar xzf /home/mcc/BenchKit/INPUTS/UtahNoC-PT-none.tgz
mv UtahNoC-PT-none execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
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 r212-smll-152732263700738"
echo "====================================================================="
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
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 ;