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/array-memsafety/knapsack_alloca_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:20:57,974 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:20:57,975 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:20:57,991 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:20:57,991 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:20:57,992 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:20:57,993 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:20:57,995 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:20:57,997 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:20:57,998 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:20:57,999 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:20:57,999 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:20:58,000 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:20:58,001 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:20:58,002 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:20:58,005 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:20:58,007 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:20:58,009 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:20:58,010 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:20:58,012 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:20:58,014 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:20:58,014 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:20:58,015 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:20:58,016 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:20:58,017 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:20:58,018 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:20:58,018 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:20:58,019 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:20:58,019 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:20:58,019 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:20:58,020 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:20:58,020 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:20:58,028 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:20:58,028 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:20:58,029 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:20:58,029 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:20:58,029 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:20:58,029 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:20:58,029 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:20:58,030 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:20:58,030 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:20:58,030 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:20:58,030 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:20:58,030 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:20:58,030 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:20:58,031 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:20:58,031 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:20:58,031 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:20:58,031 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:20:58,031 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:20:58,031 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:20:58,031 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:20:58,032 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:20:58,032 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:20:58,032 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:20:58,032 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:20:58,032 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:20:58,033 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:20:58,033 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:20:58,033 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:20:58,033 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:20:58,033 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:20:58,033 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:20:58,034 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:20:58,034 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:20:58,034 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:20:58,035 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:20:58,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:20:58,077 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:20:58,080 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:20:58,081 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:20:58,082 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:20:58,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/knapsack_alloca_unsafe_false-valid-deref.i [2018-01-24 16:20:58,252 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:20:58,257 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:20:58,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:20:58,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:20:58,263 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:20:58,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:20:58" (1/1) ... [2018-01-24 16:20:58,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386958ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:20:58, skipping insertion in model container [2018-01-24 16:20:58,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:20:58" (1/1) ... [2018-01-24 16:20:58,279 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:20:58,318 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:20:58,434 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:20:58,456 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:20:58,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:20:58 WrapperNode [2018-01-24 16:20:58,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:20:58,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:20:58,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:20:58,465 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:20:58,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:20:58" (1/1) ... [2018-01-24 16:20:58,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:20:58" (1/1) ... [2018-01-24 16:20:58,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:20:58" (1/1) ... [2018-01-24 16:20:58,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:20:58" (1/1) ... [2018-01-24 16:20:58,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:20:58" (1/1) ... [2018-01-24 16:20:58,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:20:58" (1/1) ... [2018-01-24 16:20:58,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:20:58" (1/1) ... [2018-01-24 16:20:58,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:20:58,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:20:58,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:20:58,507 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:20:58,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:20:58" (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:20:58,558 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:20:58,559 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:20:58,559 INFO L136 BoogieDeclarations]: Found implementation of procedure knapsack [2018-01-24 16:20:58,559 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:20:58,559 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:20:58,559 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:20:58,559 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:20:58,559 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:20:58,559 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:20:58,560 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:20:58,560 INFO L128 BoogieDeclarations]: Found specification of procedure knapsack [2018-01-24 16:20:58,560 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:20:58,560 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:20:58,560 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:20:58,877 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:20:58,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:20:58 BoogieIcfgContainer [2018-01-24 16:20:58,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:20:58,879 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:20:58,879 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:20:58,879 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:20:58,880 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:20:58" (1/1) ... [2018-01-24 16:20:58,938 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:21:03,129 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:21:03,153 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:21:03,158 INFO L268 AbstractInterpreter]: Visited 80 different actions 1185 times. Merged at 59 different actions 664 times. Widened at 1 different actions 4 times. Found 147 fixpoints after 21 different actions. Largest state had 42 variables. [2018-01-24 16:21:03,160 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:21:03,161 INFO L168 Benchmark]: Toolchain (without parser) took 4908.35 ms. Allocated memory was 304.1 MB in the beginning and 736.1 MB in the end (delta: 432.0 MB). Free memory was 264.1 MB in the beginning and 682.8 MB in the end (delta: -418.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. [2018-01-24 16:21:03,162 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:21:03,162 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.84 ms. Allocated memory is still 304.1 MB. Free memory was 263.1 MB in the beginning and 253.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:21:03,163 INFO L168 Benchmark]: Boogie Preprocessor took 41.60 ms. Allocated memory is still 304.1 MB. Free memory was 253.0 MB in the beginning and 250.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:21:03,163 INFO L168 Benchmark]: RCFGBuilder took 371.14 ms. Allocated memory is still 304.1 MB. Free memory was 250.9 MB in the beginning and 228.4 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:21:03,164 INFO L168 Benchmark]: Abstract Interpretation took 4281.66 ms. Allocated memory was 304.1 MB in the beginning and 736.1 MB in the end (delta: 432.0 MB). Free memory was 227.4 MB in the beginning and 682.8 MB in the end (delta: -455.5 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:21:03,165 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.12 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 206.84 ms. Allocated memory is still 304.1 MB. Free memory was 263.1 MB in the beginning and 253.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.60 ms. Allocated memory is still 304.1 MB. Free memory was 253.0 MB in the beginning and 250.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 371.14 ms. Allocated memory is still 304.1 MB. Free memory was 250.9 MB in the beginning and 228.4 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 4281.66 ms. Allocated memory was 304.1 MB in the beginning and 736.1 MB in the end (delta: 432.0 MB). Free memory was 227.4 MB in the beginning and 682.8 MB in the end (delta: -455.5 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 65 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 1017 LocStat_NO_SUPPORTING_DISEQUALITIES : 370 LocStat_NO_DISJUNCTIONS : -130 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 86 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 122 TransStat_NO_SUPPORTING_DISEQUALITIES : 19 TransStat_NO_DISJUNCTIONS : 94 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.012210 RENAME_VARIABLES(MILLISECONDS) : 0.239359 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.000854 PROJECTAWAY(MILLISECONDS) : 0.133598 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001039 DISJOIN(MILLISECONDS) : 0.286925 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.259220 ADD_EQUALITY(MILLISECONDS) : 0.021566 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.021432 #CONJOIN_DISJUNCTIVE : 1711 #RENAME_VARIABLES : 3785 #UNFREEZE : 0 #CONJOIN : 2247 #PROJECTAWAY : 2011 #ADD_WEAK_EQUALITY : 17 #DISJOIN : 395 #RENAME_VARIABLES_DISJUNCTIVE : 3545 #ADD_EQUALITY : 124 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 15 - 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: [L555] int N = __VERIFIER_nondet_int(); [L556] int M = __VERIFIER_nondet_int(); [L557] COND FALSE !(N < 1) [L560] COND TRUE M < 1 [L561] M = 1 [L563] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L563] int *size = (int*) __builtin_alloca (N * sizeof(int)); [L564] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L564] int *val = (int*) __builtin_alloca (N * sizeof(int)); [L565] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L565] int *cost = (int*) __builtin_alloca (M * sizeof(int)); [L566] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L566] int *best = (int*) __builtin_alloca (M * sizeof(int)); [L567] CALL knapsack(size, val, N, cost, best, M) [L542] int i, j; [L543] j = 1 [L543] COND TRUE j <= N [L544] i = 1 [L544] COND TRUE i <= M [L545] FCALL size[j] - 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: [L555] int N = __VERIFIER_nondet_int(); [L556] int M = __VERIFIER_nondet_int(); [L557] COND FALSE !(N < 1) [L560] COND TRUE M < 1 [L561] M = 1 [L563] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L563] int *size = (int*) __builtin_alloca (N * sizeof(int)); [L564] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L564] int *val = (int*) __builtin_alloca (N * sizeof(int)); [L565] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L565] int *cost = (int*) __builtin_alloca (M * sizeof(int)); [L566] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L566] int *best = (int*) __builtin_alloca (M * sizeof(int)); [L567] CALL knapsack(size, val, N, cost, best, M) [L542] int i, j; [L543] j = 1 [L543] COND TRUE j <= N [L544] i = 1 [L544] COND TRUE i <= M [L545] FCALL size[j] - 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: [L555] int N = __VERIFIER_nondet_int(); [L556] int M = __VERIFIER_nondet_int(); [L557] COND FALSE !(N < 1) [L560] COND TRUE M < 1 [L561] M = 1 [L563] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L563] int *size = (int*) __builtin_alloca (N * sizeof(int)); [L564] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L564] int *val = (int*) __builtin_alloca (N * sizeof(int)); [L565] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L565] int *cost = (int*) __builtin_alloca (M * sizeof(int)); [L566] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L566] int *best = (int*) __builtin_alloca (M * sizeof(int)); [L567] CALL knapsack(size, val, N, cost, best, M) [L542] int i, j; [L543] j = 1 [L543] COND TRUE j <= N [L544] i = 1 [L544] COND TRUE i <= M [L545] EXPR, FCALL size[j] [L545] COND TRUE i >= size[j] [L546] FCALL cost[i] - 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: [L555] int N = __VERIFIER_nondet_int(); [L556] int M = __VERIFIER_nondet_int(); [L557] COND FALSE !(N < 1) [L560] COND TRUE M < 1 [L561] M = 1 [L563] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L563] int *size = (int*) __builtin_alloca (N * sizeof(int)); [L564] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L564] int *val = (int*) __builtin_alloca (N * sizeof(int)); [L565] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L565] int *cost = (int*) __builtin_alloca (M * sizeof(int)); [L566] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L566] int *best = (int*) __builtin_alloca (M * sizeof(int)); [L567] CALL knapsack(size, val, N, cost, best, M) [L542] int i, j; [L543] j = 1 [L543] COND TRUE j <= N [L544] i = 1 [L544] COND TRUE i <= M [L545] EXPR, FCALL size[j] [L545] COND TRUE i >= size[j] [L546] FCALL cost[i] - 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: [L555] int N = __VERIFIER_nondet_int(); [L556] int M = __VERIFIER_nondet_int(); [L557] COND FALSE !(N < 1) [L560] COND TRUE M < 1 [L561] M = 1 [L563] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L563] int *size = (int*) __builtin_alloca (N * sizeof(int)); [L564] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L564] int *val = (int*) __builtin_alloca (N * sizeof(int)); [L565] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L565] int *cost = (int*) __builtin_alloca (M * sizeof(int)); [L566] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L566] int *best = (int*) __builtin_alloca (M * sizeof(int)); [L567] CALL knapsack(size, val, N, cost, best, M) [L542] int i, j; [L543] j = 1 [L543] COND TRUE j <= N [L544] i = 1 [L544] COND TRUE i <= M [L545] EXPR, FCALL size[j] [L545] COND TRUE i >= size[j] [L546] FCALL cost[i] [L546] FCALL size[j] - 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: [L555] int N = __VERIFIER_nondet_int(); [L556] int M = __VERIFIER_nondet_int(); [L557] COND FALSE !(N < 1) [L560] COND TRUE M < 1 [L561] M = 1 [L563] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L563] int *size = (int*) __builtin_alloca (N * sizeof(int)); [L564] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L564] int *val = (int*) __builtin_alloca (N * sizeof(int)); [L565] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L565] int *cost = (int*) __builtin_alloca (M * sizeof(int)); [L566] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L566] int *best = (int*) __builtin_alloca (M * sizeof(int)); [L567] CALL knapsack(size, val, N, cost, best, M) [L542] int i, j; [L543] j = 1 [L543] COND TRUE j <= N [L544] i = 1 [L544] COND TRUE i <= M [L545] EXPR, FCALL size[j] [L545] COND TRUE i >= size[j] [L546] FCALL cost[i] [L546] EXPR, FCALL size[j] [L546] FCALL cost[i - size[j]] - 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: [L555] int N = __VERIFIER_nondet_int(); [L556] int M = __VERIFIER_nondet_int(); [L557] COND FALSE !(N < 1) [L560] COND TRUE M < 1 [L561] M = 1 [L563] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L563] int *size = (int*) __builtin_alloca (N * sizeof(int)); [L564] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L564] int *val = (int*) __builtin_alloca (N * sizeof(int)); [L565] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L565] int *cost = (int*) __builtin_alloca (M * sizeof(int)); [L566] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L566] int *best = (int*) __builtin_alloca (M * sizeof(int)); [L567] CALL knapsack(size, val, N, cost, best, M) [L542] int i, j; [L543] j = 1 [L543] COND TRUE j <= N [L544] i = 1 [L544] COND TRUE i <= M [L545] EXPR, FCALL size[j] [L545] COND TRUE i >= size[j] [L546] FCALL cost[i] [L546] EXPR, FCALL size[j] [L546] FCALL cost[i - size[j]] [L546] FCALL val[j] - 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: [L555] int N = __VERIFIER_nondet_int(); [L556] int M = __VERIFIER_nondet_int(); [L557] COND FALSE !(N < 1) [L560] COND TRUE M < 1 [L561] M = 1 [L563] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L563] int *size = (int*) __builtin_alloca (N * sizeof(int)); [L564] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L564] int *val = (int*) __builtin_alloca (N * sizeof(int)); [L565] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L565] int *cost = (int*) __builtin_alloca (M * sizeof(int)); [L566] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L566] int *best = (int*) __builtin_alloca (M * sizeof(int)); [L567] CALL knapsack(size, val, N, cost, best, M) [L542] int i, j; [L543] j = 1 [L543] COND TRUE j <= N [L544] i = 1 [L544] COND TRUE i <= M [L545] EXPR, FCALL size[j] [L545] COND TRUE i >= size[j] [L546] FCALL cost[i] [L546] EXPR, FCALL size[j] [L546] FCALL cost[i - size[j]] [L546] FCALL val[j] - 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: [L555] int N = __VERIFIER_nondet_int(); [L556] int M = __VERIFIER_nondet_int(); [L557] COND FALSE !(N < 1) [L560] COND TRUE M < 1 [L561] M = 1 [L563] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L563] int *size = (int*) __builtin_alloca (N * sizeof(int)); [L564] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L564] int *val = (int*) __builtin_alloca (N * sizeof(int)); [L565] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L565] int *cost = (int*) __builtin_alloca (M * sizeof(int)); [L566] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L566] int *best = (int*) __builtin_alloca (M * sizeof(int)); [L567] CALL knapsack(size, val, N, cost, best, M) [L542] int i, j; [L543] j = 1 [L543] COND TRUE j <= N [L544] i = 1 [L544] COND TRUE i <= M [L545] EXPR, FCALL size[j] [L545] COND TRUE i >= size[j] [L546] EXPR, FCALL cost[i] [L546] EXPR, FCALL size[j] [L546] EXPR, FCALL cost[i - size[j]] [L546] EXPR, FCALL val[j] [L546] COND TRUE cost[i] < cost[i - size[j]] + val[j] [L547] FCALL size[j] - 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: [L555] int N = __VERIFIER_nondet_int(); [L556] int M = __VERIFIER_nondet_int(); [L557] COND FALSE !(N < 1) [L560] COND TRUE M < 1 [L561] M = 1 [L563] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L563] int *size = (int*) __builtin_alloca (N * sizeof(int)); [L564] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L564] int *val = (int*) __builtin_alloca (N * sizeof(int)); [L565] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L565] int *cost = (int*) __builtin_alloca (M * sizeof(int)); [L566] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L566] int *best = (int*) __builtin_alloca (M * sizeof(int)); [L567] CALL knapsack(size, val, N, cost, best, M) [L542] int i, j; [L543] j = 1 [L543] COND TRUE j <= N [L544] i = 1 [L544] COND TRUE i <= M [L545] EXPR, FCALL size[j] [L545] COND TRUE i >= size[j] [L546] EXPR, FCALL cost[i] [L546] EXPR, FCALL size[j] [L546] EXPR, FCALL cost[i - size[j]] [L546] EXPR, FCALL val[j] [L546] COND TRUE cost[i] < cost[i - size[j]] + val[j] [L547] EXPR, FCALL size[j] [L547] FCALL cost[i - size[j]] - UnprovableResult [Line: 554]: 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: [L555] int N = __VERIFIER_nondet_int(); [L556] int M = __VERIFIER_nondet_int(); [L557] COND FALSE !(N < 1) [L560] COND TRUE M < 1 [L561] M = 1 [L563] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L563] int *size = (int*) __builtin_alloca (N * sizeof(int)); [L564] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L564] int *val = (int*) __builtin_alloca (N * sizeof(int)); [L565] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L565] int *cost = (int*) __builtin_alloca (M * sizeof(int)); [L566] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L566] int *best = (int*) __builtin_alloca (M * sizeof(int)); [L567] CALL knapsack(size, val, N, cost, best, M) [L542] int i, j; [L543] j = 1 [L543] COND FALSE, RET !(j <= N) [L567] knapsack(size, val, N, cost, best, M) [L568] return 0; - 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: [L555] int N = __VERIFIER_nondet_int(); [L556] int M = __VERIFIER_nondet_int(); [L557] COND FALSE !(N < 1) [L560] COND TRUE M < 1 [L561] M = 1 [L563] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L563] int *size = (int*) __builtin_alloca (N * sizeof(int)); [L564] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L564] int *val = (int*) __builtin_alloca (N * sizeof(int)); [L565] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L565] int *cost = (int*) __builtin_alloca (M * sizeof(int)); [L566] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L566] int *best = (int*) __builtin_alloca (M * sizeof(int)); [L567] CALL knapsack(size, val, N, cost, best, M) [L542] int i, j; [L543] j = 1 [L543] COND TRUE j <= N [L544] i = 1 [L544] COND TRUE i <= M [L545] EXPR, FCALL size[j] [L545] COND TRUE i >= size[j] [L546] EXPR, FCALL cost[i] [L546] EXPR, FCALL size[j] [L546] EXPR, FCALL cost[i - size[j]] [L546] EXPR, FCALL val[j] [L546] COND TRUE cost[i] < cost[i - size[j]] + val[j] [L547] EXPR, FCALL size[j] [L547] FCALL cost[i - size[j]] [L547] FCALL val[j] - 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: [L555] int N = __VERIFIER_nondet_int(); [L556] int M = __VERIFIER_nondet_int(); [L557] COND FALSE !(N < 1) [L560] COND TRUE M < 1 [L561] M = 1 [L563] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L563] int *size = (int*) __builtin_alloca (N * sizeof(int)); [L564] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L564] int *val = (int*) __builtin_alloca (N * sizeof(int)); [L565] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L565] int *cost = (int*) __builtin_alloca (M * sizeof(int)); [L566] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L566] int *best = (int*) __builtin_alloca (M * sizeof(int)); [L567] CALL knapsack(size, val, N, cost, best, M) [L542] int i, j; [L543] j = 1 [L543] COND TRUE j <= N [L544] i = 1 [L544] COND TRUE i <= M [L545] EXPR, FCALL size[j] [L545] COND TRUE i >= size[j] [L546] EXPR, FCALL cost[i] [L546] EXPR, FCALL size[j] [L546] EXPR, FCALL cost[i - size[j]] [L546] EXPR, FCALL val[j] [L546] COND TRUE cost[i] < cost[i - size[j]] + val[j] [L547] EXPR, FCALL size[j] [L547] EXPR, FCALL cost[i - size[j]] [L547] EXPR, FCALL val[j] [L547] FCALL cost[i] = cost[i - size[j]] + val[j] - 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: [L555] int N = __VERIFIER_nondet_int(); [L556] int M = __VERIFIER_nondet_int(); [L557] COND FALSE !(N < 1) [L560] COND TRUE M < 1 [L561] M = 1 [L563] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L563] int *size = (int*) __builtin_alloca (N * sizeof(int)); [L564] EXPR, FCALL __builtin_alloca (N * sizeof(int)) [L564] int *val = (int*) __builtin_alloca (N * sizeof(int)); [L565] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L565] int *cost = (int*) __builtin_alloca (M * sizeof(int)); [L566] EXPR, FCALL __builtin_alloca (M * sizeof(int)) [L566] int *best = (int*) __builtin_alloca (M * sizeof(int)); [L567] CALL knapsack(size, val, N, cost, best, M) [L542] int i, j; [L543] j = 1 [L543] COND TRUE j <= N [L544] i = 1 [L544] COND TRUE i <= M [L545] EXPR, FCALL size[j] [L545] COND TRUE i >= size[j] [L546] EXPR, FCALL cost[i] [L546] EXPR, FCALL size[j] [L546] EXPR, FCALL cost[i - size[j]] [L546] EXPR, FCALL val[j] [L546] COND TRUE cost[i] < cost[i - size[j]] + val[j] [L547] EXPR, FCALL size[j] [L547] EXPR, FCALL cost[i - size[j]] [L547] EXPR, FCALL val[j] [L547] FCALL cost[i] = cost[i - size[j]] + val[j] [L548] FCALL best[i] = j - 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]: 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]: 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/knapsack_alloca_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-21-03-176.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/knapsack_alloca_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-21-03-176.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/knapsack_alloca_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-21-03-176.csv Received shutdown request...