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 204K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.3K 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 9.5K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 12K 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.6K 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.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 43K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is AutoFlight-PT-06a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r200-qhx1-152732197100035
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527406443569

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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((F((F("((u32.p111==0)||(u32.p96==1))"))U(F("(u9.p21>=1)")))))
Formula 0 simplified : !F(F"((u32.p111==0)||(u32.p96==1))" U F"(u9.p21>=1)")
built 57 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t142, t143, u1.t0, u1.t58, u2.t1, u2.t55, u4.t2, u4.t52, u5.t3, u5.t49, u7.t4, u7.t46, u8.t5, u8.t43, u10.t6, u10.t40, u11.t7, u11.t37, u13.t8, u13.t34, u14.t9, u14.t31, u16.t10, u16.t28, u17.t11, u17.t25, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :30/111/14/155
Computing Next relation with stutter on 12 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
54 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.83956,26824,1,0,17418,2257,1630,33470,723,6517,78577
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-06a-LTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(G(F(G("(u10.p23>=2)"))))))
Formula 1 simplified : !GFG"(u10.p23>=2)"
Computing Next relation with stutter on 12 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 125 rows 157 cols
invariant :u26:p54 + u40:p0 = 1
invariant :u9:p21 + u40:p0 = 1
invariant :u11:p25 + u11:p26 + u11:p27 + u40:p0 = 1
invariant :u33:p119 + u33:p120 + u33:p121 + u33:p122 + u33:p123 + u33:p124 + u40:p0 = 1
invariant :u36:p137 + u36:p138 + u36:p139 + u36:p140 + u36:p141 + u36:p142 + u40:p0 = 1
invariant :u7:p15 + u7:p16 + u7:p17 + u40:p0 = 1
invariant :u12:p28 + u40:p0 = 1
invariant :u31:p92 + u32:p118 + u33:p124 + u34:p130 + u35:p136 + u36:p142 + u37:p148 + u38:p154 + u39:p156 + 8'u40:p0 = 8
invariant :u34:p125 + u34:p126 + u34:p127 + u34:p128 + u34:p129 + u34:p130 + u40:p0 = 1
invariant :u39:p155 + u39:p156 + u40:p0 = 1
invariant :u29:p58 + u29:p59 + u40:p0 = 1
invariant :u1:p1 + u1:p2 + u1:p3 + u40:p0 = 1
invariant :u15:p35 + u40:p0 = 1
invariant :u38:p149 + u38:p150 + u38:p151 + u38:p152 + u38:p153 + u38:p154 + u40:p0 = 1
invariant :u17:p39 + u17:p40 + u17:p41 + u40:p0 = 1
invariant :u20:p45 + u40:p0 = 1
invariant :u22:p48 + u40:p0 = 1
invariant :u4:p8 + u4:p9 + u4:p10 + u40:p0 = 1
invariant :u13:p29 + u13:p30 + u13:p31 + u40:p0 = 1
invariant :u19:p43 + u19:p44 + u40:p0 = 1
invariant :u5:p11 + u5:p12 + u5:p13 + u40:p0 = 1
invariant :u28:p57 + u40:p0 = 1
invariant :u8:p18 + u8:p19 + u8:p20 + u40:p0 = 1
invariant :u21:p46 + u21:p47 + u40:p0 = 1
invariant :u25:p52 + u25:p53 + u40:p0 = 1
invariant :u3:p7 + u40:p0 = 1
invariant :u23:p49 + u23:p50 + u40:p0 = 1
invariant :u18:p42 + u40:p0 = 1
invariant :u6:p14 + u40:p0 = 1
invariant :u27:p55 + u27:p56 + u40:p0 = 1
invariant :u32:p93 + u32:p94 + u32:p95 + u32:p96 + u32:p97 + u32:p98 + u32:p99 + u32:p100 + u32:p101 + u32:p102 + u32:p103 + u32:p104 + u32:p105 + u32:p106 + u32:p107 + u32:p108 + u32:p109 + u32:p110 + u32:p111 + u32:p112 + u32:p113 + u32:p114 + u32:p115 + u32:p116 + u32:p117 + u32:p118 + u40:p0 = 1
invariant :u10:p22 + u10:p23 + u10:p24 + u40:p0 = 1
invariant :u24:p51 + u40:p0 = 1
invariant :u35:p131 + u35:p132 + u35:p133 + u35:p134 + u35:p135 + u35:p136 + u40:p0 = 1
invariant :u16:p36 + u16:p37 + u16:p38 + u40:p0 = 1
invariant :u14:p32 + u14:p33 + u14:p34 + u40:p0 = 1
invariant :u37:p143 + u37:p144 + u37:p145 + u37:p146 + u37:p147 + u37:p148 + u40:p0 = 1
invariant :u2:p4 + u2:p5 + u2:p6 + u40:p0 = 1
invariant :u31:p61 + u31:p62 + u31:p63 + u31:p64 + u31:p65 + u31:p66 + u31:p67 + u31:p68 + u31:p69 + u31:p70 + u31:p71 + u31:p72 + u31:p73 + u31:p74 + u31:p75 + u31:p76 + u31:p77 + u31:p78 + u31:p79 + u31:p80 + u31:p81 + u31:p82 + u31:p83 + u31:p84 + u31:p85 + u31:p86 + u31:p87 + u31:p88 + u31:p89 + u31:p90 + u31:p91 + -1'u32:p118 + -1'u33:p124 + -1'u34:p130 + -1'u35:p136 + -1'u36:p142 + -1'u37:p148 + -1'u38:p154 + -1'u39:p156 + -7'u40:p0 = -7
invariant :u30:p60 + u40:p0 = 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
449 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.38718,121748,1,0,231948,5989,1661,345956,725,22970,449782
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA AutoFlight-PT-06a-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(G(X("((u11.p26==0)||(u31.p78==1))")))))
Formula 2 simplified : !GX"((u11.p26==0)||(u31.p78==1))"
Computing Next relation with stutter on 12 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
32 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.72179,130172,1,0,249373,7497,1823,376732,727,31817,482022
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA AutoFlight-PT-06a-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(G(G(F("((u35.p132==0)||(u10.p22==1))"))))))
Formula 3 simplified : !XGF"((u35.p132==0)||(u10.p22==1))"
Computing Next relation with stutter on 12 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
16 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.87646,133316,1,0,256115,7497,1880,385528,729,31826,504985
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA AutoFlight-PT-06a-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(F(("(u35.p133>=3)")U("(u16.p36>=2)")))))
Formula 4 simplified : !GF("(u35.p133>=3)" U "(u16.p36>=2)")
Computing Next relation with stutter on 12 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 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,5.98102,135164,1,0,260003,7497,1926,391626,731,31836,517600
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA AutoFlight-PT-06a-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F((G("(u28.p57>=3)"))U(G("(u23.p50>=2)")))))
Formula 5 simplified : !F(G"(u28.p57>=3)" U G"(u23.p50>=2)")
Computing Next relation with stutter on 12 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,6.03413,136592,1,0,260518,7497,1951,392206,733,31836,529698
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA AutoFlight-PT-06a-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((X("((u31.p80==0)||(u38.p153==1))"))U("((u11.p26==0)||(u32.p113==1))"))))
Formula 6 simplified : !X(X"((u31.p80==0)||(u38.p153==1))" U "((u11.p26==0)||(u32.p113==1))")
Computing Next relation with stutter on 12 deadlock states
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,6.03727,136844,1,0,260518,7497,1956,392206,734,31836,529736
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA AutoFlight-PT-06a-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(("(u31.p87>=3)")U(G("(u4.p9>=1)")))))
Formula 7 simplified : !X("(u31.p87>=3)" U G"(u4.p9>=1)")
Computing Next relation with stutter on 12 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
20 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.24423,139896,1,0,266953,7497,1992,406390,737,31836,555837
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA AutoFlight-PT-06a-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(("(u31.p70>=3)"))
Formula 8 simplified : !"(u31.p70>=3)"
Computing Next relation with stutter on 12 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.24755,139896,1,0,266953,7497,1997,406390,739,31836,555879
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA AutoFlight-PT-06a-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((X(G("(u32.p98>=2)")))U(X(X("((u13.p29==0)||(u1.p1==1))")))))
Formula 9 simplified : !(XG"(u32.p98>=2)" U XX"((u13.p29==0)||(u1.p1==1))")
Computing Next relation with stutter on 12 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
46 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.71634,145508,1,0,276150,7587,2009,421261,742,32660,584952
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA AutoFlight-PT-06a-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(("((u32.p117==0)||(u32.p93==1))"))
Formula 10 simplified : !"((u32.p117==0)||(u32.p93==1))"
Computing Next relation with stutter on 12 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.71976,145772,1,0,276150,7587,2017,421261,747,32660,584988
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA AutoFlight-PT-06a-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(("(u23.p49>=2)"))
Formula 11 simplified : !"(u23.p49>=2)"
Computing Next relation with stutter on 12 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.72103,145772,1,0,276150,7587,2020,421261,747,32660,585003
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA AutoFlight-PT-06a-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(X(("((u24.p51==0)||(u31.p73==1))")U("((u34.p127==0)||(u10.p23==1))")))))
Formula 12 simplified : !XX("((u24.p51==0)||(u31.p73==1))" U "((u34.p127==0)||(u10.p23==1))")
Computing Next relation with stutter on 12 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.72368,145772,1,0,276150,7587,2037,421261,749,32660,585207
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA AutoFlight-PT-06a-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(G(G(F("(u10.p22>=1)"))))))
Formula 13 simplified : !FGF"(u10.p22>=1)"
Computing Next relation with stutter on 12 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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,7.22362,158444,1,0,304128,9366,2064,460715,749,37363,648748
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA AutoFlight-PT-06a-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(X("((u31.p86==0)||(u38.p151==1))"))))
Formula 14 simplified : !FX"((u31.p86==0)||(u38.p151==1))"
Computing Next relation with stutter on 12 deadlock states
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,7.22848,158708,1,0,304128,9366,2085,460715,750,37363,648799
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA AutoFlight-PT-06a-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(("(u15.p35>=3)"))
Formula 15 simplified : !"(u15.p35>=3)"
Computing Next relation with stutter on 12 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,7.22942,158708,1,0,304128,9366,2090,460715,752,37363,648836
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA AutoFlight-PT-06a-LTLCardinality-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 1527406469992

