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 248K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 11K 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.8K 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.7K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K 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 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 89K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is Raft-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-qhx2-152732140900078
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528318260673

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.201805241334/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.201805241334/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 : !((((F("((u31.p155>=1)&&(u21.p102>=1))"))U(F("((u33.p165>=1)&&(u14.p70>=1))")))U(G(X(X("((u33.p165>=1)&&(u7.p34>=1))"))))))
Formula 0 simplified : !((F"((u31.p155>=1)&&(u21.p102>=1))" U F"((u33.p165>=1)&&(u14.p70>=1))") U GXX"((u33.p165>=1)&&(u7.p34>=1))")
built 74 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t331, u31.t35, u31.t36, u31.t37, u31.t38, u31.t40, u32.t29, u32.t30, u32.t31, u32.t32, u32.t34, u33.t23, u33.t24, u33.t25, u33.t26, u33.t28, u34.t17, u34.t18, u34.t19, u34.t20, u34.t22, u35.t11, u35.t12, u35.t13, u35.t14, u35.t16, u36.t5, u36.t6, u36.t7, u36.t8, u36.t10, u38.t329, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :26/280/26/332
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
55 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,0.754583,28852,1,0,21032,261,3049,27938,203,914,58321
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((((G("(u35.p174>=1)"))U("(u32.p157>=1)"))U(G(("((u35.p175>=1)&&(u23.p115>=1))")U("(u38.p186>=1)")))))
Formula 1 simplified : !((G"(u35.p174>=1)" U "(u32.p157>=1)") U G("((u35.p175>=1)&&(u23.p115>=1))" U "(u38.p186>=1)"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,0.786415,29520,1,0,21037,261,3167,27943,209,915,58528
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G("((u33.p165>=1)&&(u15.p75>=1))")))
Formula 2 simplified : !G"((u33.p165>=1)&&(u15.p75>=1))"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3 ticks for the emptiness check
Normalized transition count is 280
// Phase 1: matrix 280 rows 188 cols
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,0.814698,29520,1,0,21037,261,3188,27943,209,915,58569
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((("(u33.p164>=1)")U(X(G(F("((u33.p165>=1)&&(u37.p183>=1))"))))))
Formula 3 simplified : !("(u33.p164>=1)" U XGF"((u33.p165>=1)&&(u37.p183>=1))")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
5 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,0.862125,30048,1,0,22743,261,3218,31400,209,959,61471
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((X(G(F("((u36.p180>=1)&&(u10.p47>=1))"))))U(F(X(X("((u34.p170>=1)&&(u18.p90>=1))"))))))
Formula 4 simplified : !(XGF"((u36.p180>=1)&&(u10.p47>=1))" U FXX"((u34.p170>=1)&&(u18.p90>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
10 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,0.95264,32952,1,0,28632,261,3279,40185,209,993,76704
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(F(X(F(G("((u36.p180>=1)&&(u30.p150>=1))")))))))
Formula 5 simplified : !GFXFG"((u36.p180>=1)&&(u30.p150>=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,0.960236,33216,1,0,28699,261,3320,40239,209,993,76884
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(G(X(G("((u31.p155>=1)&&(u11.p51>=1))"))))))
Formula 6 simplified : !FGXG"((u31.p155>=1)&&(u11.p51>=1))"
invariant :u14:p66 + u14:p67 + u14:p68 + u14:p69 + u14:p70 + u39:p0 = 1
invariant :u13:p61 + u13:p62 + u13:p63 + u13:p64 + u13:p65 + u39:p0 = 1
invariant :u25:p121 + u25:p122 + u25:p123 + u25:p124 + u25:p125 + u39:p0 = 1
invariant :u4:p16 + u4:p17 + u4:p18 + u4:p19 + u4:p20 + u39:p0 = 1
invariant :u36:p176 + u36:p177 + u36:p178 + u36:p179 + u36:p180 + u39:p0 = 1
invariant :u30:p146 + u30:p147 + u30:p148 + u30:p149 + u30:p150 + u39:p0 = 1
invariant :u10:p46 + u10:p47 + u10:p48 + u10:p49 + u10:p50 + u39:p0 = 1
invariant :u8:p36 + u8:p37 + u8:p38 + u8:p39 + u8:p40 + u39:p0 = 1
invariant :u2:p6 + u2:p7 + u2:p8 + u2:p9 + u2:p10 + u39:p0 = 1
invariant :u24:p116 + u24:p117 + u24:p118 + u24:p119 + u24:p120 + u39:p0 = 1
invariant :u9:p41 + u9:p42 + u9:p43 + u9:p44 + u9:p45 + u39:p0 = 1
invariant :u26:p126 + u26:p127 + u26:p128 + u26:p129 + u26:p130 + u39:p0 = 1
invariant :u1:p1 + u1:p2 + u1:p3 + u1:p4 + u1:p5 + u39:p0 = 1
invariant :u7:p31 + u7:p32 + u7:p33 + u7:p34 + u7:p35 + u39:p0 = 1
invariant :u27:p131 + u27:p132 + u27:p133 + u27:p134 + u27:p135 + u39:p0 = 1
invariant :u21:p101 + u21:p102 + u21:p103 + u21:p104 + u21:p105 + u39:p0 = 1
invariant :u5:p21 + u5:p22 + u5:p23 + u5:p24 + u5:p25 + u39:p0 = 1
invariant :u28:p136 + u28:p137 + u28:p138 + u28:p139 + u28:p140 + u39:p0 = 1
invariant :u31:p151 + u31:p152 + u31:p153 + u31:p154 + u31:p155 + u39:p0 = 1
invariant :u18:p86 + u18:p87 + u18:p88 + u18:p89 + u18:p90 + u39:p0 = 1
invariant :u17:p81 + u17:p82 + u17:p83 + u17:p84 + u17:p85 + u39:p0 = 1
invariant :u34:p166 + u34:p167 + u34:p168 + u34:p169 + u34:p170 + u39:p0 = 1
invariant :u15:p71 + u15:p72 + u15:p73 + u15:p74 + u15:p75 + u39:p0 = 1
invariant :u35:p171 + u35:p172 + u35:p173 + u35:p174 + u35:p175 + u39:p0 = 1
invariant :u23:p111 + u23:p112 + u23:p113 + u23:p114 + u23:p115 + u39:p0 = 1
invariant :u6:p26 + u6:p27 + u6:p28 + u6:p29 + u6:p30 + u39:p0 = 1
invariant :u29:p141 + u29:p142 + u29:p143 + u29:p144 + u29:p145 + u39:p0 = 1
invariant :u32:p156 + u32:p157 + u32:p158 + u32:p159 + u32:p160 + u39:p0 = 1
invariant :u20:p96 + u20:p97 + u20:p98 + u20:p99 + u20:p100 + u39:p0 = 1
invariant :u16:p76 + u16:p77 + u16:p78 + u16:p79 + u16:p80 + u39:p0 = 1
invariant :u11:p51 + u11:p52 + u11:p53 + u11:p54 + u11:p55 + u39:p0 = 1
invariant :u22:p106 + u22:p107 + u22:p108 + u22:p109 + u22:p110 + u39:p0 = 1
invariant :u33:p161 + u33:p162 + u33:p163 + u33:p164 + u33:p165 + u39:p0 = 1
invariant :u19:p91 + u19:p92 + u19:p93 + u19:p94 + u19:p95 + u39:p0 = 1
invariant :u12:p56 + u12:p57 + u12:p58 + u12:p59 + u12:p60 + u39:p0 = 1
invariant :u3:p11 + u3:p12 + u3:p13 + u3:p14 + u3:p15 + u39:p0 = 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,0.98041,33480,1,0,30424,261,3325,42950,209,1008,79297
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("((u36.p180>=1)&&(u28.p140>=1))"))
Formula 7 simplified : !"((u36.p180>=1)&&(u28.p140>=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,0.981947,33744,1,0,30424,261,3330,42950,209,1008,79302
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X("((u31.p155>=1)&&(u1.p5>=1))")))
Formula 8 simplified : !X"((u31.p155>=1)&&(u1.p5>=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,0.982533,33744,1,0,30424,261,3335,42950,209,1008,79344
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Raft-PT-06-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("((u32.p160>=1)&&(u27.p134>=1))"))
Formula 9 simplified : !"((u32.p160>=1)&&(u27.p134>=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,0.982989,33744,1,0,30424,261,3340,42950,209,1008,79356
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G("((u36.p180>=1)&&(u29.p145>=1))")))
Formula 10 simplified : !G"((u36.p180>=1)&&(u29.p145>=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,0.985889,34008,1,0,30424,261,3360,42950,209,1008,79368
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(F("((u33.p165>=1)&&(u23.p113>=1))"))))
Formula 11 simplified : !GF"((u33.p165>=1)&&(u23.p113>=1))"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
3 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.01466,34272,1,0,31589,261,3400,45346,209,1039,81383
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(("((u33.p165>=1)&&(u15.p75>=1))"))
Formula 12 simplified : !"((u33.p165>=1)&&(u15.p75>=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.01774,34536,1,0,31589,261,3400,45346,209,1039,81383
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X("((u35.p175>=1)&&(u4.p17>=1))")))
Formula 13 simplified : !X"((u35.p175>=1)&&(u4.p17>=1))"
4 unique states visited
4 strongly connected components in search stack
4 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,1.04399,35064,1,0,33222,261,3405,47552,209,1039,84938
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(("(u32.p160>=1)"))
Formula 14 simplified : !"(u32.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,1.04541,35064,1,0,33222,261,3408,47552,210,1039,84968
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((F(G("((u31.p155>=1)&&(u4.p20>=1))")))U(G("(u36.p180>=1)"))))
Formula 15 simplified : !(FG"((u31.p155>=1)&&(u4.p20>=1))" U G"(u36.p180>=1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
21 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.25235,39552,1,0,42647,261,3533,62039,210,1055,107057
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Raft-PT-06-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 1528318268523

--------------------
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/ -louvain -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/ -louvain -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 06, 2018 8:51:03 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/, -louvain, -smt]
Jun 06, 2018 8:51:03 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 06, 2018 8:51:04 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 119 ms
Jun 06, 2018 8:51:04 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 188 places.
Jun 06, 2018 8:51:04 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 332 transitions.
Jun 06, 2018 8:51:04 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Jun 06, 2018 8:51:04 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 30 ms
Jun 06, 2018 8:51:04 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 06, 2018 8:51:04 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 255 ms
Jun 06, 2018 8:51:04 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 104 ms
Jun 06, 2018 8:51:05 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 06, 2018 8:51:05 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 99 ms
Jun 06, 2018 8:51:05 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 06, 2018 8:51:05 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 250 redundant transitions.
Jun 06, 2018 8:51:05 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 19 ms
Jun 06, 2018 8:51:05 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
Jun 06, 2018 8:51:06 PM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 26 identical transitions.
Jun 06, 2018 8:51:06 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 306 transitions.
Jun 06, 2018 8:51:06 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 36 place invariants in 179 ms
Jun 06, 2018 8:51:07 PM fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver checkSat
WARNING: SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:318)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:305)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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 06, 2018 8:51:07 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1501ms 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="Raft-PT-06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstoolsl"
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/Raft-PT-06.tgz
mv Raft-PT-06 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 itstoolsl"
echo " Input is Raft-PT-06, 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 r189-qhx2-152732140900078"
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 ;