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_flag_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:28:30,515 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:28:30,517 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:28:30,530 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:28:30,530 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:28:30,531 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:28:30,533 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:28:30,534 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:28:30,535 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:28:30,536 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:28:30,537 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:28:30,537 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:28:30,537 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:28:30,539 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:28:30,540 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:28:30,542 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:28:30,545 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:28:30,547 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:28:30,548 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:28:30,549 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:28:30,552 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:28:30,552 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:28:30,552 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:28:30,553 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:28:30,554 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:28:30,555 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:28:30,556 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:28:30,556 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:28:30,557 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:28:30,557 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:28:30,557 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:28:30,558 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:30,567 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:28:30,568 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:28:30,569 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:28:30,569 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:28:30,569 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:28:30,569 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:28:30,569 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:28:30,570 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:28:30,570 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:28:30,570 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:28:30,571 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:28:30,571 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:28:30,571 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:28:30,571 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:28:30,571 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:28:30,572 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:28:30,572 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:28:30,572 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:28:30,572 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:28:30,572 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:28:30,573 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:28:30,573 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:28:30,573 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:28:30,573 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:28:30,573 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:28:30,574 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:28:30,574 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:28:30,574 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:28:30,574 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:28:30,574 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 16:28:30,575 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:28:30,575 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:28:30,575 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:28:30,576 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:28:30,576 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:28:30,612 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:28:30,625 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:28:30,629 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:28:30,631 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:28:30,631 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:28:30,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_flag_false-unreach-call_false-valid-deref.i [2018-01-24 16:28:30,804 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:28:30,810 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:28:30,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:28:30,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:28:30,816 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:28:30,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:28:30" (1/1) ... [2018-01-24 16:28:30,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f7209e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:30, skipping insertion in model container [2018-01-24 16:28:30,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:28:30" (1/1) ... [2018-01-24 16:28:30,839 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:28:30,880 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:28:31,003 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:28:31,029 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:28:31,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:31 WrapperNode [2018-01-24 16:28:31,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:28:31,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:28:31,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:28:31,040 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:28:31,057 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:31" (1/1) ... [2018-01-24 16:28:31,057 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:31" (1/1) ... [2018-01-24 16:28:31,066 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:31" (1/1) ... [2018-01-24 16:28:31,066 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:31" (1/1) ... [2018-01-24 16:28:31,073 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:31" (1/1) ... [2018-01-24 16:28:31,078 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:31" (1/1) ... [2018-01-24 16:28:31,080 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:31" (1/1) ... [2018-01-24 16:28:31,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:28:31,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:28:31,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:28:31,083 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:28:31,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:28:31" (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:31,155 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:28:31,155 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:28:31,156 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-24 16:28:31,156 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:28:31,156 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:28:31,156 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:28:31,156 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:28:31,156 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:28:31,157 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:28:31,157 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:28:31,157 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:28:31,157 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 16:28:31,157 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:28:31,157 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:28:31,158 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:28:31,158 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-24 16:28:31,158 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:28:31,158 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:28:31,158 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:28:31,559 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:28:31,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:28:31 BoogieIcfgContainer [2018-01-24 16:28:31,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:28:31,561 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2018-01-24 16:28:31,561 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2018-01-24 16:28:31,562 INFO L276 PluginConnector]: Abstract Interpretation initialized [2018-01-24 16:28:31,563 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:31" (1/1) ... [2018-01-24 16:28:31,623 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:28:33,556 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:28:33,580 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 16:28:33,597 INFO L268 AbstractInterpreter]: Visited 103 different actions 427 times. Merged at 75 different actions 235 times. Widened at 1 different actions 2 times. Found 27 fixpoints after 13 different actions. Largest state had 45 variables. [2018-01-24 16:28:33,600 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2018-01-24 16:28:33,601 INFO L168 Benchmark]: Toolchain (without parser) took 2795.91 ms. Allocated memory was 308.3 MB in the beginning and 477.1 MB in the end (delta: 168.8 MB). Free memory was 266.2 MB in the beginning and 241.9 MB in the end (delta: 24.3 MB). Peak memory consumption was 193.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:33,601 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 308.3 MB. Free memory is still 274.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:28:33,601 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.98 ms. Allocated memory is still 308.3 MB. Free memory was 265.2 MB in the beginning and 254.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:33,602 INFO L168 Benchmark]: Boogie Preprocessor took 43.48 ms. Allocated memory is still 308.3 MB. Free memory was 254.1 MB in the beginning and 252.2 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:33,602 INFO L168 Benchmark]: RCFGBuilder took 477.42 ms. Allocated memory is still 308.3 MB. Free memory was 252.2 MB in the beginning and 225.1 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:33,602 INFO L168 Benchmark]: Abstract Interpretation took 2038.60 ms. Allocated memory was 308.3 MB in the beginning and 477.1 MB in the end (delta: 168.8 MB). Free memory was 225.1 MB in the beginning and 241.9 MB in the end (delta: -16.8 MB). Peak memory consumption was 152.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:28:33,603 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.22 ms. Allocated memory is still 308.3 MB. Free memory is still 274.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 227.98 ms. Allocated memory is still 308.3 MB. Free memory was 265.2 MB in the beginning and 254.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.48 ms. Allocated memory is still 308.3 MB. Free memory was 254.1 MB in the beginning and 252.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 477.42 ms. Allocated memory is still 308.3 MB. Free memory was 252.2 MB in the beginning and 225.1 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 5.3 GB. * Abstract Interpretation took 2038.60 ms. Allocated memory was 308.3 MB in the beginning and 477.1 MB in the end (delta: 168.8 MB). Free memory was 225.1 MB in the beginning and 241.9 MB in the end (delta: -16.8 MB). Peak memory consumption was 152.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 77 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 727 LocStat_NO_SUPPORTING_DISEQUALITIES : 259 LocStat_NO_DISJUNCTIONS : -154 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 107 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 168 TransStat_NO_SUPPORTING_DISEQUALITIES : 46 TransStat_NO_DISJUNCTIONS : 129 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.210355 RENAME_VARIABLES(MILLISECONDS) : 0.079560 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.194260 PROJECTAWAY(MILLISECONDS) : 0.036331 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001505 DISJOIN(MILLISECONDS) : 0.426011 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.097672 ADD_EQUALITY(MILLISECONDS) : 0.015393 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.037696 #CONJOIN_DISJUNCTIVE : 688 #RENAME_VARIABLES : 1474 #UNFREEZE : 0 #CONJOIN : 1017 #PROJECTAWAY : 817 #ADD_WEAK_EQUALITY : 37 #DISJOIN : 164 #RENAME_VARIABLES_DISJUNCTIVE : 1328 #ADD_EQUALITY : 175 #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: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L646] 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: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND TRUE i < 20 && __VERIFIER_nondet_int() [L634] i++ [L635] FCALL p->flag = __VERIFIER_nondet_int() - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: abstract domain could reach this error location. Possible FailurePath: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND TRUE i < 20 && __VERIFIER_nondet_int() [L634] i++ [L635] FCALL p->flag = __VERIFIER_nondet_int() [L636] FCALL p->flag - 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: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L646] FCALL p->h = 3 [L647] p = a [L648] 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: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND TRUE i < 20 && __VERIFIER_nondet_int() [L634] i++ [L635] FCALL p->flag = __VERIFIER_nondet_int() [L636] FCALL p->flag [L636] COND TRUE p->flag [L637] 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: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND TRUE i < 20 && __VERIFIER_nondet_int() [L634] i++ [L635] FCALL p->flag = __VERIFIER_nondet_int() [L636] FCALL p->flag [L636] COND FALSE !(p->flag) [L639] 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: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L646] FCALL p->h = 3 [L647] p = a [L648] EXPR, FCALL p->h [L648] COND FALSE !(p->h != 3) [L659] 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: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L646] FCALL p->h = 3 [L647] p = a [L648] EXPR, FCALL p->h [L648] COND FALSE !(p->h != 3) [L659] EXPR, FCALL p->h [L659] COND FALSE !(p->h != 3 || i > 20) [L661] p = a [L662] 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: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND TRUE i < 20 && __VERIFIER_nondet_int() [L634] i++ [L635] FCALL p->flag = __VERIFIER_nondet_int() [L636] FCALL p->flag [L636] COND TRUE p->flag [L637] FCALL p->h = 1 [L641] EXPR, FCALL malloc(sizeof(struct node)) [L641] t = (List) malloc(sizeof(struct node)) [L642] COND FALSE !(t == 0) [L643] 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: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND TRUE i < 20 && __VERIFIER_nondet_int() [L634] i++ [L635] FCALL p->flag = __VERIFIER_nondet_int() [L636] FCALL p->flag [L636] COND TRUE p->flag [L637] FCALL p->h = 1 [L641] EXPR, FCALL malloc(sizeof(struct node)) [L641] t = (List) malloc(sizeof(struct node)) [L642] COND FALSE !(t == 0) [L643] 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: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND TRUE i < 20 && __VERIFIER_nondet_int() [L634] i++ [L635] FCALL p->flag = __VERIFIER_nondet_int() [L636] FCALL p->flag [L636] COND TRUE p->flag [L637] FCALL p->h = 1 [L641] EXPR, FCALL malloc(sizeof(struct node)) [L641] t = (List) malloc(sizeof(struct node)) [L642] COND FALSE !(t == 0) [L643] FCALL p->n = t [L644] 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: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L646] FCALL p->h = 3 [L647] p = a [L648] EXPR, FCALL p->h [L648] COND FALSE !(p->h != 3) [L659] EXPR, FCALL p->h [L659] COND FALSE !(p->h != 3 || i > 20) [L661] p = a [L662] EXPR, FCALL p->n [L662] COND TRUE p->n != 0 [L663] FCALL p->n - UnprovableResult [Line: 627]: 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: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L646] FCALL p->h = 3 [L647] p = a [L648] EXPR, FCALL p->h [L648] COND FALSE !(p->h != 3) [L659] EXPR, FCALL p->h [L659] COND FALSE !(p->h != 3 || i > 20) [L661] p = a [L662] EXPR, FCALL p->n [L662] COND FALSE !(p->n != 0) [L667] FCALL free(p) [L668] 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: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L646] FCALL p->h = 3 [L647] p = a [L648] EXPR, FCALL p->h [L648] COND FALSE !(p->h != 3) [L659] EXPR, FCALL p->h [L659] COND FALSE !(p->h != 3 || i > 20) [L661] p = a [L662] EXPR, FCALL p->n [L662] COND TRUE p->n != 0 [L663] EXPR, FCALL p->n [L663] t = p->n [L664] FCALL free(p) [L665] p = t [L662] 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: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND TRUE i < 20 && __VERIFIER_nondet_int() [L634] i++ [L635] FCALL p->flag = __VERIFIER_nondet_int() [L636] FCALL p->flag [L636] COND TRUE p->flag [L637] FCALL p->h = 1 [L641] EXPR, FCALL malloc(sizeof(struct node)) [L641] t = (List) malloc(sizeof(struct node)) [L642] COND FALSE !(t == 0) [L643] FCALL p->n = t [L644] EXPR, FCALL p->n [L644] p = p->n [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L646] 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: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND TRUE i < 20 && __VERIFIER_nondet_int() [L634] i++ [L635] FCALL p->flag = __VERIFIER_nondet_int() [L636] FCALL p->flag [L636] COND TRUE p->flag [L637] FCALL p->h = 1 [L641] EXPR, FCALL malloc(sizeof(struct node)) [L641] t = (List) malloc(sizeof(struct node)) [L642] COND FALSE !(t == 0) [L643] FCALL p->n = t [L644] EXPR, FCALL p->n [L644] p = p->n [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND TRUE i < 20 && __VERIFIER_nondet_int() [L634] i++ [L635] FCALL p->flag = __VERIFIER_nondet_int() - 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: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L646] FCALL p->h = 3 [L647] p = a [L648] EXPR, FCALL p->h [L648] COND FALSE !(p->h != 3) [L659] EXPR, FCALL p->h [L659] COND FALSE !(p->h != 3 || i > 20) [L661] p = a [L662] EXPR, FCALL p->n [L662] COND TRUE p->n != 0 [L663] EXPR, FCALL p->n [L663] t = p->n [L664] FCALL free(p) [L665] p = t [L662] EXPR, FCALL p->n [L662] COND FALSE !(p->n != 0) [L667] 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: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L646] FCALL p->h = 3 [L647] p = a [L648] EXPR, FCALL p->h [L648] COND FALSE !(p->h != 3) [L659] EXPR, FCALL p->h [L659] COND FALSE !(p->h != 3 || i > 20) [L661] p = a [L662] EXPR, FCALL p->n [L662] COND TRUE p->n != 0 [L663] EXPR, FCALL p->n [L663] t = p->n [L664] FCALL free(p) [L665] p = t [L662] EXPR, FCALL p->n [L662] COND TRUE p->n != 0 [L663] EXPR, FCALL p->n [L663] t = p->n [L664] 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: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND TRUE i < 20 && __VERIFIER_nondet_int() [L634] i++ [L635] FCALL p->flag = __VERIFIER_nondet_int() [L636] FCALL p->flag [L636] COND TRUE p->flag [L637] FCALL p->h = 1 [L641] EXPR, FCALL malloc(sizeof(struct node)) [L641] t = (List) malloc(sizeof(struct node)) [L642] COND FALSE !(t == 0) [L643] FCALL p->n = t [L644] EXPR, FCALL p->n [L644] p = p->n [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L646] FCALL p->h = 3 [L647] p = a [L648] EXPR, FCALL p->h [L648] COND TRUE p->h != 3 [L649] FCALL p->flag - 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: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND TRUE i < 20 && __VERIFIER_nondet_int() [L634] i++ [L635] FCALL p->flag = __VERIFIER_nondet_int() [L636] FCALL p->flag [L636] COND TRUE p->flag [L637] FCALL p->h = 1 [L641] EXPR, FCALL malloc(sizeof(struct node)) [L641] t = (List) malloc(sizeof(struct node)) [L642] COND FALSE !(t == 0) [L643] FCALL p->n = t [L644] EXPR, FCALL p->n [L644] p = p->n [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L646] FCALL p->h = 3 [L647] p = a [L648] EXPR, FCALL p->h [L648] COND TRUE p->h != 3 [L649] FCALL p->flag [L649] COND FALSE !(p->flag) [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: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND TRUE i < 20 && __VERIFIER_nondet_int() [L634] i++ [L635] FCALL p->flag = __VERIFIER_nondet_int() [L636] FCALL p->flag [L636] COND TRUE p->flag [L637] FCALL p->h = 1 [L641] EXPR, FCALL malloc(sizeof(struct node)) [L641] t = (List) malloc(sizeof(struct node)) [L642] COND FALSE !(t == 0) [L643] FCALL p->n = t [L644] EXPR, FCALL p->n [L644] p = p->n [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L646] FCALL p->h = 3 [L647] p = a [L648] EXPR, FCALL p->h [L648] COND TRUE p->h != 3 [L649] FCALL p->flag [L649] COND TRUE p->flag [L650] 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: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND TRUE i < 20 && __VERIFIER_nondet_int() [L634] i++ [L635] FCALL p->flag = __VERIFIER_nondet_int() [L636] FCALL p->flag [L636] COND TRUE p->flag [L637] FCALL p->h = 1 [L641] EXPR, FCALL malloc(sizeof(struct node)) [L641] t = (List) malloc(sizeof(struct node)) [L642] COND FALSE !(t == 0) [L643] FCALL p->n = t [L644] EXPR, FCALL p->n [L644] p = p->n [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L646] FCALL p->h = 3 [L647] p = a [L648] EXPR, FCALL p->h [L648] COND TRUE p->h != 3 [L649] FCALL p->flag [L649] COND FALSE !(p->flag) [L653] EXPR, FCALL p->h [L653] COND FALSE !(p->h != 2) [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: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) [L629] a = (List) malloc(sizeof(struct node)) [L630] COND FALSE !(a == 0) [L631] p = a [L632] int i = 0; [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND TRUE i < 20 && __VERIFIER_nondet_int() [L634] i++ [L635] FCALL p->flag = __VERIFIER_nondet_int() [L636] FCALL p->flag [L636] COND TRUE p->flag [L637] FCALL p->h = 1 [L641] EXPR, FCALL malloc(sizeof(struct node)) [L641] t = (List) malloc(sizeof(struct node)) [L642] COND FALSE !(t == 0) [L643] FCALL p->n = t [L644] EXPR, FCALL p->n [L644] p = p->n [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() [L633] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L646] FCALL p->h = 3 [L647] p = a [L648] EXPR, FCALL p->h [L648] COND TRUE p->h != 3 [L649] FCALL p->flag [L649] COND FALSE !(p->flag) [L653] EXPR, FCALL p->h [L653] COND FALSE !(p->h != 2) [L656] EXPR, FCALL p->n [L656] p = p->n [L657] i++ [L648] FCALL p->h - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: 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_flag_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-33-613.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_flag_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-33-613.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_flag_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-33-613.csv Received shutdown request...