Execution Chart

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

Trace from the execution

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

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

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Raft-PT-05-LTLFireability-00
FORMULA_NAME Raft-PT-05-LTLFireability-01
FORMULA_NAME Raft-PT-05-LTLFireability-02
FORMULA_NAME Raft-PT-05-LTLFireability-03
FORMULA_NAME Raft-PT-05-LTLFireability-04
FORMULA_NAME Raft-PT-05-LTLFireability-05
FORMULA_NAME Raft-PT-05-LTLFireability-06
FORMULA_NAME Raft-PT-05-LTLFireability-07
FORMULA_NAME Raft-PT-05-LTLFireability-08
FORMULA_NAME Raft-PT-05-LTLFireability-09
FORMULA_NAME Raft-PT-05-LTLFireability-10
FORMULA_NAME Raft-PT-05-LTLFireability-11
FORMULA_NAME Raft-PT-05-LTLFireability-12
FORMULA_NAME Raft-PT-05-LTLFireability-13
FORMULA_NAME Raft-PT-05-LTLFireability-14
FORMULA_NAME Raft-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1552933686910

Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903111103/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/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.201903111103/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 : !((((X("(u27.p131>=1)"))U(F("(u28.p0>=1)")))U(X(G("((u24.p120>=1)&&(u15.p75>=1))")))))
Formula 0 simplified : !((X"(u27.p131>=1)" U F"(u28.p0>=1)") U XG"((u24.p120>=1)&&(u15.p75>=1))")
built 52 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t237, u21.t29, u21.t30, u21.t31, u21.t32, u21.t34, u22.t23, u22.t24, u22.t25, u22.t26, u22.t28, u23.t17, u23.t18, u23.t19, u23.t20, u23.t22, u24.t11, u24.t12, u24.t13, u24.t14, u24.t16, u25.t5, u25.t6, u25.t7, u25.t8, u25.t10, u27.t235, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :22/194/22/238
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
26 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.326694,22968,1,0,11648,223,2156,14900,202,874,29527
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(G(X("(u21.p105>=1)"))))))
Formula 1 simplified : !XXGX"(u21.p105>=1)"
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.396468,26188,1,0,18819,223,2217,24563,203,904,43876
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F("(u22.p110>=1)")))
Formula 2 simplified : !F"(u22.p110>=1)"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.400955,26452,1,0,18820,223,2272,24566,203,904,44035
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Raft-PT-05-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("((u25.p125>=1)&&(u17.p85>=1))"))
Formula 3 simplified : !"((u25.p125>=1)&&(u17.p85>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,0.426216,26980,1,0,20128,223,2277,27182,203,906,48591
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(("((u21.p105>=1)&&(u17.p81>=1))")U(X(F("((u27.p130>=1)&&(u26.p129>=1))"))))))
Formula 4 simplified : !F("((u21.p105>=1)&&(u17.p81>=1))" U XF"((u27.p130>=1)&&(u26.p129>=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.43195,27244,1,0,20514,223,2296,27837,203,955,49703
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G("(u24.p120>=1)")))
Formula 5 simplified : !G"(u24.p120>=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.433589,27508,1,0,20514,223,2310,27837,203,955,49719
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(("((u25.p125>=1)&&(u20.p100>=1))"))
Formula 6 simplified : !"((u25.p125>=1)&&(u20.p100>=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.433989,27508,1,0,20514,223,2315,27837,203,955,49724
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((((G("((u21.p105>=1)&&(u9.p44>=1))"))U(X("((u23.p115>=1)&&(u15.p72>=1))")))U(X("((u21.p105>=1)&&(u3.p15>=1))"))))
Formula 7 simplified : !((G"((u21.p105>=1)&&(u9.p44>=1))" U X"((u23.p115>=1)&&(u15.p72>=1))") U X"((u21.p105>=1)&&(u3.p15>=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.439204,28652,1,0,20514,223,2353,27837,203,955,49827
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Raft-PT-05-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(("((u25.p125>=1)&&(u17.p85>=1))"))
Formula 8 simplified : !"((u25.p125>=1)&&(u17.p85>=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.439626,28652,1,0,20514,223,2353,27837,203,955,49827
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((X("((u24.p120>=1)&&(u14.p70>=1))"))U((X("((u21.p105>=1)&&(u3.p15>=1))"))U("(u21.p102>=1)"))))
Formula 9 simplified : !(X"((u24.p120>=1)&&(u14.p70>=1))" U (X"((u21.p105>=1)&&(u3.p15>=1))" U "(u21.p102>=1)"))
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.547793,32808,1,0,31024,223,2478,43828,206,989,71009
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(G((X("(u21.p104>=1)"))U(X("((u21.p105>=1)&&(u9.p44>=1))"))))))
Formula 10 simplified : !G(X"(u21.p104>=1)" U X"((u21.p105>=1)&&(u9.p44>=1))")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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,0.569758,33600,1,0,32676,223,2484,47011,207,1050,75319
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F("(u23.p113>=1)")))
Formula 11 simplified : !F"(u23.p113>=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,0.615389,35184,1,0,35685,227,2536,51382,208,1087,83753
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Checking formula 12 : !((F(X("((u22.p110>=1)&&(u6.p30>=1))"))))
Formula 12 simplified : !FX"((u22.p110>=1)&&(u6.p30>=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.617343,35448,1,0,35685,227,2557,51382,208,1087,83784
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA Raft-PT-05-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(("((u22.p110>=1)&&(u10.p46>=1))")U(X(X("((u23.p115>=1)&&(u11.p55>=1))"))))))
Formula 13 simplified : !G("((u22.p110>=1)&&(u10.p46>=1))" U XX"((u23.p115>=1)&&(u11.p55>=1))")
Normalized transition count is 195
// Phase 1: matrix 195 rows 133 cols
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 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.649033,36200,1,0,37771,232,2567,54679,208,1116,87139
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((((G("((u22.p110>=1)&&(u5.p25>=1))"))U("((u21.p105>=1)&&(u13.p63>=1))"))U(G(F(G("((u21.p105>=1)&&(u4.p20>=1))"))))))
Formula 14 simplified : !((G"((u22.p110>=1)&&(u5.p25>=1))" U "((u21.p105>=1)&&(u13.p63>=1))") U GFG"((u21.p105>=1)&&(u4.p20>=1))")
invariant :u20:p96 + u20:p97 + u20:p98 + u20:p99 + u20:p100 + u28:p0 = 1
invariant :u7:p31 + u7:p32 + u7:p33 + u7:p34 + u7:p35 + u28:p0 = 1
invariant :u10:p46 + u10:p47 + u10:p48 + u10:p49 + u10:p50 + u28:p0 = 1
invariant :u3:p11 + u3:p12 + u3:p13 + u3:p14 + u3:p15 + u28:p0 = 1
invariant :u8:p36 + u8:p37 + u8:p38 + u8:p39 + u8:p40 + u28:p0 = 1
invariant :u22:p106 + u22:p107 + u22:p108 + u22:p109 + u22:p110 + u28:p0 = 1
invariant :u23:p111 + u23:p112 + u23:p113 + u23:p114 + u23:p115 + u28:p0 = 1
invariant :u16:p76 + u16:p77 + u16:p78 + u16:p79 + u16:p80 + u28:p0 = 1
invariant :u19:p91 + u19:p92 + u19:p93 + u19:p94 + u19:p95 + u28:p0 = 1
invariant :u25:p121 + u25:p122 + u25:p123 + u25:p124 + u25:p125 + u28:p0 = 1
invariant :u21:p101 + u21:p102 + u21:p103 + u21:p104 + u21:p105 + u28:p0 = 1
invariant :u5:p21 + u5:p22 + u5:p23 + u5:p24 + u5:p25 + u28:p0 = 1
invariant :u9:p41 + u9:p42 + u9:p43 + u9:p44 + u9:p45 + u28:p0 = 1
invariant :u13:p61 + u13:p62 + u13:p63 + u13:p64 + u13:p65 + u28:p0 = 1
invariant :u15:p71 + u15:p72 + u15:p73 + u15:p74 + u15:p75 + u28:p0 = 1
invariant :u18:p86 + u18:p87 + u18:p88 + u18:p89 + u18:p90 + u28:p0 = 1
invariant :u12:p56 + u12:p57 + u12:p58 + u12:p59 + u12:p60 + u28:p0 = 1
invariant :u24:p116 + u24:p117 + u24:p118 + u24:p119 + u24:p120 + u28:p0 = 1
invariant :u11:p51 + u11:p52 + u11:p53 + u11:p54 + u11:p55 + u28:p0 = 1
invariant :u4:p16 + u4:p17 + u4:p18 + u4:p19 + u4:p20 + u28:p0 = 1
invariant :u14:p66 + u14:p67 + u14:p68 + u14:p69 + u14:p70 + u28:p0 = 1
invariant :u2:p6 + u2:p7 + u2:p8 + u2:p9 + u2:p10 + u28:p0 = 1
invariant :u6:p26 + u6:p27 + u6:p28 + u6:p29 + u6:p30 + u28:p0 = 1
invariant :u1:p1 + u1:p2 + u1:p3 + u1:p4 + u1:p5 + u28:p0 = 1
invariant :u17:p81 + u17:p82 + u17:p83 + u17:p84 + u17:p85 + u28:p0 = 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
71 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.35834,66228,1,0,104147,237,2594,173290,208,1195,164591
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Raft-PT-05-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X((F(F("((u21.p105>=1)&&(u9.p43>=1))")))U(("((u25.p125>=1)&&(u20.p100>=1))")U("((u23.p115>=1)&&(u12.p60>=1))")))))
Formula 15 simplified : !X(F"((u21.p105>=1)&&(u9.p43>=1))" U ("((u25.p125>=1)&&(u20.p100>=1))" U "((u23.p115>=1)&&(u12.p60>=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,1.36077,66752,1,0,104147,237,2623,173290,208,1195,164618
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA Raft-PT-05-LTLFireability-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, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1552933694601

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /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 -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
Mar 18, 2019 6:28:10 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]
Mar 18, 2019 6:28:10 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 18, 2019 6:28:10 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 135 ms
Mar 18, 2019 6:28:10 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 133 places.
Mar 18, 2019 6:28:10 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 238 transitions.
Mar 18, 2019 6:28:10 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Mar 18, 2019 6:28:10 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 28 ms
Mar 18, 2019 6:28:10 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Mar 18, 2019 6:28:10 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 162 ms
Mar 18, 2019 6:28:11 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 73 ms
Mar 18, 2019 6:28:11 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Mar 18, 2019 6:28:11 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Mar 18, 2019 6:28:11 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 8 events :t50,t50,t50,t50,t45,t45,t45,t45,
Mar 18, 2019 6:28:11 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 30 events :t47,t47,t47,t47,t47,t47,t47,t47,t47,t47,t47,t47,t47,t47,t47,t47,t151,t151,t151,t147,t147,t147,t143,t143,t143,t47,t47,t47,t47,t47,
Mar 18, 2019 6:28:11 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 10 events :t236,t35,t35,t35,t35,t35,t35,t35,t35,t35,
Mar 18, 2019 6:28:11 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 30 events :t46,t46,t46,t46,t46,t46,t46,t46,t46,t46,t46,t46,t46,t46,t46,t46,t119,t119,t119,t115,t115,t115,t111,t111,t111,t46,t46,t46,t46,t46,
Mar 18, 2019 6:28:11 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 30 events :t49,t49,t49,t49,t227,t227,t227,t223,t223,t223,t219,t219,t219,t49,t49,t49,t49,t49,t49,t49,t49,t49,t49,t49,t49,t49,t49,t49,t49,t49,
Mar 18, 2019 6:28:11 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 30 events :t48,t48,t48,t48,t195,t195,t195,t191,t191,t191,t187,t187,t187,t48,t48,t48,t48,t48,t48,t48,t48,t48,t48,t48,t48,t48,t48,t48,t48,t48,
Mar 18, 2019 6:28:11 PM fr.lip6.move.gal.instantiate.Instantiator dropEvents
INFO: Dropping 30 events :t45,t45,t45,t45,t45,t45,t45,t45,t45,t45,t45,t45,t45,t45,t45,t45,t87,t87,t87,t83,t83,t83,t79,t79,t79,t45,t45,t45,t45,t45,
Mar 18, 2019 6:28:11 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 168 redundant transitions.
Mar 18, 2019 6:28:11 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 229 ms
Mar 18, 2019 6:28:11 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 12 ms
Mar 18, 2019 6:28:11 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Mar 18, 2019 6:28:11 PM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 22 identical transitions.
Mar 18, 2019 6:28:11 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 216 transitions.
Mar 18, 2019 6:28:12 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 25 place invariants in 88 ms
Mar 18, 2019 6:28:12 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 133 variables to be positive in 417 ms
Mar 18, 2019 6:28:12 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 216 transitions.
Mar 18, 2019 6:28:12 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/216 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 18, 2019 6:28:12 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 18, 2019 6:28:12 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 216 transitions.
Mar 18, 2019 6:28:12 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:766)
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)
Mar 18, 2019 6:28:13 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1684ms conformant to PINS in folder :/home/mcc/execution

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Raft-PT-05"
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

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

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "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 ;