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 208K
-rw-r--r-- 1 mcc users 3.6K May 30 21:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 30 21:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 15:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 15:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 28 09:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.5K May 28 09:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 28 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.7K May 28 06:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 28 06:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 27 03:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 27 03:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 33K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is DoubleExponent-PT-002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-csrt-152749175900195
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527986767607

Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph3690121036851080064.txt, -o, /tmp/graph3690121036851080064.bin, -w, /tmp/graph3690121036851080064.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph3690121036851080064.bin, -l, -1, -v, -w, /tmp/graph3690121036851080064.weights, -q, 0, -e, 0.001], workingDir=null]
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("((i6.u12.p24>=1)&&(i1.u4.p42>=1))"))U(X("(i2.u1.p100>=1)")))U((G("(i1.u20.p41>=1)"))U(X("((i0.u33.p71>=1)&&(i4.u28.p89>=1))")))))
Formula 0 simplified : !((F"((i6.u12.p24>=1)&&(i1.u4.p42>=1))" U X"(i2.u1.p100>=1)") U (G"(i1.u20.p41>=1)" U X"((i0.u33.p71>=1)&&(i4.u28.p89>=1))"))
built 31 ordering constraints for composite.
built 23 ordering constraints for composite.
built 22 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 14 ordering constraints for composite.
built 14 ordering constraints for composite.
built 4 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 98 rows 110 cols
invariant :-1'i0:u2:p104 + i0:u17:p36 + i0:u17:p37 + i1:u15:p30 + i2:u7:p32 + i2:u13:p26 + i2:u13:p27 + i2:u13:p28 + i2:u13:p31 + i2:u13:p35 + i2:u14:p29 + i2:u16:p33 + i2:u16:p34 + -1'i6:u10:p22 = 0
invariant :i0:u31:p69 + -1'i0:u38:p83 + -1'i0:u38:p84 + -1'i5:u25:p76 + -1'i5:u34:p73 + -1'i5:u34:p74 + -1'i5:u34:p75 + -1'i5:u35:p77 + -1'i5:u36:p79 + -1'i5:u36:p80 + -1'i5:u36:p81 + -1'i5:u37:p78 + -1'i5:u37:p82 = 0
invariant :i0:u2:p103 + i0:u2:p104 + i0:u3:p105 + i0:u23:p48 + i0:u23:p49 + i0:u38:p107 + -1'i0:u38:p83 + -1'i0:u44:p95 + -2'i1:u0:p1 + -2'i1:u0:p2 + -1'i1:u0:p3 + -1'i1:u18:p4 + -1'i1:u18:p5 + i1:u20:p41 + i1:u4:p42 + i1:u4:p97 + i1:u15:p99 + i1:u41:p98 + i2:u1:p101 + -1'i2:u7:p11 + -1'i2:u7:p32 + -1'i2:u8:p17 + -1'i2:u14:p10 + -1'i2:u14:p29 + i3:u19:p38 + i3:u19:p39 + i3:u19:p40 + i3:u21:p44 + i3:u21:p45 + i3:u21:p46 + i3:u22:p43 + i3:u22:p47 + i6:u27:p102 + -1'i6:u12:p24 = -2
invariant :i0:u33:p71 + -1'i0:u44:p95 + -1'i0:u44:p96 + -1'i4:u28:p89 + -1'i4:u40:p88 + -1'i4:u39:p85 + -1'i4:u39:p86 + -1'i4:u39:p87 + -1'i4:u42:p90 + -1'i4:u42:p94 + -1'i4:u43:p91 + -1'i4:u43:p92 + i5:u25:p56 + i5:u25:p76 + i5:u29:p59 + i5:u29:p64 + i5:u36:p79 + i5:u36:p81 + -1'i6:u9:p20 + -1'i6:u9:p57 + -1'i6:u27:p102 + -1'i6:u27:p60 = 0
invariant :2'i1:u0:p1 + 2'i1:u0:p2 + i1:u0:p3 + i1:u18:p4 + i1:u18:p5 + i2:u1:p100 + i2:u7:p11 + i2:u7:p32 + i2:u8:p17 + i2:u14:p10 + i2:u14:p29 = 2
invariant :i0:u2:p103 + i0:u2:p104 + i0:u3:p105 + i0:u3:p106 + i0:u38:p107 + -1'i0:u38:p83 + -1'i0:u44:p95 + -2'i1:u0:p1 + -2'i1:u0:p2 + -1'i1:u0:p3 + -1'i1:u18:p4 + -1'i1:u18:p5 + i1:u4:p97 + i1:u15:p99 + i1:u41:p98 + i2:u1:p101 + -1'i2:u7:p11 + -1'i2:u7:p32 + -1'i2:u8:p17 + -1'i2:u14:p10 + -1'i2:u14:p29 + i6:u27:p102 = -2
invariant :i7:u5:p108 + -1'i7:u6:p66 + -1'i7:u30:p110 + -1'i7:u30:p67 = 0
invariant :-1'i0:u17:p36 + -1'i0:u23:p48 + i0:u23:p54 + i3:u22:p50 + i3:u24:p51 + i3:u24:p52 + i3:u24:p53 = 0
invariant :2'i1:u0:p1 + i1:u0:p2 + i1:u0:p3 + i1:u18:p4 + i1:u20:p41 + i1:u20:p8 + i1:u11:p15 + i1:u41:p9 + i1:u41:p98 + i3:u21:p44 = 2
invariant :2'i1:u0:p1 + 2'i1:u0:p2 + 2'i1:u0:p3 + i1:u18:p4 + i1:u18:p5 + i1:u18:p6 + -1'i2:u16:p34 + -1'i3:u21:p46 + i3:u24:p12 + i3:u24:p13 + i3:u24:p51 + i3:u24:p53 = 2
invariant :i0:u31:p70 + i0:u33:p72 + i0:u38:p83 + i0:u38:p84 + i0:u44:p95 + i0:u44:p96 + i1:u0:p1 + i1:u0:p2 + i1:u0:p3 + i1:u18:p4 + i1:u18:p5 + i1:u18:p6 + i1:u32:p14 + i1:u32:p7 + i1:u11:p15 + i1:u11:p16 + i2:u8:p17 + i2:u8:p18 + i2:u8:p19 + i4:u26:p62 + i4:u28:p25 + i4:u28:p61 + i4:u28:p89 + i4:u40:p88 + i4:u39:p85 + i4:u39:p86 + i4:u39:p87 + i4:u42:p90 + i4:u42:p94 + i4:u43:p91 + i4:u43:p92 + -1'i5:u25:p56 + -1'i5:u29:p59 + i5:u34:p73 + i5:u34:p74 + i5:u34:p75 + i5:u35:p63 + i5:u35:p77 + i5:u36:p80 + i5:u37:p78 + i5:u37:p82 + 2'i6:u9:p20 + i6:u9:p57 + i6:u27:p102 + i6:u27:p60 + i6:u10:p21 + i6:u10:p22 + i6:u12:p23 + i6:u12:p24 + i7:u5:p65 + i7:u6:p66 + i7:u30:p67 + i7:u30:p68 = 1
invariant :i7:u6:p109 + -1'i7:u30:p110 + -1'i7:u30:p67 = 0
invariant :i4:u43:p93 + i5:u25:p56 + i5:u25:p76 + i5:u29:p59 + i5:u29:p64 + i5:u36:p79 + i5:u36:p81 + -1'i6:u9:p20 + -1'i6:u9:p57 + -1'i6:u27:p102 + -1'i6:u27:p60 = 0
invariant :-1'i2:u8:p19 + i4:u26:p58 + i4:u26:p62 + i4:u40:p55 + i4:u40:p88 + i4:u43:p91 + -1'i5:u25:p56 + -1'i5:u25:p76 + -1'i5:u29:p59 + -1'i5:u29:p64 + -1'i5:u36:p79 = 0
Reverse transition relation is NOT exact ! Due to transitions t16, t19, t37, t51, t58, t61, t67, t73, t79, t85, t88, t9, t94, t97, i1.u32.t7, i2.u13.t25, i2.u13.t30, i3.u22.t42, i4.u28.t49, i4.u42.t84, i5.u37.t72, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/77/21/98
Computing Next relation with stutter on 396 deadlock states
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,0.46057,31832,1,0,23337,1037,1492,34216,266,5398,103874
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((F(F(G("(i4.u42.p94>=1)"))))U(F("(i3.u22.p47>=1)"))))
Formula 1 simplified : !(FG"(i4.u42.p94>=1)" U F"(i3.u22.p47>=1)")
Computing Next relation with stutter on 396 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
7 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.542341,33152,1,0,27371,1042,1607,37990,266,5461,119361
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F(F("(i5.u37.p82>=1)")))))
Formula 2 simplified : !GF"(i5.u37.p82>=1)"
Computing Next relation with stutter on 396 deadlock states
888 unique states visited
888 strongly connected components in search stack
889 transitions explored
888 items max in DFS search stack
197 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.50609,79616,1,0,101840,1278,1664,114087,270,7621,377557
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((X(G(X("(i5.u36.p79>=1)"))))U(F(G("((i0.u33.p71>=1)&&(i0.u44.p96>=1))")))))
Formula 3 simplified : !(XGX"(i5.u36.p79>=1)" U FG"((i0.u33.p71>=1)&&(i0.u44.p96>=1))")
Computing Next relation with stutter on 396 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
135 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,3.86208,113144,1,0,152560,1309,1693,161808,270,7698,547450
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(X(G(G("(i1.u18.p6>=1)"))))))
Formula 4 simplified : !FXG"(i1.u18.p6>=1)"
Computing Next relation with stutter on 396 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
48 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,4.33973,120800,1,0,156830,1309,1719,168208,271,7698,588453
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("(i5.u25.p76>=1)"))
Formula 5 simplified : !"(i5.u25.p76>=1)"
Computing Next relation with stutter on 396 deadlock states
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,4.35487,121064,1,0,156941,1309,1726,168495,271,7698,589119
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(F(X(X(G("((i6.u10.p22>=1)&&(i1.u15.p30>=1))")))))))
Formula 6 simplified : !XFXXG"((i6.u10.p22>=1)&&(i1.u15.p30>=1))"
Computing Next relation with stutter on 396 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
45 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,4.79623,128984,1,0,163280,1309,1752,175164,271,7698,622247
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("(i3.u24.p53>=1)"))
Formula 7 simplified : !"(i3.u24.p53>=1)"
Computing Next relation with stutter on 396 deadlock states
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,4.79675,128984,1,0,163280,1309,1759,175164,272,7698,622255
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F((X(G("(i2.u16.p33>=1)")))U(G(X("(i7.u30.p68>=1)"))))))
Formula 8 simplified : !F(XG"(i2.u16.p33>=1)" U GX"(i7.u30.p68>=1)")
Computing Next relation with stutter on 396 deadlock states
887 unique states visited
886 strongly connected components in search stack
888 transitions explored
887 items max in DFS search stack
36 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,5.15884,132152,1,0,164712,1309,1770,180308,272,7714,633101
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((X("((i3.u21.p46>=1)&&(i3.u24.p13>=1))"))U(X(X("((i3.u21.p46>=1)&&(i3.u24.p13>=1))")))))
Formula 9 simplified : !(X"((i3.u21.p46>=1)&&(i3.u24.p13>=1))" U XX"((i3.u21.p46>=1)&&(i3.u24.p13>=1))")
Computing Next relation with stutter on 396 deadlock states
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,5.18613,132416,1,0,164817,1309,1783,180581,272,7714,633735
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(G(G(F("((i0.u23.p48>=1)&&(i0.u23.p54>=1))"))))))
Formula 10 simplified : !GF"((i0.u23.p48>=1)&&(i0.u23.p54>=1))"
Computing Next relation with stutter on 396 deadlock states
888 unique states visited
888 strongly connected components in search stack
889 transitions explored
888 items max in DFS search stack
57 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,5.74641,145880,1,0,181557,1309,1824,192077,275,7714,685400
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(X(X(G(F("(i4.u39.p86>=1)")))))))
Formula 11 simplified : !GXXGF"(i4.u39.p86>=1)"
Computing Next relation with stutter on 396 deadlock states
888 unique states visited
888 strongly connected components in search stack
889 transitions explored
888 items max in DFS search stack
45 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,6.20536,156440,1,0,193755,1310,1854,201277,275,7715,723772
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(F("((i2.u14.p10>=1)&&(i1.u11.p16>=1))"))))
Formula 12 simplified : !GF"((i2.u14.p10>=1)&&(i1.u11.p16>=1))"
Computing Next relation with stutter on 396 deadlock states
888 unique states visited
888 strongly connected components in search stack
889 transitions explored
888 items max in DFS search stack
12 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,6.31495,158288,1,0,194776,1310,1890,202014,275,7715,735917
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(F(("(i2.u13.p26>=1)")U("(i4.u39.p85>=1)")))))
Formula 13 simplified : !XF("(i2.u13.p26>=1)" U "(i4.u39.p85>=1)")
Computing Next relation with stutter on 396 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
7 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,6.38552,160136,1,0,198456,1310,1905,204732,275,7715,748765
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F((X(F("(i6.u9.p20>=1)")))U(("(i1.u41.p98>=1)")U("(i3.u21.p45>=1)")))))
Formula 14 simplified : !F(XF"(i6.u9.p20>=1)" U ("(i1.u41.p98>=1)" U "(i3.u21.p45>=1)"))
Computing Next relation with stutter on 396 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,6.417,160664,1,0,199746,1310,1920,205768,275,7715,754059
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G(("(i3.u24.p53>=1)")U("(i2.u16.p33>=1)"))))
Formula 15 simplified : !G("(i3.u24.p53>=1)" U "(i2.u16.p33>=1)")
Computing Next relation with stutter on 396 deadlock states
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,6.41856,160928,1,0,199746,1310,1948,205768,275,7715,754091
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-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 1527986778618

