java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_insert_equal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:13:53,169 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:13:53,171 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:13:53,183 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:13:53,184 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:13:53,185 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:13:53,186 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:13:53,189 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:13:53,199 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:13:53,200 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:13:53,201 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:13:53,201 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:13:53,202 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:13:53,203 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:13:53,204 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:13:53,205 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:13:53,206 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:13:53,207 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:13:53,209 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:13:53,211 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:13:53,212 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:13:53,214 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:13:53,216 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:13:53,216 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:13:53,217 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:13:53,218 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:13:53,219 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:13:53,219 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:13:53,220 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:13:53,221 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:13:53,221 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:13:53,222 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:13:53,222 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:13:53,223 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:13:53,224 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:13:53,224 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:13:53,225 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:13:53,240 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:13:53,240 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:13:53,241 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:13:53,241 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:13:53,242 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:13:53,242 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:13:53,242 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:13:53,243 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:13:53,243 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:13:53,243 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:13:53,243 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:13:53,243 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:13:53,244 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:13:53,244 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:13:53,244 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:13:53,244 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:13:53,244 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:13:53,245 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:13:53,245 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:13:53,245 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:13:53,245 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:13:53,246 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:13:53,246 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:13:53,246 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:13:53,246 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:13:53,246 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:13:53,247 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:13:53,247 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:13:53,247 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:13:53,247 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:13:53,247 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:13:53,248 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:13:53,248 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:13:53,326 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:13:53,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:13:53,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:13:53,352 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:13:53,352 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:13:53,353 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:13:53,428 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e4f9935/112a923fdcdc4ccb863dd0305319d33b/FLAGe4559702b [2018-11-23 11:13:53,956 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:13:53,956 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:13:53,972 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e4f9935/112a923fdcdc4ccb863dd0305319d33b/FLAGe4559702b [2018-11-23 11:13:54,220 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e4f9935/112a923fdcdc4ccb863dd0305319d33b [2018-11-23 11:13:54,230 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:13:54,232 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:13:54,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:13:54,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:13:54,237 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:13:54,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:13:54" (1/1) ... [2018-11-23 11:13:54,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b7f990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:54, skipping insertion in model container [2018-11-23 11:13:54,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:13:54" (1/1) ... [2018-11-23 11:13:54,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:13:54,310 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:13:54,746 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:13:54,762 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:13:54,832 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:13:55,000 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:13:55,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:55 WrapperNode [2018-11-23 11:13:55,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:13:55,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:13:55,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:13:55,002 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:13:55,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:55" (1/1) ... [2018-11-23 11:13:55,033 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:55" (1/1) ... [2018-11-23 11:13:55,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:13:55,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:13:55,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:13:55,043 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:13:55,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:55" (1/1) ... [2018-11-23 11:13:55,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:55" (1/1) ... [2018-11-23 11:13:55,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:55" (1/1) ... [2018-11-23 11:13:55,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:55" (1/1) ... [2018-11-23 11:13:55,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:55" (1/1) ... [2018-11-23 11:13:55,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:55" (1/1) ... [2018-11-23 11:13:55,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:55" (1/1) ... [2018-11-23 11:13:55,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:13:55,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:13:55,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:13:55,108 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:13:55,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:55" (1/1) ... No working directory specified, using /storage/repos/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-11-23 11:13:55,168 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-11-23 11:13:55,169 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-11-23 11:13:55,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:13:55,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:13:55,169 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert [2018-11-23 11:13:55,169 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert [2018-11-23 11:13:55,169 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:13:55,170 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:13:55,170 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 11:13:55,170 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 11:13:55,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:13:55,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:13:55,171 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:13:55,171 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:13:55,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:13:55,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:13:55,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:13:55,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:13:55,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 11:13:55,172 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-23 11:13:55,172 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-23 11:13:55,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:13:55,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:13:56,678 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:13:56,678 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 11:13:56,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:13:56 BoogieIcfgContainer [2018-11-23 11:13:56,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:13:56,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:13:56,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:13:56,683 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:13:56,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:13:54" (1/3) ... [2018-11-23 11:13:56,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b69e300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:13:56, skipping insertion in model container [2018-11-23 11:13:56,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:55" (2/3) ... [2018-11-23 11:13:56,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b69e300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:13:56, skipping insertion in model container [2018-11-23 11:13:56,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:13:56" (3/3) ... [2018-11-23 11:13:56,688 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:13:56,699 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:13:56,708 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:13:56,727 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:13:56,762 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:13:56,763 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:13:56,763 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:13:56,763 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:13:56,764 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:13:56,764 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:13:56,764 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:13:56,764 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:13:56,764 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:13:56,784 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-11-23 11:13:56,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:13:56,794 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:13:56,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:13:56,797 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:13:56,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:13:56,805 INFO L82 PathProgramCache]: Analyzing trace with hash -190176239, now seen corresponding path program 1 times [2018-11-23 11:13:56,812 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:13:56,813 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:13:56,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:13:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:13:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:13:56,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:13:57,071 INFO L256 TraceCheckUtils]: 0: Hoare triple {56#true} call ULTIMATE.init(); {56#true} is VALID [2018-11-23 11:13:57,075 INFO L273 TraceCheckUtils]: 1: Hoare triple {56#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {56#true} is VALID [2018-11-23 11:13:57,076 INFO L273 TraceCheckUtils]: 2: Hoare triple {56#true} assume true; {56#true} is VALID [2018-11-23 11:13:57,076 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {56#true} {56#true} #140#return; {56#true} is VALID [2018-11-23 11:13:57,077 INFO L256 TraceCheckUtils]: 4: Hoare triple {56#true} call #t~ret19 := main(); {56#true} is VALID [2018-11-23 11:13:57,077 INFO L273 TraceCheckUtils]: 5: Hoare triple {56#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {56#true} is VALID [2018-11-23 11:13:57,077 INFO L256 TraceCheckUtils]: 6: Hoare triple {56#true} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {56#true} is VALID [2018-11-23 11:13:57,078 INFO L273 TraceCheckUtils]: 7: Hoare triple {56#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {56#true} is VALID [2018-11-23 11:13:57,078 INFO L273 TraceCheckUtils]: 8: Hoare triple {56#true} assume !~bvsgt32(~len, 0bv32); {56#true} is VALID [2018-11-23 11:13:57,078 INFO L273 TraceCheckUtils]: 9: Hoare triple {56#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {56#true} is VALID [2018-11-23 11:13:57,079 INFO L273 TraceCheckUtils]: 10: Hoare triple {56#true} assume true; {56#true} is VALID [2018-11-23 11:13:57,079 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {56#true} {56#true} #132#return; {56#true} is VALID [2018-11-23 11:13:57,079 INFO L273 TraceCheckUtils]: 12: Hoare triple {56#true} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset; {56#true} is VALID [2018-11-23 11:13:57,080 INFO L256 TraceCheckUtils]: 13: Hoare triple {56#true} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, ~bvsdiv32(~len~0, 2bv32)); {56#true} is VALID [2018-11-23 11:13:57,080 INFO L273 TraceCheckUtils]: 14: Hoare triple {56#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {56#true} is VALID [2018-11-23 11:13:57,080 INFO L256 TraceCheckUtils]: 15: Hoare triple {56#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {56#true} is VALID [2018-11-23 11:13:57,081 INFO L273 TraceCheckUtils]: 16: Hoare triple {56#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {56#true} is VALID [2018-11-23 11:13:57,081 INFO L273 TraceCheckUtils]: 17: Hoare triple {56#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {56#true} is VALID [2018-11-23 11:13:57,081 INFO L273 TraceCheckUtils]: 18: Hoare triple {56#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {56#true} is VALID [2018-11-23 11:13:57,082 INFO L273 TraceCheckUtils]: 19: Hoare triple {56#true} assume true; {56#true} is VALID [2018-11-23 11:13:57,082 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {56#true} {56#true} #144#return; {56#true} is VALID [2018-11-23 11:13:57,083 INFO L273 TraceCheckUtils]: 21: Hoare triple {56#true} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {56#true} is VALID [2018-11-23 11:13:57,096 INFO L273 TraceCheckUtils]: 22: Hoare triple {56#true} assume !true; {57#false} is VALID [2018-11-23 11:13:57,096 INFO L273 TraceCheckUtils]: 23: Hoare triple {57#false} assume ~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, ~bvadd32(4bv32, ~snd_to_last~0.offset), 4bv32);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, ~new_node~0.base, ~bvadd32(8bv32, ~new_node~0.offset), 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32); {57#false} is VALID [2018-11-23 11:13:57,097 INFO L273 TraceCheckUtils]: 24: Hoare triple {57#false} assume ~last~0.base != 0bv32 || ~last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~last~0.base, ~bvadd32(8bv32, ~last~0.offset), 4bv32); {57#false} is VALID [2018-11-23 11:13:57,097 INFO L273 TraceCheckUtils]: 25: Hoare triple {57#false} assume true; {57#false} is VALID [2018-11-23 11:13:57,097 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {57#false} {56#true} #134#return; {57#false} is VALID [2018-11-23 11:13:57,098 INFO L273 TraceCheckUtils]: 27: Hoare triple {57#false} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0bv32; {57#false} is VALID [2018-11-23 11:13:57,098 INFO L273 TraceCheckUtils]: 28: Hoare triple {57#false} assume !true; {57#false} is VALID [2018-11-23 11:13:57,098 INFO L273 TraceCheckUtils]: 29: Hoare triple {57#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {57#false} is VALID [2018-11-23 11:13:57,099 INFO L273 TraceCheckUtils]: 30: Hoare triple {57#false} assume !false; {57#false} is VALID [2018-11-23 11:13:57,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:13:57,106 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:13:57,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:13:57,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:13:57,121 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-11-23 11:13:57,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:13:57,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:13:57,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:13:57,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:13:57,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:13:57,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:13:57,418 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 2 states. [2018-11-23 11:13:58,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:13:58,764 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2018-11-23 11:13:58,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:13:58,765 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-11-23 11:13:58,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:13:58,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:13:58,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 120 transitions. [2018-11-23 11:13:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:13:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 120 transitions. [2018-11-23 11:13:58,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 120 transitions. [2018-11-23 11:13:59,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:13:59,206 INFO L225 Difference]: With dead ends: 92 [2018-11-23 11:13:59,206 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 11:13:59,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:13:59,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 11:13:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 11:13:59,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:13:59,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-23 11:13:59,410 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 11:13:59,410 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 11:13:59,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:13:59,415 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 11:13:59,416 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-23 11:13:59,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:13:59,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:13:59,417 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 11:13:59,417 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 11:13:59,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:13:59,426 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 11:13:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-23 11:13:59,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:13:59,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:13:59,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:13:59,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:13:59,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:13:59,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-11-23 11:13:59,436 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 31 [2018-11-23 11:13:59,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:13:59,437 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-23 11:13:59,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:13:59,437 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-23 11:13:59,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:13:59,439 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:13:59,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:13:59,440 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:13:59,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:13:59,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1550301628, now seen corresponding path program 1 times [2018-11-23 11:13:59,442 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:13:59,442 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:13:59,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:13:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:13:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:13:59,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:13:59,700 INFO L256 TraceCheckUtils]: 0: Hoare triple {407#true} call ULTIMATE.init(); {407#true} is VALID [2018-11-23 11:13:59,701 INFO L273 TraceCheckUtils]: 1: Hoare triple {407#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {407#true} is VALID [2018-11-23 11:13:59,701 INFO L273 TraceCheckUtils]: 2: Hoare triple {407#true} assume true; {407#true} is VALID [2018-11-23 11:13:59,702 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {407#true} {407#true} #140#return; {407#true} is VALID [2018-11-23 11:13:59,702 INFO L256 TraceCheckUtils]: 4: Hoare triple {407#true} call #t~ret19 := main(); {407#true} is VALID [2018-11-23 11:13:59,702 INFO L273 TraceCheckUtils]: 5: Hoare triple {407#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {407#true} is VALID [2018-11-23 11:13:59,703 INFO L256 TraceCheckUtils]: 6: Hoare triple {407#true} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {407#true} is VALID [2018-11-23 11:13:59,703 INFO L273 TraceCheckUtils]: 7: Hoare triple {407#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {407#true} is VALID [2018-11-23 11:13:59,703 INFO L273 TraceCheckUtils]: 8: Hoare triple {407#true} assume !~bvsgt32(~len, 0bv32); {407#true} is VALID [2018-11-23 11:13:59,704 INFO L273 TraceCheckUtils]: 9: Hoare triple {407#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {407#true} is VALID [2018-11-23 11:13:59,704 INFO L273 TraceCheckUtils]: 10: Hoare triple {407#true} assume true; {407#true} is VALID [2018-11-23 11:13:59,704 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {407#true} {407#true} #132#return; {407#true} is VALID [2018-11-23 11:13:59,705 INFO L273 TraceCheckUtils]: 12: Hoare triple {407#true} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset; {407#true} is VALID [2018-11-23 11:13:59,705 INFO L256 TraceCheckUtils]: 13: Hoare triple {407#true} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, ~bvsdiv32(~len~0, 2bv32)); {407#true} is VALID [2018-11-23 11:13:59,706 INFO L273 TraceCheckUtils]: 14: Hoare triple {407#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {407#true} is VALID [2018-11-23 11:13:59,706 INFO L256 TraceCheckUtils]: 15: Hoare triple {407#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {407#true} is VALID [2018-11-23 11:13:59,706 INFO L273 TraceCheckUtils]: 16: Hoare triple {407#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {407#true} is VALID [2018-11-23 11:13:59,707 INFO L273 TraceCheckUtils]: 17: Hoare triple {407#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {407#true} is VALID [2018-11-23 11:13:59,707 INFO L273 TraceCheckUtils]: 18: Hoare triple {407#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {407#true} is VALID [2018-11-23 11:13:59,707 INFO L273 TraceCheckUtils]: 19: Hoare triple {407#true} assume true; {407#true} is VALID [2018-11-23 11:13:59,708 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {407#true} {407#true} #144#return; {407#true} is VALID [2018-11-23 11:13:59,716 INFO L273 TraceCheckUtils]: 21: Hoare triple {407#true} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {475#(and (= dll_insert_~snd_to_last~0.offset (_ bv0 32)) (= dll_insert_~snd_to_last~0.base (_ bv0 32)))} is VALID [2018-11-23 11:13:59,729 INFO L273 TraceCheckUtils]: 22: Hoare triple {475#(and (= dll_insert_~snd_to_last~0.offset (_ bv0 32)) (= dll_insert_~snd_to_last~0.base (_ bv0 32)))} assume !~bvsgt32(~index, 0bv32); {475#(and (= dll_insert_~snd_to_last~0.offset (_ bv0 32)) (= dll_insert_~snd_to_last~0.base (_ bv0 32)))} is VALID [2018-11-23 11:13:59,741 INFO L273 TraceCheckUtils]: 23: Hoare triple {475#(and (= dll_insert_~snd_to_last~0.offset (_ bv0 32)) (= dll_insert_~snd_to_last~0.base (_ bv0 32)))} assume ~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, ~bvadd32(4bv32, ~snd_to_last~0.offset), 4bv32);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, ~new_node~0.base, ~bvadd32(8bv32, ~new_node~0.offset), 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32); {408#false} is VALID [2018-11-23 11:13:59,741 INFO L273 TraceCheckUtils]: 24: Hoare triple {408#false} assume ~last~0.base != 0bv32 || ~last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~last~0.base, ~bvadd32(8bv32, ~last~0.offset), 4bv32); {408#false} is VALID [2018-11-23 11:13:59,742 INFO L273 TraceCheckUtils]: 25: Hoare triple {408#false} assume true; {408#false} is VALID [2018-11-23 11:13:59,742 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {408#false} {407#true} #134#return; {408#false} is VALID [2018-11-23 11:13:59,742 INFO L273 TraceCheckUtils]: 27: Hoare triple {408#false} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0bv32; {408#false} is VALID [2018-11-23 11:13:59,742 INFO L273 TraceCheckUtils]: 28: Hoare triple {408#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {408#false} is VALID [2018-11-23 11:13:59,743 INFO L273 TraceCheckUtils]: 29: Hoare triple {408#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {408#false} is VALID [2018-11-23 11:13:59,743 INFO L273 TraceCheckUtils]: 30: Hoare triple {408#false} assume !false; {408#false} is VALID [2018-11-23 11:13:59,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:13:59,745 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:13:59,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:13:59,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:13:59,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 11:13:59,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:13:59,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:13:59,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:13:59,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:13:59,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:13:59,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:13:59,871 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 3 states. [2018-11-23 11:14:01,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:01,366 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-23 11:14:01,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:14:01,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 11:14:01,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:14:01,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:14:01,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-11-23 11:14:01,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:14:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-11-23 11:14:01,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2018-11-23 11:14:01,646 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:14:01,649 INFO L225 Difference]: With dead ends: 52 [2018-11-23 11:14:01,649 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 11:14:01,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:14:01,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 11:14:01,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-23 11:14:01,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:14:01,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 41 states. [2018-11-23 11:14:01,665 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 41 states. [2018-11-23 11:14:01,665 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 41 states. [2018-11-23 11:14:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:01,669 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-23 11:14:01,669 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-23 11:14:01,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:14:01,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:14:01,670 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 43 states. [2018-11-23 11:14:01,670 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 43 states. [2018-11-23 11:14:01,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:01,674 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-23 11:14:01,674 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-23 11:14:01,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:14:01,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:14:01,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:14:01,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:14:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:14:01,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-23 11:14:01,679 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 31 [2018-11-23 11:14:01,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:14:01,679 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 11:14:01,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:14:01,679 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 11:14:01,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:14:01,681 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:14:01,681 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:14:01,681 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:14:01,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:14:01,682 INFO L82 PathProgramCache]: Analyzing trace with hash -387588301, now seen corresponding path program 1 times [2018-11-23 11:14:01,682 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:14:01,682 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:14:01,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:14:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:14:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:14:01,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:14:01,900 INFO L256 TraceCheckUtils]: 0: Hoare triple {713#true} call ULTIMATE.init(); {713#true} is VALID [2018-11-23 11:14:01,900 INFO L273 TraceCheckUtils]: 1: Hoare triple {713#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {713#true} is VALID [2018-11-23 11:14:01,901 INFO L273 TraceCheckUtils]: 2: Hoare triple {713#true} assume true; {713#true} is VALID [2018-11-23 11:14:01,901 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {713#true} {713#true} #140#return; {713#true} is VALID [2018-11-23 11:14:01,902 INFO L256 TraceCheckUtils]: 4: Hoare triple {713#true} call #t~ret19 := main(); {713#true} is VALID [2018-11-23 11:14:01,905 INFO L273 TraceCheckUtils]: 5: Hoare triple {713#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {733#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:14:01,906 INFO L256 TraceCheckUtils]: 6: Hoare triple {733#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {713#true} is VALID [2018-11-23 11:14:01,906 INFO L273 TraceCheckUtils]: 7: Hoare triple {713#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {740#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:14:01,907 INFO L273 TraceCheckUtils]: 8: Hoare triple {740#(= dll_create_~len |dll_create_#in~len|)} assume !~bvsgt32(~len, 0bv32); {744#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:14:01,908 INFO L273 TraceCheckUtils]: 9: Hoare triple {744#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {744#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:14:01,910 INFO L273 TraceCheckUtils]: 10: Hoare triple {744#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} assume true; {744#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:14:01,911 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {744#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} {733#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #132#return; {714#false} is VALID [2018-11-23 11:14:01,912 INFO L273 TraceCheckUtils]: 12: Hoare triple {714#false} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset; {714#false} is VALID [2018-11-23 11:14:01,912 INFO L256 TraceCheckUtils]: 13: Hoare triple {714#false} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, ~bvsdiv32(~len~0, 2bv32)); {714#false} is VALID [2018-11-23 11:14:01,912 INFO L273 TraceCheckUtils]: 14: Hoare triple {714#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {714#false} is VALID [2018-11-23 11:14:01,913 INFO L256 TraceCheckUtils]: 15: Hoare triple {714#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {714#false} is VALID [2018-11-23 11:14:01,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {714#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {714#false} is VALID [2018-11-23 11:14:01,913 INFO L273 TraceCheckUtils]: 17: Hoare triple {714#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {714#false} is VALID [2018-11-23 11:14:01,914 INFO L273 TraceCheckUtils]: 18: Hoare triple {714#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {714#false} is VALID [2018-11-23 11:14:01,914 INFO L273 TraceCheckUtils]: 19: Hoare triple {714#false} assume true; {714#false} is VALID [2018-11-23 11:14:01,914 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {714#false} {714#false} #144#return; {714#false} is VALID [2018-11-23 11:14:01,915 INFO L273 TraceCheckUtils]: 21: Hoare triple {714#false} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {714#false} is VALID [2018-11-23 11:14:01,915 INFO L273 TraceCheckUtils]: 22: Hoare triple {714#false} assume !!~bvsgt32(~index, 0bv32);~snd_to_last~0.base, ~snd_to_last~0.offset := ~last~0.base, ~last~0.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~last~0.base, ~bvadd32(4bv32, ~last~0.offset), 4bv32);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;#t~post9 := ~index;~index := ~bvsub32(#t~post9, 1bv32);havoc #t~post9; {714#false} is VALID [2018-11-23 11:14:01,915 INFO L273 TraceCheckUtils]: 23: Hoare triple {714#false} assume !~bvsgt32(~index, 0bv32); {714#false} is VALID [2018-11-23 11:14:01,916 INFO L273 TraceCheckUtils]: 24: Hoare triple {714#false} assume ~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, ~bvadd32(4bv32, ~snd_to_last~0.offset), 4bv32);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, ~new_node~0.base, ~bvadd32(8bv32, ~new_node~0.offset), 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32); {714#false} is VALID [2018-11-23 11:14:01,916 INFO L273 TraceCheckUtils]: 25: Hoare triple {714#false} assume ~last~0.base != 0bv32 || ~last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~last~0.base, ~bvadd32(8bv32, ~last~0.offset), 4bv32); {714#false} is VALID [2018-11-23 11:14:01,916 INFO L273 TraceCheckUtils]: 26: Hoare triple {714#false} assume true; {714#false} is VALID [2018-11-23 11:14:01,917 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {714#false} {714#false} #134#return; {714#false} is VALID [2018-11-23 11:14:01,917 INFO L273 TraceCheckUtils]: 28: Hoare triple {714#false} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0bv32; {714#false} is VALID [2018-11-23 11:14:01,917 INFO L273 TraceCheckUtils]: 29: Hoare triple {714#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {714#false} is VALID [2018-11-23 11:14:01,918 INFO L273 TraceCheckUtils]: 30: Hoare triple {714#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {714#false} is VALID [2018-11-23 11:14:01,918 INFO L273 TraceCheckUtils]: 31: Hoare triple {714#false} assume !false; {714#false} is VALID [2018-11-23 11:14:01,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:14:01,920 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (4)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:14:01,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:14:01,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:14:01,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-23 11:14:01,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:14:01,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:14:02,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:14:02,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:14:02,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:14:02,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:14:02,027 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 5 states. [2018-11-23 11:14:04,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:04,019 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-11-23 11:14:04,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:14:04,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-23 11:14:04,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:14:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:14:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2018-11-23 11:14:04,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:14:04,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2018-11-23 11:14:04,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 84 transitions. [2018-11-23 11:14:04,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:14:04,260 INFO L225 Difference]: With dead ends: 74 [2018-11-23 11:14:04,260 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 11:14:04,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:14:04,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 11:14:04,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-11-23 11:14:04,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:14:04,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 42 states. [2018-11-23 11:14:04,291 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 42 states. [2018-11-23 11:14:04,291 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 42 states. [2018-11-23 11:14:04,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:04,295 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-11-23 11:14:04,295 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2018-11-23 11:14:04,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:14:04,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:14:04,296 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 46 states. [2018-11-23 11:14:04,296 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 46 states. [2018-11-23 11:14:04,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:04,299 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-11-23 11:14:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2018-11-23 11:14:04,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:14:04,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:14:04,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:14:04,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:14:04,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:14:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-11-23 11:14:04,305 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 32 [2018-11-23 11:14:04,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:14:04,305 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-11-23 11:14:04,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:14:04,305 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-23 11:14:04,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:14:04,307 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:14:04,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:14:04,307 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:14:04,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:14:04,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1024221899, now seen corresponding path program 1 times [2018-11-23 11:14:04,308 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:14:04,308 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:14:04,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:14:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:14:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:14:04,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:14:04,557 INFO L256 TraceCheckUtils]: 0: Hoare triple {1063#true} call ULTIMATE.init(); {1063#true} is VALID [2018-11-23 11:14:04,557 INFO L273 TraceCheckUtils]: 1: Hoare triple {1063#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1063#true} is VALID [2018-11-23 11:14:04,558 INFO L273 TraceCheckUtils]: 2: Hoare triple {1063#true} assume true; {1063#true} is VALID [2018-11-23 11:14:04,558 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1063#true} {1063#true} #140#return; {1063#true} is VALID [2018-11-23 11:14:04,558 INFO L256 TraceCheckUtils]: 4: Hoare triple {1063#true} call #t~ret19 := main(); {1063#true} is VALID [2018-11-23 11:14:04,558 INFO L273 TraceCheckUtils]: 5: Hoare triple {1063#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1063#true} is VALID [2018-11-23 11:14:04,559 INFO L256 TraceCheckUtils]: 6: Hoare triple {1063#true} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {1063#true} is VALID [2018-11-23 11:14:04,563 INFO L273 TraceCheckUtils]: 7: Hoare triple {1063#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1089#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-23 11:14:04,566 INFO L273 TraceCheckUtils]: 8: Hoare triple {1089#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1089#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-23 11:14:04,569 INFO L273 TraceCheckUtils]: 9: Hoare triple {1089#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1089#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-23 11:14:04,574 INFO L273 TraceCheckUtils]: 10: Hoare triple {1089#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1089#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-23 11:14:04,576 INFO L273 TraceCheckUtils]: 11: Hoare triple {1089#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {1064#false} is VALID [2018-11-23 11:14:04,576 INFO L273 TraceCheckUtils]: 12: Hoare triple {1064#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1064#false} is VALID [2018-11-23 11:14:04,576 INFO L273 TraceCheckUtils]: 13: Hoare triple {1064#false} assume !~bvsgt32(~len, 0bv32); {1064#false} is VALID [2018-11-23 11:14:04,577 INFO L273 TraceCheckUtils]: 14: Hoare triple {1064#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1064#false} is VALID [2018-11-23 11:14:04,577 INFO L273 TraceCheckUtils]: 15: Hoare triple {1064#false} assume true; {1064#false} is VALID [2018-11-23 11:14:04,577 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1064#false} {1063#true} #132#return; {1064#false} is VALID [2018-11-23 11:14:04,577 INFO L273 TraceCheckUtils]: 17: Hoare triple {1064#false} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset; {1064#false} is VALID [2018-11-23 11:14:04,578 INFO L256 TraceCheckUtils]: 18: Hoare triple {1064#false} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, ~bvsdiv32(~len~0, 2bv32)); {1064#false} is VALID [2018-11-23 11:14:04,578 INFO L273 TraceCheckUtils]: 19: Hoare triple {1064#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1064#false} is VALID [2018-11-23 11:14:04,578 INFO L256 TraceCheckUtils]: 20: Hoare triple {1064#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1064#false} is VALID [2018-11-23 11:14:04,578 INFO L273 TraceCheckUtils]: 21: Hoare triple {1064#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1064#false} is VALID [2018-11-23 11:14:04,579 INFO L273 TraceCheckUtils]: 22: Hoare triple {1064#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1064#false} is VALID [2018-11-23 11:14:04,579 INFO L273 TraceCheckUtils]: 23: Hoare triple {1064#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1064#false} is VALID [2018-11-23 11:14:04,579 INFO L273 TraceCheckUtils]: 24: Hoare triple {1064#false} assume true; {1064#false} is VALID [2018-11-23 11:14:04,579 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1064#false} {1064#false} #144#return; {1064#false} is VALID [2018-11-23 11:14:04,580 INFO L273 TraceCheckUtils]: 26: Hoare triple {1064#false} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {1064#false} is VALID [2018-11-23 11:14:04,580 INFO L273 TraceCheckUtils]: 27: Hoare triple {1064#false} assume !!~bvsgt32(~index, 0bv32);~snd_to_last~0.base, ~snd_to_last~0.offset := ~last~0.base, ~last~0.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~last~0.base, ~bvadd32(4bv32, ~last~0.offset), 4bv32);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;#t~post9 := ~index;~index := ~bvsub32(#t~post9, 1bv32);havoc #t~post9; {1064#false} is VALID [2018-11-23 11:14:04,580 INFO L273 TraceCheckUtils]: 28: Hoare triple {1064#false} assume !~bvsgt32(~index, 0bv32); {1064#false} is VALID [2018-11-23 11:14:04,581 INFO L273 TraceCheckUtils]: 29: Hoare triple {1064#false} assume ~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, ~bvadd32(4bv32, ~snd_to_last~0.offset), 4bv32);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, ~new_node~0.base, ~bvadd32(8bv32, ~new_node~0.offset), 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32); {1064#false} is VALID [2018-11-23 11:14:04,581 INFO L273 TraceCheckUtils]: 30: Hoare triple {1064#false} assume ~last~0.base != 0bv32 || ~last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~last~0.base, ~bvadd32(8bv32, ~last~0.offset), 4bv32); {1064#false} is VALID [2018-11-23 11:14:04,581 INFO L273 TraceCheckUtils]: 31: Hoare triple {1064#false} assume true; {1064#false} is VALID [2018-11-23 11:14:04,582 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1064#false} {1064#false} #134#return; {1064#false} is VALID [2018-11-23 11:14:04,582 INFO L273 TraceCheckUtils]: 33: Hoare triple {1064#false} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0bv32; {1064#false} is VALID [2018-11-23 11:14:04,582 INFO L273 TraceCheckUtils]: 34: Hoare triple {1064#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {1064#false} is VALID [2018-11-23 11:14:04,583 INFO L273 TraceCheckUtils]: 35: Hoare triple {1064#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1064#false} is VALID [2018-11-23 11:14:04,583 INFO L273 TraceCheckUtils]: 36: Hoare triple {1064#false} assume !false; {1064#false} is VALID [2018-11-23 11:14:04,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:14:04,586 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:14:04,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:14:04,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:14:04,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 11:14:04,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:14:04,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:14:04,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:14:04,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:14:04,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:14:04,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:14:04,714 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 3 states. [2018-11-23 11:14:05,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:05,885 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2018-11-23 11:14:05,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:14:05,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 11:14:05,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:14:05,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:14:05,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 11:14:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:14:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 11:14:05,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2018-11-23 11:14:06,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:14:06,113 INFO L225 Difference]: With dead ends: 79 [2018-11-23 11:14:06,114 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 11:14:06,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:14:06,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 11:14:06,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-23 11:14:06,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:14:06,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2018-11-23 11:14:06,134 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2018-11-23 11:14:06,134 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2018-11-23 11:14:06,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:06,137 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 11:14:06,137 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-23 11:14:06,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:14:06,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:14:06,138 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2018-11-23 11:14:06,138 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2018-11-23 11:14:06,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:06,141 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 11:14:06,141 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-23 11:14:06,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:14:06,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:14:06,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:14:06,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:14:06,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:14:06,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2018-11-23 11:14:06,145 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 37 [2018-11-23 11:14:06,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:14:06,145 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2018-11-23 11:14:06,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:14:06,145 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2018-11-23 11:14:06,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:14:06,146 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:14:06,147 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:14:06,147 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:14:06,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:14:06,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1086261513, now seen corresponding path program 1 times [2018-11-23 11:14:06,148 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:14:06,148 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:14:06,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:14:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:14:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:14:06,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:14:06,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {1433#true} call ULTIMATE.init(); {1433#true} is VALID [2018-11-23 11:14:06,479 INFO L273 TraceCheckUtils]: 1: Hoare triple {1433#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1433#true} is VALID [2018-11-23 11:14:06,479 INFO L273 TraceCheckUtils]: 2: Hoare triple {1433#true} assume true; {1433#true} is VALID [2018-11-23 11:14:06,480 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1433#true} {1433#true} #140#return; {1433#true} is VALID [2018-11-23 11:14:06,480 INFO L256 TraceCheckUtils]: 4: Hoare triple {1433#true} call #t~ret19 := main(); {1433#true} is VALID [2018-11-23 11:14:06,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {1433#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1453#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:14:06,481 INFO L256 TraceCheckUtils]: 6: Hoare triple {1453#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {1433#true} is VALID [2018-11-23 11:14:06,482 INFO L273 TraceCheckUtils]: 7: Hoare triple {1433#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1460#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:14:06,482 INFO L273 TraceCheckUtils]: 8: Hoare triple {1460#(= dll_create_~len |dll_create_#in~len|)} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1460#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:14:06,482 INFO L273 TraceCheckUtils]: 9: Hoare triple {1460#(= dll_create_~len |dll_create_#in~len|)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1460#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:14:06,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {1460#(= dll_create_~len |dll_create_#in~len|)} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1460#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:14:06,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {1460#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1460#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:14:06,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {1460#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1476#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} is VALID [2018-11-23 11:14:06,486 INFO L273 TraceCheckUtils]: 13: Hoare triple {1476#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} assume !~bvsgt32(~len, 0bv32); {1480#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:14:06,487 INFO L273 TraceCheckUtils]: 14: Hoare triple {1480#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1480#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:14:06,488 INFO L273 TraceCheckUtils]: 15: Hoare triple {1480#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1480#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:14:06,490 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1480#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {1453#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #132#return; {1434#false} is VALID [2018-11-23 11:14:06,490 INFO L273 TraceCheckUtils]: 17: Hoare triple {1434#false} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset; {1434#false} is VALID [2018-11-23 11:14:06,490 INFO L256 TraceCheckUtils]: 18: Hoare triple {1434#false} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, ~bvsdiv32(~len~0, 2bv32)); {1434#false} is VALID [2018-11-23 11:14:06,491 INFO L273 TraceCheckUtils]: 19: Hoare triple {1434#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1434#false} is VALID [2018-11-23 11:14:06,491 INFO L256 TraceCheckUtils]: 20: Hoare triple {1434#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1434#false} is VALID [2018-11-23 11:14:06,492 INFO L273 TraceCheckUtils]: 21: Hoare triple {1434#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1434#false} is VALID [2018-11-23 11:14:06,492 INFO L273 TraceCheckUtils]: 22: Hoare triple {1434#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1434#false} is VALID [2018-11-23 11:14:06,493 INFO L273 TraceCheckUtils]: 23: Hoare triple {1434#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1434#false} is VALID [2018-11-23 11:14:06,493 INFO L273 TraceCheckUtils]: 24: Hoare triple {1434#false} assume true; {1434#false} is VALID [2018-11-23 11:14:06,493 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1434#false} {1434#false} #144#return; {1434#false} is VALID [2018-11-23 11:14:06,494 INFO L273 TraceCheckUtils]: 26: Hoare triple {1434#false} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {1434#false} is VALID [2018-11-23 11:14:06,494 INFO L273 TraceCheckUtils]: 27: Hoare triple {1434#false} assume !!~bvsgt32(~index, 0bv32);~snd_to_last~0.base, ~snd_to_last~0.offset := ~last~0.base, ~last~0.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~last~0.base, ~bvadd32(4bv32, ~last~0.offset), 4bv32);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;#t~post9 := ~index;~index := ~bvsub32(#t~post9, 1bv32);havoc #t~post9; {1434#false} is VALID [2018-11-23 11:14:06,494 INFO L273 TraceCheckUtils]: 28: Hoare triple {1434#false} assume !~bvsgt32(~index, 0bv32); {1434#false} is VALID [2018-11-23 11:14:06,494 INFO L273 TraceCheckUtils]: 29: Hoare triple {1434#false} assume ~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, ~bvadd32(4bv32, ~snd_to_last~0.offset), 4bv32);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, ~new_node~0.base, ~bvadd32(8bv32, ~new_node~0.offset), 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32); {1434#false} is VALID [2018-11-23 11:14:06,494 INFO L273 TraceCheckUtils]: 30: Hoare triple {1434#false} assume ~last~0.base != 0bv32 || ~last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~last~0.base, ~bvadd32(8bv32, ~last~0.offset), 4bv32); {1434#false} is VALID [2018-11-23 11:14:06,495 INFO L273 TraceCheckUtils]: 31: Hoare triple {1434#false} assume true; {1434#false} is VALID [2018-11-23 11:14:06,495 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1434#false} {1434#false} #134#return; {1434#false} is VALID [2018-11-23 11:14:06,495 INFO L273 TraceCheckUtils]: 33: Hoare triple {1434#false} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0bv32; {1434#false} is VALID [2018-11-23 11:14:06,495 INFO L273 TraceCheckUtils]: 34: Hoare triple {1434#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {1434#false} is VALID [2018-11-23 11:14:06,495 INFO L273 TraceCheckUtils]: 35: Hoare triple {1434#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1434#false} is VALID [2018-11-23 11:14:06,496 INFO L273 TraceCheckUtils]: 36: Hoare triple {1434#false} assume !false; {1434#false} is VALID [2018-11-23 11:14:06,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:14:06,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:14:06,857 INFO L273 TraceCheckUtils]: 36: Hoare triple {1434#false} assume !false; {1434#false} is VALID [2018-11-23 11:14:06,857 INFO L273 TraceCheckUtils]: 35: Hoare triple {1434#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1434#false} is VALID [2018-11-23 11:14:06,858 INFO L273 TraceCheckUtils]: 34: Hoare triple {1434#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {1434#false} is VALID [2018-11-23 11:14:06,858 INFO L273 TraceCheckUtils]: 33: Hoare triple {1434#false} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0bv32; {1434#false} is VALID [2018-11-23 11:14:06,858 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1433#true} {1434#false} #134#return; {1434#false} is VALID [2018-11-23 11:14:06,858 INFO L273 TraceCheckUtils]: 31: Hoare triple {1433#true} assume true; {1433#true} is VALID [2018-11-23 11:14:06,859 INFO L273 TraceCheckUtils]: 30: Hoare triple {1433#true} assume ~last~0.base != 0bv32 || ~last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~last~0.base, ~bvadd32(8bv32, ~last~0.offset), 4bv32); {1433#true} is VALID [2018-11-23 11:14:06,859 INFO L273 TraceCheckUtils]: 29: Hoare triple {1433#true} assume ~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, ~bvadd32(4bv32, ~snd_to_last~0.offset), 4bv32);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, ~new_node~0.base, ~bvadd32(8bv32, ~new_node~0.offset), 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32); {1433#true} is VALID [2018-11-23 11:14:06,859 INFO L273 TraceCheckUtils]: 28: Hoare triple {1433#true} assume !~bvsgt32(~index, 0bv32); {1433#true} is VALID [2018-11-23 11:14:06,859 INFO L273 TraceCheckUtils]: 27: Hoare triple {1433#true} assume !!~bvsgt32(~index, 0bv32);~snd_to_last~0.base, ~snd_to_last~0.offset := ~last~0.base, ~last~0.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~last~0.base, ~bvadd32(4bv32, ~last~0.offset), 4bv32);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;#t~post9 := ~index;~index := ~bvsub32(#t~post9, 1bv32);havoc #t~post9; {1433#true} is VALID [2018-11-23 11:14:06,859 INFO L273 TraceCheckUtils]: 26: Hoare triple {1433#true} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {1433#true} is VALID [2018-11-23 11:14:06,860 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1433#true} {1433#true} #144#return; {1433#true} is VALID [2018-11-23 11:14:06,860 INFO L273 TraceCheckUtils]: 24: Hoare triple {1433#true} assume true; {1433#true} is VALID [2018-11-23 11:14:06,860 INFO L273 TraceCheckUtils]: 23: Hoare triple {1433#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1433#true} is VALID [2018-11-23 11:14:06,860 INFO L273 TraceCheckUtils]: 22: Hoare triple {1433#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1433#true} is VALID [2018-11-23 11:14:06,860 INFO L273 TraceCheckUtils]: 21: Hoare triple {1433#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1433#true} is VALID [2018-11-23 11:14:06,861 INFO L256 TraceCheckUtils]: 20: Hoare triple {1433#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1433#true} is VALID [2018-11-23 11:14:06,861 INFO L273 TraceCheckUtils]: 19: Hoare triple {1433#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1433#true} is VALID [2018-11-23 11:14:06,861 INFO L256 TraceCheckUtils]: 18: Hoare triple {1434#false} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, ~bvsdiv32(~len~0, 2bv32)); {1433#true} is VALID [2018-11-23 11:14:06,861 INFO L273 TraceCheckUtils]: 17: Hoare triple {1434#false} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset; {1434#false} is VALID [2018-11-23 11:14:06,864 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1480#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {1610#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} #132#return; {1434#false} is VALID [2018-11-23 11:14:06,865 INFO L273 TraceCheckUtils]: 15: Hoare triple {1480#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1480#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:14:06,865 INFO L273 TraceCheckUtils]: 14: Hoare triple {1480#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1480#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:14:06,866 INFO L273 TraceCheckUtils]: 13: Hoare triple {1623#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !~bvsgt32(~len, 0bv32); {1480#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:14:06,888 INFO L273 TraceCheckUtils]: 12: Hoare triple {1627#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1623#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:14:06,903 INFO L273 TraceCheckUtils]: 11: Hoare triple {1627#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1627#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:14:06,904 INFO L273 TraceCheckUtils]: 10: Hoare triple {1627#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1627#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:14:06,907 INFO L273 TraceCheckUtils]: 9: Hoare triple {1627#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1627#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:14:06,909 INFO L273 TraceCheckUtils]: 8: Hoare triple {1627#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1627#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:14:06,911 INFO L273 TraceCheckUtils]: 7: Hoare triple {1433#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1627#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:14:06,911 INFO L256 TraceCheckUtils]: 6: Hoare triple {1610#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {1433#true} is VALID [2018-11-23 11:14:06,912 INFO L273 TraceCheckUtils]: 5: Hoare triple {1433#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1610#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:14:06,912 INFO L256 TraceCheckUtils]: 4: Hoare triple {1433#true} call #t~ret19 := main(); {1433#true} is VALID [2018-11-23 11:14:06,912 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1433#true} {1433#true} #140#return; {1433#true} is VALID [2018-11-23 11:14:06,913 INFO L273 TraceCheckUtils]: 2: Hoare triple {1433#true} assume true; {1433#true} is VALID [2018-11-23 11:14:06,913 INFO L273 TraceCheckUtils]: 1: Hoare triple {1433#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1433#true} is VALID [2018-11-23 11:14:06,914 INFO L256 TraceCheckUtils]: 0: Hoare triple {1433#true} call ULTIMATE.init(); {1433#true} is VALID [2018-11-23 11:14:06,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:14:06,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:14:06,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 11:14:06,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 11:14:06,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:14:06,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:14:07,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:14:07,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:14:07,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:14:07,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:14:07,092 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 9 states. [2018-11-23 11:14:09,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:09,489 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2018-11-23 11:14:09,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:14:09,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 11:14:09,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:14:09,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:14:09,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2018-11-23 11:14:09,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:14:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2018-11-23 11:14:09,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 89 transitions. [2018-11-23 11:14:09,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:14:09,806 INFO L225 Difference]: With dead ends: 79 [2018-11-23 11:14:09,806 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 11:14:09,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:14:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 11:14:09,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-11-23 11:14:09,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:14:09,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 47 states. [2018-11-23 11:14:09,865 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 47 states. [2018-11-23 11:14:09,865 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 47 states. [2018-11-23 11:14:09,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:09,868 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2018-11-23 11:14:09,868 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2018-11-23 11:14:09,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:14:09,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:14:09,869 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 51 states. [2018-11-23 11:14:09,869 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 51 states. [2018-11-23 11:14:09,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:14:09,872 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2018-11-23 11:14:09,872 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2018-11-23 11:14:09,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:14:09,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:14:09,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:14:09,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:14:09,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:14:09,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-11-23 11:14:09,875 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 37 [2018-11-23 11:14:09,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:14:09,876 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-11-23 11:14:09,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:14:09,876 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-23 11:14:09,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 11:14:09,877 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:14:09,877 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:14:09,878 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:14:09,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:14:09,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1219620533, now seen corresponding path program 1 times [2018-11-23 11:14:09,879 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:14:09,879 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:14:09,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:14:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:14:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:14:10,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:14:10,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 11:14:10,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:14:10,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:14:10,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:14:10,382 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:14:10,383 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_46|]. (and (= |main_~#s~0.offset| (_ bv0 32)) (= |#valid| (store |v_#valid_46| |main_~#s~0.base| (_ bv1 1)))) [2018-11-23 11:14:10,383 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (= |main_~#s~0.offset| (_ bv0 32))) [2018-11-23 11:14:10,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-23 11:14:10,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 11:14:10,696 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:10,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-23 11:14:10,702 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:14:10,716 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:14:10,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:14:10,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:14:10,778 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:48, output treesize:48 [2018-11-23 11:14:10,941 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:10,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 79 [2018-11-23 11:14:10,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 11:14:10,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:14:11,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:14:11,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:14:11,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:72 [2018-11-23 11:14:11,123 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:14:11,124 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_57|, dll_create_~head~0.offset]. (let ((.cse2 (select |v_#memory_$Pointer$.base_57| dll_create_~new_head~0.base))) (let ((.cse0 (select .cse2 (bvadd dll_create_~new_head~0.offset (_ bv4 32))))) (let ((.cse1 (store |old(#valid)| .cse0 (_ bv1 1)))) (and (= (_ bv0 32) dll_create_~new_head~0.offset) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_57| .cse0 (store (select |v_#memory_$Pointer$.base_57| .cse0) (bvadd dll_create_~head~0.offset (_ bv8 32)) dll_create_~new_head~0.base))) (= (select .cse1 dll_create_~new_head~0.base) (_ bv0 1)) (= (_ bv0 1) (select |old(#valid)| .cse0)) (= (store .cse1 dll_create_~new_head~0.base (_ bv1 1)) |#valid|) (not (= dll_create_~new_head~0.base (_ bv0 32))) (= (_ bv0 32) (select .cse2 (bvadd dll_create_~new_head~0.offset (_ bv8 32)))))))) [2018-11-23 11:14:11,124 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [dll_create_~head~0.offset]. (let ((.cse2 (select |#memory_$Pointer$.base| dll_create_~new_head~0.base))) (let ((.cse1 (select .cse2 (bvadd dll_create_~new_head~0.offset (_ bv4 32))))) (let ((.cse0 (store |old(#valid)| .cse1 (_ bv1 1)))) (and (= (_ bv0 32) dll_create_~new_head~0.offset) (= |#valid| (store .cse0 dll_create_~new_head~0.base (_ bv1 1))) (= (select .cse0 dll_create_~new_head~0.base) (_ bv0 1)) (= (select |old(#valid)| .cse1) (_ bv0 1)) (not (= dll_create_~new_head~0.base (_ bv0 32))) (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| .cse1) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) (select .cse2 (bvadd dll_create_~new_head~0.offset (_ bv8 32)))))))) [2018-11-23 11:14:13,556 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-23 11:14:15,792 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-23 11:14:16,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:16,024 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:16,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:16,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 56 [2018-11-23 11:14:16,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 48 [2018-11-23 11:14:16,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:14:16,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:14:16,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:14:16,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:71 [2018-11-23 11:14:16,168 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:14:16,169 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#valid)_AFTER_CALL_28|, v_subst_1]. (let ((.cse2 (select |#memory_$Pointer$.base| |main_#t~ret13.base|))) (let ((.cse0 (select .cse2 (_ bv4 32)))) (let ((.cse1 (store |v_old(#valid)_AFTER_CALL_28| .cse0 (_ bv1 1)))) (and (= (select (select |#memory_$Pointer$.base| .cse0) (bvadd v_subst_1 (_ bv8 32))) |main_#t~ret13.base|) (= (_ bv0 1) (select .cse1 |main_#t~ret13.base|)) (= (_ bv0 1) (select |v_old(#valid)_AFTER_CALL_28| .cse0)) (= |main_~#s~0.offset| (_ bv0 32)) (= (store .cse1 |main_#t~ret13.base| (_ bv1 1)) |#valid|) (= (bvadd (select |v_old(#valid)_AFTER_CALL_28| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) |main_#t~ret13.base|)) (= (_ bv0 32) (select .cse2 (_ bv8 32))) (= |main_#t~ret13.offset| (_ bv0 32)))))) [2018-11-23 11:14:16,169 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_1]. (let ((.cse1 (select |#memory_$Pointer$.base| |main_#t~ret13.base|))) (let ((.cse0 (select .cse1 (_ bv4 32)))) (and (not (= .cse0 |main_#t~ret13.base|)) (= (select (select |#memory_$Pointer$.base| .cse0) (bvadd v_subst_1 (_ bv8 32))) |main_#t~ret13.base|) (= |main_~#s~0.offset| (_ bv0 32)) (= (select |#valid| |main_#t~ret13.base|) (_ bv1 1)) (= (_ bv1 1) (select |#valid| .cse0)) (not (= |main_~#s~0.base| .cse0)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= |main_~#s~0.base| |main_#t~ret13.base|)) (not (= (_ bv0 32) |main_#t~ret13.base|)) (= (_ bv0 32) (select .cse1 (_ bv8 32))) (= |main_#t~ret13.offset| (_ bv0 32))))) [2018-11-23 11:14:17,834 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-23 11:14:17,867 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:14:17,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:14:17,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:14:17,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:62, output treesize:55 [2018-11-23 11:14:18,104 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:14:18,105 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|]. (and (= dll_insert_~last~0.base (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (= (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.offset| dll_insert_~new_node~0.base) (_ bv0 32)))) |#memory_$Pointer$.offset|) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= (select (select |#memory_$Pointer$.offset| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~last~0.offset) (= (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_insert_~new_node~0.base) (_ bv0 32)))) |#memory_$Pointer$.base|)) [2018-11-23 11:14:18,105 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_DerPreprocessor_2]. (and (= (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~last~0.offset) (= dll_insert_~last~0.base (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_insert_~new_node~0.base) (_ bv0 32)))) |#memory_$Pointer$.base|)) [2018-11-23 11:14:19,119 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:14:19,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:14:19,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 11:14:19,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:152, output treesize:285 [2018-11-23 11:14:21,463 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:14:21,464 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_DerPreprocessor_2, |v_#memory_$Pointer$.base_59|, dll_insert_~new_node~0.offset]. (let ((.cse1 (select (select |v_#memory_$Pointer$.base_59| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|))) (let ((.cse2 (select |v_#memory_$Pointer$.base_59| .cse1)) (.cse3 (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)))) (and (= (let ((.cse0 (store |v_#memory_$Pointer$.base_59| .cse1 (store .cse2 .cse3 dll_insert_~new_node~0.base)))) (store .cse0 dll_insert_~new_node~0.base (store (store (select .cse0 dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) .cse1) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) dll_insert_~last~0.base))) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= (select .cse2 .cse3) dll_insert_~last~0.base) (= |v_#memory_$Pointer$.base_59| (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |v_#memory_$Pointer$.base_59| dll_insert_~new_node~0.base) (_ bv0 32)))))))) [2018-11-23 11:14:21,464 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_DerPreprocessor_4, v_DerPreprocessor_2, dll_insert_~new_node~0.offset]. (let ((.cse4 (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)))) (let ((.cse3 (select (select .cse4 |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|))) (let ((.cse0 (select .cse4 .cse3)) (.cse1 (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)))) (and (= (select .cse0 .cse1) dll_insert_~last~0.base) (= (let ((.cse2 (store .cse4 .cse3 (store .cse0 .cse1 dll_insert_~new_node~0.base)))) (store .cse2 dll_insert_~new_node~0.base (store (store (select .cse2 dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) .cse3) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) dll_insert_~last~0.base))) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)))))) [2018-11-23 11:14:26,063 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-23 11:14:28,185 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (dll_insert_~new_node~0.base (_ BitVec 32)) (dll_insert_~last~0.offset (_ BitVec 32)) (dll_insert_~new_node~0.offset (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (let ((.cse4 (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)))) (let ((.cse3 (select (select .cse4 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|))) (let ((.cse5 (select .cse4 .cse3)) (.cse6 (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) (_ bv4 32)))) (let ((.cse1 (select .cse5 .cse6))) (let ((.cse0 (let ((.cse2 (store .cse4 .cse3 (store .cse5 .cse6 dll_insert_~new_node~0.base)))) (store .cse2 dll_insert_~new_node~0.base (store (store (select .cse2 dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) .cse3) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) .cse1))))) (store .cse0 .cse1 (store (select .cse0 .cse1) (bvadd dll_insert_~last~0.offset (_ bv8 32)) dll_insert_~new_node~0.base)))))))) (= (_ bv0 1) (select |c_old(#valid)| dll_insert_~new_node~0.base)))) is different from true [2018-11-23 11:14:51,029 WARN L180 SmtUtils]: Spent 20.68 s on a formula simplification. DAG size of input: 173 DAG size of output: 71 [2018-11-23 11:14:51,128 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:51,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:51,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:51,157 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:14:51,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 61 [2018-11-23 11:14:51,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:14:51,901 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:14:52,496 INFO L303 Elim1Store]: Index analysis took 626 ms [2018-11-23 11:14:52,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 460 treesize of output 268 [2018-11-23 11:14:52,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-23 11:14:52,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-23 11:14:52,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-23 11:14:52,653 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:14:52,753 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:14:52,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:14:53,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:53,756 INFO L303 Elim1Store]: Index analysis took 464 ms [2018-11-23 11:14:53,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 313 treesize of output 211 [2018-11-23 11:14:54,695 WARN L180 SmtUtils]: Spent 901.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2018-11-23 11:14:54,715 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:14:54,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 99 [2018-11-23 11:14:54,749 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:14:54,989 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:55,135 INFO L303 Elim1Store]: Index analysis took 160 ms [2018-11-23 11:14:55,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 134 [2018-11-23 11:14:55,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 55 [2018-11-23 11:14:55,306 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 11:14:55,307 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:14:55,779 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:55,791 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:14:55,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:55,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:55,858 INFO L303 Elim1Store]: Index analysis took 116 ms [2018-11-23 11:14:55,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2018-11-23 11:14:55,865 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:14:56,508 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:56,513 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:56,518 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:56,535 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:56,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:56,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:56,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 96 [2018-11-23 11:14:56,624 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-23 11:14:57,049 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:57,052 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:57,054 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:57,057 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:57,058 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:14:57,061 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:57,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2018-11-23 11:14:57,087 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:14:58,096 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:58,119 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:58,145 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:58,166 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:58,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:58,216 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:58,268 INFO L303 Elim1Store]: Index analysis took 214 ms [2018-11-23 11:14:58,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 88 [2018-11-23 11:14:58,295 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:14:58,648 INFO L267 ElimStorePlain]: Start of recursive call 10: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-23 11:14:59,029 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:59,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:59,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 166 [2018-11-23 11:14:59,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 55 [2018-11-23 11:14:59,200 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-23 11:14:59,423 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:14:59,448 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:59,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 158 [2018-11-23 11:14:59,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 55 [2018-11-23 11:14:59,626 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-11-23 11:14:59,825 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:14:59,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:14:59,942 INFO L303 Elim1Store]: Index analysis took 102 ms [2018-11-23 11:14:59,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 160 [2018-11-23 11:15:00,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 55 [2018-11-23 11:15:00,043 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-11-23 11:15:00,286 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:15:00,314 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:00,318 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:00,337 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:00,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 167 [2018-11-23 11:15:00,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 55 [2018-11-23 11:15:00,502 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-11-23 11:15:00,753 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:15:00,841 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:00,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:00,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 159 [2018-11-23 11:15:01,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 55 [2018-11-23 11:15:01,118 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-11-23 11:15:01,424 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:15:02,265 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-11-23 11:15:03,248 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-11-23 11:15:04,362 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-11-23 11:15:05,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 141 [2018-11-23 11:15:05,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 11:15:05,597 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:05,704 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:05,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 136 [2018-11-23 11:15:05,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 11:15:05,782 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:05,902 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:05,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 148 [2018-11-23 11:15:05,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 11:15:05,936 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:06,054 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:06,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 150 [2018-11-23 11:15:06,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 11:15:06,087 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:06,218 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:06,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 141 [2018-11-23 11:15:06,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 11:15:06,252 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:06,357 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:06,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 129 [2018-11-23 11:15:06,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 11:15:06,414 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:06,535 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:06,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 136 [2018-11-23 11:15:06,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 11:15:06,563 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:06,649 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:06,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 148 [2018-11-23 11:15:06,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 11:15:06,677 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:06,784 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:06,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 138 [2018-11-23 11:15:06,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 11:15:06,817 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:06,923 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:06,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 153 [2018-11-23 11:15:06,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 11:15:06,952 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:07,068 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:08,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 17 dim-0 vars, and 10 xjuncts. [2018-11-23 11:15:08,402 INFO L202 ElimStorePlain]: Needed 45 recursive calls to eliminate 9 variables, input treesize:791, output treesize:2076 [2018-11-23 11:15:10,547 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:10,547 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#memory_$Pointer$.base)_AFTER_CALL_23|, dll_insert_~new_node~0.base, v_DerPreprocessor_4, |v_#memory_$Pointer$.offset_BEFORE_CALL_4|, v_DerPreprocessor_2, dll_insert_~new_node~0.offset, dll_insert_~last~0.offset, |v_#valid_BEFORE_CALL_6|, v_subst_1]. (let ((.cse0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_23| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse9 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_23| .cse0))) (let ((.cse1 (select .cse9 (_ bv4 32)))) (and (not (= |main_~#s~0.base| .cse0)) (not (= (select |v_#valid_BEFORE_CALL_6| |main_~#s~0.base|) (_ bv0 1))) (not (= .cse1 .cse0)) (= |#memory_$Pointer$.base| (let ((.cse6 (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_23| dll_insert_~new_node~0.base (store (store (store (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_23| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)))) (let ((.cse5 (select (select .cse6 |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse7 (select .cse6 .cse5)) (.cse8 (bvadd (select (select (store |v_#memory_$Pointer$.offset_BEFORE_CALL_4| dll_insert_~new_node~0.base (store (store (store (select |v_#memory_$Pointer$.offset_BEFORE_CALL_4| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) (let ((.cse3 (select .cse7 .cse8))) (let ((.cse2 (let ((.cse4 (store .cse6 .cse5 (store .cse7 .cse8 dll_insert_~new_node~0.base)))) (store .cse4 dll_insert_~new_node~0.base (store (store (select .cse4 dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) .cse5) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) .cse3))))) (store .cse2 .cse3 (store (select .cse2 .cse3) (bvadd dll_insert_~last~0.offset (_ bv8 32)) dll_insert_~new_node~0.base)))))))) (not (= .cse1 |main_~#s~0.base|)) (= (select |v_#valid_BEFORE_CALL_6| dll_insert_~new_node~0.base) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_4| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (_ bv1 1) (select |v_#valid_BEFORE_CALL_6| .cse0)) (not (= (_ bv0 32) .cse0)) (= (_ bv1 1) (select |v_#valid_BEFORE_CALL_6| .cse1)) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_23| .cse1) (bvadd v_subst_1 (_ bv8 32))) .cse0) (= (_ bv0 32) (select .cse9 (_ bv8 32))))))) [2018-11-23 11:15:10,548 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_19, v_prenex_18, v_prenex_17, v_prenex_15, v_prenex_16, v_prenex_9, v_prenex_8, v_prenex_13, dll_insert_~new_node~0.offset, v_prenex_10, v_prenex_11, v_prenex_12, v_prenex_20, v_prenex_21, v_subst_1, dll_insert_~last~0.offset, v_prenex_14]. (let ((.cse21 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse34 (select |#memory_$Pointer$.base| .cse21))) (let ((.cse8 (select .cse34 (bvadd |main_~#s~0.offset| (_ bv4 32))))) (let ((.cse26 (select |#memory_$Pointer$.base| .cse8))) (let ((.cse38 (select .cse26 (_ bv0 32))) (.cse36 (select .cse26 (_ bv4 32))) (.cse35 (select .cse26 (_ bv8 32)))) (let ((.cse2 (= .cse21 .cse35)) (.cse29 (= .cse21 .cse36)) (.cse37 (select .cse26 (_ bv4294967292 32))) (.cse17 (= .cse38 .cse21))) (let ((.cse28 (select |#memory_$Pointer$.base| .cse38)) (.cse31 (not (= |main_~#s~0.base| .cse38))) (.cse32 (not (= .cse34 .cse26))) (.cse27 (not (= .cse8 .cse38))) (.cse30 (not .cse17)) (.cse11 (= (_ bv0 32) .cse35)) (.cse12 (not (= .cse8 .cse37))) (.cse14 (not (= |main_~#s~0.base| .cse37))) (.cse15 (not (= .cse37 .cse21))) (.cse16 (select |#memory_$Pointer$.base| .cse37)) (.cse4 (not .cse29)) (.cse5 (not (= |main_~#s~0.base| .cse36))) (.cse7 (select |#memory_$Pointer$.base| .cse36)) (.cse9 (not (= .cse8 .cse36))) (.cse18 (= (select .cse26 (_ bv12 32)) .cse21)) (.cse19 (not (= |main_~#s~0.base| .cse35))) (.cse20 (select |#memory_$Pointer$.base| .cse35)) (.cse0 (not (= |main_~#s~0.base| .cse8))) (.cse13 (= (_ bv0 32) .cse36)) (.cse1 (= |main_~#s~0.offset| (_ bv0 32))) (.cse22 (not (= .cse8 .cse35))) (.cse3 (= (select .cse34 (_ bv8 32)) (_ bv0 32))) (.cse23 (not .cse2)) (.cse6 (not (= |main_~#s~0.base| .cse21))) (.cse10 (not (= (_ bv0 32) .cse21)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (select .cse7 (bvadd v_prenex_15 (_ bv8 32))) .cse8) .cse9 .cse10) (and .cse11 .cse0 .cse12 .cse13 .cse1 .cse3 .cse14 .cse6 .cse15 (= .cse8 (select .cse16 (bvadd v_prenex_16 (_ bv8 32)))) .cse17 .cse10) (and .cse18 .cse19 (= (select .cse20 (bvadd v_prenex_9 (_ bv8 32))) .cse8) .cse0 (= (select .cse20 (bvadd v_prenex_8 (_ bv8 32))) .cse21) .cse13 .cse1 .cse22 .cse3 .cse23 .cse6 .cse10) (let ((.cse25 (select .cse26 (bvadd v_prenex_19 (_ bv4 32))))) (let ((.cse24 (select |#memory_$Pointer$.base| .cse25))) (and (= (select .cse24 (bvadd v_prenex_18 (_ bv8 32))) .cse21) (not (= .cse8 .cse25)) .cse11 .cse13 (= (select .cse26 (bvadd v_prenex_19 (_ bv8 32))) .cse21) (= (select .cse24 (bvadd v_prenex_17 (_ bv8 32))) .cse8) (not (= .cse21 .cse25)) (not (= |main_~#s~0.base| .cse25)) .cse0 .cse1 .cse3 .cse6 .cse10))) (and .cse27 .cse11 .cse0 .cse1 (= .cse8 (select .cse28 (bvadd v_prenex_13 (_ bv8 32)))) .cse29 .cse3 .cse6 .cse30 .cse31 .cse32 .cse10) (let ((.cse33 (select .cse26 (bvadd dll_insert_~new_node~0.offset (_ bv4 32))))) (and (not (= .cse8 .cse33)) .cse11 (not (= |main_~#s~0.base| .cse33)) .cse0 .cse13 .cse1 .cse3 (= (select .cse26 (bvadd dll_insert_~new_node~0.offset (_ bv8 32))) .cse21) (= (select (select |#memory_$Pointer$.base| .cse33) (bvadd v_prenex_10 (_ bv8 32))) .cse8) (not (= .cse21 .cse33)) .cse6 .cse10)) (and (= (select .cse28 (bvadd v_prenex_11 (_ bv8 32))) .cse21) .cse11 (= .cse8 (select .cse28 (bvadd v_prenex_12 (_ bv8 32)))) .cse29 .cse31 .cse32 .cse27 .cse0 .cse1 .cse3 .cse6 .cse30 .cse10) (and .cse11 .cse13 .cse17 .cse0 .cse12 .cse1 .cse3 .cse14 .cse15 .cse6 (= .cse8 (select .cse16 (bvadd v_prenex_20 (_ bv8 32)))) (= (select .cse16 (bvadd v_prenex_21 (_ bv8 32))) .cse21) .cse10) (and (= (select .cse7 (bvadd v_subst_1 (_ bv8 32))) .cse21) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (select .cse7 (bvadd dll_insert_~last~0.offset (_ bv8 32))) .cse8) .cse9 .cse10) (and .cse18 .cse19 (= (select .cse20 (bvadd v_prenex_14 (_ bv8 32))) .cse8) .cse0 .cse13 .cse1 .cse22 .cse3 .cse23 .cse6 .cse10))))))))) [2018-11-23 11:15:12,580 WARN L180 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 174 DAG size of output: 91 [2018-11-23 11:15:12,731 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:12,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 105 [2018-11-23 11:15:12,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-11-23 11:15:12,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:13,203 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:13,208 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:13,210 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:13,218 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:13,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 59 [2018-11-23 11:15:13,234 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 11:15:13,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-11-23 11:15:13,326 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:13,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-11-23 11:15:13,338 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:13,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-11-23 11:15:13,391 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:13,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-11-23 11:15:13,476 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:13,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:15:14,083 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:14,086 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:14,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:14,100 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:14,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 98 [2018-11-23 11:15:14,150 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 40 [2018-11-23 11:15:14,154 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:15:14,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-11-23 11:15:14,279 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:14,327 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:14,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2018-11-23 11:15:14,335 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:14,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-23 11:15:14,363 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:14,369 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:14,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:14,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:14,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 94 [2018-11-23 11:15:14,817 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 55 [2018-11-23 11:15:14,832 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-23 11:15:14,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2018-11-23 11:15:14,964 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:15,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 33 [2018-11-23 11:15:15,030 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:15,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-11-23 11:15:15,056 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:15,063 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:15,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:15,394 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:15,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 89 [2018-11-23 11:15:15,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 26 [2018-11-23 11:15:15,430 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:15,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-11-23 11:15:15,497 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:15,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-11-23 11:15:15,532 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:15,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-23 11:15:15,556 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:15,563 INFO L267 ElimStorePlain]: Start of recursive call 19: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:15,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:15,634 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 13 variables, input treesize:699, output treesize:4 [2018-11-23 11:15:15,677 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:15,677 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_23, v_prenex_22, dll_insert_~new_node~0.offset, v_prenex_10, v_prenex_27, v_prenex_26, v_prenex_14, |#memory_$Pointer$.base|, |main_~#s~0.base|, v_prenex_15, v_prenex_25, v_prenex_24, v_prenex_13]. (or (let ((.cse3 (select (select v_prenex_23 v_prenex_22) (_ bv0 32)))) (let ((.cse2 (select v_prenex_23 .cse3))) (let ((.cse4 (select .cse2 (_ bv4 32)))) (let ((.cse1 (select v_prenex_23 .cse4))) (let ((.cse0 (select .cse1 (bvadd dll_insert_~new_node~0.offset (_ bv4 32))))) (and (not (= v_prenex_22 .cse0)) (= (select .cse1 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse2 (_ bv8 32))) (not (= .cse3 .cse0)) (= .cse3 main_~ptr~0.base) (not (= v_prenex_22 .cse4)) (= .cse3 (select .cse1 (bvadd dll_insert_~new_node~0.offset (_ bv8 32)))) (not (= v_prenex_22 .cse3)) (not (= .cse4 .cse0)) (not (= (_ bv0 32) .cse3)) (= (_ bv0 32) (select .cse1 (_ bv8 32))) (= (select (select v_prenex_23 .cse0) (bvadd v_prenex_10 (_ bv8 32))) .cse4))))))) (let ((.cse7 (select (select v_prenex_27 v_prenex_26) (_ bv0 32)))) (let ((.cse9 (select v_prenex_27 .cse7))) (let ((.cse6 (select .cse9 (_ bv4 32)))) (let ((.cse8 (select v_prenex_27 .cse6))) (let ((.cse5 (select .cse8 (_ bv8 32)))) (and (= (select (select v_prenex_27 .cse5) (bvadd v_prenex_14 (_ bv8 32))) .cse6) (not (= v_prenex_26 .cse5)) (= .cse7 main_~ptr~0.base) (= (select .cse8 (_ bv12 32)) .cse7) (= (select .cse8 (_ bv4 32)) (_ bv0 32)) (not (= (_ bv0 32) .cse7)) (not (= v_prenex_26 .cse6)) (not (= v_prenex_26 .cse7)) (not (= .cse6 .cse5)) (not (= .cse7 .cse5)) (= (_ bv0 32) (select .cse9 (_ bv8 32))))))))) (let ((.cse10 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)))) (let ((.cse14 (select |#memory_$Pointer$.base| .cse10))) (let ((.cse11 (select .cse14 (_ bv4 32)))) (let ((.cse13 (select |#memory_$Pointer$.base| .cse11))) (let ((.cse12 (select .cse13 (_ bv4 32)))) (and (= .cse10 main_~ptr~0.base) (not (= |main_~#s~0.base| .cse11)) (not (= .cse12 .cse11)) (= .cse10 (select .cse13 (_ bv8 32))) (= (_ bv0 32) (select .cse14 (_ bv8 32))) (= (select (select |#memory_$Pointer$.base| .cse12) (bvadd v_prenex_15 (_ bv8 32))) .cse11) (not (= .cse12 |main_~#s~0.base|)) (not (= |main_~#s~0.base| .cse10)) (not (= (_ bv0 32) .cse10)) (not (= .cse12 .cse10)))))))) (let ((.cse16 (select (select v_prenex_25 v_prenex_24) (_ bv0 32)))) (let ((.cse17 (select v_prenex_25 .cse16))) (let ((.cse19 (select .cse17 (_ bv4 32)))) (let ((.cse15 (select v_prenex_25 .cse19))) (let ((.cse18 (select .cse15 (_ bv0 32)))) (and (= (select .cse15 (_ bv4 32)) .cse16) (not (= v_prenex_24 .cse16)) (not (= .cse17 .cse15)) (= (select (select v_prenex_25 .cse18) (bvadd v_prenex_13 (_ bv8 32))) .cse19) (= (_ bv0 32) (select .cse17 (_ bv8 32))) (not (= .cse18 v_prenex_24)) (not (= (_ bv0 32) .cse16)) (= (_ bv0 32) (select .cse15 (_ bv8 32))) (not (= .cse18 .cse16)) (not (= .cse18 .cse19)) (= .cse16 main_~ptr~0.base)))))))) [2018-11-23 11:15:15,677 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= (_ bv0 32) main_~ptr~0.base)) [2018-11-23 11:15:15,882 INFO L256 TraceCheckUtils]: 0: Hoare triple {1937#true} call ULTIMATE.init(); {1937#true} is VALID [2018-11-23 11:15:15,883 INFO L273 TraceCheckUtils]: 1: Hoare triple {1937#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1937#true} is VALID [2018-11-23 11:15:15,883 INFO L273 TraceCheckUtils]: 2: Hoare triple {1937#true} assume true; {1937#true} is VALID [2018-11-23 11:15:15,883 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1937#true} {1937#true} #140#return; {1937#true} is VALID [2018-11-23 11:15:15,884 INFO L256 TraceCheckUtils]: 4: Hoare triple {1937#true} call #t~ret19 := main(); {1937#true} is VALID [2018-11-23 11:15:15,890 INFO L273 TraceCheckUtils]: 5: Hoare triple {1937#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1957#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:15:15,891 INFO L256 TraceCheckUtils]: 6: Hoare triple {1957#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {1961#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:15:15,892 INFO L273 TraceCheckUtils]: 7: Hoare triple {1961#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1961#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:15:15,893 INFO L273 TraceCheckUtils]: 8: Hoare triple {1961#(= |#valid| |old(#valid)|)} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1968#(and (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} is VALID [2018-11-23 11:15:15,893 INFO L273 TraceCheckUtils]: 9: Hoare triple {1968#(and (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1968#(and (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} is VALID [2018-11-23 11:15:15,912 INFO L273 TraceCheckUtils]: 10: Hoare triple {1968#(and (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1968#(and (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} is VALID [2018-11-23 11:15:15,912 INFO L273 TraceCheckUtils]: 11: Hoare triple {1968#(and (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1968#(and (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} is VALID [2018-11-23 11:15:15,914 INFO L273 TraceCheckUtils]: 12: Hoare triple {1968#(and (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1981#(and (= |#valid| (store |old(#valid)| dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)))} is VALID [2018-11-23 11:15:15,915 INFO L273 TraceCheckUtils]: 13: Hoare triple {1981#(and (= |#valid| (store |old(#valid)| dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1985#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (_ bv0 1) (select (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (not (= dll_create_~new_head~0.base (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)))} is VALID [2018-11-23 11:15:15,916 INFO L273 TraceCheckUtils]: 14: Hoare triple {1985#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (_ bv0 1) (select (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (not (= dll_create_~new_head~0.base (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1985#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (_ bv0 1) (select (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (not (= dll_create_~new_head~0.base (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)))} is VALID [2018-11-23 11:15:15,920 INFO L273 TraceCheckUtils]: 15: Hoare triple {1985#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (_ bv0 1) (select (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (not (= dll_create_~new_head~0.base (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1992#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (_ bv0 1) (select (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (not (= dll_create_~new_head~0.base (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) dll_create_~head~0.base) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))))} is VALID [2018-11-23 11:15:15,923 INFO L273 TraceCheckUtils]: 16: Hoare triple {1992#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (_ bv0 1) (select (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (not (= dll_create_~new_head~0.base (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) dll_create_~head~0.base) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))))} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {1996#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (exists ((dll_create_~head~0.offset (_ BitVec 32))) (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (bvadd dll_create_~head~0.offset (_ bv8 32))))) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~new_head~0.base) (_ bv0 1)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (_ bv0 1)) (not (= dll_create_~new_head~0.base (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))))} is VALID [2018-11-23 11:15:15,928 INFO L273 TraceCheckUtils]: 17: Hoare triple {1996#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (exists ((dll_create_~head~0.offset (_ BitVec 32))) (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (bvadd dll_create_~head~0.offset (_ bv8 32))))) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~new_head~0.base) (_ bv0 1)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (_ bv0 1)) (not (= dll_create_~new_head~0.base (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {2000#(and (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 32) dll_create_~head~0.offset) (not (= (_ bv0 32) dll_create_~head~0.base)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv0 1)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)))} is VALID [2018-11-23 11:15:15,930 INFO L273 TraceCheckUtils]: 18: Hoare triple {2000#(and (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 32) dll_create_~head~0.offset) (not (= (_ bv0 32) dll_create_~head~0.base)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv0 1)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)))} assume !~bvsgt32(~len, 0bv32); {2000#(and (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 32) dll_create_~head~0.offset) (not (= (_ bv0 32) dll_create_~head~0.base)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv0 1)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)))} is VALID [2018-11-23 11:15:15,933 INFO L273 TraceCheckUtils]: 19: Hoare triple {2000#(and (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 32) dll_create_~head~0.offset) (not (= (_ bv0 32) dll_create_~head~0.base)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv0 1)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2007#(and (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_create_#res.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= |dll_create_#res.offset| (_ bv0 32)) (not (= |dll_create_#res.base| (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} is VALID [2018-11-23 11:15:15,934 INFO L273 TraceCheckUtils]: 20: Hoare triple {2007#(and (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_create_#res.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= |dll_create_#res.offset| (_ bv0 32)) (not (= |dll_create_#res.base| (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} assume true; {2007#(and (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_create_#res.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= |dll_create_#res.offset| (_ bv0 32)) (not (= |dll_create_#res.base| (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} is VALID [2018-11-23 11:15:15,942 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2007#(and (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_create_#res.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= |dll_create_#res.offset| (_ bv0 32)) (not (= |dll_create_#res.base| (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} {1957#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} #132#return; {2014#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32)) |main_#t~ret13.base|)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| |main_#t~ret13.base|) (_ bv1 1)) (_ bv0 1)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32)))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) |main_#t~ret13.base|)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= |main_~#s~0.base| |main_#t~ret13.base|)) (not (= (_ bv0 32) |main_#t~ret13.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv8 32))) (= |main_#t~ret13.offset| (_ bv0 32)))} is VALID [2018-11-23 11:15:15,945 INFO L273 TraceCheckUtils]: 22: Hoare triple {2014#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32)) |main_#t~ret13.base|)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| |main_#t~ret13.base|) (_ bv1 1)) (_ bv0 1)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32)))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) |main_#t~ret13.base|)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= |main_~#s~0.base| |main_#t~ret13.base|)) (not (= (_ bv0 32) |main_#t~ret13.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv8 32))) (= |main_#t~ret13.offset| (_ bv0 32)))} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset; {2018#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv1 1)) (_ bv0 1)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 11:15:15,947 INFO L256 TraceCheckUtils]: 23: Hoare triple {2018#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv1 1)) (_ bv0 1)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, ~bvsdiv32(~len~0, 2bv32)); {2022#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:15:15,948 INFO L273 TraceCheckUtils]: 24: Hoare triple {2022#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2026#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:15:15,949 INFO L256 TraceCheckUtils]: 25: Hoare triple {2026#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {2022#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:15:15,951 INFO L273 TraceCheckUtils]: 26: Hoare triple {2022#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2033#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:15:15,952 INFO L273 TraceCheckUtils]: 27: Hoare triple {2033#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2033#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:15:15,957 INFO L273 TraceCheckUtils]: 28: Hoare triple {2033#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2040#(and (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.base| |node_create_#res.base|) (_ bv0 32)))) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.offset| |node_create_#res.base|) (_ bv0 32)))) |#memory_$Pointer$.offset|))} is VALID [2018-11-23 11:15:15,958 INFO L273 TraceCheckUtils]: 29: Hoare triple {2040#(and (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.base| |node_create_#res.base|) (_ bv0 32)))) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.offset| |node_create_#res.base|) (_ bv0 32)))) |#memory_$Pointer$.offset|))} assume true; {2040#(and (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.base| |node_create_#res.base|) (_ bv0 32)))) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.offset| |node_create_#res.base|) (_ bv0 32)))) |#memory_$Pointer$.offset|))} is VALID [2018-11-23 11:15:15,960 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2040#(and (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.base| |node_create_#res.base|) (_ bv0 32)))) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.offset| |node_create_#res.base|) (_ bv0 32)))) |#memory_$Pointer$.offset|))} {2026#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} #144#return; {2047#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= (_ bv0 1) (select |old(#valid)| |dll_insert_#t~ret6.base|)) (= (store |old(#memory_$Pointer$.base)| |dll_insert_#t~ret6.base| (store (store (store (select |old(#memory_$Pointer$.base)| |dll_insert_#t~ret6.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_insert_#t~ret6.base|) (_ bv0 32)))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |dll_insert_#t~ret6.base| (store (store (store (select |old(#memory_$Pointer$.offset)| |dll_insert_#t~ret6.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_insert_#t~ret6.base|) (_ bv0 32)))) |#memory_$Pointer$.offset|) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} is VALID [2018-11-23 11:15:15,967 INFO L273 TraceCheckUtils]: 31: Hoare triple {2047#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= (_ bv0 1) (select |old(#valid)| |dll_insert_#t~ret6.base|)) (= (store |old(#memory_$Pointer$.base)| |dll_insert_#t~ret6.base| (store (store (store (select |old(#memory_$Pointer$.base)| |dll_insert_#t~ret6.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_insert_#t~ret6.base|) (_ bv0 32)))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |dll_insert_#t~ret6.base| (store (store (store (select |old(#memory_$Pointer$.offset)| |dll_insert_#t~ret6.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_insert_#t~ret6.base|) (_ bv0 32)))) |#memory_$Pointer$.offset|) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {2051#(and (= dll_insert_~last~0.base (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (exists ((v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~last~0.offset)) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_insert_~new_node~0.base) (_ bv0 32)))) |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:15:15,968 INFO L273 TraceCheckUtils]: 32: Hoare triple {2051#(and (= dll_insert_~last~0.base (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (exists ((v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~last~0.offset)) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_insert_~new_node~0.base) (_ bv0 32)))) |#memory_$Pointer$.base|))} assume !!~bvsgt32(~index, 0bv32);~snd_to_last~0.base, ~snd_to_last~0.offset := ~last~0.base, ~last~0.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~last~0.base, ~bvadd32(4bv32, ~last~0.offset), 4bv32);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;#t~post9 := ~index;~index := ~bvsub32(#t~post9, 1bv32);havoc #t~post9; {2055#(and (exists ((v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~snd_to_last~0.offset)) (= dll_insert_~snd_to_last~0.base (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (= dll_insert_~last~0.base (select (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (bvadd dll_insert_~snd_to_last~0.offset (_ bv4 32)))) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_insert_~new_node~0.base) (_ bv0 32)))) |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:15:15,969 INFO L273 TraceCheckUtils]: 33: Hoare triple {2055#(and (exists ((v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~snd_to_last~0.offset)) (= dll_insert_~snd_to_last~0.base (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (= dll_insert_~last~0.base (select (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (bvadd dll_insert_~snd_to_last~0.offset (_ bv4 32)))) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_insert_~new_node~0.base) (_ bv0 32)))) |#memory_$Pointer$.base|))} assume !~bvsgt32(~index, 0bv32); {2055#(and (exists ((v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~snd_to_last~0.offset)) (= dll_insert_~snd_to_last~0.base (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (= dll_insert_~last~0.base (select (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (bvadd dll_insert_~snd_to_last~0.offset (_ bv4 32)))) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_insert_~new_node~0.base) (_ bv0 32)))) |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:15:15,978 INFO L273 TraceCheckUtils]: 34: Hoare triple {2055#(and (exists ((v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~snd_to_last~0.offset)) (= dll_insert_~snd_to_last~0.base (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (= dll_insert_~last~0.base (select (select |#memory_$Pointer$.base| dll_insert_~snd_to_last~0.base) (bvadd dll_insert_~snd_to_last~0.offset (_ bv4 32)))) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_insert_~new_node~0.base) (_ bv0 32)))) |#memory_$Pointer$.base|))} assume ~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, ~bvadd32(4bv32, ~snd_to_last~0.offset), 4bv32);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, ~new_node~0.base, ~bvadd32(8bv32, ~new_node~0.offset), 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32); {2062#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (dll_insert_~new_node~0.offset (_ BitVec 32))) (and (= (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))) dll_insert_~last~0.base) (= (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) dll_insert_~last~0.base)) |#memory_$Pointer$.base|))))} is VALID [2018-11-23 11:15:15,991 INFO L273 TraceCheckUtils]: 35: Hoare triple {2062#(and (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (dll_insert_~new_node~0.offset (_ BitVec 32))) (and (= (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))) dll_insert_~last~0.base) (= (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) dll_insert_~last~0.base)) |#memory_$Pointer$.base|))))} assume ~last~0.base != 0bv32 || ~last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~last~0.base, ~bvadd32(8bv32, ~last~0.offset), 4bv32); {2066#(exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (dll_insert_~new_node~0.base (_ BitVec 32)) (dll_insert_~last~0.offset (_ BitVec 32)) (dll_insert_~new_node~0.offset (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))) (store (select (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)))) (bvadd dll_insert_~last~0.offset (_ bv8 32)) dll_insert_~new_node~0.base))) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base))))} is VALID [2018-11-23 11:15:15,992 INFO L273 TraceCheckUtils]: 36: Hoare triple {2066#(exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (dll_insert_~new_node~0.base (_ BitVec 32)) (dll_insert_~last~0.offset (_ BitVec 32)) (dll_insert_~new_node~0.offset (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))) (store (select (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)))) (bvadd dll_insert_~last~0.offset (_ bv8 32)) dll_insert_~new_node~0.base))) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base))))} assume true; {2066#(exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (dll_insert_~new_node~0.base (_ BitVec 32)) (dll_insert_~last~0.offset (_ BitVec 32)) (dll_insert_~new_node~0.offset (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))) (store (select (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)))) (bvadd dll_insert_~last~0.offset (_ bv8 32)) dll_insert_~new_node~0.base))) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base))))} is VALID [2018-11-23 11:15:16,049 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2066#(exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (dll_insert_~new_node~0.base (_ BitVec 32)) (dll_insert_~last~0.offset (_ BitVec 32)) (dll_insert_~new_node~0.offset (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))) (store (select (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_4)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_2)) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)))) (bvadd dll_insert_~last~0.offset (_ bv8 32)) dll_insert_~new_node~0.base))) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base))))} {2018#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv1 1)) (_ bv0 1)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #134#return; {2073#(or (and (exists ((v_prenex_10 (_ BitVec 32)) (dll_insert_~new_node~0.offset (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd dll_insert_~new_node~0.offset (_ bv4 32))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd dll_insert_~new_node~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)))) (bvadd v_prenex_10 (_ bv8 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd dll_insert_~new_node~0.offset (_ bv8 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd dll_insert_~new_node~0.offset (_ bv4 32))))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))) (and (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32)))) (exists ((v_prenex_15 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (bvadd v_prenex_15 (_ bv8 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32))) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_prenex_13 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv0 32))) (bvadd v_prenex_13 (_ bv8 32))))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv0 32)))) (not (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv12 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))))) (exists ((v_prenex_14 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32))) (bvadd v_prenex_14 (_ bv8 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))))} is VALID [2018-11-23 11:15:16,055 INFO L273 TraceCheckUtils]: 38: Hoare triple {2073#(or (and (exists ((v_prenex_10 (_ BitVec 32)) (dll_insert_~new_node~0.offset (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd dll_insert_~new_node~0.offset (_ bv4 32))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd dll_insert_~new_node~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)))) (bvadd v_prenex_10 (_ bv8 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd dll_insert_~new_node~0.offset (_ bv8 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd dll_insert_~new_node~0.offset (_ bv4 32))))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))) (and (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32)))) (exists ((v_prenex_15 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (bvadd v_prenex_15 (_ bv8 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32))) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_prenex_13 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv0 32))) (bvadd v_prenex_13 (_ bv8 32))))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv0 32)))) (not (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv12 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))))) (exists ((v_prenex_14 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32))) (bvadd v_prenex_14 (_ bv8 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))))} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0bv32; {2077#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-23 11:15:16,055 INFO L273 TraceCheckUtils]: 39: Hoare triple {2077#(not (= (_ bv0 32) main_~ptr~0.base))} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {1938#false} is VALID [2018-11-23 11:15:16,056 INFO L273 TraceCheckUtils]: 40: Hoare triple {1938#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1938#false} is VALID [2018-11-23 11:15:16,056 INFO L273 TraceCheckUtils]: 41: Hoare triple {1938#false} assume !false; {1938#false} is VALID [2018-11-23 11:15:16,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:15:16,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:15:16,351 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-23 11:15:16,481 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-23 11:15:16,827 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-23 11:15:17,022 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-23 11:15:18,887 WARN L180 SmtUtils]: Spent 1.85 s on a formula simplification that was a NOOP. DAG size: 92 [2018-11-23 11:15:20,065 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 66 [2018-11-23 11:15:22,454 WARN L180 SmtUtils]: Spent 2.39 s on a formula simplification that was a NOOP. DAG size: 82 [2018-11-23 11:15:24,256 WARN L180 SmtUtils]: Spent 1.80 s on a formula simplification that was a NOOP. DAG size: 76 [2018-11-23 11:15:26,372 WARN L833 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2018-11-23 11:15:28,454 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:28,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:28,982 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:29,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:29,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:29,250 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:251, output treesize:683 [2018-11-23 11:15:31,271 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:31,272 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_$Pointer$.base_76|, |v_#memory_$Pointer$.offset_72|, v_dll_insert_~new_node~0.base_12, v_dll_insert_~new_node~0.offset_12, v_dll_insert_~last~0.offset_15]. (or (not (= |v_#memory_$Pointer$.offset_72| (store |#memory_$Pointer$.offset| v_dll_insert_~new_node~0.base_12 (store (store (store (select |#memory_$Pointer$.offset| v_dll_insert_~new_node~0.base_12) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |v_#memory_$Pointer$.offset_72| v_dll_insert_~new_node~0.base_12) (_ bv0 32)))))) (not (= |v_#memory_$Pointer$.base_76| (store |#memory_$Pointer$.base| v_dll_insert_~new_node~0.base_12 (store (store (store (select |#memory_$Pointer$.base| v_dll_insert_~new_node~0.base_12) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) (select (select |v_#memory_$Pointer$.base_76| v_dll_insert_~new_node~0.base_12) (_ bv0 32)))))) (not (= (_ bv0 1) (select |#valid| v_dll_insert_~new_node~0.base_12))) (not (= (_ bv0 32) (select (select (let ((.cse3 (select (select |v_#memory_$Pointer$.base_76| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse4 (select |v_#memory_$Pointer$.base_76| .cse3)) (.cse5 (bvadd (select (select |v_#memory_$Pointer$.offset_72| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) (let ((.cse1 (select .cse4 .cse5))) (let ((.cse0 (let ((.cse2 (store |v_#memory_$Pointer$.base_76| .cse3 (store .cse4 .cse5 v_dll_insert_~new_node~0.base_12)))) (store .cse2 v_dll_insert_~new_node~0.base_12 (store (store (select .cse2 v_dll_insert_~new_node~0.base_12) (bvadd v_dll_insert_~new_node~0.offset_12 (_ bv8 32)) .cse3) (bvadd v_dll_insert_~new_node~0.offset_12 (_ bv4 32)) .cse1))))) (store .cse0 .cse1 (store (select .cse0 .cse1) (bvadd v_dll_insert_~last~0.offset_15 (_ bv8 32)) v_dll_insert_~new_node~0.base_12)))))) |main_~#s~0.base|) |main_~#s~0.offset|)))) [2018-11-23 11:15:31,272 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_dll_insert_~new_node~0.base_12, v_DerPreprocessor_6, v_DerPreprocessor_8, v_dll_insert_~new_node~0.offset_12, v_dll_insert_~last~0.offset_15]. (or (not (= (_ bv0 1) (select |#valid| v_dll_insert_~new_node~0.base_12))) (not (= (_ bv0 32) (select (select (let ((.cse4 (store |#memory_$Pointer$.base| v_dll_insert_~new_node~0.base_12 (store (store (store (select |#memory_$Pointer$.base| v_dll_insert_~new_node~0.base_12) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_6)))) (let ((.cse3 (select (select .cse4 |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse5 (select .cse4 .cse3)) (.cse6 (bvadd (select (select (store |#memory_$Pointer$.offset| v_dll_insert_~new_node~0.base_12 (store (store (store (select |#memory_$Pointer$.offset| v_dll_insert_~new_node~0.base_12) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)) (_ bv0 32) v_DerPreprocessor_8)) |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) (let ((.cse1 (select .cse5 .cse6))) (let ((.cse0 (let ((.cse2 (store .cse4 .cse3 (store .cse5 .cse6 v_dll_insert_~new_node~0.base_12)))) (store .cse2 v_dll_insert_~new_node~0.base_12 (store (store (select .cse2 v_dll_insert_~new_node~0.base_12) (bvadd v_dll_insert_~new_node~0.offset_12 (_ bv8 32)) .cse3) (bvadd v_dll_insert_~new_node~0.offset_12 (_ bv4 32)) .cse1))))) (store .cse0 .cse1 (store (select .cse0 .cse1) (bvadd v_dll_insert_~last~0.offset_15 (_ bv8 32)) v_dll_insert_~new_node~0.base_12))))))) |main_~#s~0.base|) |main_~#s~0.offset|)))) [2018-11-23 11:15:37,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:15:37,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:15:37,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:37,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:37,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 11:15:37,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:37,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:37,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 11:15:37,976 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:37,976 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_65|]. (= |#valid| (store |v_#valid_65| |main_~#s~0.base| (_ bv1 1))) [2018-11-23 11:15:37,976 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| |main_~#s~0.base|) (_ bv1 1)) [2018-11-23 11:15:40,238 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |c_old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) is different from true [2018-11-23 11:15:49,438 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 11:15:49,512 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:49,513 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:49,536 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:49,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-11-23 11:15:49,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2018-11-23 11:15:49,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:49,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:49,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:49,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:33 [2018-11-23 11:15:49,614 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:49,614 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_12|, |dll_create_#t~malloc3.base|]. (let ((.cse0 (store |v_#valid_BEFORE_CALL_12| |dll_create_#t~malloc3.base| (_ bv1 1)))) (and (= (_ bv0 1) (select |v_#valid_BEFORE_CALL_12| |dll_create_#t~malloc3.base|)) (= (select .cse0 |main_#t~ret13.base|) (_ bv0 1)) (= |#valid| (store .cse0 |main_#t~ret13.base| (_ bv1 1))) (not (= (_ bv0 32) |main_#t~ret13.base|)) (= (bvadd (select |v_#valid_BEFORE_CALL_12| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)))) [2018-11-23 11:15:49,614 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|dll_create_#t~malloc3.base|]. (and (not (= |main_~#s~0.base| |dll_create_#t~malloc3.base|)) (not (= |dll_create_#t~malloc3.base| |main_#t~ret13.base|)) (= (select |#valid| |main_#t~ret13.base|) (_ bv1 1)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= |main_~#s~0.base| |main_#t~ret13.base|)) (not (= (_ bv0 32) |main_#t~ret13.base|)) (= (_ bv1 1) (select |#valid| |dll_create_#t~malloc3.base|))) [2018-11-23 11:15:57,498 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:16:00,002 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-23 11:16:02,595 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-23 11:16:05,285 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-23 11:16:05,355 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:05,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:05,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:05,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:230 [2018-11-23 11:16:15,834 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 11:16:17,913 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (dll_insert_~last~0.base (_ BitVec 32)) (dll_insert_~snd_to_last~0.offset (_ BitVec 32)) (dll_insert_~new_node~0.base (_ BitVec 32)) (dll_insert_~last~0.offset (_ BitVec 32)) (dll_insert_~new_node~0.offset (_ BitVec 32))) (and (not (= dll_insert_~new_node~0.base (_ bv0 32))) (= (_ bv0 1) (select |c_old(#valid)| dll_insert_~new_node~0.base)) (= (let ((.cse0 (let ((.cse3 (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) (bvadd node_create_~temp~0.offset (_ bv8 32)) (_ bv0 32)) node_create_~temp~0.offset v_DerPreprocessor_10)))) (let ((.cse2 (select (select .cse3 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|))) (let ((.cse1 (store .cse3 .cse2 (store (select .cse3 .cse2) (bvadd dll_insert_~snd_to_last~0.offset (_ bv4 32)) dll_insert_~new_node~0.base)))) (store .cse1 dll_insert_~new_node~0.base (store (store (select .cse1 dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) .cse2) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) dll_insert_~last~0.base))))))) (store .cse0 dll_insert_~last~0.base (store (select .cse0 dll_insert_~last~0.base) (bvadd dll_insert_~last~0.offset (_ bv8 32)) dll_insert_~new_node~0.base))) |c_#memory_$Pointer$.base|))) is different from true [2018-11-23 11:16:23,609 WARN L180 SmtUtils]: Spent 5.22 s on a formula simplification. DAG size of input: 107 DAG size of output: 65 [2018-11-23 11:16:23,687 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:23,703 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:23,715 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:23,716 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:16:23,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-23 11:16:23,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:24,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:24,275 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:24,602 INFO L303 Elim1Store]: Index analysis took 418 ms [2018-11-23 11:16:24,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 300 treesize of output 169 [2018-11-23 11:16:24,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-11-23 11:16:24,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:24,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 31 [2018-11-23 11:16:24,714 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:24,731 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:24,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:24,809 INFO L303 Elim1Store]: Index analysis took 121 ms [2018-11-23 11:16:24,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-11-23 11:16:24,812 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:24,952 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:25,052 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:25,722 INFO L303 Elim1Store]: Index analysis took 374 ms [2018-11-23 11:16:25,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 130 [2018-11-23 11:16:26,331 WARN L180 SmtUtils]: Spent 591.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-23 11:16:26,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 11:16:26,353 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:27,290 INFO L303 Elim1Store]: Index analysis took 562 ms [2018-11-23 11:16:27,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 108 [2018-11-23 11:16:27,330 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:27,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:27,366 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:27,427 INFO L303 Elim1Store]: Index analysis took 112 ms [2018-11-23 11:16:27,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 83 [2018-11-23 11:16:27,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:27,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:27,858 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:27,908 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:27,922 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:28,860 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:29,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:29,070 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:29,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:29,164 INFO L303 Elim1Store]: Index analysis took 1490 ms [2018-11-23 11:16:29,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 130 [2018-11-23 11:16:29,522 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-23 11:16:31,051 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:31,056 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:31,061 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:31,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:31,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 96 [2018-11-23 11:16:31,131 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:31,848 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:31,858 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:31,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:31,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:31,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:31,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:31,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:31,953 INFO L303 Elim1Store]: Index analysis took 122 ms [2018-11-23 11:16:31,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 110 [2018-11-23 11:16:31,962 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:33,167 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:33,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:33,177 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:33,183 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:33,183 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:16:33,214 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:33,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 88 [2018-11-23 11:16:33,257 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:35,089 INFO L267 ElimStorePlain]: Start of recursive call 10: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-23 11:16:35,874 INFO L303 Elim1Store]: Index analysis took 143 ms [2018-11-23 11:16:35,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 138 [2018-11-23 11:16:36,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 126 [2018-11-23 11:16:36,077 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:37,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 121 [2018-11-23 11:16:37,067 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-23 11:16:38,044 INFO L267 ElimStorePlain]: Start of recursive call 15: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:16:38,208 INFO L303 Elim1Store]: Index analysis took 147 ms [2018-11-23 11:16:38,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 127 [2018-11-23 11:16:38,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 108 [2018-11-23 11:16:38,471 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:16,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 107 [2018-11-23 11:17:16,547 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts.