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 208K
-rw-r--r-- 1 mcc users 3.6K May 30 21:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 30 21:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 15:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 15:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 28 09:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.5K May 28 09:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 28 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.7K May 28 06:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 28 06:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 27 03:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 27 03:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 33K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is DoubleExponent-PT-002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r284-csrt-152749174700195
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527921554609

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 : !((((F("((p24>=1)&&(p42>=1))"))U(X("(p100>=1)")))U((G("(p41>=1)"))U(X("((p71>=1)&&(p89>=1))")))))
Formula 0 simplified : !((F"((p24>=1)&&(p42>=1))" U X"(p100>=1)") U (G"(p41>=1)" U X"((p71>=1)&&(p89>=1))"))
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 98 rows 110 cols
invariant :p100 + p101 + p103 + p104 + p105 + p106 + p107 + -1'p20 + p56 + -1'p57 + p59 + -1'p60 + p64 + p76 + p79 + p81 + -1'p83 + p93 + -1'p95 + p97 + p98 + p99 = 0
invariant :p108 + -1'p110 + -1'p66 + -1'p67 = 0
invariant :p109 + -1'p110 + -1'p67 = 0
invariant :p69 + -1'p73 + -1'p74 + -1'p75 + -1'p76 + -1'p77 + -1'p78 + -1'p79 + -1'p80 + -1'p81 + -1'p82 + -1'p83 + -1'p84 = 0
invariant :p100 + p101 + p103 + p104 + p105 + p107 + -1'p20 + -1'p24 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p56 + -1'p57 + p59 + -1'p60 + p64 + p76 + p79 + p81 + -1'p83 + p93 + -1'p95 + p97 + p98 + p99 = 0
invariant :2'p1 + p10 + p100 + p11 + p17 + 2'p2 + p29 + p3 + p32 + p4 + p5 = 2
invariant :2'p1 + p12 + p13 + 2'p2 + 2'p3 + -1'p34 + p4 + -1'p46 + p5 + p51 + p53 + p6 = 2
invariant :-1'p19 + p55 + -1'p56 + p58 + -1'p59 + p62 + -1'p64 + -1'p76 + -1'p79 + p88 + p91 = 0
invariant :p71 + -1'p85 + -1'p86 + -1'p87 + -1'p88 + -1'p89 + -1'p90 + -1'p91 + -1'p92 + -1'p93 + -1'p94 + -1'p95 + -1'p96 = 0
invariant :-1'p104 + -1'p22 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 = 0
invariant :p102 + p20 + -1'p56 + p57 + -1'p59 + p60 + -1'p64 + -1'p76 + -1'p79 + -1'p81 + -1'p93 = 0
invariant :-1'p36 + -1'p48 + p50 + p51 + p52 + p53 + p54 = 0
invariant :p1 + p14 + p15 + p16 + p17 + p18 + p19 + p2 + p20 + p21 + p22 + p23 + p24 + p25 + p3 + p4 + p5 + p6 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p7 + p70 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 = 1
invariant :2'p1 + p15 + p2 + p3 + p4 + p41 + p44 + p8 + p9 + p98 = 2
Reverse transition relation is NOT exact ! Due to transitions t16, t19, t25, t30, t37, t42, t49, t51, t58, t61, t67, t7, t72, t73, t79, t84, t85, t88, t9, t94, t97, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/77/21/98
Computing Next relation with stutter on 396 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
104 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.10116,57148,1,0,424,139377,240,346,3186,112291,747
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(((F(F(G("(p94>=1)"))))U(F("(p47>=1)"))))
Formula 1 simplified : !(FG"(p94>=1)" U F"(p47>=1)")
Computing Next relation with stutter on 396 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
18 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.27627,64276,1,0,918,174095,249,793,3187,172020,1694
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G(F(F("(p82>=1)")))))
Formula 2 simplified : !GF"(p82>=1)"
Computing Next relation with stutter on 396 deadlock states
888 unique states visited
888 strongly connected components in search stack
889 transitions explored
888 items max in DFS search stack
186 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.14419,111180,1,0,4668,368641,262,4762,3355,492787,10791
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(((X(G(X("(p79>=1)"))))U(F(G("((p71>=1)&&(p96>=1))")))))
Formula 3 simplified : !(XGX"(p79>=1)" U FG"((p71>=1)&&(p96>=1))")
Computing Next relation with stutter on 396 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
174 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.8836,157048,1,0,8384,561770,275,9917,3357,883717,23920
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((F(X(G(G("(p6>=1)"))))))
Formula 4 simplified : !FXG"(p6>=1)"
Computing Next relation with stutter on 396 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
39 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.27187,172888,1,0,10149,576901,288,13440,3358,925495,34545
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(("(p76>=1)"))
Formula 5 simplified : !"(p76>=1)"
Computing Next relation with stutter on 396 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.27585,172888,1,0,10149,576935,293,13440,3359,925516,34552
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X(F(X(X(G("((p22>=1)&&(p30>=1))")))))))
Formula 6 simplified : !XFXXG"((p22>=1)&&(p30>=1))"
Computing Next relation with stutter on 396 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
49 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.75848,188464,1,0,12896,602251,306,17110,3362,982770,45323
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("(p53>=1)"))
Formula 7 simplified : !"(p53>=1)"
Computing Next relation with stutter on 396 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.7592,188464,1,0,12896,602251,309,17110,3363,982771,45325
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((F((X(G("(p33>=1)")))U(G(X("(p68>=1)"))))))
Formula 8 simplified : !F(XG"(p33>=1)" U GX"(p68>=1)")
Computing Next relation with stutter on 396 deadlock states
887 unique states visited
886 strongly connected components in search stack
888 transitions explored
887 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,6.12157,190048,1,0,14807,615144,314,19281,3364,1.14219e+06,49912
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(((X("((p46>=1)&&(p13>=1))"))U(X(X("((p46>=1)&&(p13>=1))")))))
Formula 9 simplified : !(X"((p46>=1)&&(p13>=1))" U XX"((p46>=1)&&(p13>=1))")
Computing Next relation with stutter on 396 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.12742,190048,1,0,14807,615178,318,19281,3367,1.14221e+06,49921
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G(G(G(F("((p48>=1)&&(p54>=1))"))))))
Formula 10 simplified : !GF"((p48>=1)&&(p54>=1))"
Computing Next relation with stutter on 396 deadlock states
888 unique states visited
888 strongly connected components in search stack
889 transitions explored
888 items max in DFS search stack
55 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.67239,206680,1,0,17413,707391,327,21033,3370,1.2373e+06,54325
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((G(X(X(G(F("(p86>=1)")))))))
Formula 11 simplified : !GXXGF"(p86>=1)"
Computing Next relation with stutter on 396 deadlock states
888 unique states visited
888 strongly connected components in search stack
889 transitions explored
888 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,6.81692,209584,1,0,19699,727586,336,22557,3371,1.26256e+06,58385
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G(F("((p10>=1)&&(p16>=1))"))))
Formula 12 simplified : !GF"((p10>=1)&&(p16>=1))"
Computing Next relation with stutter on 396 deadlock states
888 unique states visited
888 strongly connected components in search stack
889 transitions explored
888 items max in DFS search stack
17 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.9859,216184,1,0,19856,740392,345,22683,3374,1.27657e+06,60350
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X(F(("(p26>=1)")U("(p85>=1)")))))
Formula 13 simplified : !XF("(p26>=1)" U "(p85>=1)")
Computing Next relation with stutter on 396 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
15 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.12518,218824,1,0,20850,751474,354,23989,3375,1.31253e+06,63018
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((F((X(F("(p20>=1)")))U(("(p98>=1)")U("(p45>=1)")))))
Formula 14 simplified : !F(XF"(p20>=1)" U ("(p98>=1)" U "(p45>=1)"))
Computing Next relation with stutter on 396 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,7.25655,223048,1,0,21231,771121,363,24301,3376,1.3391e+06,63798
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G(("(p53>=1)")U("(p33>=1)"))))
Formula 15 simplified : !G("(p53>=1)" U "(p33>=1)")
Computing Next relation with stutter on 396 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.25831,223312,1,0,21231,771121,377,24301,3384,1.3391e+06,63805
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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 1527921566194

