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 368K
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K 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:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 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.7K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.3K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K 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.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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 200K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is DLCround-PT-04a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-smll-152732262900167
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527902192915

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 : !((G(G(G(F("((u17.p86==0)||(u9.p75==1))"))))))
Formula 0 simplified : !GF"((u17.p86==0)||(u9.p75==1))"
built 121 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
34 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.394316,22868,1,0,2495,453,3246,2192,368,819,9384
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X("((u7.p56==0)||(u28.p97==1))"))U(("((u40.p109==0)||(u6.p47==1))")U("((u49.p118==0)||(u9.p70==1))"))))
Formula 1 simplified : !(X"((u7.p56==0)||(u28.p97==1))" U ("((u40.p109==0)||(u6.p47==1))" U "((u49.p118==0)||(u9.p70==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.397194,23752,1,0,2495,453,3263,2192,370,819,9431
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DLCround-PT-04a-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(G(G(X("(u43.p112>=3)"))))))
Formula 2 simplified : !GX"(u43.p112>=3)"
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,0.405308,23752,1,0,2869,453,3283,2573,372,904,10832
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(F(("(u2.p10>=3)")U("(u63.p132>=1)")))))
Formula 3 simplified : !XF("(u2.p10>=3)" U "(u63.p132>=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.410179,23752,1,0,2869,453,3302,2573,373,904,10847
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA DLCround-PT-04a-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((G("((u6.p47==0)||(u64.p133==1))"))U(X("(u65.p134>=1)")))))
Formula 4 simplified : !X(G"((u6.p47==0)||(u64.p133==1))" U X"(u65.p134>=1)")
3 unique states visited
0 strongly connected components in search stack
2 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.41338,24604,1,0,2869,453,3318,2573,375,904,10914
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA DLCround-PT-04a-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(X(("(u26.p95>=1)")U("((u28.p97==0)||(u1.p7==1))")))))
Formula 5 simplified : !FX("(u26.p95>=1)" U "((u28.p97==0)||(u1.p7==1))")
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,0.419075,24604,1,0,2869,453,3340,2573,376,904,10994
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA DLCround-PT-04a-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G("((u5.p34==0)||(u1.p3==1))")))
Formula 6 simplified : !G"((u5.p34==0)||(u1.p3==1))"
3 unique states visited
3 strongly connected components in search stack
3 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.479043,26188,1,0,5727,621,3499,6773,378,2219,16919
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("(u1.p2>=1)"))
Formula 7 simplified : !"(u1.p2>=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,0.479702,26188,1,0,5728,621,3502,6773,379,2219,17025
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(F(X(G("(u9.p76>=3)"))))))
Formula 8 simplified : !XFXG"(u9.p76>=3)"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 122
// Phase 1: matrix 122 rows 139 cols
invariant :u60:p129 + u70:p0 = 1
invariant :u47:p116 + u70:p0 = 1
invariant :u34:p103 + u70:p0 = 1
invariant :u46:p115 + u70:p0 = 1
invariant :u65:p134 + u70:p0 = 1
invariant :u6:p39 + u6:p40 + u6:p41 + u6:p42 + u6:p43 + u6:p44 + u6:p45 + u6:p46 + u6:p47 + u6:p48 + u70:p0 = 1
invariant :u2:p8 + u2:p9 + u2:p10 + u2:p11 + u2:p12 + u2:p13 + u2:p14 + u70:p0 = 1
invariant :u41:p110 + u70:p0 = 1
invariant :u24:p93 + u70:p0 = 1
invariant :u68:p137 + u70:p0 = 1
invariant :u63:p132 + u70:p0 = 1
invariant :u37:p106 + u70:p0 = 1
invariant :u9:p69 + u9:p70 + u9:p71 + u9:p72 + u9:p73 + u9:p74 + u9:p75 + u9:p76 + u9:p77 + u9:p78 + u70:p0 = 1
invariant :u16:p85 + u70:p0 = 1
invariant :u36:p105 + u70:p0 = 1
invariant :u50:p119 + u70:p0 = 1
invariant :u23:p92 + u70:p0 = 1
invariant :u7:p49 + u7:p50 + u7:p51 + u7:p52 + u7:p53 + u7:p54 + u7:p55 + u7:p56 + u7:p57 + u7:p58 + u70:p0 = 1
invariant :u26:p95 + u70:p0 = 1
invariant :u49:p118 + u70:p0 = 1
invariant :u69:p138 + u70:p0 = 1
invariant :u25:p94 + u70:p0 = 1
invariant :u15:p84 + u70:p0 = 1
invariant :u59:p128 + u70:p0 = 1
invariant :u10:p79 + u70:p0 = 1
invariant :u39:p108 + u70:p0 = 1
invariant :u13:p82 + u70:p0 = 1
invariant :u4:p22 + u4:p23 + u4:p24 + u4:p25 + u4:p26 + u4:p27 + u4:p28 + u70:p0 = 1
invariant :u58:p127 + u70:p0 = 1
invariant :u28:p97 + u70:p0 = 1
invariant :u51:p120 + u70:p0 = 1
invariant :u31:p100 + u70:p0 = 1
invariant :u45:p114 + u70:p0 = 1
invariant :u42:p111 + u70:p0 = 1
invariant :u33:p102 + u70:p0 = 1
invariant :u38:p107 + u70:p0 = 1
invariant :u3:p15 + u3:p16 + u3:p17 + u3:p18 + u3:p19 + u3:p20 + u3:p21 + u70:p0 = 1
invariant :u67:p136 + u70:p0 = 1
invariant :u64:p133 + u70:p0 = 1
invariant :u40:p109 + u70:p0 = 1
invariant :u54:p123 + u70:p0 = 1
invariant :u18:p87 + u70:p0 = 1
invariant :u27:p96 + u70:p0 = 1
invariant :u21:p90 + u70:p0 = 1
invariant :u32:p101 + u70:p0 = 1
invariant :u1:p1 + u1:p2 + u1:p3 + u1:p4 + u1:p5 + u1:p6 + u1:p7 + u70:p0 = 1
invariant :u17:p86 + u70:p0 = 1
invariant :u22:p91 + u70:p0 = 1
invariant :u19:p88 + u70:p0 = 1
invariant :u66:p135 + u70:p0 = 1
invariant :u44:p113 + u70:p0 = 1
invariant :u14:p83 + u70:p0 = 1
invariant :u53:p122 + u70:p0 = 1
invariant :u43:p112 + u70:p0 = 1
invariant :u56:p125 + u70:p0 = 1
invariant :u30:p99 + u70:p0 = 1
invariant :u35:p104 + u70:p0 = 1
invariant :u52:p121 + u70:p0 = 1
invariant :u48:p117 + u70:p0 = 1
invariant :u12:p81 + u70:p0 = 1
invariant :u29:p98 + u70:p0 = 1
invariant :u62:p131 + u70:p0 = 1
invariant :u57:p126 + u70:p0 = 1
invariant :u20:p89 + u70:p0 = 1
invariant :u5:p29 + u5:p30 + u5:p31 + u5:p32 + u5:p33 + u5:p34 + u5:p35 + u5:p36 + u5:p37 + u5:p38 + u70:p0 = 1
invariant :u8:p59 + u8:p60 + u8:p61 + u8:p62 + u8:p63 + u8:p64 + u8:p65 + u8:p66 + u8:p67 + u8:p68 + u70:p0 = 1
invariant :u55:p124 + u70:p0 = 1
invariant :u61:p130 + u70:p0 = 1
invariant :u11:p80 + u70:p0 = 1
4 unique states visited
4 strongly connected components in search stack
4 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.610193,33308,1,0,25324,693,3527,30817,381,3392,40816
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("((u2.p9==0)||(u15.p84==1))"))
Formula 9 simplified : !"((u2.p9==0)||(u15.p84==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.611358,33572,1,0,25324,693,3533,30817,382,3392,40888
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA DLCround-PT-04a-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(G(("((u47.p116==0)||(u68.p137==1))")U("(u61.p130>=1)")))))
Formula 10 simplified : !XG("((u47.p116==0)||(u68.p137==1))" U "(u61.p130>=1)")
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.637634,34492,1,0,25412,693,3610,30936,382,3438,41111
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA DLCround-PT-04a-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(("(u4.p27>=1)"))
Formula 11 simplified : !"(u4.p27>=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,0.638194,34492,1,0,25412,693,3615,30936,383,3438,41170
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F("(u6.p41>=2)")))
Formula 12 simplified : !F"(u6.p41>=2)"
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,0.681043,35284,1,0,25771,697,3741,31617,385,3575,42705
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(F(X(G("(u2.p11>=3)"))))))
Formula 13 simplified : !XFXG"(u2.p11>=3)"
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,0.691108,35548,1,0,25775,697,3766,31620,387,3578,45298
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X(X(("((u9.p73==0)||(u4.p27==1))")U("(u3.p17>=2)")))))
Formula 14 simplified : !XX("((u9.p73==0)||(u4.p27==1))" U "(u3.p17>=2)")
4 unique states visited
4 strongly connected components in search stack
4 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,0.794236,38184,1,0,31053,810,3898,39281,391,4661,56139
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA DLCround-PT-04a-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G((F("(u4.p27>=1)"))U(F("((u8.p68==0)||(u57.p126==1))")))))
Formula 15 simplified : !G(F"(u4.p27>=1)" U F"((u8.p68==0)||(u57.p126==1))")
2 unique states visited
0 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,0.796049,38412,1,0,31068,810,3904,39298,392,4666,56203
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA DLCround-PT-04a-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
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 1527902198743

--------------------
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
Jun 02, 2018 1:16:35 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]
Jun 02, 2018 1:16:35 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 1:16:35 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 161 ms
Jun 02, 2018 1:16:35 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 139 places.
Jun 02, 2018 1:16:35 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 823 transitions.
Jun 02, 2018 1:16:35 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Jun 02, 2018 1:16:35 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 38 ms
Jun 02, 2018 1:16:35 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 02, 2018 1:16:35 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 02, 2018 1:16:35 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 227 ms
Jun 02, 2018 1:16:35 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 02, 2018 1:16:36 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 1216 redundant transitions.
Jun 02, 2018 1:16:36 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 12 ms
Jun 02, 2018 1:16:36 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Jun 02, 2018 1:16:36 AM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 91 identical transitions.
Jun 02, 2018 1:16:36 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 732 transitions.
Jun 02, 2018 1:16:37 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 69 place invariants in 47 ms
Jun 02, 2018 1:16:37 AM fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver checkSat
WARNING: SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:297)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:305)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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 02, 2018 1:16:37 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 995ms 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-04a"
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/DLCround-PT-04a.tgz
mv DLCround-PT-04a 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 DLCround-PT-04a, 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 r212-smll-152732262900167"
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 ;