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 200K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 346 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 18K 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:49 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 36K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is AutoFlight-PT-05a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r200-qhx1-152732197100032
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527403149160

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 : !((G(G("((u3.p7>=1)&&(u26.p67>=1))"))))
Formula 0 simplified : !G"((u3.p7>=1)&&(u26.p67>=1))"
built 48 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t119, t120, u1.t0, u1.t48, u2.t1, u2.t45, u4.t2, u4.t42, u5.t3, u5.t39, u7.t4, u7.t36, u8.t5, u8.t33, u10.t6, u10.t30, u11.t7, u11.t27, u13.t8, u13.t24, u14.t9, u14.t21, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :25/93/12/130
Computing Next relation with stutter on 10 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 105 rows 132 cols
invariant :u9:p21 + u34:p0 = 1
invariant :u26:p51 + u26:p52 + u26:p53 + u26:p54 + u26:p55 + u26:p56 + u26:p57 + u26:p58 + u26:p59 + u26:p60 + u26:p61 + u26:p62 + u26:p63 + u26:p64 + u26:p65 + u26:p66 + u26:p67 + u26:p68 + u26:p69 + u26:p70 + u26:p71 + u26:p72 + u26:p73 + u26:p74 + u26:p75 + u26:p76 + -1'u27:p99 + -1'u28:p105 + -1'u29:p111 + -1'u30:p117 + -1'u31:p123 + -1'u32:p129 + -1'u33:p131 + -6'u34:p0 = -6
invariant :u14:p32 + u14:p33 + u14:p34 + u34:p0 = 1
invariant :u32:p124 + u32:p125 + u32:p126 + u32:p127 + u32:p128 + u32:p129 + u34:p0 = 1
invariant :u4:p8 + u4:p9 + u4:p10 + u34:p0 = 1
invariant :u2:p4 + u2:p5 + u2:p6 + u34:p0 = 1
invariant :u8:p18 + u8:p19 + u8:p20 + u34:p0 = 1
invariant :u20:p42 + u20:p43 + u34:p0 = 1
invariant :u1:p1 + u1:p2 + u1:p3 + u34:p0 = 1
invariant :u25:p50 + u34:p0 = 1
invariant :u22:p45 + u22:p46 + u34:p0 = 1
invariant :u19:p41 + u34:p0 = 1
invariant :u10:p22 + u10:p23 + u10:p24 + u34:p0 = 1
invariant :u24:p48 + u24:p49 + u34:p0 = 1
invariant :u15:p35 + u34:p0 = 1
invariant :u30:p112 + u30:p113 + u30:p114 + u30:p115 + u30:p116 + u30:p117 + u34:p0 = 1
invariant :u3:p7 + u34:p0 = 1
invariant :u7:p15 + u7:p16 + u7:p17 + u34:p0 = 1
invariant :u28:p100 + u28:p101 + u28:p102 + u28:p103 + u28:p104 + u28:p105 + u34:p0 = 1
invariant :u5:p11 + u5:p12 + u5:p13 + u34:p0 = 1
invariant :u33:p130 + u33:p131 + u34:p0 = 1
invariant :u13:p29 + u13:p30 + u13:p31 + u34:p0 = 1
invariant :u29:p106 + u29:p107 + u29:p108 + u29:p109 + u29:p110 + u29:p111 + u34:p0 = 1
invariant :u31:p118 + u31:p119 + u31:p120 + u31:p121 + u31:p122 + u31:p123 + u34:p0 = 1
invariant :u27:p78 + u27:p79 + u27:p80 + u27:p81 + u27:p82 + u27:p83 + u27:p84 + u27:p85 + u27:p86 + u27:p87 + u27:p88 + u27:p89 + u27:p90 + u27:p91 + u27:p92 + u27:p93 + u27:p94 + u27:p95 + u27:p96 + u27:p97 + u27:p98 + u27:p99 + u34:p0 = 1
invariant :u23:p47 + u34:p0 = 1
invariant :u17:p38 + u34:p0 = 1
invariant :u6:p14 + u34:p0 = 1
invariant :u26:p77 + u27:p99 + u28:p105 + u29:p111 + u30:p117 + u31:p123 + u32:p129 + u33:p131 + 7'u34:p0 = 7
invariant :u11:p25 + u11:p26 + u11:p27 + u34:p0 = 1
invariant :u12:p28 + u34:p0 = 1
invariant :u21:p44 + u34:p0 = 1
invariant :u18:p39 + u18:p40 + u34:p0 = 1
invariant :u16:p36 + u16:p37 + u34:p0 = 1
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
49 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.631233,25592,1,0,15114,2324,1412,28460,628,6375,63334
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("((u6.p14>=1)&&(u27.p90>=1))"))
Formula 1 simplified : !"((u6.p14>=1)&&(u27.p90>=1))"
Computing Next relation with stutter on 10 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,0.634858,25904,1,0,15114,2324,1418,28460,628,6375,63367
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((((F("((u32.p124>=1)&&(u33.p131>=1))"))U(G("((u14.p34>=1)&&(u32.p126>=1))")))U((G("(u11.p27>=1)"))U(X("(u14.p33>=1)")))))
Formula 2 simplified : !((F"((u32.p124>=1)&&(u33.p131>=1))" U G"((u14.p34>=1)&&(u32.p126>=1))") U (G"(u11.p27>=1)" U X"(u14.p33>=1)"))
Computing Next relation with stutter on 10 deadlock states
6 unique states visited
4 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
8 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.738511,30172,1,0,19472,2330,1539,36976,632,6469,76879
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G("((u14.p32>=1)&&(u27.p98>=1))")))
Formula 3 simplified : !G"((u14.p32>=1)&&(u27.p98>=1))"
Computing Next relation with stutter on 10 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,0.741942,30436,1,0,19472,2330,1562,36976,632,6469,76915
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(G(("(u20.p43>=1)")U(G("(u5.p12>=1)"))))))
Formula 4 simplified : !G("(u20.p43>=1)" U G"(u5.p12>=1)")
Computing Next relation with stutter on 10 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,0.744428,30700,1,0,19472,2330,1594,36976,632,6469,76999
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G((X(G("((u2.p6>=1)&&(u28.p102>=1))")))U(G(F("(u1.p2>=1)"))))))
Formula 5 simplified : !G(XG"((u2.p6>=1)&&(u28.p102>=1))" U GF"(u1.p2>=1)")
Computing Next relation with stutter on 10 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
13 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.88231,34396,1,0,28734,2331,1653,49764,632,6545,94164
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X(G(G(X("((u6.p14>=1)&&(u27.p90>=1))")))))))
Formula 6 simplified : !FXGX"((u6.p14>=1)&&(u27.p90>=1))"
Computing Next relation with stutter on 10 deadlock states
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 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,0.9409,35452,1,0,30560,2845,1734,54308,632,8540,97235
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X("((u15.p35>=1)&&(u27.p93>=1))")))
Formula 7 simplified : !X"((u15.p35>=1)&&(u27.p93>=1))"
Computing Next relation with stutter on 10 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,1.00908,37036,1,0,33573,2845,1740,59079,632,8542,106446
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((X(G("((u1.p3>=1)&&(u28.p101>=1))")))U(F(X("(u20.p43>=1)"))))))
Formula 8 simplified : !X(XG"((u1.p3>=1)&&(u28.p101>=1))" U FX"(u20.p43>=1)")
Computing Next relation with stutter on 10 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 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.03649,37828,1,0,35396,2845,1766,61576,632,8546,111356
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(G(G(("((u14.p32>=1)&&(u27.p98>=1))")U("(u26.p58>=1)"))))))
Formula 9 simplified : !XG("((u14.p32>=1)&&(u27.p98>=1))" U "(u26.p58>=1)")
Computing Next relation with stutter on 10 deadlock states
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,1.04325,38092,1,0,35396,2845,1797,61576,633,8546,111455
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F((F(X("((u1.p1>=1)&&(u26.p72>=1))")))U("((u4.p10>=1)&&(u29.p107>=1))"))))
Formula 10 simplified : !F(FX"((u1.p1>=1)&&(u26.p72>=1))" U "((u4.p10>=1)&&(u29.p107>=1))")
Computing Next relation with stutter on 10 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,1.09667,39412,1,0,38959,2845,1860,67049,633,8565,121002
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((X(("(u27.p88>=1)")U("(u4.p9>=1)")))U(G("((u26.p51>=1)&&(u33.p131>=1))"))))
Formula 11 simplified : !(X("(u27.p88>=1)" U "(u4.p9>=1)") U G"((u26.p51>=1)&&(u33.p131>=1))")
Computing Next relation with stutter on 10 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,1.11544,39676,1,0,39369,2850,1931,67660,633,8612,123285
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((G("(u13.p30>=1)"))U(G("((u23.p47>=1)&&(u31.p122>=1))"))))
Formula 12 simplified : !(G"(u13.p30>=1)" U G"((u23.p47>=1)&&(u31.p122>=1))")
Computing Next relation with stutter on 10 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,1.12203,39940,1,0,39369,2850,1973,67660,633,8612,123335
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((((X("((u1.p1>=1)&&(u26.p72>=1))"))U("(u7.p16>=1)"))U((G("((u13.p29>=1)&&(u26.p76>=1))"))U("((u32.p124>=1)&&(u33.p131>=1))"))))
Formula 13 simplified : !((X"((u1.p1>=1)&&(u26.p72>=1))" U "(u7.p16>=1)") U (G"((u13.p29>=1)&&(u26.p76>=1))" U "((u32.p124>=1)&&(u33.p131>=1))"))
Computing Next relation with stutter on 10 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 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,1.13135,39940,1,0,39369,2850,2057,67660,633,8612,123542
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G(X("((u26.p51>=1)&&(u33.p131>=1))"))))
Formula 14 simplified : !GX"((u26.p51>=1)&&(u33.p131>=1))"
Computing Next relation with stutter on 10 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 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,1.13341,39940,1,0,39369,2850,2057,67660,633,8612,123559
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((F((F(G("((u10.p24>=1)&&(u31.p119>=1))")))U(F(G("(u26.p63>=1)"))))))
Formula 15 simplified : !F(FG"((u10.p24>=1)&&(u31.p119>=1))" U FG"(u26.p63>=1)")
Computing Next relation with stutter on 10 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
239 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.52656,89572,1,0,151444,6154,2081,232082,634,27670,317951
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-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 1527403159234

