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 496K
-rw-r--r-- 1 mcc users 3.9K 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.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 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.8K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 325K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is DLCround-PT-06a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r213-smll-152732264000176
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527872987860

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 : !(((G(G(G("((u11.p96>=1)&&(u67.p154>=1))"))))U("((u1.p7>=1)&&(u28.p115>=1))")))
Formula 0 simplified : !(G"((u11.p96>=1)&&(u67.p154>=1))" U "((u1.p7>=1)&&(u28.p115>=1))")
built 197 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 154
// Phase 1: matrix 154 rows 197 cols
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
81 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.880096,28136,1,0,4626,604,4885,3932,379,777,19147
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DLCround-PT-06a-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((("((u2.p9>=1)&&(u14.p101>=1))")U(F(X(X("((u7.p53>=1)&&(u31.p118>=1))"))))))
Formula 1 simplified : !("((u2.p9>=1)&&(u14.p101>=1))" U FXX"((u7.p53>=1)&&(u31.p118>=1))")
invariant :u7:p49 + u7:p50 + u7:p51 + u7:p52 + u7:p53 + u7:p54 + u7:p55 + u7:p56 + u7:p57 + u7:p58 + u110:p0 = 1
invariant :u18:p105 + u110:p0 = 1
invariant :u86:p173 + u110:p0 = 1
invariant :u87:p174 + u110:p0 = 1
invariant :u17:p104 + u110:p0 = 1
invariant :u64:p151 + u110:p0 = 1
invariant :u105:p192 + u110:p0 = 1
invariant :u31:p118 + u110:p0 = 1
invariant :u108:p195 + u110:p0 = 1
invariant :u13:p100 + u110:p0 = 1
invariant :u45:p132 + u110:p0 = 1
invariant :u43:p130 + u110:p0 = 1
invariant :u102:p189 + u110:p0 = 1
invariant :u81:p168 + u110:p0 = 1
invariant :u24:p111 + u110:p0 = 1
invariant :u38:p125 + u110:p0 = 1
invariant :u25:p112 + u110:p0 = 1
invariant :u103:p190 + u110:p0 = 1
invariant :u77:p164 + u110:p0 = 1
invariant :u10:p79 + u10:p80 + u10:p81 + u10:p82 + u10:p83 + u10:p84 + u10:p85 + u10:p86 + u10:p87 + u10:p88 + u110:p0 = 1
invariant :u56:p143 + u110:p0 = 1
invariant :u76:p163 + u110:p0 = 1
invariant :u90:p177 + u110:p0 = 1
invariant :u2:p8 + u2:p9 + u2:p10 + u2:p11 + u2:p12 + u2:p13 + u2:p14 + u110:p0 = 1
invariant :u1:p1 + u1:p2 + u1:p3 + u1:p4 + u1:p5 + u1:p6 + u1:p7 + u110:p0 = 1
invariant :u66:p153 + u110:p0 = 1
invariant :u63:p150 + u110:p0 = 1
invariant :u100:p187 + u110:p0 = 1
invariant :u74:p161 + u110:p0 = 1
invariant :u92:p179 + u110:p0 = 1
invariant :u32:p119 + u110:p0 = 1
invariant :u26:p113 + u110:p0 = 1
invariant :u40:p127 + u110:p0 = 1
invariant :u36:p123 + u110:p0 = 1
invariant :u33:p120 + u110:p0 = 1
invariant :u88:p175 + u110:p0 = 1
invariant :u75:p162 + u110:p0 = 1
invariant :u52:p139 + u110:p0 = 1
invariant :u12:p99 + u110:p0 = 1
invariant :u30:p117 + u110:p0 = 1
invariant :u37:p124 + u110:p0 = 1
invariant :u44:p131 + u110:p0 = 1
invariant :u5:p29 + u5:p30 + u5:p31 + u5:p32 + u5:p33 + u5:p34 + u5:p35 + u5:p36 + u5:p37 + u5:p38 + u110:p0 = 1
invariant :u16:p103 + u110:p0 = 1
invariant :u19:p106 + u110:p0 = 1
invariant :u60:p147 + u110:p0 = 1
invariant :u69:p156 + u110:p0 = 1
invariant :u34:p121 + u110:p0 = 1
invariant :u41:p128 + u110:p0 = 1
invariant :u97:p184 + u110:p0 = 1
invariant :u35:p122 + u110:p0 = 1
invariant :u95:p182 + u110:p0 = 1
invariant :u101:p188 + u110:p0 = 1
invariant :u94:p181 + u110:p0 = 1
invariant :u80:p167 + u110:p0 = 1
invariant :u51:p138 + u110:p0 = 1
invariant :u15:p102 + u110:p0 = 1
invariant :u107:p194 + u110:p0 = 1
invariant :u27:p114 + u110:p0 = 1
invariant :u49:p136 + u110:p0 = 1
invariant :u14:p101 + u110:p0 = 1
invariant :u28:p115 + u110:p0 = 1
invariant :u58:p145 + u110:p0 = 1
invariant :u29:p116 + u110:p0 = 1
invariant :u46:p133 + u110:p0 = 1
invariant :u11:p89 + u11:p90 + u11:p91 + u11:p92 + u11:p93 + u11:p94 + u11:p95 + u11:p96 + u11:p97 + u11:p98 + u110:p0 = 1
invariant :u72:p159 + u110:p0 = 1
invariant :u67:p154 + u110:p0 = 1
invariant :u61:p148 + u110:p0 = 1
invariant :u62:p149 + u110:p0 = 1
invariant :u106:p193 + u110:p0 = 1
invariant :u47:p134 + u110:p0 = 1
invariant :u84:p171 + u110:p0 = 1
invariant :u54:p141 + u110:p0 = 1
invariant :u6:p39 + u6:p40 + u6:p41 + u6:p42 + u6:p43 + u6:p44 + u6:p45 + u6:p46 + u6:p47 + u6:p48 + u110:p0 = 1
invariant :u23:p110 + u110:p0 = 1
invariant :u57:p144 + u110:p0 = 1
invariant :u59:p146 + u110:p0 = 1
invariant :u96:p183 + u110:p0 = 1
invariant :u70:p157 + u110:p0 = 1
invariant :u93:p180 + u110:p0 = 1
invariant :u83:p170 + u110:p0 = 1
invariant :u3:p15 + u3:p16 + u3:p17 + u3:p18 + u3:p19 + u3:p20 + u3:p21 + u110:p0 = 1
invariant :u104:p191 + u110:p0 = 1
invariant :u39:p126 + u110:p0 = 1
invariant :u20:p107 + u110:p0 = 1
invariant :u9:p69 + u9:p70 + u9:p71 + u9:p72 + u9:p73 + u9:p74 + u9:p75 + u9:p76 + u9:p77 + u9:p78 + u110:p0 = 1
invariant :u89:p176 + u110:p0 = 1
invariant :u109:p196 + u110:p0 = 1
invariant :u50:p137 + u110:p0 = 1
invariant :u4:p22 + u4:p23 + u4:p24 + u4:p25 + u4:p26 + u4:p27 + u4:p28 + u110:p0 = 1
invariant :u65:p152 + u110:p0 = 1
invariant :u55:p142 + u110:p0 = 1
invariant :u99:p186 + u110:p0 = 1
invariant :u21:p108 + u110:p0 = 1
invariant :u79:p166 + u110:p0 = 1
invariant :u68:p155 + u110:p0 = 1
invariant :u53:p140 + u110:p0 = 1
invariant :u98:p185 + u110:p0 = 1
invariant :u8:p59 + u8:p60 + u8:p61 + u8:p62 + u8:p63 + u8:p64 + u8:p65 + u8:p66 + u8:p67 + u8:p68 + u110:p0 = 1
invariant :u22:p109 + u110:p0 = 1
invariant :u82:p169 + u110:p0 = 1
invariant :u91:p178 + u110:p0 = 1
invariant :u48:p135 + u110:p0 = 1
invariant :u42:p129 + u110:p0 = 1
invariant :u71:p158 + u110:p0 = 1
invariant :u78:p165 + u110:p0 = 1
invariant :u85:p172 + u110:p0 = 1
invariant :u73:p160 + u110:p0 = 1
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
14 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.02533,32408,1,0,9227,604,5133,10087,379,1617,28045
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DLCround-PT-06a-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(("((u9.p74>=1)&&(u97.p184>=1))"))
Formula 2 simplified : !"((u9.p74>=1)&&(u97.p184>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.02641,32672,1,0,9227,604,5137,10087,379,1617,28060
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DLCround-PT-06a-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X("((u10.p81>=1)&&(u100.p187>=1))")))
Formula 3 simplified : !X"((u10.p81>=1)&&(u100.p187>=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,1.02796,32672,1,0,9231,604,5141,10087,379,1617,28282
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DLCround-PT-06a-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((X("((u6.p39>=1)&&(u21.p108>=1))"))U("((u6.p43>=1)&&(u25.p112>=1))")))
Formula 4 simplified : !(X"((u6.p39>=1)&&(u21.p108>=1))" U "((u6.p43>=1)&&(u25.p112>=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,1.03075,32672,1,0,9231,604,5157,10087,379,1617,28526
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DLCround-PT-06a-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F(G(F("((u3.p21>=1)&&(u56.p143>=1))"))))U(X(X(G("((u102.p189>=1)&&(u9.p77>=1))"))))))
Formula 5 simplified : !(FGF"((u3.p21>=1)&&(u56.p143>=1))" U XXG"((u102.p189>=1)&&(u9.p77>=1))")
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
37 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.3927,40600,1,0,16586,677,5535,21474,379,2647,40012
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DLCround-PT-06a-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X("((u7.p53>=1)&&(u35.p122>=1))")))
Formula 6 simplified : !X"((u7.p53>=1)&&(u35.p122>=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,1.39397,40864,1,0,16586,677,5539,21474,379,2647,40082
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DLCround-PT-06a-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("(u10.p87>=1)"))
Formula 7 simplified : !"(u10.p87>=1)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.39487,40864,1,0,16586,677,5542,21474,380,2647,40125
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DLCround-PT-06a-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X("((u91.p178>=1)&&(u8.p65>=1))")))
Formula 8 simplified : !X"((u91.p178>=1)&&(u8.p65>=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,1.39593,40864,1,0,16586,677,5548,21474,380,2647,40188
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DLCround-PT-06a-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X((X("(u5.p37>=1)"))U(("((u15.p102>=1)&&(u2.p14>=1))")U("((u71.p158>=1)&&(u5.p35>=1))")))))
Formula 9 simplified : !X(X"(u5.p37>=1)" U ("((u15.p102>=1)&&(u2.p14>=1))" U "((u71.p158>=1)&&(u5.p35>=1))"))
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,1.60678,47604,1,0,29643,731,5834,37197,380,3470,63392
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DLCround-PT-06a-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(("(u9.p73>=1)"))
Formula 10 simplified : !"(u9.p73>=1)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.60794,47604,1,0,29643,731,5838,37197,381,3470,63444
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DLCround-PT-06a-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((("((u106.p193>=1)&&(u11.p95>=1))")U(F(("((u6.p47>=1)&&(u105.p192>=1))")U("((u9.p71>=1)&&(u95.p182>=1))")))))
Formula 11 simplified : !("((u106.p193>=1)&&(u11.p95>=1))" U F("((u6.p47>=1)&&(u105.p192>=1))" U "((u9.p71>=1)&&(u95.p182>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4 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.65071,49188,1,0,31379,774,5891,40186,381,3831,67201
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DLCround-PT-06a-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F("((u7.p57>=1)&&(u30.p117>=1))")))
Formula 12 simplified : !F"((u7.p57>=1)&&(u30.p117>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,1.77494,52092,1,0,33118,774,6091,43248,381,3845,70986
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DLCround-PT-06a-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((G(("((u47.p134>=1)&&(u9.p75>=1))")U("((u11.p97>=1)&&(u62.p149>=1))")))U(F("((u5.p33>=1)&&(u15.p102>=1))"))))
Formula 13 simplified : !(G("((u47.p134>=1)&&(u9.p75>=1))" U "((u11.p97>=1)&&(u62.p149>=1))") U F"((u5.p33>=1)&&(u15.p102>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,1.93348,55732,1,0,36332,790,6322,48424,381,4127,77053
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DLCround-PT-06a-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(("((u9.p77>=1)&&(u93.p180>=1))"))
Formula 14 simplified : !"((u9.p77>=1)&&(u93.p180>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.93477,55996,1,0,36332,790,6326,48424,381,4127,77073
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA DLCround-PT-06a-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G("((u3.p21>=1)&&(u65.p152>=1))")))
Formula 15 simplified : !G"((u3.p21>=1)&&(u65.p152>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.94648,56784,1,0,36332,790,6346,48424,381,4127,77175
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA DLCround-PT-06a-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 1527872995030

