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/optional_data_creation_test04_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:28:16,379 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:28:16,380 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:28:16,394 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:28:16,395 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:28:16,395 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:28:16,396 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:28:16,397 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:28:16,399 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:28:16,399 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:28:16,400 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:28:16,400 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:28:16,401 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:28:16,402 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:28:16,402 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:28:16,405 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:28:16,407 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:28:16,409 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:28:16,410 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:28:16,411 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:28:16,414 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:28:16,414 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:28:16,414 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:28:16,415 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:28:16,416 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:28:16,417 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:28:16,418 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:28:16,418 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:28:16,418 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:28:16,419 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:28:16,419 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:28:16,419 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf [2018-01-24 16:28:16,429 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:28:16,429 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:28:16,430 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:28:16,430 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:28:16,431 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:28:16,431 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:28:16,431 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:28:16,431 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:28:16,432 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:28:16,432 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:28:16,432 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:28:16,433 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:28:16,433 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:28:16,433 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:28:16,433 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:28:16,433 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:28:16,434 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:28:16,434 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:28:16,434 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:28:16,434 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:28:16,434 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:28:16,435 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:28:16,435 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:28:16,435 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:28:16,435 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:28:16,436 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:28:16,436 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:28:16,436 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:28:16,436 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:28:16,436 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:28:16,437 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:28:16,437 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:28:16,437 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:28:16,438 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:28:16,438 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:28:16,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:28:16,486 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:28:16,490 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:28:16,492 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:28:16,492 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:28:16,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04_true-valid-memsafety.i [2018-01-24 16:28:16,667 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:28:16,674 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:28:16,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:28:16,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:28:16,708 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:28:16,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:28:16" (1/1) ... [2018-01-24 16:28:16,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321f72c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:16, skipping insertion in model container [2018-01-24 16:28:16,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:28:16" (1/1) ... [2018-01-24 16:28:16,729 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:28:16,769 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:28:16,881 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:28:16,899 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:28:16,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:16 WrapperNode [2018-01-24 16:28:16,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:28:16,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:28:16,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:28:16,909 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:28:16,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:16" (1/1) ... [2018-01-24 16:28:16,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:16" (1/1) ... [2018-01-24 16:28:16,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:16" (1/1) ... [2018-01-24 16:28:16,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:16" (1/1) ... [2018-01-24 16:28:16,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:16" (1/1) ... [2018-01-24 16:28:16,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:16" (1/1) ... [2018-01-24 16:28:16,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:16" (1/1) ... [2018-01-24 16:28:16,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:28:16,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:28:16,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:28:16,952 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:28:16,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:16" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:28:17,004 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:28:17,004 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:28:17,004 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-01-24 16:28:17,004 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-01-24 16:28:17,005 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-24 16:28:17,005 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:28:17,005 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:28:17,005 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:28:17,005 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:28:17,005 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:28:17,005 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:28:17,005 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:28:17,005 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:28:17,005 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:28:17,006 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:28:17,006 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:28:17,006 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-01-24 16:28:17,006 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-01-24 16:28:17,006 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-24 16:28:17,006 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:28:17,006 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:28:17,007 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:28:17,493 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:28:17,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:28:17 BoogieIcfgContainer [2018-01-24 16:28:17,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:28:17,494 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:28:17,494 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:28:17,495 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:28:17,496 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:28:17" (1/1) ... [2018-01-24 16:28:17,541 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:28:19,776 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:28:19,824 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:28:19,829 INFO L268 AbstractInterpreter]: Visited 130 different actions 592 times. Merged at 60 different actions 230 times. Never widened. Found 28 fixpoints after 11 different actions. Largest state had 33 variables. [2018-01-24 16:28:19,831 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:28:19,833 INFO L168 Benchmark]: Toolchain (without parser) took 3164.90 ms. Allocated memory was 306.7 MB in the beginning and 490.2 MB in the end (delta: 183.5 MB). Free memory was 266.7 MB in the beginning and 344.2 MB in the end (delta: -77.4 MB). Peak memory consumption was 106.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:19,833 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 306.7 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:28:19,833 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.57 ms. Allocated memory is still 306.7 MB. Free memory was 265.7 MB in the beginning and 254.7 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:28:19,834 INFO L168 Benchmark]: Boogie Preprocessor took 42.13 ms. Allocated memory is still 306.7 MB. Free memory was 254.7 MB in the beginning and 252.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:19,834 INFO L168 Benchmark]: RCFGBuilder took 542.41 ms. Allocated memory is still 306.7 MB. Free memory was 252.7 MB in the beginning and 222.1 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:19,834 INFO L168 Benchmark]: Abstract Interpretation took 2337.23 ms. Allocated memory was 306.7 MB in the beginning and 490.2 MB in the end (delta: 183.5 MB). Free memory was 222.1 MB in the beginning and 344.2 MB in the end (delta: -122.0 MB). Peak memory consumption was 61.5 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:19,835 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 306.7 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 205.57 ms. Allocated memory is still 306.7 MB. Free memory was 265.7 MB in the beginning and 254.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.13 ms. Allocated memory is still 306.7 MB. Free memory was 254.7 MB in the beginning and 252.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 542.41 ms. Allocated memory is still 306.7 MB. Free memory was 252.7 MB in the beginning and 222.1 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 2337.23 ms. Allocated memory was 306.7 MB in the beginning and 490.2 MB in the end (delta: 183.5 MB). Free memory was 222.1 MB in the beginning and 344.2 MB in the end (delta: -122.0 MB). Peak memory consumption was 61.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 110 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 962 LocStat_NO_SUPPORTING_DISEQUALITIES : 344 LocStat_NO_DISJUNCTIONS : -220 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 140 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 229 TransStat_NO_SUPPORTING_DISEQUALITIES : 60 TransStat_NO_DISJUNCTIONS : 168 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.416539 RENAME_VARIABLES(MILLISECONDS) : 0.004731 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.116227 PROJECTAWAY(MILLISECONDS) : 0.372283 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001589 DISJOIN(MILLISECONDS) : 0.132910 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.014691 ADD_EQUALITY(MILLISECONDS) : 0.031915 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010748 #CONJOIN_DISJUNCTIVE : 986 #RENAME_VARIABLES : 2389 #UNFREEZE : 0 #CONJOIN : 1782 #PROJECTAWAY : 1434 #ADD_WEAK_EQUALITY : 67 #DISJOIN : 437 #RENAME_VARIABLES_DISJUNCTIVE : 2127 #ADD_EQUALITY : 243 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 45 - 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: [L571] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); [L567] EXPR create_data() [L567] FCALL node->data = create_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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL create_data() [L539] COND FALSE !(__VERIFIER_nondet_int()) [L542] EXPR, FCALL malloc(sizeof *data) [L542] Data data = malloc(sizeof *data); [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] FCALL data->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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); [L567] EXPR create_data() [L567] FCALL node->data = create_data() [L568] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL create_data() [L539] COND FALSE !(__VERIFIER_nondet_int()) [L542] EXPR, FCALL malloc(sizeof *data) [L542] Data data = malloc(sizeof *data); [L543] COND TRUE __VERIFIER_nondet_int() [L544] EXPR, FCALL malloc(20 * sizeof(data->array)) [L544] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL create_data() [L539] COND FALSE !(__VERIFIER_nondet_int()) [L542] EXPR, FCALL malloc(sizeof *data) [L542] Data data = malloc(sizeof *data); [L543] COND TRUE __VERIFIER_nondet_int() [L544] EXPR, FCALL malloc(20 * sizeof(data->array)) [L544] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL create_data() [L539] COND FALSE !(__VERIFIER_nondet_int()) [L542] EXPR, FCALL malloc(sizeof *data) [L542] Data data = malloc(sizeof *data); [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] FCALL data->array = ((void *)0) [L552] FCALL 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL create_data() [L539] COND FALSE !(__VERIFIER_nondet_int()) [L542] EXPR, FCALL malloc(sizeof *data) [L542] Data data = malloc(sizeof *data); [L543] COND TRUE __VERIFIER_nondet_int() [L544] EXPR, FCALL malloc(20 * sizeof(data->array)) [L544] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L545] int counter = 0; [L546] counter = 0 [L546] COND TRUE counter < 20 [L547] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND FALSE !(__VERIFIER_nondet_int()) [L542] EXPR, FCALL malloc(sizeof *data) [L542] Data data = malloc(sizeof *data); [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] FCALL data->array = ((void *)0) [L552] FCALL data->number = __VERIFIER_nondet_int() [L553] RET return data; [L567] EXPR create_data() [L567] FCALL node->data = create_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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); [L567] EXPR create_data() [L567] FCALL node->data = create_data() [L568] RET, FCALL *pointerToList = node [L574] append(&list) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L576] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL create_data() [L539] COND FALSE !(__VERIFIER_nondet_int()) [L542] EXPR, FCALL malloc(sizeof *data) [L542] Data data = malloc(sizeof *data); [L543] COND TRUE __VERIFIER_nondet_int() [L544] EXPR, FCALL malloc(20 * sizeof(data->array)) [L544] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L545] int counter = 0; [L546] counter = 0 [L546] COND TRUE counter < 20 [L547] EXPR, FCALL data->array [L547] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND FALSE !(__VERIFIER_nondet_int()) [L542] EXPR, FCALL malloc(sizeof *data) [L542] Data data = malloc(sizeof *data); [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] FCALL data->array = ((void *)0) [L552] FCALL data->number = __VERIFIER_nondet_int() [L553] RET return data; [L567] EXPR create_data() [L567] FCALL node->data = create_data() [L568] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); [L567] EXPR create_data() [L567] FCALL node->data = create_data() [L568] RET, FCALL *pointerToList = node [L574] append(&list) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L576] FCALL \read(*list) [L576] COND TRUE \read(*list) [L577] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); [L567] EXPR create_data() [L567] FCALL node->data = create_data() [L568] RET, FCALL *pointerToList = node [L574] append(&list) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L576] FCALL \read(*list) [L576] COND TRUE \read(*list) [L577] EXPR, FCALL \read(*list) [L577] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); [L567] EXPR create_data() [L567] FCALL node->data = create_data() [L568] RET, FCALL *pointerToList = node [L574] append(&list) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L576] FCALL \read(*list) [L576] COND TRUE \read(*list) [L577] EXPR, FCALL \read(*list) [L577] EXPR, FCALL list->next [L577] struct node_t *next = list->next; [L578] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); [L567] EXPR create_data() [L567] FCALL node->data = create_data() [L568] RET, FCALL *pointerToList = node [L574] append(&list) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L576] FCALL \read(*list) [L576] COND TRUE \read(*list) [L577] EXPR, FCALL \read(*list) [L577] EXPR, FCALL list->next [L577] struct node_t *next = list->next; [L578] EXPR, FCALL \read(*list) [L578] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL create_data() [L539] COND FALSE !(__VERIFIER_nondet_int()) [L542] EXPR, FCALL malloc(sizeof *data) [L542] Data data = malloc(sizeof *data); [L543] COND TRUE __VERIFIER_nondet_int() [L544] EXPR, FCALL malloc(20 * sizeof(data->array)) [L544] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) [L545] int counter = 0; [L546] counter = 0 [L546] COND TRUE counter < 20 [L547] EXPR, FCALL data->array [L547] FCALL data->array[counter] = __VERIFIER_nondet_int() [L546] counter++ [L546] COND TRUE counter < 20 [L547] EXPR, FCALL data->array [L547] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); [L567] EXPR create_data() [L567] FCALL node->data = create_data() [L568] RET, FCALL *pointerToList = node [L574] append(&list) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L576] FCALL \read(*list) [L576] COND TRUE \read(*list) [L577] EXPR, FCALL \read(*list) [L577] EXPR, FCALL list->next [L577] struct node_t *next = list->next; [L578] EXPR, FCALL \read(*list) [L578] EXPR, FCALL list->data [L578] CALL freeData(list->data) [L556] COND FALSE !(data == ((void *)0)) [L559] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); [L567] EXPR create_data() [L567] FCALL node->data = create_data() [L568] RET, FCALL *pointerToList = node [L574] append(&list) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L576] FCALL \read(*list) [L576] COND TRUE \read(*list) [L577] EXPR, FCALL \read(*list) [L577] EXPR, FCALL list->next [L577] struct node_t *next = list->next; [L578] EXPR, FCALL \read(*list) [L578] EXPR, FCALL list->data [L578] CALL freeData(list->data) [L556] COND FALSE !(data == ((void *)0)) [L559] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); [L567] EXPR create_data() [L567] FCALL node->data = create_data() [L568] RET, FCALL *pointerToList = node [L574] append(&list) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L576] FCALL \read(*list) [L576] COND TRUE \read(*list) [L577] EXPR, FCALL \read(*list) [L577] EXPR, FCALL list->next [L577] struct node_t *next = list->next; [L578] EXPR, FCALL \read(*list) [L578] EXPR, FCALL list->data [L578] CALL freeData(list->data) [L556] COND FALSE !(data == ((void *)0)) [L559] EXPR, FCALL data->array [L559] COND FALSE !(data->array != ((void *)0)) [L562] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); [L567] EXPR create_data() [L567] FCALL node->data = create_data() [L568] RET, FCALL *pointerToList = node [L574] append(&list) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L576] FCALL \read(*list) [L576] COND TRUE \read(*list) [L577] EXPR, FCALL \read(*list) [L577] EXPR, FCALL list->next [L577] struct node_t *next = list->next; [L578] EXPR, FCALL \read(*list) [L578] EXPR, FCALL list->data [L578] CALL freeData(list->data) [L556] COND FALSE !(data == ((void *)0)) [L559] EXPR, FCALL data->array [L559] COND TRUE data->array != ((void *)0) [L560] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); [L567] EXPR create_data() [L567] FCALL node->data = create_data() [L568] RET, FCALL *pointerToList = node [L574] append(&list) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L576] FCALL \read(*list) [L576] COND TRUE \read(*list) [L577] EXPR, FCALL \read(*list) [L577] EXPR, FCALL list->next [L577] struct node_t *next = list->next; [L578] EXPR, FCALL \read(*list) [L578] EXPR, FCALL list->data [L578] CALL freeData(list->data) [L556] COND TRUE, RET data == ((void *)0) [L578] freeData(list->data) [L579] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); [L567] EXPR create_data() [L567] FCALL node->data = create_data() [L568] RET, FCALL *pointerToList = node [L574] append(&list) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L576] FCALL \read(*list) [L576] COND TRUE \read(*list) [L577] EXPR, FCALL \read(*list) [L577] EXPR, FCALL list->next [L577] struct node_t *next = list->next; [L578] EXPR, FCALL \read(*list) [L578] EXPR, FCALL list->data [L578] CALL freeData(list->data) [L556] COND FALSE !(data == ((void *)0)) [L559] EXPR, FCALL data->array [L559] COND TRUE data->array != ((void *)0) [L560] EXPR, FCALL data->array [L560] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); [L567] EXPR create_data() [L567] FCALL node->data = create_data() [L568] RET, FCALL *pointerToList = node [L574] append(&list) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L576] FCALL \read(*list) [L576] COND TRUE \read(*list) [L577] EXPR, FCALL \read(*list) [L577] EXPR, FCALL list->next [L577] struct node_t *next = list->next; [L578] EXPR, FCALL \read(*list) [L578] EXPR, FCALL list->data [L578] CALL freeData(list->data) [L556] COND FALSE !(data == ((void *)0)) [L559] EXPR, FCALL data->array [L559] COND TRUE data->array != ((void *)0) [L560] EXPR, FCALL data->array [L560] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); [L567] EXPR create_data() [L567] FCALL node->data = create_data() [L568] RET, FCALL *pointerToList = node [L574] append(&list) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L576] FCALL \read(*list) [L576] COND TRUE \read(*list) [L577] EXPR, FCALL \read(*list) [L577] EXPR, FCALL list->next [L577] struct node_t *next = list->next; [L578] EXPR, FCALL \read(*list) [L578] EXPR, FCALL list->data [L578] CALL freeData(list->data) [L556] COND FALSE !(data == ((void *)0)) [L559] EXPR, FCALL data->array [L559] COND TRUE data->array != ((void *)0) [L560] EXPR, FCALL data->array [L560] FCALL free(data->array) [L562] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); [L567] EXPR create_data() [L567] FCALL node->data = create_data() [L568] RET, FCALL *pointerToList = node [L574] append(&list) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L576] FCALL \read(*list) [L576] COND TRUE \read(*list) [L577] EXPR, FCALL \read(*list) [L577] EXPR, FCALL list->next [L577] struct node_t *next = list->next; [L578] EXPR, FCALL \read(*list) [L578] EXPR, FCALL list->data [L578] CALL freeData(list->data) [L556] COND TRUE, RET data == ((void *)0) [L578] freeData(list->data) [L579] EXPR, FCALL \read(*list) [L579] FCALL free(list) [L580] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); [L567] EXPR create_data() [L567] FCALL node->data = create_data() [L568] RET, FCALL *pointerToList = node [L574] append(&list) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L576] FCALL \read(*list) [L576] COND TRUE \read(*list) [L577] EXPR, FCALL \read(*list) [L577] EXPR, FCALL list->next [L577] struct node_t *next = list->next; [L578] EXPR, FCALL \read(*list) [L578] EXPR, FCALL list->data [L578] CALL freeData(list->data) [L556] COND TRUE, RET data == ((void *)0) [L578] freeData(list->data) [L579] EXPR, FCALL \read(*list) [L579] FCALL free(list) [L580] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); [L567] EXPR create_data() [L567] FCALL node->data = create_data() [L568] RET, FCALL *pointerToList = node [L574] append(&list) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L576] FCALL \read(*list) [L576] COND TRUE \read(*list) [L577] EXPR, FCALL \read(*list) [L577] EXPR, FCALL list->next [L577] struct node_t *next = list->next; [L578] EXPR, FCALL \read(*list) [L578] EXPR, FCALL list->data [L578] CALL freeData(list->data) [L556] COND FALSE !(data == ((void *)0)) [L559] EXPR, FCALL data->array [L559] COND FALSE !(data->array != ((void *)0)) [L562] FCALL free(data) [L579] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); [L567] EXPR create_data() [L567] FCALL node->data = create_data() [L568] RET, FCALL *pointerToList = node [L574] append(&list) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L576] FCALL \read(*list) [L576] COND TRUE \read(*list) [L577] EXPR, FCALL \read(*list) [L577] EXPR, FCALL list->next [L577] struct node_t *next = list->next; [L578] EXPR, FCALL \read(*list) [L578] EXPR, FCALL list->data [L578] CALL freeData(list->data) [L556] COND FALSE !(data == ((void *)0)) [L559] EXPR, FCALL data->array [L559] COND FALSE !(data->array != ((void *)0)) [L562] FCALL free(data) [L579] EXPR, FCALL \read(*list) [L579] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); [L567] EXPR create_data() [L567] FCALL node->data = create_data() [L568] RET, FCALL *pointerToList = node [L574] append(&list) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L576] FCALL \read(*list) [L576] COND TRUE \read(*list) [L577] EXPR, FCALL \read(*list) [L577] EXPR, FCALL list->next [L577] struct node_t *next = list->next; [L578] EXPR, FCALL \read(*list) [L578] EXPR, FCALL list->data [L578] CALL freeData(list->data) [L556] COND TRUE, RET data == ((void *)0) [L578] freeData(list->data) [L579] EXPR, FCALL \read(*list) [L579] FCALL free(list) [L580] FCALL list = next [L576] FCALL \read(*list) [L576] COND TRUE \read(*list) [L577] EXPR, FCALL \read(*list) [L577] FCALL list->next - UnprovableResult [Line: 570]: 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); [L567] EXPR create_data() [L567] FCALL node->data = create_data() [L568] RET, FCALL *pointerToList = node [L574] append(&list) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L576] FCALL \read(*list) [L576] COND TRUE \read(*list) [L577] EXPR, FCALL \read(*list) [L577] EXPR, FCALL list->next [L577] struct node_t *next = list->next; [L578] EXPR, FCALL \read(*list) [L578] EXPR, FCALL list->data [L578] CALL freeData(list->data) [L556] COND TRUE, RET data == ((void *)0) [L578] freeData(list->data) [L579] EXPR, FCALL \read(*list) [L579] FCALL free(list) [L580] FCALL list = next [L576] FCALL \read(*list) [L576] COND FALSE !(\read(*list)) [L582] return 0; [L571] FCALL struct node_t *list = ((void *)0); [L582] 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: [L571] FCALL struct node_t *list = ((void *)0); [L572] int dataNotFinished = 0; [L574] CALL append(&list) [L565] EXPR, FCALL malloc(sizeof *node) [L565] struct node_t *node = malloc(sizeof *node); [L566] EXPR, FCALL \read(**pointerToList) [L566] FCALL node->next = *pointerToList [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); [L567] EXPR create_data() [L567] FCALL node->data = create_data() [L568] RET, FCALL *pointerToList = node [L574] append(&list) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L576] FCALL \read(*list) [L576] COND TRUE \read(*list) [L577] EXPR, FCALL \read(*list) [L577] EXPR, FCALL list->next [L577] struct node_t *next = list->next; [L578] EXPR, FCALL \read(*list) [L578] EXPR, FCALL list->data [L578] CALL freeData(list->data) [L556] COND TRUE, RET data == ((void *)0) [L578] freeData(list->data) [L579] EXPR, FCALL \read(*list) [L579] FCALL free(list) [L580] FCALL list = next [L576] FCALL \read(*list) [L576] COND TRUE \read(*list) [L577] EXPR, FCALL \read(*list) [L577] EXPR, FCALL list->next [L577] struct node_t *next = list->next; [L578] EXPR, FCALL \read(*list) [L578] EXPR, FCALL list->data [L578] CALL freeData(list->data) [L556] COND TRUE, RET data == ((void *)0) [L578] freeData(list->data) [L579] EXPR, FCALL \read(*list) [L579] 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 * 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/optional_data_creation_test04_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-28-19-845.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-28-19-845.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-28-19-845.csv Received shutdown request...