--------------------
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 03, 2018 12:46:09 AM 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 03, 2018 12:46:09 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 03, 2018 12:46:09 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 52 ms
Jun 03, 2018 12:46:09 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 110 places.
Jun 03, 2018 12:46:10 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 98 transitions.
Jun 03, 2018 12:46:10 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 12 ms
Jun 03, 2018 12:46:10 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 03, 2018 12:46:10 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 89 ms
Jun 03, 2018 12:46:10 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 21 ms
Begin: Sun Jun 3 00:46:10 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sun Jun 3 00:46:10 2018
network size: 110 nodes, 348 links, 196 weight
quality increased from -0.0102171 to 0.412497
end computation: Sun Jun 3 00:46:10 2018
level 1:
start computation: Sun Jun 3 00:46:10 2018
network size: 45 nodes, 251 links, 196 weight
quality increased from 0.412497 to 0.597577
end computation: Sun Jun 3 00:46:10 2018
level 2:
start computation: Sun Jun 3 00:46:10 2018
network size: 14 nodes, 94 links, 196 weight
quality increased from 0.597577 to 0.620262
end computation: Sun Jun 3 00:46:10 2018
level 3:
start computation: Sun Jun 3 00:46:10 2018
network size: 8 nodes, 50 links, 196 weight
quality increased from 0.620262 to 0.620262
end computation: Sun Jun 3 00:46:10 2018
End: Sun Jun 3 00:46:10 2018
Total duration: 0 sec
0.620262
Jun 03, 2018 12:46:10 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 03, 2018 12:46:10 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 23 ms
Jun 03, 2018 12:46:10 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 03, 2018 12:46:10 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 23 redundant transitions.
Jun 03, 2018 12:46:10 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 14 ms
Jun 03, 2018 12:46:10 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 03, 2018 12:46:11 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 98 transitions.
Jun 03, 2018 12:46:11 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 14 place invariants in 31 ms
Jun 03, 2018 12:46:11 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 110 variables to be positive in 286 ms
Jun 03, 2018 12:46:11 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 98 transitions.
Jun 03, 2018 12:46:11 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/98 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 03, 2018 12:46:11 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 03, 2018 12:46:11 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 98 transitions.
Jun 03, 2018 12:46:11 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 03, 2018 12:46:12 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 98 transitions.
Jun 03, 2018 12:46:14 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(19/98) took 2157 ms. Total solver calls (SAT/UNSAT): 1097(1014/83)
Jun 03, 2018 12:46:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(48/98) took 5195 ms. Total solver calls (SAT/UNSAT): 1944(1760/184)
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.computeCoEnablingMatrix(NecessaryEnablingsolver.java:480)
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 03, 2018 12:46:18 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 7218ms 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="DoubleExponent-PT-002"
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/DoubleExponent-PT-002.tgz
mv DoubleExponent-PT-002 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 DoubleExponent-PT-002, 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 r285-csrt-152749175900195"
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 ;