--------------------
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 01, 2018 5:09:49 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
Jun 01, 2018 5:09:49 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2018 5:09:50 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 182 ms
Jun 01, 2018 5:09:50 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 197 places.
Jun 01, 2018 5:09:50 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 1313 transitions.
Jun 01, 2018 5:09:50 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Jun 01, 2018 5:09:50 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 46 ms
Jun 01, 2018 5:09:50 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 01, 2018 5:09:50 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 360 ms
Jun 01, 2018 5:09:51 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 150 ms
Jun 01, 2018 5:09:51 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 01, 2018 5:09:51 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 146 ms
Jun 01, 2018 5:09:51 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 01, 2018 5:09:51 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 2062 redundant transitions.
Jun 01, 2018 5:09:51 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 17 ms
Jun 01, 2018 5:09:51 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 01, 2018 5:09:51 PM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 135 identical transitions.
Jun 01, 2018 5:09:51 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 1178 transitions.
Jun 01, 2018 5:09:52 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 109 place invariants in 67 ms
Jun 01, 2018 5:09:53 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 197 variables to be positive in 674 ms
Jun 01, 2018 5:09:53 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 1178 transitions.
Jun 01, 2018 5:09:53 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/1178 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 5:09:53 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 99 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 5:09:53 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 1178 transitions.
Jun 01, 2018 5:09:53 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 58 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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.computeAblingForPredicate(NecessaryEnablingsolver.java:660)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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 01, 2018 5:09:53 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 2157ms 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="DLCround-PT-06a"
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/DLCround-PT-06a.tgz
mv DLCround-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 itstoolsl"
echo " Input is DLCround-PT-06a, 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 r213-smll-152732264000176"
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 ;