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_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:28:43,007 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:28:43,009 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:28:43,021 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:28:43,021 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:28:43,022 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:28:43,023 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:28:43,025 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:28:43,026 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:28:43,027 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:28:43,028 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:28:43,028 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:28:43,028 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:28:43,030 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:28:43,031 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:28:43,033 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:28:43,035 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:28:43,038 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:28:43,039 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:28:43,040 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:28:43,042 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:28:43,043 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:28:43,043 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:28:43,044 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:28:43,045 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:28:43,046 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:28:43,046 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:28:43,047 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:28:43,047 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:28:43,047 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:28:43,048 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:28:43,048 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:43,058 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:28:43,058 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:28:43,059 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:28:43,059 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:28:43,060 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:28:43,060 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:28:43,060 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:28:43,060 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:28:43,061 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:28:43,061 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:28:43,061 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:28:43,062 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:28:43,062 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:28:43,062 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:28:43,062 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:28:43,062 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:28:43,062 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:28:43,063 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:28:43,063 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:28:43,063 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:28:43,063 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:28:43,063 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:28:43,064 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:28:43,064 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:28:43,064 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:28:43,064 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:28:43,064 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:28:43,065 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:28:43,065 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:28:43,065 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:28:43,065 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:28:43,065 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:28:43,066 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:28:43,066 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:28:43,067 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:28:43,101 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:28:43,111 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:28:43,114 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:28:43,115 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:28:43,115 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:28:43,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_1_true-valid-memsafety.i [2018-01-24 16:28:43,281 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:28:43,287 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:28:43,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:28:43,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:28:43,292 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:28:43,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:28:43" (1/1) ... [2018-01-24 16:28:43,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a76578b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:43, skipping insertion in model container [2018-01-24 16:28:43,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:28:43" (1/1) ... [2018-01-24 16:28:43,307 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:28:43,342 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:28:43,465 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:28:43,484 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:28:43,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:43 WrapperNode [2018-01-24 16:28:43,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:28:43,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:28:43,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:28:43,493 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:28:43,506 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:43" (1/1) ... [2018-01-24 16:28:43,506 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:43" (1/1) ... [2018-01-24 16:28:43,517 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:43" (1/1) ... [2018-01-24 16:28:43,518 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:43" (1/1) ... [2018-01-24 16:28:43,523 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:43" (1/1) ... [2018-01-24 16:28:43,526 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:43" (1/1) ... [2018-01-24 16:28:43,528 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:43" (1/1) ... [2018-01-24 16:28:43,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:28:43,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:28:43,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:28:43,530 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:28:43,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:43" (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:43,579 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:28:43,579 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:28:43,580 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-24 16:28:43,580 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:28:43,580 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:28:43,580 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:28:43,580 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:28:43,580 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:28:43,580 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:28:43,581 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:28:43,581 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:28:43,581 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 16:28:43,581 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:28:43,581 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:28:43,581 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:28:43,582 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-24 16:28:43,582 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:28:43,582 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:28:43,582 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:28:44,030 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:28:44,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:28:44 BoogieIcfgContainer [2018-01-24 16:28:44,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:28:44,032 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:28:44,032 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:28:44,032 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:28:44,033 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:44" (1/1) ... [2018-01-24 16:28:44,095 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:28:45,979 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:28:46,015 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:28:46,023 INFO L268 AbstractInterpreter]: Visited 112 different actions 514 times. Merged at 84 different actions 283 times. Widened at 3 different actions 5 times. Found 39 fixpoints after 26 different actions. Largest state had 52 variables. [2018-01-24 16:28:46,026 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:28:46,027 INFO L168 Benchmark]: Toolchain (without parser) took 2745.17 ms. Allocated memory was 301.5 MB in the beginning and 491.8 MB in the end (delta: 190.3 MB). Free memory was 258.4 MB in the beginning and 209.8 MB in the end (delta: 48.6 MB). Peak memory consumption was 238.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:46,028 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 301.5 MB. Free memory is still 264.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:28:46,028 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.34 ms. Allocated memory is still 301.5 MB. Free memory was 258.4 MB in the beginning and 246.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:46,028 INFO L168 Benchmark]: Boogie Preprocessor took 37.24 ms. Allocated memory is still 301.5 MB. Free memory was 246.4 MB in the beginning and 244.4 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:46,028 INFO L168 Benchmark]: RCFGBuilder took 501.22 ms. Allocated memory is still 301.5 MB. Free memory was 244.4 MB in the beginning and 215.5 MB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:46,029 INFO L168 Benchmark]: Abstract Interpretation took 1994.31 ms. Allocated memory was 301.5 MB in the beginning and 491.8 MB in the end (delta: 190.3 MB). Free memory was 215.5 MB in the beginning and 209.8 MB in the end (delta: 5.7 MB). Peak memory consumption was 196.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:46,030 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.18 ms. Allocated memory is still 301.5 MB. Free memory is still 264.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 204.34 ms. Allocated memory is still 301.5 MB. Free memory was 258.4 MB in the beginning and 246.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.24 ms. Allocated memory is still 301.5 MB. Free memory was 246.4 MB in the beginning and 244.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 501.22 ms. Allocated memory is still 301.5 MB. Free memory was 244.4 MB in the beginning and 215.5 MB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 1994.31 ms. Allocated memory was 301.5 MB in the beginning and 491.8 MB in the end (delta: 190.3 MB). Free memory was 215.5 MB in the beginning and 209.8 MB in the end (delta: 5.7 MB). Peak memory consumption was 196.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 87 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 896 LocStat_NO_SUPPORTING_DISEQUALITIES : 299 LocStat_NO_DISJUNCTIONS : -174 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 116 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 197 TransStat_NO_SUPPORTING_DISEQUALITIES : 50 TransStat_NO_DISJUNCTIONS : 139 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.397017 RENAME_VARIABLES(MILLISECONDS) : 0.450407 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.374263 PROJECTAWAY(MILLISECONDS) : 0.559330 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001518 DISJOIN(MILLISECONDS) : 0.406160 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.477203 ADD_EQUALITY(MILLISECONDS) : 0.012467 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007952 #CONJOIN_DISJUNCTIVE : 817 #RENAME_VARIABLES : 1703 #UNFREEZE : 0 #CONJOIN : 1156 #PROJECTAWAY : 910 #ADD_WEAK_EQUALITY : 45 #DISJOIN : 159 #RENAME_VARIABLES_DISJUNCTIVE : 1550 #ADD_EQUALITY : 206 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 40 - 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 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] FCALL p->n = 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 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 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 FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] FCALL p->n = 0 [L651] i = 0 [L652] y = 0 [L653] p = a [L654] 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] 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] FCALL p->n = 0 [L651] i = 0 [L652] y = 0 [L653] p = a [L654] EXPR, FCALL p->h [L654] COND TRUE p->h == 1 [L655] i++ [L656] 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] FCALL p->n = 0 [L651] i = 0 [L652] y = 0 [L653] p = a [L654] EXPR, FCALL p->h [L654] COND FALSE !(p->h == 1) [L658] 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] FCALL p->n = 0 [L651] i = 0 [L652] y = 0 [L653] p = a [L654] EXPR, FCALL p->h [L654] COND FALSE !(p->h == 1) [L658] EXPR, FCALL p->h [L658] COND FALSE !(p->h == 2) [L662] 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] FCALL p->n = 0 [L651] i = 0 [L652] y = 0 [L653] p = a [L654] EXPR, FCALL p->h [L654] COND FALSE !(p->h == 1) [L658] EXPR, FCALL p->h [L658] COND TRUE p->h == 2 [L659] y++ [L660] 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] FCALL p->n = 0 [L651] i = 0 [L652] y = 0 [L653] p = a [L654] EXPR, FCALL p->h [L654] COND TRUE p->h == 1 [L655] i++ [L656] EXPR, FCALL p->n [L656] p = p->n [L654] 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] FCALL p->n = 0 [L651] i = 0 [L652] y = 0 [L653] p = a [L654] EXPR, FCALL p->h [L654] COND FALSE !(p->h == 1) [L658] EXPR, FCALL p->h [L658] COND TRUE p->h == 2 [L659] y++ [L660] EXPR, FCALL p->n [L660] p = p->n [L658] 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] FCALL p->n = 0 [L651] i = 0 [L652] y = 0 [L653] p = a [L654] EXPR, FCALL p->h [L654] COND FALSE !(p->h == 1) [L658] EXPR, FCALL p->h [L658] COND FALSE !(p->h == 2) [L662] EXPR, FCALL p->h [L662] COND FALSE !(p->h != 3 || (i + y) > 20) [L664] p = a [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 FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] FCALL p->n = 0 [L651] i = 0 [L652] y = 0 [L653] p = a [L654] EXPR, FCALL p->h [L654] COND FALSE !(p->h == 1) [L658] EXPR, FCALL p->h [L658] COND FALSE !(p->h == 2) [L662] EXPR, FCALL p->h [L662] COND FALSE !(p->h != 3 || (i + y) > 20) [L664] p = a [L665] EXPR, FCALL p->n [L665] COND TRUE p->n != 0 [L666] 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] FCALL p->n = 0 [L651] i = 0 [L652] y = 0 [L653] p = a [L654] EXPR, FCALL p->h [L654] COND FALSE !(p->h == 1) [L658] EXPR, FCALL p->h [L658] COND FALSE !(p->h == 2) [L662] EXPR, FCALL p->h [L662] COND FALSE !(p->h != 3 || (i + y) > 20) [L664] p = a [L665] EXPR, FCALL p->n [L665] COND FALSE !(p->n != 0) [L670] FCALL free(p) [L671] 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 FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] FCALL p->n = 0 [L651] i = 0 [L652] y = 0 [L653] p = a [L654] EXPR, FCALL p->h [L654] COND FALSE !(p->h == 1) [L658] EXPR, FCALL p->h [L658] COND FALSE !(p->h == 2) [L662] EXPR, FCALL p->h [L662] COND FALSE !(p->h != 3 || (i + y) > 20) [L664] p = a [L665] EXPR, FCALL p->n [L665] COND TRUE p->n != 0 [L666] EXPR, FCALL p->n [L666] t = p->n [L667] FCALL free(p) [L668] p = t [L665] 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] FCALL p->n = 0 [L651] i = 0 [L652] y = 0 [L653] p = a [L654] EXPR, FCALL p->h [L654] COND FALSE !(p->h == 1) [L658] EXPR, FCALL p->h [L658] COND FALSE !(p->h == 2) [L662] EXPR, FCALL p->h [L662] COND FALSE !(p->h != 3 || (i + y) > 20) [L664] p = a [L665] EXPR, FCALL p->n [L665] COND TRUE p->n != 0 [L666] EXPR, FCALL p->n [L666] t = p->n [L667] FCALL free(p) [L668] p = t [L665] EXPR, FCALL p->n [L665] COND FALSE !(p->n != 0) [L670] FCALL free(p) - 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] FCALL p->n = 0 [L651] i = 0 [L652] y = 0 [L653] p = a [L654] EXPR, FCALL p->h [L654] COND FALSE !(p->h == 1) [L658] EXPR, FCALL p->h [L658] COND FALSE !(p->h == 2) [L662] EXPR, FCALL p->h [L662] COND FALSE !(p->h != 3 || (i + y) > 20) [L664] p = a [L665] EXPR, FCALL p->n [L665] COND TRUE p->n != 0 [L666] EXPR, FCALL p->n [L666] t = p->n [L667] FCALL free(p) [L668] p = t [L665] EXPR, FCALL p->n [L665] COND TRUE p->n != 0 [L666] EXPR, FCALL p->n [L666] t = p->n [L667] FCALL free(p) - 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 - 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_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-Benchmark-0-2018-01-24_16-28-46-041.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-28-46-041.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_imprecise.epf_AbstractInterpretationC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-28-46-041.csv Received shutdown request...