Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r140-smll-155284912300042.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-3817
Executing tool itstools
Input is Raft-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-smll-155284912300042
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 3.1K Feb 12 11:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 12 11:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 8 13:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 8 13:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 97 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 335 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 5 00:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 5 00:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.0K Feb 4 22:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Feb 4 14:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 4 14:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 1 11:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 1 11:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 89K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1552933781335

Working with output stream class java.io.PrintStream
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.201903111103/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.201903111103/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 : !((X(G("((u36.p176==0)||(u25.p121==1))"))))
Formula 0 simplified : !XG"((u36.p176==0)||(u25.p121==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
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,0.420875,25604,1,0,18827,270,2986,23520,204,922,56313
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("((u19.p92==0)||(u2.p10==1))"))
Formula 1 simplified : !"((u19.p92==0)||(u2.p10==1))"
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,0.42186,25964,1,0,18827,270,2993,23520,206,922,56357
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Raft-PT-06-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(("(u7.p32>=1)")U(G("(u2.p8>=3)")))))
Formula 2 simplified : !X("(u7.p32>=1)" U G"(u2.p8>=3)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.474346,28192,1,0,22550,270,3029,29531,209,947,67426
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((G(X("((u25.p122==0)||(u19.p95==1))")))U(("((u11.p53==0)||(u17.p81==1))")U("((u33.p161==0)||(u33.p165==1))"))))
Formula 3 simplified : !(GX"((u25.p122==0)||(u19.p95==1))" U ("((u11.p53==0)||(u17.p81==1))" U "((u33.p161==0)||(u33.p165==1))"))
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,0.479092,29400,1,0,22550,270,3047,29531,214,947,67490
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Raft-PT-06-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((F("((u23.p112==0)||(u12.p60==1))"))U(F("((u18.p90==0)||(u8.p39==1))")))))
Formula 4 simplified : !X(F"((u23.p112==0)||(u12.p60==1))" U F"((u18.p90==0)||(u8.p39==1))")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 280
// Phase 1: matrix 280 rows 188 cols
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.583689,32292,1,0,28973,270,3148,40751,216,960,86162
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((X(F("(u23.p111>=3)")))U(("((u38.p185==0)||(u14.p70==1))")U("(u35.p175>=2)"))))
Formula 5 simplified : !(XF"(u23.p111>=3)" U ("((u38.p185==0)||(u14.p70==1))" U "(u35.p175>=2)"))
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
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,0.642843,34908,1,0,33596,270,3238,48051,220,1003,97968
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((G(G("((u25.p123==0)||(u24.p117==1))")))U(X(F("((u13.p62==0)||(u10.p50==1))")))))
Formula 6 simplified : !(G"((u25.p123==0)||(u24.p117==1))" U XF"((u13.p62==0)||(u10.p50==1))")
2 unique states visited
0 strongly connected components in search stack
1 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,0.645607,35156,1,0,33596,270,3259,48051,220,1003,98002
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Raft-PT-06-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((X("((u11.p51==0)||(u35.p174==1))"))U("(u19.p92>=3)")))
Formula 7 simplified : !(X"((u11.p51==0)||(u35.p174==1))" U "(u19.p92>=3)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
33 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.979228,47300,1,0,58656,270,3348,93962,222,1063,161708
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(G(F(F("(u37.p183>=3)"))))))
Formula 8 simplified : !XGF"(u37.p183>=3)"
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.982593,47300,1,0,58660,270,3368,93971,224,1072,161731
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(X(G(X("((u11.p54==0)||(u10.p50==1))"))))))
Formula 9 simplified : !GXGX"((u11.p54==0)||(u10.p50==1))"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,1.18878,54404,1,0,73135,270,3458,117894,225,1081,199738
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F((X("(u29.p145>=3)"))U(G("(u2.p7>=1)")))))
Formula 10 simplified : !F(X"(u29.p145>=3)" U G"(u2.p7>=1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
247 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.6562,140700,1,0,265278,270,3481,441940,225,1211,434816
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(G("((u17.p85==0)||(u23.p113==1))"))))
Formula 11 simplified : !XG"((u17.p85==0)||(u23.p113==1))"
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,3.65918,140964,1,0,265278,270,3500,441940,226,1211,434860
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((X(X("(u10.p49>=2)")))U(G(X("(u30.p147>=1)")))))
Formula 12 simplified : !(XX"(u10.p49>=2)" U GX"(u30.p147>=1)")
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 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,3.6703,141424,1,0,265535,270,3533,442331,228,1239,435702
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(X(("(u35.p173>=2)")U("((u3.p11==0)||(u32.p156==1))")))))
Formula 13 simplified : !FX("(u35.p173>=2)" U "((u3.p11==0)||(u32.p156==1))")
2 unique states visited
0 strongly connected components in search stack
1 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,3.67347,141424,1,0,265535,270,3559,442331,228,1239,435747
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA Raft-PT-06-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X(G(F(G("(u18.p86>=2)"))))))
Formula 14 simplified : !XGFG"(u18.p86>=2)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
67 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.35903,172788,1,0,341840,270,3584,561584,230,1242,525222
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Raft-PT-06-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X(F("(u6.p26>=2)"))))
Formula 15 simplified : !XF"(u6.p26>=2)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
11 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.45256,175956,1,0,347153,270,3671,572277,230,1244,545039
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Raft-PT-06-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, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1552933792368

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /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 -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
Mar 18, 2019 6:29:44 PM 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]
Mar 18, 2019 6:29:44 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 18, 2019 6:29:44 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 141 ms
Mar 18, 2019 6:29:44 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 188 places.
Mar 18, 2019 6:29:44 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 332 transitions.
Mar 18, 2019 6:29:44 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Mar 18, 2019 6:29:44 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 39 ms
Mar 18, 2019 6:29:45 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Mar 18, 2019 6:29:45 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 214 ms
Mar 18, 2019 6:29:45 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 73 ms
Mar 18, 2019 6:29:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Mar 18, 2019 6:29:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Mar 18, 2019 6:29:45 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 10 events :t59,t59,t59,t59,t59,t53,t53,t53,t53,t53,
Mar 18, 2019 6:29:45 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 38 events :t55,t55,t55,t55,t55,t199,t199,t199,t199,t194,t194,t194,t194,t189,t189,t189,t189,t55,t55,t55,t55,t55,t55,t55,t55,t55,t55,t55,t55,t55,t55,t55,t55,t55,t55,t55,t55,t55,
Mar 18, 2019 6:29:45 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 38 events :t53,t53,t53,t53,t53,t53,t53,t53,t53,t53,t53,t53,t53,t53,t53,t53,t53,t53,t53,t53,t104,t104,t104,t104,t99,t99,t99,t99,t94,t94,t94,t94,t53,t53,t53,t53,t53,t53,
Mar 18, 2019 6:29:45 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 12 events :t330,t41,t41,t41,t41,t41,t41,t41,t41,t41,t41,t41,
Mar 18, 2019 6:29:45 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 38 events :t56,t56,t56,t56,t56,t239,t239,t239,t239,t234,t234,t234,t234,t229,t229,t229,t229,t56,t56,t56,t56,t56,t56,t56,t56,t56,t56,t56,t56,t56,t56,t56,t56,t56,t56,t56,t56,t56,
Mar 18, 2019 6:29:45 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 38 events :t58,t58,t58,t58,t58,t319,t319,t319,t319,t314,t314,t314,t314,t309,t309,t309,t309,t58,t58,t58,t58,t58,t58,t58,t58,t58,t58,t58,t58,t58,t58,t58,t58,t58,t58,t58,t58,t58,
Mar 18, 2019 6:29:45 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 38 events :t54,t54,t54,t54,t54,t54,t54,t54,t54,t54,t54,t54,t54,t54,t54,t54,t54,t54,t54,t54,t144,t144,t144,t144,t139,t139,t139,t139,t134,t134,t134,t134,t54,t54,t54,t54,t54,t54,
Mar 18, 2019 6:29:45 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 38 events :t57,t57,t57,t57,t57,t279,t279,t279,t279,t274,t274,t274,t274,t269,t269,t269,t269,t57,t57,t57,t57,t57,t57,t57,t57,t57,t57,t57,t57,t57,t57,t57,t57,t57,t57,t57,t57,t57,
Mar 18, 2019 6:29:45 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 250 redundant transitions.
Mar 18, 2019 6:29:45 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 136 ms
Mar 18, 2019 6:29:45 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 10 ms
Mar 18, 2019 6:29:45 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 5 ms
Mar 18, 2019 6:29:45 PM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 26 identical transitions.
Mar 18, 2019 6:29:45 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 306 transitions.
Mar 18, 2019 6:29:46 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 36 place invariants in 78 ms
Mar 18, 2019 6:29:46 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 188 variables to be positive in 543 ms
Mar 18, 2019 6:29:46 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 306 transitions.
Mar 18, 2019 6:29:46 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/306 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 18, 2019 6:29:46 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 58 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 18, 2019 6:29:46 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 306 transitions.
Mar 18, 2019 6:29:46 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 18, 2019 6:29:48 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 306 transitions.
Mar 18, 2019 6:29:49 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(25/306) took 1808 ms. Total solver calls (SAT/UNSAT): 1579(637/942)
Mar 18, 2019 6:29:51 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (>= (select s0 124) 1) (>= (select s0 174) 1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (>= (select s0 124) 1) (>= (select s0 174) 1))")
[(assert (and (>= (select s0 124) 1) (>= (select s0 174) 1)))]
Skipping mayMatrices nes/nds SMT solver raised an exception.
java.lang.RuntimeException: SMT solver raised an exception.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:475)
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)
Mar 18, 2019 6:29:51 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 5559ms 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="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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3817"
echo " Executing tool itstools"
echo " Input is Raft-PT-06, 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 r140-smll-155284912300042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Raft-PT-06.tgz
mv Raft-PT-06 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;