--------------------
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 6:39:16 AM 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 6:39:16 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 6:39:16 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 46 ms
Jun 02, 2018 6:39:16 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 110 places.
Jun 02, 2018 6:39:16 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 98 transitions.
Jun 02, 2018 6:39:16 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 16 ms
Jun 02, 2018 6:39:17 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 44 ms
Jun 02, 2018 6:39:17 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
Jun 02, 2018 6:39:17 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 02, 2018 6:39:17 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 98 transitions.
Jun 02, 2018 6:39:17 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 14 place invariants in 31 ms
Jun 02, 2018 6:39:17 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 110 variables to be positive in 177 ms
Jun 02, 2018 6:39:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 98 transitions.
Jun 02, 2018 6:39:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/98 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 6:39:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 6:39:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 98 transitions.
Jun 02, 2018 6:39:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 6:39:18 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 98 transitions.
Jun 02, 2018 6:39:20 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(13/98) took 2178 ms. Total solver calls (SAT/UNSAT): 822(119/703)
Jun 02, 2018 6:39:23 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(30/98) took 5179 ms. Total solver calls (SAT/UNSAT): 1146(399/747)
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.computeCoEnablingMatrix(NecessaryEnablingsolver.java:480)
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)
Jun 02, 2018 6:39:25 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 8650ms 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="DoubleExponent-PT-002"
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/DoubleExponent-PT-002.tgz
mv DoubleExponent-PT-002 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 DoubleExponent-PT-002, 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 r284-csrt-152749174700195"
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 ;