--------------------
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
May 27, 2018 6:39:12 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/, -smt]
May 27, 2018 6:39:12 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 27, 2018 6:39:12 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 73 ms
May 27, 2018 6:39:12 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 132 places.
May 27, 2018 6:39:12 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 130 transitions.
May 27, 2018 6:39:12 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
May 27, 2018 6:39:12 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 16 ms
May 27, 2018 6:39:12 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 27, 2018 6:39:12 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 27, 2018 6:39:12 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 67 ms
May 27, 2018 6:39:12 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 27, 2018 6:39:13 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 27 redundant transitions.
May 27, 2018 6:39:13 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 8 ms
May 27, 2018 6:39:13 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
May 27, 2018 6:39:13 AM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 25 identical transitions.
May 27, 2018 6:39:13 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 105 transitions.
May 27, 2018 6:39:13 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 34 place invariants in 53 ms
May 27, 2018 6:39:14 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 132 variables to be positive in 689 ms
May 27, 2018 6:39:14 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 105 transitions.
May 27, 2018 6:39:14 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/105 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 27, 2018 6:39:14 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 27, 2018 6:39:14 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 105 transitions.
May 27, 2018 6:39:14 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 27, 2018 6:39:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 105 transitions.
May 27, 2018 6:39:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/105) took 241 ms. Total solver calls (SAT/UNSAT): 104(0/104)
Skipping mayMatrices nes/nds Could not set logic :(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
java.lang.RuntimeException: Could not set logic :(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.buildSolver(NecessaryEnablingsolver.java:104)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:381)
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)
May 27, 2018 6:39:17 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 4651ms 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="AutoFlight-PT-05a"
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/AutoFlight-PT-05a.tgz
mv AutoFlight-PT-05a 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 AutoFlight-PT-05a, 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 r200-qhx1-152732197100032"
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 ;