Sponsored Content
Top Forums Programming *** glibc detected *** double free or corruption: 0x40236ff4 *** Post 302074633 by napapanbkk on Wednesday 24th of May 2006 06:18:34 PM
Old 05-24-2006
*** glibc detected *** double free or corruption (top): 0x08ec9a48 ***

I'm a C++ beginner programmer. I'm using C++ on Unix with the gcc version 3.4.5 20051201 (Red Hat 3.4.5-2).

I have the same error message with my simulation program. When this error happens then the simulation stops running with the message "Abort".

The simulation is supposed to run 50 replicates. This problem occurs randomly. Sometimes, it happened in the 32th and 37th replicates. Other time, it happened in the 3rd replicate.

So, I tried to debug the program by running the program step by step. Surprisingly, the program ran fine. No error.

Or when I tried to run the replicate that had this problem, then it ran fine, too. But not with 50 replicates in a row.

My friend told me maybe it had something to do with optimization. I even lowered the level of optimization from -O to -O0. It didn't help.

Could somebody educate me what is going on? Where should I look at?

Many thanks.
 

10 More Discussions You Might Find Interesting

1. Programming

*** glibc detected *** free(): invalid next size (normal): 0x0000000000503e70 ***

hi, I have made a small C program that make use of malloc and free for processing bitmap images. when i try to run the program, I am getting a error something like *** glibc detected *** free(): invalid next size (normal): 0x0000000000503e70 *** I am not sure of which free() is causing this... (1 Reply)
Discussion started by: vbreddy
1 Replies

2. Programming

Pointer to a struct (with pointers) *** glibc detected *** double free

I am using a structure defined as follows struct gene_square { double *x; double *y; };I have class, with a member function which is a pointer of this type: gene_square* m_Genes;I am allocating memory in the constructors like this: m_Genes = new gene_square; for (ii=0;... (1 Reply)
Discussion started by: jatoo
1 Replies

3. Programming

Why does this occur? *** glibc detected *** malloc(): memory corruption: 0x10013ff8 ***

there seems not to be error in this segment. In some computers, it can work well. But in others, it will give a failure. why it ocurrs and how to deal with it? in a function: if( *ver == NULL ) { *ver = (vertex *) malloc(sizeof(vertex)); //this line ... (17 Replies)
Discussion started by: cdbug
17 Replies

4. Programming

solved: glibc detection corruption using a fork in popen

Hi, I am having a hell of a time getting this to work. So basically, I have opened a popen to run a program that is going to prompt an action to occur half way through, when it gets to this I need to create a separate process and do some stuff, then return to the original process. This works... (0 Replies)
Discussion started by: imrank27
0 Replies

5. Programming

*** glibc detected *** ./a.out: malloc(): memory corruption (fast):

*** glibc detected *** ./a.out: malloc(): memory corruption (fast): Posted A minute ago M trying to make multiway tree and dont know what happend when this part of code get executed: 01void ins(NODE *ptr) 02{ 03 //working 04 if(ptr!=NULL) 05 { 06 SNODE *var=NULL; 07 var=(SNODE... (3 Replies)
Discussion started by: exgenome
3 Replies

6. Programming

*** glibc detected *** : malloc(): memory corruption (fast)

Hi Friends, while executing the below code, am getting *** glibc detected *** ./ok: malloc(): memory corruption (fast) error, please suggest how to solve this issue. #include <stdio.h> #include <string.h> #include <sqlca.h> #include <alloca.h> /* Define constants for VARCHAR... (2 Replies)
Discussion started by: mpjobsrch
2 Replies

7. Programming

FORTRAN: double free or corruption

Hello. I'm looking for a quite "interesting" bug I'm using fortran 90, compiler gfortran and the main idea is for every time step I build a bin structure for search contact between particles, for this at the begining TYPE :: circle_index INTEGER(kind = 4) :: ind_p TYPE(circle_index),... (1 Reply)
Discussion started by: Marce
1 Replies

8. Programming

*** glibc detected *** ./a.out malloc() memory corruption

I am facing a problem of memory corruption. The loop runs for the first time but does not go through the second time. What could be the problem? for(int z=0;z<2;z++) { fp=fopen("poly.dat","r"); /*do something which reads this file into a 2D array*/ fclose(fp); ... (10 Replies)
Discussion started by: dare
10 Replies

9. Programming

C++ glibc detected double free or corruption(!prev) using shared library

Currently I test a shared library vendor provided in linux , the following is the simple source : #include <iostream> using namespace std; extern int test1(); extern int test2(); int main() { cout << "hello world" << endl ; return 0 ; cout << "Test 1" << endl; ... (6 Replies)
Discussion started by: barfatchen
6 Replies

10. Homework & Coursework Questions

FORTRAN error *** glibc detected ***

Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted! 1. The problem statement, all variables and given/known data: I'm doing aproximation of derivative called five-point stencil. For every value of x, in interval , in step... (0 Replies)
Discussion started by: antonija
0 Replies
SPIN(1) 						      General Commands Manual							   SPIN(1)

NAME
spin - verification tool for concurrent systems SYNOPSIS
spin [ -nN ] [ -plgrsmv ] [ -iat ] [ -DV ] [ file ] DESCRIPTION
Spin is a tool for analyzing the logical consistency of concurrent systems, specifically communication protocols. The system is specified in a guarded command language called PROMELA2. The language, described in the references, allows for the dynamic creation of processes, nondeterministic case selection, loops, gotos, variables, and the specification of correctness requirements. The tool has fast algorithms for analyzing arbitrary liveness and safety conditions. Given a model system specified in PROMELA2, spin can perform interactive, guided, or random simulations of the system's execution or it can generate a C program that performs an exhaustive or approximate verification of the system. The verifier can check, for instance, if user specified system invariants are violated during a protocol's execution, or if non-progress execution cycles exist. Without any options the program performs a random simulation of the system defined in the input file, default standard input. The option -nN sets the random seed to the integer value N. The group of options -pglmrsv is used to set the level of information reported about the simulation run. Every line of output normally contains a reference to the source line in the specification that caused it. p Show at each time step which process changed state and what source statement was executed. l In combination with option p, show the current value of local variables of the process. g Show the value of global variables at each time step. r Show all message-receive events, giving the name and number of the receiving process and the corresponding source line number. For each message parameter, show the message type and the message channel number and name. s Show all message-send events. m Ordinarily, a send action will be delayed if the target message buffer if full. With this option a message sent to a full buffer is lost. The option can be combined with -a (see below). v Verbose mode: add extra detail and include more warnings. i Perform an interactive simulation. a Generate a protocol-specific verifier. The output is written into a set of C files, named pan.[cbhmt], that can be compiled (cc pan.c) to produce an executable verifier. Systems that require more memory than available on the target machine can still be ana- lyzed by compiling the verifier with a bit state space: cc -DBITSTATE pan.c This collapses the state space to 1 bit per system state, with minimal side-effects. Partial order reduction rules take effect dur- ing the verification if the compiler directive -DREDUCE is used. The compiled verifiers have their own sets of options, which can be seen by running them with option -?. t If the verifier finds a violation of a correctness property, it writes an error trail. The trail can be inspected in detail by invoking spin with the -t option. In combination with the options pglrsv, different views of the error sequence are then be obtained. D Perform a static dataflow analysis. V Print the version number and exit. SEE ALSO
G.J. Holzmann, Design and Validation of Computer Protocols, Prentice Hall, 1991. --, ``Using SPIN''. SPIN(1)
All times are GMT -4. The time now is 03:56 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy