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/memsafety-ext2/complex_data_creation_test02_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:27:37,251 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:27:37,253 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:27:37,268 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:27:37,268 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:27:37,269 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:27:37,270 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:27:37,272 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:27:37,274 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:27:37,275 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:27:37,276 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:27:37,276 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:27:37,277 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:27:37,278 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:27:37,279 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:27:37,282 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:27:37,284 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:27:37,286 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:27:37,288 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:27:37,289 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:27:37,291 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:27:37,292 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:27:37,292 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:27:37,293 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:27:37,294 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:27:37,295 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:27:37,296 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:27:37,296 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:27:37,297 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:27:37,297 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:27:37,298 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:27:37,298 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:27:37,308 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:27:37,308 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:27:37,309 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:27:37,310 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:27:37,310 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:27:37,310 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:27:37,310 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:27:37,310 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:27:37,311 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:27:37,311 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:27:37,311 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:27:37,312 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:27:37,312 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:27:37,312 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:27:37,312 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:27:37,312 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:27:37,313 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:27:37,313 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:27:37,313 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:27:37,313 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:27:37,313 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:27:37,314 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:27:37,314 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:27:37,314 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:27:37,314 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:27:37,314 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:27:37,315 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:27:37,315 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:27:37,315 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:27:37,315 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:27:37,315 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:27:37,316 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:27:37,316 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:27:37,317 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:27:37,317 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:27:37,354 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:27:37,368 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:27:37,372 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:27:37,374 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:27:37,375 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:27:37,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test02_false-valid-memtrack.i [2018-01-24 16:27:37,584 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:27:37,589 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:27:37,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:27:37,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:27:37,595 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:27:37,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:27:37" (1/1) ... [2018-01-24 16:27:37,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4be6e797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:37, skipping insertion in model container [2018-01-24 16:27:37,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:27:37" (1/1) ... [2018-01-24 16:27:37,611 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:27:37,651 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:27:37,781 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:27:37,810 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:27:37,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:37 WrapperNode [2018-01-24 16:27:37,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:27:37,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:27:37,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:27:37,827 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:27:37,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:37" (1/1) ... [2018-01-24 16:27:37,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:37" (1/1) ... [2018-01-24 16:27:37,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:37" (1/1) ... [2018-01-24 16:27:37,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:37" (1/1) ... [2018-01-24 16:27:37,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:37" (1/1) ... [2018-01-24 16:27:37,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:37" (1/1) ... [2018-01-24 16:27:37,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:37" (1/1) ... [2018-01-24 16:27:37,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:27:37,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:27:37,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:27:37,875 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:27:37,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:27:37" (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:27:37,925 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:27:37,925 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:27:37,925 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-01-24 16:27:37,926 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-01-24 16:27:37,926 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-24 16:27:37,926 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:27:37,926 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:27:37,926 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:27:37,926 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:27:37,926 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:27:37,926 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:27:37,926 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:27:37,927 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:27:37,927 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:27:37,927 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:27:37,927 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:27:37,927 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-01-24 16:27:37,927 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-01-24 16:27:37,927 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-24 16:27:37,927 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:27:37,927 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:27:37,927 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:27:38,698 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:27:38,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:27:38 BoogieIcfgContainer [2018-01-24 16:27:38,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:27:38,700 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:27:38,700 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:27:38,700 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:27:38,701 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:27:38" (1/1) ... [2018-01-24 16:27:38,750 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:27:56,425 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:27:56,506 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:27:56,512 INFO L268 AbstractInterpreter]: Visited 232 different actions 5899 times. Merged at 139 different actions 3062 times. Widened at 2 different actions 20 times. Found 415 fixpoints after 36 different actions. Largest state had 51 variables. [2018-01-24 16:27:56,515 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:27:56,516 INFO L168 Benchmark]: Toolchain (without parser) took 18931.42 ms. Allocated memory was 301.5 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 261.4 MB in the beginning and 124.0 MB in the end (delta: 137.4 MB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-01-24 16:27:56,517 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 301.5 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:27:56,518 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.31 ms. Allocated memory is still 301.5 MB. Free memory was 260.4 MB in the beginning and 249.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:56,518 INFO L168 Benchmark]: Boogie Preprocessor took 47.89 ms. Allocated memory is still 301.5 MB. Free memory was 249.3 MB in the beginning and 246.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:56,518 INFO L168 Benchmark]: RCFGBuilder took 824.10 ms. Allocated memory is still 301.5 MB. Free memory was 246.4 MB in the beginning and 196.8 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 5.3 GB. [2018-01-24 16:27:56,519 INFO L168 Benchmark]: Abstract Interpretation took 17815.69 ms. Allocated memory was 301.5 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 196.8 MB in the beginning and 124.0 MB in the end (delta: 72.8 MB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-01-24 16:27:56,521 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.19 ms. Allocated memory is still 301.5 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 236.31 ms. Allocated memory is still 301.5 MB. Free memory was 260.4 MB in the beginning and 249.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 47.89 ms. Allocated memory is still 301.5 MB. Free memory was 249.3 MB in the beginning and 246.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 824.10 ms. Allocated memory is still 301.5 MB. Free memory was 246.4 MB in the beginning and 196.8 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 17815.69 ms. Allocated memory was 301.5 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 196.8 MB in the beginning and 124.0 MB in the end (delta: 72.8 MB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 187 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 2294 LocStat_NO_SUPPORTING_DISEQUALITIES : 855 LocStat_NO_DISJUNCTIONS : -374 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 242 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 405 TransStat_NO_SUPPORTING_DISEQUALITIES : 92 TransStat_NO_DISJUNCTIONS : 304 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.246514 RENAME_VARIABLES(MILLISECONDS) : 0.196267 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.234628 PROJECTAWAY(MILLISECONDS) : 0.104823 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002745 DISJOIN(MILLISECONDS) : 0.154159 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.215038 ADD_EQUALITY(MILLISECONDS) : 0.015143 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007336 #CONJOIN_DISJUNCTIVE : 8539 #RENAME_VARIABLES : 19845 #UNFREEZE : 0 #CONJOIN : 12061 #PROJECTAWAY : 10102 #ADD_WEAK_EQUALITY : 129 #DISJOIN : 2788 #RENAME_VARIABLES_DISJUNCTIVE : 17698 #ADD_EQUALITY : 458 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 74 - 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: [L586] FCALL struct node_t *list = ((void *)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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] FCALL \read(**pointerToList) - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] FCALL \read(**pointerToList) - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] FCALL \read(**pointerToList) - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] FCALL node->next - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] FCALL node->next->data - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] FCALL node->next->data - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] FCALL prevData->hasNextPartReference - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] FCALL prevData->hasNextPartReference - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] FCALL prevData->nextData - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND FALSE !(counter < 3) [L550] FCALL data->number = 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND TRUE counter < 3 [L548] FCALL data->array - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND TRUE counter < 3 [L548] EXPR, FCALL data->array [L548] FCALL data->array[counter] = __VERIFIER_nondet_int() - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] FCALL *pointerToList = node - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND FALSE !(counter < 3) [L550] FCALL data->number = 0 [L551] int userInput = __VERIFIER_nondet_int(); [L552] __VERIFIER_nondet_int() && data->number < 200 [L552] FCALL data->number - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] FCALL \read(*list) - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] FCALL list->data - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND FALSE !(counter < 3) [L550] FCALL data->number = 0 [L551] int userInput = __VERIFIER_nondet_int(); [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L552] COND FALSE !(__VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200) [L556] FCALL data->hasNextPartReference = 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND FALSE !(counter < 3) [L550] FCALL data->number = 0 [L551] int userInput = __VERIFIER_nondet_int(); [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L552] COND FALSE !(__VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200) [L556] FCALL data->hasNextPartReference = 0 [L557] FCALL data->nextData = ((void *)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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND FALSE !(counter < 3) [L550] FCALL data->number = 0 [L551] int userInput = __VERIFIER_nondet_int(); [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 [L552] EXPR, FCALL data->number [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 [L552] __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L552] FCALL data->number - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND TRUE counter < 3 [L548] EXPR, FCALL data->array [L548] FCALL data->array[counter] = __VERIFIER_nondet_int() [L547] counter++ [L547] COND TRUE counter < 3 [L548] EXPR, FCALL data->array [L548] FCALL data->array[counter] = __VERIFIER_nondet_int() - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] list->data != ((void *)0) && list->data->hasNextPartReference [L590] FCALL \read(*list) - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] list->data != ((void *)0) && list->data->hasNextPartReference [L590] EXPR, FCALL \read(*list) [L590] FCALL list->data - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND FALSE !(counter < 3) [L550] FCALL data->number = 0 [L551] int userInput = __VERIFIER_nondet_int(); [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 [L552] EXPR, FCALL data->number [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L552] EXPR, FCALL data->number [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L552] COND TRUE __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200 [L553] FCALL data->number - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] list->data != ((void *)0) && list->data->hasNextPartReference [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] FCALL list->data->hasNextPartReference - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] list->data != ((void *)0) && list->data->hasNextPartReference [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] FCALL list->data->hasNextPartReference - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND FALSE !(counter < 3) [L550] FCALL data->number = 0 [L551] int userInput = __VERIFIER_nondet_int(); [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 [L552] EXPR, FCALL data->number [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L552] EXPR, FCALL data->number [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L552] COND TRUE __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200 [L553] EXPR, FCALL data->number [L553] FCALL data->number = data->number + __VERIFIER_nondet_int() - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND FALSE !(counter < 3) [L550] FCALL data->number = 0 [L551] int userInput = __VERIFIER_nondet_int(); [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L552] COND FALSE !(__VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200) [L556] FCALL data->hasNextPartReference = 0 [L557] FCALL data->nextData = ((void *)0) [L558] COND TRUE __VERIFIER_nondet_int() [L559] EXPR, FCALL malloc(sizeof *data) [L559] Data nextData = malloc(sizeof *data); [L560] FCALL nextData->array = ((void *)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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] dataNotFinished = list->data != ((void *)0) && list->data->hasNextPartReference [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] COND FALSE !(dataNotFinished || __VERIFIER_nondet_int()) [L592] FCALL \read(*list) - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL, EXPR create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND FALSE !(counter < 3) [L550] FCALL data->number = 0 [L551] int userInput = __VERIFIER_nondet_int(); [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L552] COND FALSE !(__VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200) [L556] FCALL data->hasNextPartReference = 0 [L557] FCALL data->nextData = ((void *)0) [L558] COND FALSE !(__VERIFIER_nondet_int()) [L569] RET return data; [L579] EXPR create_data(((void *)0)) [L579] FCALL node->data = create_data(((void *)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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL, EXPR create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND FALSE !(counter < 3) [L550] FCALL data->number = 0 [L551] int userInput = __VERIFIER_nondet_int(); [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L552] COND FALSE !(__VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200) [L556] FCALL data->hasNextPartReference = 0 [L557] FCALL data->nextData = ((void *)0) [L558] COND FALSE !(__VERIFIER_nondet_int()) [L569] RET return data; [L579] EXPR create_data(((void *)0)) [L579] FCALL node->data = create_data(((void *)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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND FALSE !(counter < 3) [L550] FCALL data->number = 0 [L551] int userInput = __VERIFIER_nondet_int(); [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L552] COND FALSE !(__VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200) [L556] FCALL data->hasNextPartReference = 0 [L557] FCALL data->nextData = ((void *)0) [L558] COND TRUE __VERIFIER_nondet_int() [L559] EXPR, FCALL malloc(sizeof *data) [L559] Data nextData = malloc(sizeof *data); [L560] FCALL nextData->array = ((void *)0) [L561] FCALL data->number - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND FALSE !(counter < 3) [L550] FCALL data->number = 0 [L551] int userInput = __VERIFIER_nondet_int(); [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L552] COND FALSE !(__VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200) [L556] FCALL data->hasNextPartReference = 0 [L557] FCALL data->nextData = ((void *)0) [L558] COND TRUE __VERIFIER_nondet_int() [L559] EXPR, FCALL malloc(sizeof *data) [L559] Data nextData = malloc(sizeof *data); [L560] FCALL nextData->array = ((void *)0) [L561] FCALL data->number - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND FALSE !(counter < 3) [L550] FCALL data->number = 0 [L551] int userInput = __VERIFIER_nondet_int(); [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L552] COND FALSE !(__VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200) [L556] FCALL data->hasNextPartReference = 0 [L557] FCALL data->nextData = ((void *)0) [L558] COND TRUE __VERIFIER_nondet_int() [L559] EXPR, FCALL malloc(sizeof *data) [L559] Data nextData = malloc(sizeof *data); [L560] FCALL nextData->array = ((void *)0) [L561] EXPR, FCALL data->number [L561] FCALL nextData->number = data->number - 200 - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] dataNotFinished = list->data != ((void *)0) && list->data->hasNextPartReference [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] COND FALSE !(dataNotFinished || __VERIFIER_nondet_int()) [L592] FCALL \read(*list) [L592] COND TRUE \read(*list) [L593] FCALL \read(*list) - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL, EXPR create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND FALSE !(counter < 3) [L550] FCALL data->number = 0 [L551] int userInput = __VERIFIER_nondet_int(); [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L552] COND FALSE !(__VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200) [L556] FCALL data->hasNextPartReference = 0 [L557] FCALL data->nextData = ((void *)0) [L558] COND FALSE !(__VERIFIER_nondet_int()) [L569] RET return data; [L579] EXPR create_data(((void *)0)) [L579] FCALL node->data = create_data(((void *)0)) [L583] FCALL *pointerToList = node - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] dataNotFinished = list->data != ((void *)0) && list->data->hasNextPartReference [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] COND FALSE !(dataNotFinished || __VERIFIER_nondet_int()) [L592] FCALL \read(*list) [L592] COND TRUE \read(*list) [L593] EXPR, FCALL \read(*list) [L593] FCALL list->next - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND FALSE !(counter < 3) [L550] FCALL data->number = 0 [L551] int userInput = __VERIFIER_nondet_int(); [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L552] COND FALSE !(__VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200) [L556] FCALL data->hasNextPartReference = 0 [L557] FCALL data->nextData = ((void *)0) [L558] COND FALSE !(__VERIFIER_nondet_int()) [L569] RET return data; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND FALSE !(counter < 3) [L550] FCALL data->number = 0 [L551] int userInput = __VERIFIER_nondet_int(); [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L552] COND FALSE !(__VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200) [L556] FCALL data->hasNextPartReference = 0 [L557] FCALL data->nextData = ((void *)0) [L558] COND TRUE __VERIFIER_nondet_int() [L559] EXPR, FCALL malloc(sizeof *data) [L559] Data nextData = malloc(sizeof *data); [L560] FCALL nextData->array = ((void *)0) [L561] EXPR, FCALL data->number [L561] FCALL nextData->number = data->number - 200 [L562] FCALL data->number = 200 - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND FALSE !(counter < 3) [L550] FCALL data->number = 0 [L551] int userInput = __VERIFIER_nondet_int(); [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L552] COND FALSE !(__VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200) [L556] FCALL data->hasNextPartReference = 0 [L557] FCALL data->nextData = ((void *)0) [L558] COND TRUE __VERIFIER_nondet_int() [L559] EXPR, FCALL malloc(sizeof *data) [L559] Data nextData = malloc(sizeof *data); [L560] FCALL nextData->array = ((void *)0) [L561] EXPR, FCALL data->number [L561] FCALL nextData->number = data->number - 200 [L562] FCALL data->number = 200 [L563] FCALL data->hasNextPartReference = 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] dataNotFinished = list->data != ((void *)0) && list->data->hasNextPartReference [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] COND FALSE !(dataNotFinished || __VERIFIER_nondet_int()) [L592] FCALL \read(*list) [L592] COND TRUE \read(*list) [L593] EXPR, FCALL \read(*list) [L593] EXPR, FCALL list->next [L593] struct node_t *next = list->next; [L594] FCALL \read(*list) - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND FALSE !(counter < 3) [L550] FCALL data->number = 0 [L551] int userInput = __VERIFIER_nondet_int(); [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L552] COND FALSE !(__VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200) [L556] FCALL data->hasNextPartReference = 0 [L557] FCALL data->nextData = ((void *)0) [L558] COND TRUE __VERIFIER_nondet_int() [L559] EXPR, FCALL malloc(sizeof *data) [L559] Data nextData = malloc(sizeof *data); [L560] FCALL nextData->array = ((void *)0) [L561] EXPR, FCALL data->number [L561] FCALL nextData->number = data->number - 200 [L562] FCALL data->number = 200 [L563] FCALL data->hasNextPartReference = 1 [L564] FCALL data->nextData = nextData - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] dataNotFinished = list->data != ((void *)0) && list->data->hasNextPartReference [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] COND FALSE !(dataNotFinished || __VERIFIER_nondet_int()) [L592] FCALL \read(*list) [L592] COND TRUE \read(*list) [L593] EXPR, FCALL \read(*list) [L593] EXPR, FCALL list->next [L593] struct node_t *next = list->next; [L594] EXPR, FCALL \read(*list) [L594] FCALL list->data - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND FALSE !(counter < 3) [L550] FCALL data->number = 0 [L551] int userInput = __VERIFIER_nondet_int(); [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L552] COND FALSE !(__VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200) [L556] FCALL data->hasNextPartReference = 0 [L557] FCALL data->nextData = ((void *)0) [L558] COND TRUE __VERIFIER_nondet_int() [L559] EXPR, FCALL malloc(sizeof *data) [L559] Data nextData = malloc(sizeof *data); [L560] FCALL nextData->array = ((void *)0) [L561] EXPR, FCALL data->number [L561] FCALL nextData->number = data->number - 200 [L562] FCALL data->number = 200 [L563] FCALL data->hasNextPartReference = 1 [L564] FCALL data->nextData = nextData [L565] FCALL nextData->hasNextPartReference = 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) [L544] Data data = malloc(sizeof *data); [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L546] int counter = 0; [L547] counter = 0 [L547] COND FALSE !(counter < 3) [L550] FCALL data->number = 0 [L551] int userInput = __VERIFIER_nondet_int(); [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L552] COND FALSE !(__VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200) [L556] FCALL data->hasNextPartReference = 0 [L557] FCALL data->nextData = ((void *)0) [L558] COND TRUE __VERIFIER_nondet_int() [L559] EXPR, FCALL malloc(sizeof *data) [L559] Data nextData = malloc(sizeof *data); [L560] FCALL nextData->array = ((void *)0) [L561] EXPR, FCALL data->number [L561] FCALL nextData->number = data->number - 200 [L562] FCALL data->number = 200 [L563] FCALL data->hasNextPartReference = 1 [L564] FCALL data->nextData = nextData [L565] FCALL nextData->hasNextPartReference = 0 [L566] FCALL nextData->nextData = ((void *)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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] dataNotFinished = list->data != ((void *)0) && list->data->hasNextPartReference [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] COND FALSE !(dataNotFinished || __VERIFIER_nondet_int()) [L592] FCALL \read(*list) [L592] COND TRUE \read(*list) [L593] EXPR, FCALL \read(*list) [L593] EXPR, FCALL list->next [L593] struct node_t *next = list->next; [L594] EXPR, FCALL \read(*list) [L594] EXPR, FCALL list->data [L594] CALL freeData(list->data) [L572] FCALL data->array - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] dataNotFinished = list->data != ((void *)0) && list->data->hasNextPartReference [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] COND FALSE !(dataNotFinished || __VERIFIER_nondet_int()) [L592] FCALL \read(*list) [L592] COND TRUE \read(*list) [L593] EXPR, FCALL \read(*list) [L593] EXPR, FCALL list->next [L593] struct node_t *next = list->next; [L594] EXPR, FCALL \read(*list) [L594] EXPR, FCALL list->data [L594] CALL freeData(list->data) [L572] EXPR, FCALL data->array [L572] FCALL free(data->array) - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] dataNotFinished = list->data != ((void *)0) && list->data->hasNextPartReference [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] COND FALSE !(dataNotFinished || __VERIFIER_nondet_int()) [L592] FCALL \read(*list) [L592] COND TRUE \read(*list) [L593] EXPR, FCALL \read(*list) [L593] EXPR, FCALL list->next [L593] struct node_t *next = list->next; [L594] EXPR, FCALL \read(*list) [L594] EXPR, FCALL list->data [L594] CALL freeData(list->data) [L572] EXPR, FCALL data->array [L572] FCALL free(data->array) - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR, FCALL list->data->hasNextPartReference [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] dataNotFinished = list->data != ((void *)0) && list->data->hasNextPartReference [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] COND FALSE !(dataNotFinished || __VERIFIER_nondet_int()) [L592] FCALL \read(*list) [L592] COND TRUE \read(*list) [L593] EXPR, FCALL \read(*list) [L593] EXPR, FCALL list->next [L593] struct node_t *next = list->next; [L594] EXPR, FCALL \read(*list) [L594] EXPR, FCALL list->data [L594] CALL freeData(list->data) [L572] FCALL data->array - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] dataNotFinished = list->data != ((void *)0) && list->data->hasNextPartReference [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] COND FALSE !(dataNotFinished || __VERIFIER_nondet_int()) [L592] FCALL \read(*list) [L592] COND TRUE \read(*list) [L593] EXPR, FCALL \read(*list) [L593] EXPR, FCALL list->next [L593] struct node_t *next = list->next; [L594] EXPR, FCALL \read(*list) [L594] EXPR, FCALL list->data [L594] CALL freeData(list->data) [L572] EXPR, FCALL data->array [L572] FCALL free(data->array) [L573] FCALL free(data) [L595] FCALL \read(*list) - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] dataNotFinished = list->data != ((void *)0) && list->data->hasNextPartReference [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] COND FALSE !(dataNotFinished || __VERIFIER_nondet_int()) [L592] FCALL \read(*list) [L592] COND TRUE \read(*list) [L593] EXPR, FCALL \read(*list) [L593] EXPR, FCALL list->next [L593] struct node_t *next = list->next; [L594] EXPR, FCALL \read(*list) [L594] EXPR, FCALL list->data [L594] CALL freeData(list->data) [L572] EXPR, FCALL data->array [L572] FCALL free(data->array) [L573] FCALL free(data) [L595] FCALL \read(*list) - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR, FCALL list->data->hasNextPartReference [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] dataNotFinished = list->data != ((void *)0) && list->data->hasNextPartReference [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] COND FALSE !(dataNotFinished || __VERIFIER_nondet_int()) [L592] FCALL \read(*list) [L592] COND TRUE \read(*list) [L593] EXPR, FCALL \read(*list) [L593] EXPR, FCALL list->next [L593] struct node_t *next = list->next; [L594] EXPR, FCALL \read(*list) [L594] EXPR, FCALL list->data [L594] CALL freeData(list->data) [L572] EXPR, FCALL data->array [L572] FCALL free(data->array) [L573] FCALL free(data) - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR, FCALL list->data->hasNextPartReference [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] dataNotFinished = list->data != ((void *)0) && list->data->hasNextPartReference [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] COND FALSE !(dataNotFinished || __VERIFIER_nondet_int()) [L592] FCALL \read(*list) [L592] COND TRUE \read(*list) [L593] EXPR, FCALL \read(*list) [L593] EXPR, FCALL list->next [L593] struct node_t *next = list->next; [L594] EXPR, FCALL \read(*list) [L594] EXPR, FCALL list->data [L594] CALL freeData(list->data) [L572] EXPR, FCALL data->array [L572] FCALL free(data->array) [L573] FCALL free(data) - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] dataNotFinished = list->data != ((void *)0) && list->data->hasNextPartReference [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] COND TRUE dataNotFinished || __VERIFIER_nondet_int() [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] FCALL prevData->nextData - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] dataNotFinished = list->data != ((void *)0) && list->data->hasNextPartReference [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] COND FALSE !(dataNotFinished || __VERIFIER_nondet_int()) [L592] FCALL \read(*list) [L592] COND TRUE \read(*list) [L593] EXPR, FCALL \read(*list) [L593] EXPR, FCALL list->next [L593] struct node_t *next = list->next; [L594] EXPR, FCALL \read(*list) [L594] EXPR, FCALL list->data [L594] CALL freeData(list->data) [L572] EXPR, FCALL data->array [L572] FCALL free(data->array) [L573] FCALL free(data) [L595] EXPR, FCALL \read(*list) [L595] FCALL free(list) - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] dataNotFinished = list->data != ((void *)0) && list->data->hasNextPartReference [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] COND FALSE !(dataNotFinished || __VERIFIER_nondet_int()) [L592] FCALL \read(*list) [L592] COND TRUE \read(*list) [L593] EXPR, FCALL \read(*list) [L593] EXPR, FCALL list->next [L593] struct node_t *next = list->next; [L594] EXPR, FCALL \read(*list) [L594] EXPR, FCALL list->data [L594] CALL freeData(list->data) [L572] EXPR, FCALL data->array [L572] FCALL free(data->array) [L573] FCALL free(data) [L595] EXPR, FCALL \read(*list) [L595] FCALL free(list) [L596] FCALL list = next - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] dataNotFinished = list->data != ((void *)0) && list->data->hasNextPartReference [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] COND FALSE !(dataNotFinished || __VERIFIER_nondet_int()) [L592] FCALL \read(*list) [L592] COND TRUE \read(*list) [L593] EXPR, FCALL \read(*list) [L593] EXPR, FCALL list->next [L593] struct node_t *next = list->next; [L594] EXPR, FCALL \read(*list) [L594] EXPR, FCALL list->data [L594] CALL freeData(list->data) [L572] EXPR, FCALL data->array [L572] FCALL free(data->array) [L573] FCALL free(data) [L595] EXPR, FCALL \read(*list) [L595] FCALL free(list) [L596] FCALL list = next - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] dataNotFinished = list->data != ((void *)0) && list->data->hasNextPartReference [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] COND FALSE !(dataNotFinished || __VERIFIER_nondet_int()) [L592] FCALL \read(*list) [L592] COND TRUE \read(*list) [L593] EXPR, FCALL \read(*list) [L593] EXPR, FCALL list->next [L593] struct node_t *next = list->next; [L594] EXPR, FCALL \read(*list) [L594] EXPR, FCALL list->data [L594] CALL freeData(list->data) [L572] EXPR, FCALL data->array [L572] FCALL free(data->array) [L573] FCALL free(data) [L595] EXPR, FCALL \read(*list) [L595] FCALL free(list) [L596] FCALL list = next [L592] FCALL \read(*list) [L592] COND TRUE \read(*list) [L593] EXPR, FCALL \read(*list) [L593] FCALL list->next - UnprovableResult [Line: 585]: 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] dataNotFinished = list->data != ((void *)0) && list->data->hasNextPartReference [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] COND FALSE !(dataNotFinished || __VERIFIER_nondet_int()) [L592] FCALL \read(*list) [L592] COND TRUE \read(*list) [L593] EXPR, FCALL \read(*list) [L593] EXPR, FCALL list->next [L593] struct node_t *next = list->next; [L594] EXPR, FCALL \read(*list) [L594] EXPR, FCALL list->data [L594] CALL freeData(list->data) [L572] EXPR, FCALL data->array [L572] FCALL free(data->array) [L573] FCALL free(data) [L595] EXPR, FCALL \read(*list) [L595] FCALL free(list) [L596] FCALL list = next [L592] FCALL \read(*list) [L592] COND FALSE !(\read(*list)) [L598] return 0; [L586] FCALL struct node_t *list = ((void *)0); [L598] return 0; - 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: [L586] FCALL struct node_t *list = ((void *)0); [L587] int dataNotFinished = 0; [L589] CALL append(&list) [L576] EXPR, FCALL malloc(sizeof *node) [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR, FCALL \read(**pointerToList) [L577] FCALL node->next = *pointerToList [L578] EXPR, FCALL \read(**pointerToList) [L578] COND FALSE !(*pointerToList == ((void *)0)) [L581] EXPR, FCALL node->next [L581] EXPR, FCALL node->next->data [L581] CALL, EXPR create_data(node->next->data) [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] EXPR, FCALL prevData->hasNextPartReference [L541] prevData != ((void *)0) && prevData->hasNextPartReference [L541] COND TRUE prevData != ((void *)0) && prevData->hasNextPartReference [L542] EXPR, FCALL prevData->nextData [L542] RET return prevData->nextData; [L581] EXPR create_data(node->next->data) [L581] FCALL node->data = create_data(node->next->data) [L583] RET, FCALL *pointerToList = node [L589] append(&list) [L590] EXPR, FCALL \read(*list) [L590] EXPR, FCALL list->data [L590] EXPR list->data != ((void *)0) && list->data->hasNextPartReference [L590] dataNotFinished = list->data != ((void *)0) && list->data->hasNextPartReference [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] dataNotFinished || __VERIFIER_nondet_int() [L591] COND FALSE !(dataNotFinished || __VERIFIER_nondet_int()) [L592] FCALL \read(*list) [L592] COND TRUE \read(*list) [L593] EXPR, FCALL \read(*list) [L593] EXPR, FCALL list->next [L593] struct node_t *next = list->next; [L594] EXPR, FCALL \read(*list) [L594] EXPR, FCALL list->data [L594] CALL freeData(list->data) [L572] EXPR, FCALL data->array [L572] FCALL free(data->array) [L573] FCALL free(data) [L595] EXPR, FCALL \read(*list) [L595] FCALL free(list) [L596] FCALL list = next [L592] FCALL \read(*list) [L592] COND TRUE \read(*list) [L593] EXPR, FCALL \read(*list) [L593] EXPR, FCALL list->next [L593] struct node_t *next = list->next; [L594] EXPR, FCALL \read(*list) [L594] EXPR, FCALL list->data [L594] CALL freeData(list->data) [L572] EXPR, FCALL data->array [L572] FCALL free(data->array) [L573] FCALL free(data) [L595] EXPR, FCALL \read(*list) [L595] FCALL free(list) - 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 - 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 - 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 - 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/complex_data_creation_test02_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-27-56-535.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-27-56-535.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-27-56-535.csv Received shutdown request...