fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r248-blw7-152732549700046
Last Updated
June 26, 2018

About the Execution of ITS-Tools for FlexibleBarrier-PT-12a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15754.620 3977.00 11004.00 96.50 FFFFFFFFFFFFFFFF normal

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 292K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K 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.3K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 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.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 128K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is FlexibleBarrier-PT-12a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r248-blw7-152732549700046
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527961420867

Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(("(u3.p29>=1)"))
Formula 0 simplified : !"(u3.p29>=1)"
built 91 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
8 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.119925,18880,1,0,4374,970,1593,4668,306,4998,5754
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((G(F("(((u4.p48>=1)&&(u10.p119>=1))&&(u13.p145>=1))")))U("(((u4.p47>=1)&&(u7.p84>=1))&&(u13.p145>=1))"))))
Formula 1 simplified : !F(GF"(((u4.p48>=1)&&(u10.p119>=1))&&(u13.p145>=1))" U "(((u4.p47>=1)&&(u7.p84>=1))&&(u13.p145>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
8 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.196055,23700,1,0,14984,1266,1649,17542,306,9063,19745
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F("(((u3.p35>=1)&&(u7.p84>=1))&&(u13.p145>=1))")))
Formula 2 simplified : !F"(((u3.p35>=1)&&(u7.p84>=1))&&(u13.p145>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.266982,28184,1,0,26126,1295,1705,30990,306,9596,33909
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(X(G(F("((u2.p17>=1)&&(u14.p146>=1))"))))))
Formula 3 simplified : !GXGF"((u2.p17>=1)&&(u14.p146>=1))"
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.280946,28656,1,0,26505,1300,1875,31549,306,9854,34475
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X(("(((u3.p35>=1)&&(u10.p120>=1))&&(u13.p145>=1))")U(G("(u7.p83>=1)"))))))
Formula 4 simplified : !GX("(((u3.p35>=1)&&(u10.p120>=1))&&(u13.p145>=1))" U G"(u7.p83>=1)")
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.290317,29556,1,0,26976,1306,1975,32363,307,10048,35422
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(G(G(G(G("(((u5.p59>=1)&&(u10.p120>=1))&&(u13.p145>=1))")))))))
Formula 5 simplified : !XG"(((u5.p59>=1)&&(u10.p120>=1))&&(u13.p145>=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,0.292088,29816,1,0,26991,1306,2004,32365,307,10048,35570
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(F("(((u2.p24>=1)&&(u7.p83>=1))&&(u13.p145>=1))"))))
Formula 6 simplified : !GF"(((u2.p24>=1)&&(u7.p83>=1))&&(u13.p145>=1))"
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.296409,29816,1,0,27254,1308,2055,32821,307,10107,36025
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((X(X(F("(((u3.p36>=1)&&(u8.p95>=1))&&(u13.p145>=1))"))))U(F(("(((u5.p59>=1)&&(u9.p108>=1))&&(u13.p145>=1))")U("(((u3.p35>=1)&&(u7.p84>=1))&&(u13.p145>=1))")))))
Formula 7 simplified : !(XXF"(((u3.p36>=1)&&(u8.p95>=1))&&(u13.p145>=1))" U F("(((u5.p59>=1)&&(u9.p108>=1))&&(u13.p145>=1))" U "(((u3.p35>=1)&&(u7.p84>=1))&&(u13.p145>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 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.297185,30056,1,0,27254,1308,2055,32821,307,10107,36025
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G("(u2.p20>=1)")))
Formula 8 simplified : !G"(u2.p20>=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.298152,30056,1,0,27254,1308,2073,32821,308,10107,36061
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(F(F(G(G("(u5.p49>=1)")))))))
Formula 9 simplified : !FG"(u5.p49>=1)"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 314
// Phase 1: matrix 314 rows 147 cols
invariant :u4:p37 + u4:p38 + u4:p39 + u4:p40 + u4:p41 + u4:p42 + u4:p43 + u4:p44 + u4:p45 + u4:p46 + u4:p47 + u4:p48 + u15:p0 = 1
invariant :u1:p1 + u1:p2 + u1:p3 + u1:p4 + u1:p5 + u1:p6 + u1:p7 + u1:p8 + u1:p9 + u1:p10 + u1:p11 + u1:p12 + u15:p0 = 1
invariant :u11:p121 + u11:p122 + u11:p123 + u11:p124 + u11:p125 + u11:p126 + u11:p127 + u11:p128 + u11:p129 + u11:p130 + u11:p131 + u11:p132 + u15:p0 = 1
invariant :u14:p146 + u15:p0 = 1
invariant :u2:p13 + u2:p14 + u2:p15 + u2:p16 + u2:p17 + u2:p18 + u2:p19 + u2:p20 + u2:p21 + u2:p22 + u2:p23 + u2:p24 + u15:p0 = 1
invariant :u12:p133 + u12:p134 + u12:p135 + u12:p136 + u12:p137 + u12:p138 + u12:p139 + u12:p140 + u12:p141 + u12:p142 + u12:p143 + u12:p144 + u15:p0 = 1
invariant :u9:p97 + u9:p98 + u9:p99 + u9:p100 + u9:p101 + u9:p102 + u9:p103 + u9:p104 + u9:p105 + u9:p106 + u9:p107 + u9:p108 + u15:p0 = 1
invariant :u10:p109 + u10:p110 + u10:p111 + u10:p112 + u10:p113 + u10:p114 + u10:p115 + u10:p116 + u10:p117 + u10:p118 + u10:p119 + u10:p120 + u15:p0 = 1
invariant :u7:p73 + u7:p74 + u7:p75 + u7:p76 + u7:p77 + u7:p78 + u7:p79 + u7:p80 + u7:p81 + u7:p82 + u7:p83 + u7:p84 + u15:p0 = 1
invariant :u8:p85 + u8:p86 + u8:p87 + u8:p88 + u8:p89 + u8:p90 + u8:p91 + u8:p92 + u8:p93 + u8:p94 + u8:p95 + u8:p96 + u15:p0 = 1
invariant :u5:p49 + u5:p50 + u5:p51 + u5:p52 + u5:p53 + u5:p54 + u5:p55 + u5:p56 + u5:p57 + u5:p58 + u5:p59 + u5:p60 + u15:p0 = 1
invariant :u6:p61 + u6:p62 + u6:p63 + u6:p64 + u6:p65 + u6:p66 + u6:p67 + u6:p68 + u6:p69 + u6:p70 + u6:p71 + u6:p72 + u15:p0 = 1
invariant :u3:p25 + u3:p26 + u3:p27 + u3:p28 + u3:p29 + u3:p30 + u3:p31 + u3:p32 + u3:p33 + u3:p34 + u3:p35 + u3:p36 + u15:p0 = 1
invariant :u13:p145 + u15:p0 = 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,0.623159,45360,1,0,65461,1794,2102,63651,309,15407,66216
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(G(F(F(G("(((u5.p60>=1)&&(u10.p119>=1))&&(u13.p145>=1))")))))))
Formula 10 simplified : !FGFG"(((u5.p60>=1)&&(u10.p119>=1))&&(u13.p145>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
41 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.03224,63260,1,0,107689,1849,2134,103070,309,16305,101012
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((("(u3.p25>=1)")U(X("(((u1.p12>=1)&&(u8.p95>=1))&&(u13.p145>=1))")))U("(((u6.p72>=1)&&(u11.p131>=1))&&(u13.p145>=1))")))
Formula 11 simplified : !(("(u3.p25>=1)" U X"(((u1.p12>=1)&&(u8.p95>=1))&&(u13.p145>=1))") U "(((u6.p72>=1)&&(u11.p131>=1))&&(u13.p145>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,1.13459,67816,1,0,119136,1860,2183,115471,309,16629,116319
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(F((F("((u7.p77>=1)&&(u14.p146>=1))"))U(G("(u12.p140>=1)"))))))
Formula 12 simplified : !GF(F"((u7.p77>=1)&&(u14.p146>=1))" U G"(u12.p140>=1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,1.18413,70704,1,0,126171,1917,2202,120245,309,17236,123978
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(X(X("(((u3.p35>=1)&&(u6.p72>=1))&&(u13.p145>=1))")))))
Formula 13 simplified : !XXX"(((u3.p35>=1)&&(u6.p72>=1))&&(u13.p145>=1))"
6 unique states visited
6 strongly connected components in search stack
6 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,1.18726,70952,1,0,126494,1917,2208,120629,309,17236,124931
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((X(("(((u7.p84>=1)&&(u10.p119>=1))&&(u13.p145>=1))")U("((u14.p146>=1)&&(u2.p21>=1))")))U((X("(((u1.p11>=1)&&(u4.p48>=1))&&(u13.p145>=1))"))U(F("(u4.p44>=1)")))))
Formula 14 simplified : !(X("(((u7.p84>=1)&&(u10.p119>=1))&&(u13.p145>=1))" U "((u14.p146>=1)&&(u2.p21>=1))") U (X"(((u1.p11>=1)&&(u4.p48>=1))&&(u13.p145>=1))" U F"(u4.p44>=1)"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2 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.21308,72652,1,0,130653,1921,2360,124488,309,17328,131239
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X(F(G(G("(u2.p24>=1)"))))))
Formula 15 simplified : !XFG"(u2.p24>=1)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.24253,74500,1,0,135347,1926,2390,129679,310,17518,137852
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-12a-LTLFireability-15 FALSE 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 1527961424844

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 02, 2018 5:43:42 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/, -smt]
Jun 02, 2018 5:43:42 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 5:43:42 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 64 ms
Jun 02, 2018 5:43:42 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 147 places.
Jun 02, 2018 5:43:42 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 448 transitions.
Jun 02, 2018 5:43:42 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Jun 02, 2018 5:43:42 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 27 ms
Jun 02, 2018 5:43:42 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 02, 2018 5:43:42 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 02, 2018 5:43:42 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 94 ms
Jun 02, 2018 5:43:42 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 02, 2018 5:43:42 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 785 redundant transitions.
Jun 02, 2018 5:43:42 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
Jun 02, 2018 5:43:42 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 02, 2018 5:43:43 PM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 122 identical transitions.
Jun 02, 2018 5:43:43 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 326 transitions.
Jun 02, 2018 5:43:43 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 14 place invariants in 47 ms
Jun 02, 2018 5:43:43 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 147 variables to be positive in 298 ms
Jun 02, 2018 5:43:43 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 326 transitions.
Jun 02, 2018 5:43:43 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/326 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 5:43:43 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 5:43:43 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 326 transitions.
Jun 02, 2018 5:43:43 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 5:43:44 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
Jun 02, 2018 5:43:44 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Jun 02, 2018 5:43:44 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (>= (select s0 44) 1) (>= (select s0 145) 1)) (= (store (store s0 43 (+ (select s0 43) 1)) 44 (- (select s0 44) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (>= (select s0 44) 1) (>= (select s0 145) 1)) (= (store (store s0 43 (+ (select s0 43) 1)) 44 (- (select s0 44) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:755)
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 02, 2018 5:43:44 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1578ms 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="FlexibleBarrier-PT-12a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-12a.tgz
mv FlexibleBarrier-PT-12a 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 FlexibleBarrier-PT-12a, 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 r248-blw7-152732549700046"
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 ;