java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AbstractInterpretationC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:28:25,272 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:28:25,274 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:28:25,288 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:28:25,289 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:28:25,290 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:28:25,291 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:28:25,293 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:28:25,294 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:28:25,295 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:28:25,296 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:28:25,296 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:28:25,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:28:25,297 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:28:25,298 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:28:25,300 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:28:25,303 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:28:25,305 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:28:25,306 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:28:25,307 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:28:25,310 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:28:25,310 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:28:25,310 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:28:25,311 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:28:25,312 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:28:25,314 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:28:25,314 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:28:25,315 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:28:25,315 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:28:25,315 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:28:25,316 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:28:25,316 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:25,326 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:28:25,327 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:28:25,327 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:28:25,328 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:28:25,328 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:28:25,328 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:28:25,328 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:28:25,328 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:28:25,329 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:28:25,329 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:28:25,330 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:28:25,330 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:28:25,330 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:28:25,330 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:28:25,330 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:28:25,331 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:28:25,331 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:28:25,331 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:28:25,331 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:28:25,331 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:28:25,332 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:28:25,332 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:28:25,332 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:28:25,332 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:28:25,332 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:28:25,333 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:28:25,333 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:28:25,333 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:28:25,333 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:28:25,333 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:28:25,333 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:28:25,334 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:28:25,334 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:28:25,335 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:28:25,335 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:28:25,371 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:28:25,385 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:28:25,390 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:28:25,392 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:28:25,393 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:28:25,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i [2018-01-24 16:28:25,580 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:28:25,584 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:28:25,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:28:25,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:28:25,590 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:28:25,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:28:25" (1/1) ... [2018-01-24 16:28:25,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d56f953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:25, skipping insertion in model container [2018-01-24 16:28:25,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:28:25" (1/1) ... [2018-01-24 16:28:25,607 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:28:25,645 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:28:25,778 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:28:25,804 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:28:25,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:25 WrapperNode [2018-01-24 16:28:25,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:28:25,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:28:25,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:28:25,814 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:28:25,830 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:25" (1/1) ... [2018-01-24 16:28:25,830 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:25" (1/1) ... [2018-01-24 16:28:25,842 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:25" (1/1) ... [2018-01-24 16:28:25,843 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:25" (1/1) ... [2018-01-24 16:28:25,850 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:25" (1/1) ... [2018-01-24 16:28:25,853 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:25" (1/1) ... [2018-01-24 16:28:25,855 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:25" (1/1) ... [2018-01-24 16:28:25,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:28:25,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:28:25,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:28:25,858 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:28:25,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:25" (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:25,914 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:28:25,914 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:28:25,914 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-24 16:28:25,915 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:28:25,915 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:28:25,915 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:28:25,915 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:28:25,915 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:28:25,915 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:28:25,915 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:28:25,916 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:28:25,916 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 16:28:25,916 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:28:25,916 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:28:25,916 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:28:25,916 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-24 16:28:25,917 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:28:25,917 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:28:25,917 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:28:26,312 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:28:26,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:28:26 BoogieIcfgContainer [2018-01-24 16:28:26,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:28:26,314 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:28:26,314 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:28:26,314 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:28:26,315 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:26" (1/1) ... [2018-01-24 16:28:26,378 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:28:28,679 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:28:28,714 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:28:28,725 INFO L268 AbstractInterpreter]: Visited 109 different actions 460 times. Merged at 82 different actions 251 times. Widened at 2 different actions 2 times. Found 35 fixpoints after 21 different actions. Largest state had 52 variables. [2018-01-24 16:28:28,728 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:28:28,729 INFO L168 Benchmark]: Toolchain (without parser) took 3148.63 ms. Allocated memory was 296.7 MB in the beginning and 483.4 MB in the end (delta: 186.6 MB). Free memory was 256.7 MB in the beginning and 255.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 188.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:28,730 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 296.7 MB. Free memory is still 262.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:28:28,730 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.12 ms. Allocated memory is still 296.7 MB. Free memory was 255.6 MB in the beginning and 244.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:28,731 INFO L168 Benchmark]: Boogie Preprocessor took 42.83 ms. Allocated memory is still 296.7 MB. Free memory was 244.5 MB in the beginning and 242.6 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:28,731 INFO L168 Benchmark]: RCFGBuilder took 455.85 ms. Allocated memory is still 296.7 MB. Free memory was 242.6 MB in the beginning and 214.5 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:28,731 INFO L168 Benchmark]: Abstract Interpretation took 2414.44 ms. Allocated memory was 296.7 MB in the beginning and 483.4 MB in the end (delta: 186.6 MB). Free memory was 214.5 MB in the beginning and 255.2 MB in the end (delta: -40.7 MB). Peak memory consumption was 145.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:28,733 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.27 ms. Allocated memory is still 296.7 MB. Free memory is still 262.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 229.12 ms. Allocated memory is still 296.7 MB. Free memory was 255.6 MB in the beginning and 244.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.83 ms. Allocated memory is still 296.7 MB. Free memory was 244.5 MB in the beginning and 242.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 455.85 ms. Allocated memory is still 296.7 MB. Free memory was 242.6 MB in the beginning and 214.5 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 2414.44 ms. Allocated memory was 296.7 MB in the beginning and 483.4 MB in the end (delta: 186.6 MB). Free memory was 214.5 MB in the beginning and 255.2 MB in the end (delta: -40.7 MB). Peak memory consumption was 145.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 85 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 874 LocStat_NO_SUPPORTING_DISEQUALITIES : 292 LocStat_NO_DISJUNCTIONS : -170 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 113 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 192 TransStat_NO_SUPPORTING_DISEQUALITIES : 49 TransStat_NO_DISJUNCTIONS : 135 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.600830 RENAME_VARIABLES(MILLISECONDS) : 0.014256 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.370343 PROJECTAWAY(MILLISECONDS) : 1.349258 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001624 DISJOIN(MILLISECONDS) : 0.529734 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.030411 ADD_EQUALITY(MILLISECONDS) : 0.018615 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.018798 #CONJOIN_DISJUNCTIVE : 743 #RENAME_VARIABLES : 1547 #UNFREEZE : 0 #CONJOIN : 1065 #PROJECTAWAY : 849 #ADD_WEAK_EQUALITY : 39 #DISJOIN : 175 #RENAME_VARIABLES_DISJUNCTIVE : 1404 #ADD_EQUALITY : 197 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 39 - 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: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND TRUE i < 10 && __VERIFIER_nondet_int() [L634] i++ [L635] FCALL p->h = 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: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND TRUE y < 10 && __VERIFIER_nondet_int() [L642] y++ [L643] FCALL p->h = 2 - 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: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] FCALL p->h = 3 - 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: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND TRUE i < 10 && __VERIFIER_nondet_int() [L634] i++ [L635] FCALL p->h = 1 [L636] EXPR, FCALL malloc(sizeof(struct node)) [L636] t = (List) malloc(sizeof(struct node)) [L637] COND FALSE !(t == 0) [L638] FCALL p->n = t - 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: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND TRUE i < 10 && __VERIFIER_nondet_int() [L634] i++ [L635] FCALL p->h = 1 [L636] EXPR, FCALL malloc(sizeof(struct node)) [L636] t = (List) malloc(sizeof(struct node)) [L637] COND FALSE !(t == 0) [L638] FCALL p->n = t - 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: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND TRUE i < 10 && __VERIFIER_nondet_int() [L634] i++ [L635] FCALL p->h = 1 [L636] EXPR, FCALL malloc(sizeof(struct node)) [L636] t = (List) malloc(sizeof(struct node)) [L637] COND FALSE !(t == 0) [L638] FCALL p->n = t [L639] FCALL p->n - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] i = 0 [L651] y = 0 [L652] p = a [L653] FCALL p->h - 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: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND TRUE y < 10 && __VERIFIER_nondet_int() [L642] y++ [L643] FCALL p->h = 2 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t - 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: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND TRUE y < 10 && __VERIFIER_nondet_int() [L642] y++ [L643] FCALL p->h = 2 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t - 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: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND TRUE y < 10 && __VERIFIER_nondet_int() [L642] y++ [L643] FCALL p->h = 2 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] FCALL p->n - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] i = 0 [L651] y = 0 [L652] p = a [L653] EXPR, FCALL p->h [L653] COND FALSE !(p->h == 1) [L657] FCALL p->h - 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: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND TRUE i < 10 && __VERIFIER_nondet_int() [L634] i++ [L635] FCALL p->h = 1 [L636] EXPR, FCALL malloc(sizeof(struct node)) [L636] t = (List) malloc(sizeof(struct node)) [L637] COND FALSE !(t == 0) [L638] FCALL p->n = t [L639] EXPR, FCALL p->n [L639] p = p->n [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND TRUE i < 10 && __VERIFIER_nondet_int() [L634] i++ [L635] FCALL p->h = 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: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] i = 0 [L651] y = 0 [L652] p = a [L653] EXPR, FCALL p->h [L653] COND FALSE !(p->h == 1) [L657] EXPR, FCALL p->h [L657] COND FALSE !(p->h == 2) [L661] FCALL p->h - 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: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND TRUE y < 10 && __VERIFIER_nondet_int() [L642] y++ [L643] FCALL p->h = 2 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND TRUE y < 10 && __VERIFIER_nondet_int() [L642] y++ [L643] FCALL p->h = 2 - 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: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND TRUE y < 10 && __VERIFIER_nondet_int() [L642] y++ [L643] FCALL p->h = 2 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] FCALL p->h = 3 - 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: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] i = 0 [L651] y = 0 [L652] p = a [L653] EXPR, FCALL p->h [L653] COND FALSE !(p->h == 1) [L657] EXPR, FCALL p->h [L657] COND FALSE !(p->h == 2) [L661] EXPR, FCALL p->h [L661] COND FALSE !(p->h != 3 || (i + y) < 20) [L663] p = a [L664] FCALL p->n - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] i = 0 [L651] y = 0 [L652] p = a [L653] EXPR, FCALL p->h [L653] COND FALSE !(p->h == 1) [L657] EXPR, FCALL p->h [L657] COND FALSE !(p->h == 2) [L661] EXPR, FCALL p->h [L661] COND FALSE !(p->h != 3 || (i + y) < 20) [L663] p = a [L664] EXPR, FCALL p->n [L664] COND TRUE p->n != 0 [L665] FCALL p->n - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND TRUE y < 10 && __VERIFIER_nondet_int() [L642] y++ [L643] FCALL p->h = 2 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] i = 0 [L651] y = 0 [L652] p = a [L653] EXPR, FCALL p->h [L653] COND TRUE p->h == 1 [L654] i++ [L655] FCALL p->n - UnprovableResult [Line: 626]: 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: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] i = 0 [L651] y = 0 [L652] p = a [L653] EXPR, FCALL p->h [L653] COND FALSE !(p->h == 1) [L657] EXPR, FCALL p->h [L657] COND FALSE !(p->h == 2) [L661] EXPR, FCALL p->h [L661] COND FALSE !(p->h != 3 || (i + y) < 20) [L663] p = a [L664] EXPR, FCALL p->n [L664] COND FALSE !(p->n != 0) [L669] FCALL free(p) [L670] return 0; - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND TRUE y < 10 && __VERIFIER_nondet_int() [L642] y++ [L643] FCALL p->h = 2 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] i = 0 [L651] y = 0 [L652] p = a [L653] EXPR, FCALL p->h [L653] COND FALSE !(p->h == 1) [L657] EXPR, FCALL p->h [L657] COND TRUE p->h == 2 [L658] y++ [L659] FCALL p->n - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND TRUE y < 10 && __VERIFIER_nondet_int() [L642] y++ [L643] FCALL p->h = 2 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] i = 0 [L651] y = 0 [L652] p = a [L653] EXPR, FCALL p->h [L653] COND TRUE p->h == 1 [L654] i++ [L655] EXPR, FCALL p->n [L655] p = p->n [L653] FCALL p->h - 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: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] i = 0 [L651] y = 0 [L652] p = a [L653] EXPR, FCALL p->h [L653] COND FALSE !(p->h == 1) [L657] EXPR, FCALL p->h [L657] COND FALSE !(p->h == 2) [L661] EXPR, FCALL p->h [L661] COND FALSE !(p->h != 3 || (i + y) < 20) [L663] p = a [L664] EXPR, FCALL p->n [L664] COND TRUE p->n != 0 [L665] EXPR, FCALL p->n [L665] t = p->n [L666] FCALL free(p) [L667] p = t [L664] FCALL p->n - 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: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] i = 0 [L651] y = 0 [L652] p = a [L653] EXPR, FCALL p->h [L653] COND FALSE !(p->h == 1) [L657] EXPR, FCALL p->h [L657] COND FALSE !(p->h == 2) [L661] EXPR, FCALL p->h [L661] COND FALSE !(p->h != 3 || (i + y) < 20) [L663] p = a [L664] EXPR, FCALL p->n [L664] COND TRUE p->n != 0 [L665] EXPR, FCALL p->n [L665] t = p->n [L666] FCALL free(p) [L667] p = t [L664] EXPR, FCALL p->n [L664] COND FALSE !(p->n != 0) [L669] FCALL free(p) - 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: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND TRUE y < 10 && __VERIFIER_nondet_int() [L642] y++ [L643] FCALL p->h = 2 [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) [L645] COND FALSE !(t == 0) [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] i = 0 [L651] y = 0 [L652] p = a [L653] EXPR, FCALL p->h [L653] COND FALSE !(p->h == 1) [L657] EXPR, FCALL p->h [L657] COND TRUE p->h == 2 [L658] y++ [L659] EXPR, FCALL p->n [L659] p = p->n [L657] FCALL p->h - 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: [L627] int i = 0; [L628] int y = 0; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] List a = (List) malloc(sizeof(struct node)); [L630] COND FALSE !(a == 0) [L631] List t; [L632] List p = a; [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() [L641] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] i = 0 [L651] y = 0 [L652] p = a [L653] EXPR, FCALL p->h [L653] COND FALSE !(p->h == 1) [L657] EXPR, FCALL p->h [L657] COND FALSE !(p->h == 2) [L661] EXPR, FCALL p->h [L661] COND FALSE !(p->h != 3 || (i + y) < 20) [L663] p = a [L664] EXPR, FCALL p->n [L664] COND TRUE p->n != 0 [L665] EXPR, FCALL p->n [L665] t = p->n [L666] FCALL free(p) [L667] p = t [L664] EXPR, FCALL p->n [L664] COND TRUE p->n != 0 [L665] EXPR, FCALL p->n [L665] t = p->n [L666] FCALL free(p) - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location * 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/list-ext_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-28-28-745.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-28-28-745.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-28-28-745.csv Received shutdown request...