fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r090-csrt-149441076300006
Last Updated
June 27, 2017

About the Execution of ITS-Tools for S_AirplaneLD-COL-0010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
559.320 12230.00 26275.00 209.10 FTFFFFFTFFFFFFFF 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)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool itstools
Input is S_AirplaneLD-COL-0010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r090-csrt-149441076300006
=====================================================================


--------------------
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 AirplaneLD-COL-0010-LTLFireability-0
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-1
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-10
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-11
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-12
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-13
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-14
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-15
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-2
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-3
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-4
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-5
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-6
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-7
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-8
FORMULA_NAME AirplaneLD-COL-0010-LTLFireability-9

=== Now, execution of the tool begins

BK_START 1496380698555


Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/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(G((("P1.P1[0]>=1")&&("Weight0.Weight_Left_Wheel_0>=1"))U(X((((((("P5.P5[0]>=1")&&("Speed0.Speed_Right_Wheel_0>=1"))||(("P5.P5[0]>=1")&&("Speed1.Speed_Right_Wheel_1>=1")))||(("P5.P5[0]>=1")&&("Speed2.Speed_Right_Wheel_2>=1")))||(("P5.P5[0]>=1")&&("Speed3.Speed_Right_Wheel_3>=1")))||(("P5.P5[0]>=1")&&("Speed4.Speed_Right_Wheel_4>=1")))||(("P5.P5[0]>=1")&&("Speed9.Speed_Right_Wheel_9>=1"))))))))
Formula 0 simplified : !FG(("P1.P1[0]>=1" & "Weight0.Weight_Left_Wheel_0>=1") U X(("P5.P5[0]>=1" & "Speed0.Speed_Right_Wheel_0>=1") | ("P5.P5[0]>=1" & "Speed1.Speed_Right_Wheel_1>=1") | ("P5.P5[0]>=1" & "Speed2.Speed_Right_Wheel_2>=1") | ("P5.P5[0]>=1" & "Speed3.Speed_Right_Wheel_3>=1") | ("P5.P5[0]>=1" & "Speed4.Speed_Right_Wheel_4>=1") | ("P5.P5[0]>=1" & "Speed9.Speed_Right_Wheel_9>=1")))
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 88 rows 57 cols
invariant : -1'Signal0:Plane_On_Ground_Signal_no_0 + -1'Signal1:Plane_On_Ground_Signal_no_1 + 1'P6:P6[0]= 0
invariant : 1'Signal0:Plane_On_Ground_Signal_no_0 + 1'Signal1:Plane_On_Ground_Signal_no_1 + 1'P5:P5[0] + 1'P4:P4[0] + 1'P3:P3[0] + 1'P2:P2[0] + 1'P1:P1[0]= 1
invariant : 1'Signal0:Plane_On_Ground_Signal_no_0 + 1'Signal1:Plane_On_Ground_Signal_no_1 + 1'stp1:stp1[0] + 1'P5:P5[0] + 1'P4:P4[0] + 1'P3:P3[0] + 1'P2:P2[0] + 1'Weight0:Weight_Left_Wheel_0 + 1'Weight1:Weight_Left_Wheel_1= 1
12 unique states visited
11 strongly connected components in search stack
13 transitions explored
12 items max in DFS search stack
31 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.392871,43740,1,0,41128,181,1042,42527,36,163,88275
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AirplaneLD-COL-0010-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("stp3.stp3[0]>=1"))
Formula 1 simplified : !"stp3.stp3[0]>=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.393387,43800,1,0,41128,181,1045,42527,36,163,88292
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA AirplaneLD-COL-0010-LTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((("Weight1.Weight_Left_Wheel_1>=1")&&("P1.P1[0]>=1")))
Formula 2 simplified : !("P1.P1[0]>=1" & "Weight1.Weight_Left_Wheel_1>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.397408,43844,1,0,41841,181,1055,42889,36,163,89809
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA AirplaneLD-COL-0010-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((G(("stp3.stp3[0]>=1")U("stp3.stp3[0]>=1")))U((((((("P4.P4[0]>=1")&&("Speed0.Speed_Left_Wheel_0>=1"))||(("P4.P4[0]>=1")&&("Speed1.Speed_Left_Wheel_1>=1")))||(("P4.P4[0]>=1")&&("Speed2.Speed_Left_Wheel_2>=1")))||(("P4.P4[0]>=1")&&("Speed3.Speed_Left_Wheel_3>=1")))||(("P4.P4[0]>=1")&&("Speed4.Speed_Left_Wheel_4>=1")))||(("P4.P4[0]>=1")&&("Speed9.Speed_Left_Wheel_9>=1")))))
Formula 3 simplified : !(G"stp3.stp3[0]>=1" U (("P4.P4[0]>=1" & "Speed0.Speed_Left_Wheel_0>=1") | ("P4.P4[0]>=1" & "Speed1.Speed_Left_Wheel_1>=1") | ("P4.P4[0]>=1" & "Speed2.Speed_Left_Wheel_2>=1") | ("P4.P4[0]>=1" & "Speed3.Speed_Left_Wheel_3>=1") | ("P4.P4[0]>=1" & "Speed4.Speed_Left_Wheel_4>=1") | ("P4.P4[0]>=1" & "Speed9.Speed_Left_Wheel_9>=1")))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.437413,45396,1,0,45868,181,1137,47704,36,163,98138
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA AirplaneLD-COL-0010-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(G((G(("Weight1.Weight_Left_Wheel_1>=1")&&("P1.P1[0]>=1")))U(X(("Weight1.Weight_Right_Wheel_1>=1")&&("P2.P2[0]>=1")))))))
Formula 4 simplified : !FG(G("P1.P1[0]>=1" & "Weight1.Weight_Left_Wheel_1>=1") U X("P2.P2[0]>=1" & "Weight1.Weight_Right_Wheel_1>=1"))
9 unique states visited
8 strongly connected components in search stack
10 transitions explored
9 items max in DFS search stack
16 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.603523,52864,1,0,65451,181,1221,64223,36,163,141516
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA AirplaneLD-COL-0010-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F((((("Speed5.Speed_Left_Wheel_5>=1")&&("P4.P4[0]>=1"))||(("Speed6.Speed_Left_Wheel_6>=1")&&("P4.P4[0]>=1")))||(("Speed7.Speed_Left_Wheel_7>=1")&&("P4.P4[0]>=1")))||(("Speed8.Speed_Left_Wheel_8>=1")&&("P4.P4[0]>=1")))))
Formula 5 simplified : !F(("P4.P4[0]>=1" & "Speed5.Speed_Left_Wheel_5>=1") | ("P4.P4[0]>=1" & "Speed6.Speed_Left_Wheel_6>=1") | ("P4.P4[0]>=1" & "Speed7.Speed_Left_Wheel_7>=1") | ("P4.P4[0]>=1" & "Speed8.Speed_Left_Wheel_8>=1"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
5 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.658668,55944,1,0,73246,181,1274,72041,36,163,157741
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA AirplaneLD-COL-0010-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((G(G(G("stp1.stp1[0]>=1"))))U(X(X(X(("Weight1.Weight_Left_Wheel_1>=1")&&("P1.P1[0]>=1")))))))
Formula 6 simplified : !(G"stp1.stp1[0]>=1" U XXX("P1.P1[0]>=1" & "Weight1.Weight_Left_Wheel_1>=1"))
8 unique states visited
8 strongly connected components in search stack
8 transitions explored
8 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.735912,60260,1,0,85795,181,1303,79805,36,163,185834
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA AirplaneLD-COL-0010-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(F((F((((("P5.P5[0]>=1")&&("Speed5.Speed_Right_Wheel_5>=1"))||(("P5.P5[0]>=1")&&("Speed6.Speed_Right_Wheel_6>=1")))||(("P5.P5[0]>=1")&&("Speed7.Speed_Right_Wheel_7>=1")))||(("P5.P5[0]>=1")&&("Speed8.Speed_Right_Wheel_8>=1"))))U(G("stp1.stp1[0]>=1"))))))
Formula 7 simplified : !F(F(("P5.P5[0]>=1" & "Speed5.Speed_Right_Wheel_5>=1") | ("P5.P5[0]>=1" & "Speed6.Speed_Right_Wheel_6>=1") | ("P5.P5[0]>=1" & "Speed7.Speed_Right_Wheel_7>=1") | ("P5.P5[0]>=1" & "Speed8.Speed_Right_Wheel_8>=1")) U G"stp1.stp1[0]>=1")
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,0.864425,66020,1,0,98177,181,1362,93736,36,163,214034
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA AirplaneLD-COL-0010-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(X((((((("P5.P5[0]>=1")&&("Speed0.Speed_Right_Wheel_0>=1"))||(("P5.P5[0]>=1")&&("Speed1.Speed_Right_Wheel_1>=1")))||(("P5.P5[0]>=1")&&("Speed2.Speed_Right_Wheel_2>=1")))||(("P5.P5[0]>=1")&&("Speed3.Speed_Right_Wheel_3>=1")))||(("P5.P5[0]>=1")&&("Speed4.Speed_Right_Wheel_4>=1")))||(("P5.P5[0]>=1")&&("Speed9.Speed_Right_Wheel_9>=1"))))))
Formula 8 simplified : !XX(("P5.P5[0]>=1" & "Speed0.Speed_Right_Wheel_0>=1") | ("P5.P5[0]>=1" & "Speed1.Speed_Right_Wheel_1>=1") | ("P5.P5[0]>=1" & "Speed2.Speed_Right_Wheel_2>=1") | ("P5.P5[0]>=1" & "Speed3.Speed_Right_Wheel_3>=1") | ("P5.P5[0]>=1" & "Speed4.Speed_Right_Wheel_4>=1") | ("P5.P5[0]>=1" & "Speed9.Speed_Right_Wheel_9>=1"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.875379,66372,1,0,99272,181,1362,94554,36,163,217543
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA AirplaneLD-COL-0010-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((X(X(F((((("Speed5.Speed_Left_Wheel_5>=1")&&("P4.P4[0]>=1"))||(("Speed6.Speed_Left_Wheel_6>=1")&&("P4.P4[0]>=1")))||(("Speed7.Speed_Left_Wheel_7>=1")&&("P4.P4[0]>=1")))||(("Speed8.Speed_Left_Wheel_8>=1")&&("P4.P4[0]>=1"))))))U((G("stp5.stp5[0]>=1"))U(X("stp1.stp1[0]>=1")))))
Formula 9 simplified : !(XXF(("P4.P4[0]>=1" & "Speed5.Speed_Left_Wheel_5>=1") | ("P4.P4[0]>=1" & "Speed6.Speed_Left_Wheel_6>=1") | ("P4.P4[0]>=1" & "Speed7.Speed_Left_Wheel_7>=1") | ("P4.P4[0]>=1" & "Speed8.Speed_Left_Wheel_8>=1")) U (G"stp5.stp5[0]>=1" U X"stp1.stp1[0]>=1"))
6 unique states visited
6 strongly connected components in search stack
6 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.919062,67628,1,0,102754,181,1379,99325,36,163,227339
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA AirplaneLD-COL-0010-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((("P1.P1[0]>=1")&&("Weight0.Weight_Left_Wheel_0>=1")))
Formula 10 simplified : !("P1.P1[0]>=1" & "Weight0.Weight_Left_Wheel_0>=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.919834,67888,1,0,102754,181,1379,99325,36,163,227388
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA AirplaneLD-COL-0010-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((X(F(F(("P1.P1[0]>=1")&&("Weight0.Weight_Left_Wheel_0>=1")))))U(((((("Speed5.Speed_Left_Wheel_5>=1")&&("P4.P4[0]>=1"))||(("Speed6.Speed_Left_Wheel_6>=1")&&("P4.P4[0]>=1")))||(("Speed7.Speed_Left_Wheel_7>=1")&&("P4.P4[0]>=1")))||(("Speed8.Speed_Left_Wheel_8>=1")&&("P4.P4[0]>=1")))U(X("stp3.stp3[0]>=1")))))
Formula 11 simplified : !(XF("P1.P1[0]>=1" & "Weight0.Weight_Left_Wheel_0>=1") U ((("P4.P4[0]>=1" & "Speed5.Speed_Left_Wheel_5>=1") | ("P4.P4[0]>=1" & "Speed6.Speed_Left_Wheel_6>=1") | ("P4.P4[0]>=1" & "Speed7.Speed_Left_Wheel_7>=1") | ("P4.P4[0]>=1" & "Speed8.Speed_Left_Wheel_8>=1")) U X"stp3.stp3[0]>=1"))
11 unique states visited
11 strongly connected components in search stack
11 transitions explored
11 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.997341,68944,1,0,105373,181,1407,102778,36,163,234461
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA AirplaneLD-COL-0010-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F((G("stp3.stp3[0]>=1"))U(X(F(("Weight1.Weight_Left_Wheel_1>=1")&&("P1.P1[0]>=1")))))))
Formula 12 simplified : !F(G"stp3.stp3[0]>=1" U XF("P1.P1[0]>=1" & "Weight1.Weight_Left_Wheel_1>=1"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,1.07438,71404,1,0,111305,181,1456,107703,36,163,250676
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA AirplaneLD-COL-0010-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((("stp3.stp3[0]>=1")U(G("stp2.stp2[0]>=1"))))
Formula 13 simplified : !("stp3.stp3[0]>=1" U G"stp2.stp2[0]>=1")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,1.14544,75464,1,0,122201,181,1531,117730,36,163,273998
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA AirplaneLD-COL-0010-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((X(X(G(("Weight1.Weight_Left_Wheel_1>=1")&&("P1.P1[0]>=1")))))U((G(((((((((((("P3.P3[0]>=1")&&("Altitude9.TheAltitude_9>=1"))||(("P3.P3[0]>=1")&&("Altitude10.TheAltitude_10>=1")))||(("P3.P3[0]>=1")&&("Altitude11.TheAltitude_11>=1")))||(("P3.P3[0]>=1")&&("Altitude12.TheAltitude_12>=1")))||(("P3.P3[0]>=1")&&("Altitude13.TheAltitude_13>=1")))||(("P3.P3[0]>=1")&&("Altitude14.TheAltitude_14>=1")))||(("P3.P3[0]>=1")&&("Altitude15.TheAltitude_15>=1")))||(("P3.P3[0]>=1")&&("Altitude16.TheAltitude_16>=1")))||(("P3.P3[0]>=1")&&("Altitude17.TheAltitude_17>=1")))||(("P3.P3[0]>=1")&&("Altitude18.TheAltitude_18>=1")))||(("P3.P3[0]>=1")&&("Altitude19.TheAltitude_19>=1"))))U(X((((((("P5.P5[0]>=1")&&("Speed0.Speed_Right_Wheel_0>=1"))||(("P5.P5[0]>=1")&&("Speed1.Speed_Right_Wheel_1>=1")))||(("P5.P5[0]>=1")&&("Speed2.Speed_Right_Wheel_2>=1")))||(("P5.P5[0]>=1")&&("Speed3.Speed_Right_Wheel_3>=1")))||(("P5.P5[0]>=1")&&("Speed4.Speed_Right_Wheel_4>=1")))||(("P5.P5[0]>=1")&&("Speed9.Speed_Right_Wheel_9>=1")))))))
Formula 14 simplified : !(XXG("P1.P1[0]>=1" & "Weight1.Weight_Left_Wheel_1>=1") U (G(("Altitude9.TheAltitude_9>=1" & "P3.P3[0]>=1") | ("Altitude10.TheAltitude_10>=1" & "P3.P3[0]>=1") | ("Altitude11.TheAltitude_11>=1" & "P3.P3[0]>=1") | ("Altitude12.TheAltitude_12>=1" & "P3.P3[0]>=1") | ("Altitude13.TheAltitude_13>=1" & "P3.P3[0]>=1") | ("Altitude14.TheAltitude_14>=1" & "P3.P3[0]>=1") | ("Altitude15.TheAltitude_15>=1" & "P3.P3[0]>=1") | ("Altitude16.TheAltitude_16>=1" & "P3.P3[0]>=1") | ("Altitude17.TheAltitude_17>=1" & "P3.P3[0]>=1") | ("Altitude18.TheAltitude_18>=1" & "P3.P3[0]>=1") | ("Altitude19.TheAltitude_19>=1" & "P3.P3[0]>=1")) U X(("P5.P5[0]>=1" & "Speed0.Speed_Right_Wheel_0>=1") | ("P5.P5[0]>=1" & "Speed1.Speed_Right_Wheel_1>=1") | ("P5.P5[0]>=1" & "Speed2.Speed_Right_Wheel_2>=1") | ("P5.P5[0]>=1" & "Speed3.Speed_Right_Wheel_3>=1") | ("P5.P5[0]>=1" & "Speed4.Speed_Right_Wheel_4>=1") | ("P5.P5[0]>=1" & "Speed9.Speed_Right_Wheel_9>=1"))))
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]
Exit code :0
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Exit code :0
Exit code :1
FORMULA AirplaneLD-COL-0010-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA AirplaneLD-COL-0010-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Detected timeout of ITS tools.