--------------------
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 LTLCardinality -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 LTLCardinality -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 7:34:14 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 7:34:15 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 27, 2018 7:34:16 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 246 ms
May 27, 2018 7:34:16 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 157 places.
May 27, 2018 7:34:16 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 155 transitions.
May 27, 2018 7:34:16 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
May 27, 2018 7:34:16 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 56 ms
May 27, 2018 7:34:16 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 27, 2018 7:34:16 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 27, 2018 7:34:17 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 120 ms
May 27, 2018 7:34:17 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 27, 2018 7:34:17 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 32 redundant transitions.
May 27, 2018 7:34:17 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 14 ms
May 27, 2018 7:34:17 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
May 27, 2018 7:34:19 AM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 30 identical transitions.
May 27, 2018 7:34:19 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 125 transitions.
May 27, 2018 7:34:20 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 40 place invariants in 56 ms
May 27, 2018 7:34:21 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 157 variables to be positive in 1347 ms
May 27, 2018 7:34:21 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 125 transitions.
May 27, 2018 7:34:21 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/125 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 27, 2018 7:34:21 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 27, 2018 7:34:21 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 125 transitions.
May 27, 2018 7:34:21 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 27, 2018 7:34:24 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 125 transitions.
May 27, 2018 7:34:24 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/125) took 286 ms. Total solver calls (SAT/UNSAT): 124(0/124)
May 27, 2018 7:34:27 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(26/125) took 3319 ms. Total solver calls (SAT/UNSAT): 741(555/186)
May 27, 2018 7:34:28 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
May 27, 2018 7:34:28 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (= 1 (+ (select s0 6) (select s0 156)))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (= 1 (+ (select s0 6) (select s0 156)))")
[(declare-fun s0 () (Array Int Int)), (assert (= 1 (+ (select s0 6) (select s0 156)))), (assert (= 1 (+ (select s0 92) (select s0 93) (select s0 94) (select s0 95) (select s0 96) (select s0 97) (select s0 98) (select s0 99) (select s0 100) (select s0 101) (select s0 102) (select s0 103) (select s0 104) (select s0 105) (select s0 106) (select s0 107) (select s0 108) (select s0 109) (select s0 110) (select s0 111) (select s0 112) (select s0 113) (select s0 114) (select s0 115) (select s0 116) (select s0 117) (select s0 156)))), (assert (and (>= (select s0 6) 1) (>= (select s0 93) 1))), (assert (>= (select s0 6) 0)), (assert (>= (select s0 92) 0)), (assert (>= (select s0 93) 0)), (assert (>= (select s0 94) 0)), (assert (>= (select s0 95) 0)), (assert (>= (select s0 96) 0)), (assert (>= (select s0 97) 0)), (assert (>= (select s0 98) 0)), (assert (>= (select s0 99) 0)), (assert (>= (select s0 100) 0)), (assert (>= (select s0 101) 0)), (assert (>= (select s0 102) 0)), (assert (>= (select s0 103) 0)), (assert (>= (select s0 104) 0)), (assert (>= (select s0 105) 0)), (assert (>= (select s0 106) 0)), (assert (>= (select s0 107) 0)), (assert (>= (select s0 108) 0)), (assert (>= (select s0 109) 0)), (assert (>= (select s0 110) 0)), (assert (>= (select s0 111) 0)), (assert (>= (select s0 112) 0)), (assert (>= (select s0 113) 0)), (assert (>= (select s0 114) 0)), (assert (>= (select s0 115) 0)), (assert (>= (select s0 116) 0)), (assert (>= (select s0 117) 0)), (assert (>= (select s0 156) 0))]
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@63cf3507
java.lang.RuntimeException: SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@63cf3507
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:448)
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 7:34:28 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 9249ms 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-06a"
export BK_EXAMINATION="LTLCardinality"
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-06a.tgz
mv AutoFlight-PT-06a 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-06a, examination is LTLCardinality"
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-152732197100035"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;