java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AbstractInterpretationC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:28:41,187 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:28:41,190 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:28:41,207 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:28:41,207 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:28:41,208 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:28:41,209 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:28:41,211 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:28:41,214 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:28:41,214 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:28:41,215 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:28:41,216 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:28:41,217 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:28:41,218 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:28:41,219 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:28:41,222 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:28:41,224 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:28:41,226 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:28:41,228 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:28:41,229 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:28:41,231 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:28:41,232 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:28:41,232 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:28:41,233 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:28:41,234 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:28:41,235 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:28:41,235 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:28:41,236 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:28:41,236 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:28:41,236 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:28:41,237 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:28:41,238 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf [2018-01-24 16:28:41,248 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:28:41,248 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:28:41,249 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:28:41,249 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:28:41,249 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:28:41,249 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:28:41,249 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:28:41,250 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:28:41,250 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:28:41,250 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:28:41,251 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:28:41,251 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:28:41,251 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:28:41,251 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:28:41,251 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:28:41,252 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:28:41,252 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:28:41,252 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:28:41,252 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:28:41,252 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:28:41,253 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:28:41,253 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:28:41,253 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:28:41,253 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:28:41,253 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:28:41,254 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:28:41,254 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:28:41,254 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:28:41,254 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:28:41,254 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:28:41,255 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:28:41,255 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:28:41,255 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:28:41,256 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:28:41,256 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:28:41,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:28:41,303 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:28:41,307 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:28:41,308 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:28:41,309 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:28:41,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i [2018-01-24 16:28:41,489 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:28:41,493 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:28:41,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:28:41,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:28:41,497 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:28:41,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:28:41" (1/1) ... [2018-01-24 16:28:41,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11cccfa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:41, skipping insertion in model container [2018-01-24 16:28:41,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:28:41" (1/1) ... [2018-01-24 16:28:41,518 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:28:41,555 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:28:41,669 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:28:41,684 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:28:41,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:41 WrapperNode [2018-01-24 16:28:41,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:28:41,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:28:41,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:28:41,692 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:28:41,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:41" (1/1) ... [2018-01-24 16:28:41,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:41" (1/1) ... [2018-01-24 16:28:41,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:41" (1/1) ... [2018-01-24 16:28:41,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:41" (1/1) ... [2018-01-24 16:28:41,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:41" (1/1) ... [2018-01-24 16:28:41,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:41" (1/1) ... [2018-01-24 16:28:41,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:41" (1/1) ... [2018-01-24 16:28:41,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:28:41,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:28:41,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:28:41,727 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:28:41,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:41" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:28:41,776 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:28:41,777 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:28:41,777 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 16:28:41,777 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:28:41,777 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:28:41,777 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:28:41,777 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:28:41,777 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:28:41,777 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:28:41,777 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:28:41,778 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:28:41,778 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:28:41,778 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 16:28:41,778 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:28:41,778 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:28:41,778 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:28:42,018 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:28:42,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:28:42 BoogieIcfgContainer [2018-01-24 16:28:42,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:28:42,020 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:28:42,020 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:28:42,020 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:28:42,021 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:28:42" (1/1) ... [2018-01-24 16:28:42,069 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:28:43,005 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:28:43,030 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:28:43,034 INFO L268 AbstractInterpreter]: Visited 65 different actions 222 times. Merged at 46 different actions 112 times. Never widened. Found 11 fixpoints after 7 different actions. Largest state had 31 variables. [2018-01-24 16:28:43,037 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:28:43,038 INFO L168 Benchmark]: Toolchain (without parser) took 1548.49 ms. Allocated memory was 306.2 MB in the beginning and 371.7 MB in the end (delta: 65.5 MB). Free memory was 266.2 MB in the beginning and 277.0 MB in the end (delta: -10.8 MB). Peak memory consumption was 54.7 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:43,039 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 306.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:28:43,039 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.26 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 255.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:43,039 INFO L168 Benchmark]: Boogie Preprocessor took 34.91 ms. Allocated memory is still 306.2 MB. Free memory was 255.2 MB in the beginning and 253.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:43,039 INFO L168 Benchmark]: RCFGBuilder took 292.27 ms. Allocated memory is still 306.2 MB. Free memory was 253.2 MB in the beginning and 234.6 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:43,040 INFO L168 Benchmark]: Abstract Interpretation took 1017.22 ms. Allocated memory was 306.2 MB in the beginning and 371.7 MB in the end (delta: 65.5 MB). Free memory was 233.6 MB in the beginning and 277.0 MB in the end (delta: -43.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:43,041 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 306.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 198.26 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 255.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.91 ms. Allocated memory is still 306.2 MB. Free memory was 255.2 MB in the beginning and 253.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 292.27 ms. Allocated memory is still 306.2 MB. Free memory was 253.2 MB in the beginning and 234.6 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 1017.22 ms. Allocated memory was 306.2 MB in the beginning and 371.7 MB in the end (delta: 65.5 MB). Free memory was 233.6 MB in the beginning and 277.0 MB in the end (delta: -43.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 52 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 570 LocStat_NO_SUPPORTING_DISEQUALITIES : 135 LocStat_NO_DISJUNCTIONS : -104 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 71 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 146 TransStat_NO_SUPPORTING_DISEQUALITIES : 32 TransStat_NO_DISJUNCTIONS : 86 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.019913 RENAME_VARIABLES(MILLISECONDS) : 0.137088 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.001132 PROJECTAWAY(MILLISECONDS) : 0.077842 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001549 DISJOIN(MILLISECONDS) : 0.303226 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.163454 ADD_EQUALITY(MILLISECONDS) : 0.042035 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013073 #CONJOIN_DISJUNCTIVE : 303 #RENAME_VARIABLES : 683 #UNFREEZE : 0 #CONJOIN : 587 #PROJECTAWAY : 412 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 45 #RENAME_VARIABLES_DISJUNCTIVE : 611 #ADD_EQUALITY : 117 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 26 - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L619] int *a, *b; [L620] int n; [L632] n = 1 [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc (n * sizeof(*a)) [L636] a = malloc (n * sizeof(*a)) [L637] EXPR, FCALL malloc (n * sizeof(*b)) [L637] b = malloc (n * sizeof(*b)) [L638] EXPR b++ [L638] FCALL *b++ = n - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L619] int *a, *b; [L620] int n; [L632] n = 1 [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc (n * sizeof(*a)) [L636] a = malloc (n * sizeof(*a)) [L637] EXPR, FCALL malloc (n * sizeof(*b)) [L637] b = malloc (n * sizeof(*b)) [L638] EXPR b++ [L638] FCALL *b++ = n [L639] CALL foo () [L624] int i; [L625] i = 0 [L625] COND TRUE i < n [L626] FCALL a[i] = n - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L619] int *a, *b; [L620] int n; [L632] n = 1 [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc (n * sizeof(*a)) [L636] a = malloc (n * sizeof(*a)) [L637] EXPR, FCALL malloc (n * sizeof(*b)) [L637] b = malloc (n * sizeof(*b)) [L638] EXPR b++ [L638] FCALL *b++ = n [L639] CALL foo () [L624] int i; [L625] i = 0 [L625] COND TRUE i < n [L626] FCALL a[i] = n - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L619] int *a, *b; [L620] int n; [L632] n = 1 [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc (n * sizeof(*a)) [L636] a = malloc (n * sizeof(*a)) [L637] EXPR, FCALL malloc (n * sizeof(*b)) [L637] b = malloc (n * sizeof(*b)) [L638] EXPR b++ [L638] FCALL *b++ = n [L639] CALL foo () [L624] int i; [L625] i = 0 [L625] COND FALSE !(i < n) [L627] i = 0 [L627] COND TRUE i < n - 1 [L628] FCALL b[i] = n - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L619] int *a, *b; [L620] int n; [L632] n = 1 [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc (n * sizeof(*a)) [L636] a = malloc (n * sizeof(*a)) [L637] EXPR, FCALL malloc (n * sizeof(*b)) [L637] b = malloc (n * sizeof(*b)) [L638] EXPR b++ [L638] FCALL *b++ = n [L639] CALL foo () [L624] int i; [L625] i = 0 [L625] COND FALSE !(i < n) [L627] i = 0 [L627] COND FALSE, RET !(i < n - 1) [L639] foo () [L640] FCALL b[-1] - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L619] int *a, *b; [L620] int n; [L632] n = 1 [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc (n * sizeof(*a)) [L636] a = malloc (n * sizeof(*a)) [L637] EXPR, FCALL malloc (n * sizeof(*b)) [L637] b = malloc (n * sizeof(*b)) [L638] EXPR b++ [L638] FCALL *b++ = n [L639] CALL foo () [L624] int i; [L625] i = 0 [L625] COND FALSE !(i < n) [L627] i = 0 [L627] COND FALSE, RET !(i < n - 1) [L639] foo () [L640] FCALL b[-1] [L640] FCALL b[n - 2] - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L619] int *a, *b; [L620] int n; [L632] n = 1 [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc (n * sizeof(*a)) [L636] a = malloc (n * sizeof(*a)) [L637] EXPR, FCALL malloc (n * sizeof(*b)) [L637] b = malloc (n * sizeof(*b)) [L638] EXPR b++ [L638] FCALL *b++ = n [L639] CALL foo () [L624] int i; [L625] i = 0 [L625] COND FALSE !(i < n) [L627] i = 0 [L627] COND FALSE, RET !(i < n - 1) [L639] foo () [L640] EXPR, FCALL b[-1] [L640] EXPR, FCALL b[n - 2] [L640] COND FALSE !(b[-1] - b[n - 2]) [L643] FCALL free(a) - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L619] int *a, *b; [L620] int n; [L632] n = 1 [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc (n * sizeof(*a)) [L636] a = malloc (n * sizeof(*a)) [L637] EXPR, FCALL malloc (n * sizeof(*b)) [L637] b = malloc (n * sizeof(*b)) [L638] EXPR b++ [L638] FCALL *b++ = n [L639] CALL foo () [L624] int i; [L625] i = 0 [L625] COND FALSE !(i < n) [L627] i = 0 [L627] COND FALSE, RET !(i < n - 1) [L639] foo () [L640] EXPR, FCALL b[-1] [L640] EXPR, FCALL b[n - 2] [L640] COND TRUE b[-1] - b[n - 2] [L641] FCALL free(a) - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L619] int *a, *b; [L620] int n; [L632] n = 1 [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc (n * sizeof(*a)) [L636] a = malloc (n * sizeof(*a)) [L637] EXPR, FCALL malloc (n * sizeof(*b)) [L637] b = malloc (n * sizeof(*b)) [L638] EXPR b++ [L638] FCALL *b++ = n [L639] CALL foo () [L624] int i; [L625] i = 0 [L625] COND FALSE !(i < n) [L627] i = 0 [L627] COND FALSE, RET !(i < n - 1) [L639] foo () [L640] EXPR, FCALL b[-1] [L640] EXPR, FCALL b[n - 2] [L640] COND FALSE !(b[-1] - b[n - 2]) [L643] FCALL free(a) [L643] FCALL free(b-1) - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L619] int *a, *b; [L620] int n; [L632] n = 1 [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc (n * sizeof(*a)) [L636] a = malloc (n * sizeof(*a)) [L637] EXPR, FCALL malloc (n * sizeof(*b)) [L637] b = malloc (n * sizeof(*b)) [L638] EXPR b++ [L638] FCALL *b++ = n [L639] CALL foo () [L624] int i; [L625] i = 0 [L625] COND FALSE !(i < n) [L627] i = 0 [L627] COND FALSE, RET !(i < n - 1) [L639] foo () [L640] EXPR, FCALL b[-1] [L640] EXPR, FCALL b[n - 2] [L640] COND FALSE !(b[-1] - b[n - 2]) [L643] FCALL free(a) [L643] FCALL free(b-1) - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L619] int *a, *b; [L620] int n; [L632] n = 1 [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc (n * sizeof(*a)) [L636] a = malloc (n * sizeof(*a)) [L637] EXPR, FCALL malloc (n * sizeof(*b)) [L637] b = malloc (n * sizeof(*b)) [L638] EXPR b++ [L638] FCALL *b++ = n [L639] CALL foo () [L624] int i; [L625] i = 0 [L625] COND FALSE !(i < n) [L627] i = 0 [L627] COND FALSE, RET !(i < n - 1) [L639] foo () [L640] EXPR, FCALL b[-1] [L640] EXPR, FCALL b[n - 2] [L640] COND TRUE b[-1] - b[n - 2] [L641] FCALL free(a) [L641] FCALL free(b) - UnprovableResult [Line: 1]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L619] int *a, *b; [L620] int n; [L632] n = 1 [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc (n * sizeof(*a)) [L636] a = malloc (n * sizeof(*a)) [L637] EXPR, FCALL malloc (n * sizeof(*b)) [L637] b = malloc (n * sizeof(*b)) [L638] EXPR b++ [L638] FCALL *b++ = n [L639] CALL foo () [L624] int i; [L625] i = 0 [L625] COND FALSE !(i < n) [L627] i = 0 [L627] COND FALSE, RET !(i < n - 1) [L639] foo () [L640] EXPR, FCALL b[-1] [L640] EXPR, FCALL b[n - 2] [L640] COND TRUE b[-1] - b[n - 2] [L641] FCALL free(a) [L641] FCALL free(b) - UnprovableResult [Line: 630]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: abstract domain could reach this error location. Possible FailurePath: [L619] int *a, *b; [L620] int n; [L632] n = 1 [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc (n * sizeof(*a)) [L636] a = malloc (n * sizeof(*a)) [L637] EXPR, FCALL malloc (n * sizeof(*b)) [L637] b = malloc (n * sizeof(*b)) [L638] EXPR b++ [L638] FCALL *b++ = n [L639] CALL foo () [L624] int i; [L625] i = 0 [L625] COND FALSE !(i < n) [L627] i = 0 [L627] COND FALSE, RET !(i < n - 1) [L639] foo () [L640] EXPR, FCALL b[-1] [L640] EXPR, FCALL b[n - 2] [L640] COND FALSE !(b[-1] - b[n - 2]) [L643] FCALL free(a) [L643] FCALL free(b-1) [L644] return 0; - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-28-43-050.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-28-43-050.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-28-43-050.csv Received shutdown request...