BK_STOP 1496380710785

--------------------
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
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLFireability -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 02, 2017 5:18:20 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2017 5:18:20 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Jun 02, 2017 5:18:21 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1407 ms
Jun 02, 2017 5:18:21 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 20 places.
Jun 02, 2017 5:18:21 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Jun 02, 2017 5:18:21 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Speed->SpeedPossibleVal,Speed_Left_Wheel,Speed_Right_Wheel,
Signal->Plane_On_Ground_Signal_no,
Dot->stp5,stp4,stp3,stp2,stp1,P5,P4,P3,P2,P6,P1,
Weight->WeightPossibleVal,Weight_Right_Wheel,Weight_Left_Wheel,
Altitude->AltitudePossibleVal,TheAltitude,

Jun 02, 2017 5:18:21 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 15 transitions.
Jun 02, 2017 5:18:21 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Jun 02, 2017 5:18:21 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 02, 2017 5:18:21 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 02, 2017 5:18:21 AM fr.lip6.move.gal.instantiate.Instantiator instantiateParameters
INFO: On-the-fly reduction of False transitions avoided exploring 44 instantiations of transitions. Total transitions/syncs built is 100
Jun 02, 2017 5:18:21 AM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 3 fixed domain variables (out of 89 variables) in GAL type AirplaneLD_COL_0010
Jun 02, 2017 5:18:21 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Found a total of 32 constant array cells/variables (out of 89 variables) in type AirplaneLD_COL_0010
Jun 02, 2017 5:18:21 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: SpeedPossibleVal[0-9], AltitudePossibleVal[0-19], WeightPossibleVal[0-1],
Jun 02, 2017 5:18:21 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Simplified 184 expressions due to constant valuations.
Jun 02, 2017 5:18:21 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 54 ms
Jun 02, 2017 5:18:21 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays Weight_Right_Wheel, Weight_Left_Wheel, TheAltitude, Speed_Left_Wheel, Speed_Right_Wheel, Plane_On_Ground_Signal_no to variables to allow decomposition.
Jun 02, 2017 5:18:21 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 59 redundant transitions.
Jun 02, 2017 5:18:21 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 11 ms
Jun 02, 2017 5:18:21 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 02, 2017 5:18:22 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 3 place invariants in 28 ms
Jun 02, 2017 5:18:22 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 57 variables to be positive in 144 ms
Jun 02, 2017 5:18:22 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 88 transitions.
Jun 02, 2017 5:18:22 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/88 took 4 ms. Total solver calls (SAT/UNSAT): 3(1/2)
Jun 02, 2017 5:18:23 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :50/88 took 1026 ms. Total solver calls (SAT/UNSAT): 912(674/238)
Jun 02, 2017 5:18:24 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 1786 ms. Total solver calls (SAT/UNSAT): 1452(1214/238)
Jun 02, 2017 5:18:24 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 88 transitions.
Jun 02, 2017 5:18:25 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 795 ms. Total solver calls (SAT/UNSAT): 1452(236/1216)
Jun 02, 2017 5:18:25 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 88 transitions.
Jun 02, 2017 5:18:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(28/88) took 1009 ms. Total solver calls (SAT/UNSAT): 2146(1444/702)
Jun 02, 2017 5:18:27 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(78/88) took 2011 ms. Total solver calls (SAT/UNSAT): 3871(3072/799)
Jun 02, 2017 5:18:27 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 2044 ms. Total solver calls (SAT/UNSAT): 3916(3117/799)
Jun 02, 2017 5:18:27 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 88 transitions.
Jun 02, 2017 5:18:28 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 1354 ms. Total solver calls (SAT/UNSAT): 42(0/42)
Jun 02, 2017 5:18:28 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 6348ms conformant to PINS in folder :/home/mcc/execution
Jun 02, 2017 5:18:30 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, (X(X([]((LTLAP3==true)))))U(([]((LTLAP11==true)))U(X((LTLAP1==true))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.001: Loading model from ./gal.so
pins2lts-seq, 0.002: library has no initializer
pins2lts-seq, 0.002: loading model GAL
pins2lts-seq, 0.003: completed loading model GAL
pins2lts-seq, 0.003: LTL layer: formula: (X(X([]((LTLAP3==true)))))U(([]((LTLAP11==true)))U(X((LTLAP1==true))))
pins2lts-seq, 0.003: Expression is: ((X (X ([] (LTLAP3 == true )))) U (([] (LTLAP11 == true )) U (X (LTLAP1 == true ))))
pins2lts-seq, 0.004: buchi has 18 states
pins2lts-seq, 0.004: state 0: non-accepting
pins2lts-seq, 0.004: -> 1, | true
pins2lts-seq, 0.004: -> 2, | true
pins2lts-seq, 0.004: -> 7, | !(LTLAP11 == true )
pins2lts-seq, 0.004: -> 8, | true
pins2lts-seq, 0.004: -> 9, | true
pins2lts-seq, 0.004: state 1: non-accepting
pins2lts-seq, 0.004: -> 1, | !(LTLAP1 == true )
pins2lts-seq, 0.004: -> 2, | !(LTLAP1 == true )
pins2lts-seq, 0.004: -> 8, | !(LTLAP1 == true ) && !(LTLAP11 == true )
pins2lts-seq, 0.004: -> 7, | !(LTLAP1 == true ) && !(LTLAP11 == true )
pins2lts-seq, 0.004: state 2: non-accepting
pins2lts-seq, 0.004: -> 3, | !(LTLAP1 == true )
pins2lts-seq, 0.004: -> 6, | !(LTLAP1 == true ) && !(LTLAP11 == true )
pins2lts-seq, 0.004: state 3: non-accepting
pins2lts-seq, 0.004: -> 3, | true
pins2lts-seq, 0.004: -> 4, | !(LTLAP3 == true )
pins2lts-seq, 0.004: -> 6, | !(LTLAP11 == true )
pins2lts-seq, 0.004: -> 5, | !(LTLAP11 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.004: state 4: non-accepting
pins2lts-seq, 0.004: -> 4, | true
pins2lts-seq, 0.004: -> 5, | !(LTLAP11 == true )
pins2lts-seq, 0.004: state 5: accepting
pins2lts-seq, 0.004: -> 5, | true
pins2lts-seq, 0.004: state 6: non-accepting
pins2lts-seq, 0.004: -> 6, | true
pins2lts-seq, 0.004: -> 5, | !(LTLAP3 == true )
pins2lts-seq, 0.004: state 7: accepting
pins2lts-seq, 0.004: -> 6, | !(LTLAP1 == true )
pins2lts-seq, 0.004: state 8: accepting
pins2lts-seq, 0.004: -> 8, | !(LTLAP1 == true )
pins2lts-seq, 0.004: -> 9, | !(LTLAP1 == true )
pins2lts-seq, 0.004: -> 7, | !(LTLAP1 == true ) && !(LTLAP11 == true )
pins2lts-seq, 0.004: -> 1, | !(LTLAP1 == true )
pins2lts-seq, 0.004: -> 2, | !(LTLAP1 == true )
pins2lts-seq, 0.004: state 9: accepting
pins2lts-seq, 0.004: -> 10, | !(LTLAP1 == true )
pins2lts-seq, 0.004: -> 16, | !(LTLAP1 == true ) && !(LTLAP11 == true )
pins2lts-seq, 0.004: -> 17, | !(LTLAP1 == true )
pins2lts-seq, 0.004: state 10: non-accepting
pins2lts-seq, 0.004: -> 10, | !(LTLAP1 == true )
pins2lts-seq, 0.004: -> 11, | !(LTLAP1 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.004: -> 16, | !(LTLAP1 == true ) && !(LTLAP11 == true )
pins2lts-seq, 0.004: -> 13, | !(LTLAP1 == true ) && !(LTLAP11 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.004: -> 14, | !(LTLAP1 == true )
pins2lts-seq, 0.004: -> 12, | !(LTLAP1 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.004: state 11: accepting
pins2lts-seq, 0.004: -> 11, | !(LTLAP1 == true )
pins2lts-seq, 0.004: -> 13, | !(LTLAP1 == true ) && !(LTLAP11 == true )
pins2lts-seq, 0.004: -> 12, | !(LTLAP1 == true )
pins2lts-seq, 0.004: state 12: accepting
pins2lts-seq, 0.004: -> 4, | !(LTLAP1 == true )
pins2lts-seq, 0.004: -> 5, | !(LTLAP1 == true ) && !(LTLAP11 == true )
pins2lts-seq, 0.004: state 13: accepting
pins2lts-seq, 0.004: -> 5, | !(LTLAP1 == true )
pins2lts-seq, 0.004: state 14: non-accepting
pins2lts-seq, 0.004: -> 15, | !(LTLAP1 == true )
pins2lts-seq, 0.004: -> 4, | !(LTLAP1 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.004: -> 6, | !(LTLAP1 == true ) && !(LTLAP11 == true )
pins2lts-seq, 0.004: -> 5, | !(LTLAP1 == true ) && !(LTLAP11 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.004: state 15: non-accepting
pins2lts-seq, 0.004: -> 15, | true
pins2lts-seq, 0.004: -> 4, | !(LTLAP3 == true )
pins2lts-seq, 0.004: -> 6, | !(LTLAP11 == true )
pins2lts-seq, 0.004: -> 5, | !(LTLAP11 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.004: state 16: non-accepting
pins2lts-seq, 0.004: -> 6, | !(LTLAP1 == true )
pins2lts-seq, 0.004: -> 5, | !(LTLAP1 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.004: state 17: non-accepting
pins2lts-seq, 0.004: -> 3, | !(LTLAP1 == true )
pins2lts-seq, 0.004: -> 4, | !(LTLAP1 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.004: -> 6, | !(LTLAP1 == true ) && !(LTLAP11 == true )
pins2lts-seq, 0.004: -> 5, | !(LTLAP1 == true ) && !(LTLAP11 == true ) && !(LTLAP3 == true )
pins2lts-seq, 0.006: There are 102 state labels and 1 edge labels
pins2lts-seq, 0.006: State length is 58, there are 143 groups
pins2lts-seq, 0.006: Running scc search strategy
pins2lts-seq, 0.006: Using a tree for state storage
pins2lts-seq, 0.008: accepting cycle found!
pins2lts-seq, 0.008: exiting now

Jun 02, 2017 5:18:30 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, ([]((LTLAP12==true)))U((LTLAP10==true))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 101, guards 88
pins2lts-seq, 0.009: LTL layer: formula: ([]((LTLAP12==true)))U((LTLAP10==true))
pins2lts-seq, 0.009: Expression is: (([] (LTLAP12 == true )) U (LTLAP10 == true ))
pins2lts-seq, 0.009: buchi has 3 states
pins2lts-seq, 0.009: state 0: accepting
pins2lts-seq, 0.009: -> 0, | !(LTLAP10 == true )
pins2lts-seq, 0.009: -> 1, | !(LTLAP10 == true ) && !(LTLAP12 == true )
pins2lts-seq, 0.009: -> 2, | !(LTLAP10 == true )
pins2lts-seq, 0.009: state 1: accepting
pins2lts-seq, 0.009: -> 1, | true
pins2lts-seq, 0.009: state 2: non-accepting
pins2lts-seq, 0.009: -> 2, | true
pins2lts-seq, 0.009: -> 1, | !(LTLAP12 == true )
pins2lts-seq, 0.009: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.010: There are 102 state labels and 1 edge labels
pins2lts-seq, 0.010: State length is 58, there are 94 groups
pins2lts-seq, 0.010: Running scc search strategy
pins2lts-seq, 0.010: Using a tree for state storage
pins2lts-seq, 0.010: Visible groups: 0 / 94, labels: 2 / 102
pins2lts-seq, 0.010: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.013: state space 1 levels, 1 states 0 transitions

Jun 02, 2017 5:18:30 AM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 02, 2017 5:18:30 AM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 02, 2017 5:18:30 AM fr.lip6.move.gal.itstools.ProcessController$1 run
WARNING: null

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="S_AirplaneLD-COL-0010"
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/S_AirplaneLD-COL-0010.tgz
mv S_AirplaneLD-COL-0010 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool itstools"
echo " Input is S_AirplaneLD-COL-0010, 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 r090-csrt-149441076300006"
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 ;