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/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:15:47,112 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:15:47,114 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:15:47,127 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:15:47,127 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:15:47,128 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:15:47,129 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:15:47,131 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:15:47,133 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:15:47,134 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:15:47,134 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:15:47,135 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:15:47,136 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:15:47,136 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:15:47,138 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:15:47,138 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:15:47,139 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:15:47,141 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:15:47,143 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:15:47,145 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:15:47,146 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:15:47,147 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:15:47,150 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:15:47,150 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:15:47,150 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:15:47,151 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:15:47,152 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:15:47,153 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:15:47,154 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:15:47,155 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:15:47,155 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:15:47,156 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:15:47,156 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:15:47,156 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:15:47,157 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:15:47,158 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:15:47,159 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:15:47,175 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:15:47,175 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:15:47,176 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:15:47,176 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:15:47,177 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:15:47,177 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:15:47,177 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:15:47,177 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:15:47,177 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:15:47,178 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:15:47,178 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:15:47,178 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:15:47,178 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:15:47,178 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:15:47,179 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:15:47,179 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:15:47,179 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:15:47,179 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:15:47,179 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:15:47,179 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:15:47,180 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:15:47,180 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:15:47,180 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:15:47,180 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:15:47,180 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:15:47,181 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:15:47,181 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:15:47,181 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:15:47,181 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:15:47,181 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:15:47,182 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:15:47,182 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:15:47,182 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:15:47,229 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:15:47,242 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:15:47,246 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:15:47,248 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:15:47,248 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:15:47,249 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:15:47,310 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7a95d7c0/0d684673c4954627a00ff1f470f6503d/FLAG13124ccb1 [2018-11-23 11:15:47,928 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:15:47,929 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:15:47,947 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7a95d7c0/0d684673c4954627a00ff1f470f6503d/FLAG13124ccb1 [2018-11-23 11:15:48,147 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7a95d7c0/0d684673c4954627a00ff1f470f6503d [2018-11-23 11:15:48,161 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:15:48,163 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:15:48,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:15:48,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:15:48,172 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:15:48,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:15:48" (1/1) ... [2018-11-23 11:15:48,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f2cfef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:48, skipping insertion in model container [2018-11-23 11:15:48,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:15:48" (1/1) ... [2018-11-23 11:15:48,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:15:48,250 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:15:48,684 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:15:48,708 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:15:48,815 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:15:48,969 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:15:48,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:48 WrapperNode [2018-11-23 11:15:48,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:15:48,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:15:48,971 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:15:48,971 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:15:48,981 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:15:48" (1/1) ... [2018-11-23 11:15:49,012 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:15:48" (1/1) ... [2018-11-23 11:15:49,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:15:49,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:15:49,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:15:49,026 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:15:49,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:48" (1/1) ... [2018-11-23 11:15:49,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:48" (1/1) ... [2018-11-23 11:15:49,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:48" (1/1) ... [2018-11-23 11:15:49,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:48" (1/1) ... [2018-11-23 11:15:49,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:48" (1/1) ... [2018-11-23 11:15:49,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:48" (1/1) ... [2018-11-23 11:15:49,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:48" (1/1) ... [2018-11-23 11:15:49,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:15:49,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:15:49,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:15:49,102 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:15:49,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:48" (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:15:49,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:15:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:15:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:15:49,161 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:15:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 11:15:49,161 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 11:15:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:15:49,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:15:49,162 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:15:49,162 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:15:49,162 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2018-11-23 11:15:49,162 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2018-11-23 11:15:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:15:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:15:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-11-23 11:15:49,163 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-11-23 11:15:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:15:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:15:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-11-23 11:15:49,164 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-11-23 11:15:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2018-11-23 11:15:49,164 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2018-11-23 11:15:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:15:49,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:15:50,294 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:15:50,295 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 11:15:50,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:15:50 BoogieIcfgContainer [2018-11-23 11:15:50,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:15:50,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:15:50,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:15:50,300 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:15:50,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:15:48" (1/3) ... [2018-11-23 11:15:50,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327bc8d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:15:50, skipping insertion in model container [2018-11-23 11:15:50,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:48" (2/3) ... [2018-11-23 11:15:50,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327bc8d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:15:50, skipping insertion in model container [2018-11-23 11:15:50,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:15:50" (3/3) ... [2018-11-23 11:15:50,304 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:15:50,315 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:15:50,324 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:15:50,342 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:15:50,375 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:15:50,375 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:15:50,376 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:15:50,376 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:15:50,376 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:15:50,376 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:15:50,377 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:15:50,377 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:15:50,377 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:15:50,399 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-11-23 11:15:50,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:15:50,408 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:50,409 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:15:50,411 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:50,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:50,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1745188395, now seen corresponding path program 1 times [2018-11-23 11:15:50,423 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:50,424 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:15:50,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:50,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:50,965 INFO L256 TraceCheckUtils]: 0: Hoare triple {60#true} call ULTIMATE.init(); {60#true} is VALID [2018-11-23 11:15:50,969 INFO L273 TraceCheckUtils]: 1: Hoare triple {60#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {60#true} is VALID [2018-11-23 11:15:50,970 INFO L273 TraceCheckUtils]: 2: Hoare triple {60#true} assume true; {60#true} is VALID [2018-11-23 11:15:50,970 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {60#true} {60#true} #145#return; {60#true} is VALID [2018-11-23 11:15:50,971 INFO L256 TraceCheckUtils]: 4: Hoare triple {60#true} call #t~ret17 := main(); {60#true} is VALID [2018-11-23 11:15:50,974 INFO L273 TraceCheckUtils]: 5: Hoare triple {60#true} ~len~0 := 2bv32;~data~0 := 1bv32; {80#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:50,974 INFO L256 TraceCheckUtils]: 6: Hoare triple {80#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {60#true} is VALID [2018-11-23 11:15:50,992 INFO L273 TraceCheckUtils]: 7: Hoare triple {60#true} ~len := #in~len;~data := #in~data; {87#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-23 11:15:50,993 INFO L256 TraceCheckUtils]: 8: Hoare triple {87#(= |sll_circular_create_#in~len| sll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {60#true} is VALID [2018-11-23 11:15:50,993 INFO L273 TraceCheckUtils]: 9: Hoare triple {60#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {60#true} is VALID [2018-11-23 11:15:50,993 INFO L273 TraceCheckUtils]: 10: Hoare triple {60#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {60#true} is VALID [2018-11-23 11:15:50,994 INFO L273 TraceCheckUtils]: 11: Hoare triple {60#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {60#true} is VALID [2018-11-23 11:15:50,994 INFO L273 TraceCheckUtils]: 12: Hoare triple {60#true} assume true; {60#true} is VALID [2018-11-23 11:15:51,012 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {60#true} {87#(= |sll_circular_create_#in~len| sll_circular_create_~len)} #141#return; {87#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-23 11:15:51,027 INFO L273 TraceCheckUtils]: 14: Hoare triple {87#(= |sll_circular_create_#in~len| sll_circular_create_~len)} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {87#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-23 11:15:51,042 INFO L273 TraceCheckUtils]: 15: Hoare triple {87#(= |sll_circular_create_#in~len| sll_circular_create_~len)} assume !~bvsgt32(~len, 1bv32); {112#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-23 11:15:51,053 INFO L273 TraceCheckUtils]: 16: Hoare triple {112#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {112#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-23 11:15:51,054 INFO L273 TraceCheckUtils]: 17: Hoare triple {112#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} assume true; {112#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-23 11:15:51,056 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {112#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} {80#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #133#return; {61#false} is VALID [2018-11-23 11:15:51,057 INFO L273 TraceCheckUtils]: 19: Hoare triple {61#false} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {61#false} is VALID [2018-11-23 11:15:51,057 INFO L273 TraceCheckUtils]: 20: Hoare triple {61#false} assume !~bvsgt32(~i~0, 4294967295bv32); {61#false} is VALID [2018-11-23 11:15:51,058 INFO L273 TraceCheckUtils]: 21: Hoare triple {61#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {61#false} is VALID [2018-11-23 11:15:51,058 INFO L273 TraceCheckUtils]: 22: Hoare triple {61#false} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {61#false} is VALID [2018-11-23 11:15:51,059 INFO L256 TraceCheckUtils]: 23: Hoare triple {61#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {61#false} is VALID [2018-11-23 11:15:51,059 INFO L273 TraceCheckUtils]: 24: Hoare triple {61#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {61#false} is VALID [2018-11-23 11:15:51,060 INFO L273 TraceCheckUtils]: 25: Hoare triple {61#false} assume !~bvsgt32(~index, 0bv32); {61#false} is VALID [2018-11-23 11:15:51,060 INFO L273 TraceCheckUtils]: 26: Hoare triple {61#false} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {61#false} is VALID [2018-11-23 11:15:51,060 INFO L273 TraceCheckUtils]: 27: Hoare triple {61#false} assume true; {61#false} is VALID [2018-11-23 11:15:51,060 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {61#false} {61#false} #137#return; {61#false} is VALID [2018-11-23 11:15:51,061 INFO L273 TraceCheckUtils]: 29: Hoare triple {61#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {61#false} is VALID [2018-11-23 11:15:51,061 INFO L273 TraceCheckUtils]: 30: Hoare triple {61#false} assume !false; {61#false} is VALID [2018-11-23 11:15:51,067 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:15:51,068 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:15:51,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:15:51,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:15:51,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 11:15:51,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:51,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:15:51,215 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:15:51,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:15:51,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:15:51,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:15:51,231 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 5 states. [2018-11-23 11:15:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:52,922 INFO L93 Difference]: Finished difference Result 99 states and 131 transitions. [2018-11-23 11:15:52,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:15:52,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 11:15:52,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:52,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:15:52,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2018-11-23 11:15:52,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:15:52,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2018-11-23 11:15:52,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 131 transitions. [2018-11-23 11:15:53,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:53,297 INFO L225 Difference]: With dead ends: 99 [2018-11-23 11:15:53,298 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:15:53,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:15:53,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:15:53,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-23 11:15:53,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:53,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 43 states. [2018-11-23 11:15:53,380 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 43 states. [2018-11-23 11:15:53,381 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 43 states. [2018-11-23 11:15:53,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:53,388 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-23 11:15:53,388 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 11:15:53,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:53,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:53,390 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 45 states. [2018-11-23 11:15:53,390 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 45 states. [2018-11-23 11:15:53,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:53,396 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-23 11:15:53,396 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 11:15:53,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:53,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:53,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:53,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:53,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:15:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-23 11:15:53,404 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 31 [2018-11-23 11:15:53,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:53,405 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-23 11:15:53,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:15:53,405 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 11:15:53,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:15:53,407 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:53,407 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] [2018-11-23 11:15:53,408 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:53,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:53,408 INFO L82 PathProgramCache]: Analyzing trace with hash -378425709, now seen corresponding path program 1 times [2018-11-23 11:15:53,409 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:53,409 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:15:53,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:53,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:53,656 INFO L256 TraceCheckUtils]: 0: Hoare triple {450#true} call ULTIMATE.init(); {450#true} is VALID [2018-11-23 11:15:53,656 INFO L273 TraceCheckUtils]: 1: Hoare triple {450#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {450#true} is VALID [2018-11-23 11:15:53,657 INFO L273 TraceCheckUtils]: 2: Hoare triple {450#true} assume true; {450#true} is VALID [2018-11-23 11:15:53,657 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {450#true} {450#true} #145#return; {450#true} is VALID [2018-11-23 11:15:53,658 INFO L256 TraceCheckUtils]: 4: Hoare triple {450#true} call #t~ret17 := main(); {450#true} is VALID [2018-11-23 11:15:53,659 INFO L273 TraceCheckUtils]: 5: Hoare triple {450#true} ~len~0 := 2bv32;~data~0 := 1bv32; {470#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:53,659 INFO L256 TraceCheckUtils]: 6: Hoare triple {470#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {450#true} is VALID [2018-11-23 11:15:53,659 INFO L273 TraceCheckUtils]: 7: Hoare triple {450#true} ~len := #in~len;~data := #in~data; {450#true} is VALID [2018-11-23 11:15:53,659 INFO L256 TraceCheckUtils]: 8: Hoare triple {450#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {450#true} is VALID [2018-11-23 11:15:53,660 INFO L273 TraceCheckUtils]: 9: Hoare triple {450#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {450#true} is VALID [2018-11-23 11:15:53,660 INFO L273 TraceCheckUtils]: 10: Hoare triple {450#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {450#true} is VALID [2018-11-23 11:15:53,660 INFO L273 TraceCheckUtils]: 11: Hoare triple {450#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {450#true} is VALID [2018-11-23 11:15:53,661 INFO L273 TraceCheckUtils]: 12: Hoare triple {450#true} assume true; {450#true} is VALID [2018-11-23 11:15:53,661 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {450#true} {450#true} #141#return; {450#true} is VALID [2018-11-23 11:15:53,662 INFO L273 TraceCheckUtils]: 14: Hoare triple {450#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {450#true} is VALID [2018-11-23 11:15:53,662 INFO L273 TraceCheckUtils]: 15: Hoare triple {450#true} assume !!~bvsgt32(~len, 1bv32); {450#true} is VALID [2018-11-23 11:15:53,662 INFO L256 TraceCheckUtils]: 16: Hoare triple {450#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {450#true} is VALID [2018-11-23 11:15:53,663 INFO L273 TraceCheckUtils]: 17: Hoare triple {450#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {450#true} is VALID [2018-11-23 11:15:53,663 INFO L273 TraceCheckUtils]: 18: Hoare triple {450#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {450#true} is VALID [2018-11-23 11:15:53,663 INFO L273 TraceCheckUtils]: 19: Hoare triple {450#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {450#true} is VALID [2018-11-23 11:15:53,664 INFO L273 TraceCheckUtils]: 20: Hoare triple {450#true} assume true; {450#true} is VALID [2018-11-23 11:15:53,664 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {450#true} {450#true} #143#return; {450#true} is VALID [2018-11-23 11:15:53,664 INFO L273 TraceCheckUtils]: 22: Hoare triple {450#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {450#true} is VALID [2018-11-23 11:15:53,665 INFO L273 TraceCheckUtils]: 23: Hoare triple {450#true} assume !~bvsgt32(~len, 1bv32); {450#true} is VALID [2018-11-23 11:15:53,665 INFO L273 TraceCheckUtils]: 24: Hoare triple {450#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {450#true} is VALID [2018-11-23 11:15:53,666 INFO L273 TraceCheckUtils]: 25: Hoare triple {450#true} assume true; {450#true} is VALID [2018-11-23 11:15:53,669 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {450#true} {470#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #133#return; {470#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:53,670 INFO L273 TraceCheckUtils]: 27: Hoare triple {470#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {537#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:53,674 INFO L273 TraceCheckUtils]: 28: Hoare triple {537#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsgt32(~i~0, 4294967295bv32); {451#false} is VALID [2018-11-23 11:15:53,674 INFO L273 TraceCheckUtils]: 29: Hoare triple {451#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {451#false} is VALID [2018-11-23 11:15:53,674 INFO L273 TraceCheckUtils]: 30: Hoare triple {451#false} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {451#false} is VALID [2018-11-23 11:15:53,675 INFO L256 TraceCheckUtils]: 31: Hoare triple {451#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {451#false} is VALID [2018-11-23 11:15:53,675 INFO L273 TraceCheckUtils]: 32: Hoare triple {451#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {451#false} is VALID [2018-11-23 11:15:53,676 INFO L273 TraceCheckUtils]: 33: Hoare triple {451#false} assume !~bvsgt32(~index, 0bv32); {451#false} is VALID [2018-11-23 11:15:53,676 INFO L273 TraceCheckUtils]: 34: Hoare triple {451#false} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {451#false} is VALID [2018-11-23 11:15:53,676 INFO L273 TraceCheckUtils]: 35: Hoare triple {451#false} assume true; {451#false} is VALID [2018-11-23 11:15:53,677 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {451#false} {451#false} #137#return; {451#false} is VALID [2018-11-23 11:15:53,677 INFO L273 TraceCheckUtils]: 37: Hoare triple {451#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {451#false} is VALID [2018-11-23 11:15:53,677 INFO L273 TraceCheckUtils]: 38: Hoare triple {451#false} assume !false; {451#false} is VALID [2018-11-23 11:15:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:15:53,681 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 (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:15:53,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:15:53,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:15:53,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-11-23 11:15:53,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:53,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:15:53,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:53,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:15:53,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:15:53,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:15:53,785 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-11-23 11:15:54,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:54,277 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-11-23 11:15:54,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:15:54,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-11-23 11:15:54,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:15:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2018-11-23 11:15:54,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:15:54,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2018-11-23 11:15:54,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 72 transitions. [2018-11-23 11:15:54,429 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:54,432 INFO L225 Difference]: With dead ends: 64 [2018-11-23 11:15:54,432 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 11:15:54,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:15:54,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 11:15:54,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2018-11-23 11:15:54,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:54,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 44 states. [2018-11-23 11:15:54,470 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 44 states. [2018-11-23 11:15:54,470 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 44 states. [2018-11-23 11:15:54,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:54,476 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-11-23 11:15:54,476 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-23 11:15:54,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:54,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:54,477 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 52 states. [2018-11-23 11:15:54,478 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 52 states. [2018-11-23 11:15:54,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:54,482 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-11-23 11:15:54,483 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-23 11:15:54,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:54,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:54,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:54,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:54,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:15:54,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-23 11:15:54,488 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 39 [2018-11-23 11:15:54,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:54,488 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-23 11:15:54,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:15:54,488 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-23 11:15:54,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:15:54,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:54,491 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, 1, 1, 1, 1, 1] [2018-11-23 11:15:54,491 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:54,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:54,491 INFO L82 PathProgramCache]: Analyzing trace with hash -439772951, now seen corresponding path program 1 times [2018-11-23 11:15:54,492 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:54,492 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:15:54,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:54,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:54,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {835#true} call ULTIMATE.init(); {835#true} is VALID [2018-11-23 11:15:54,756 INFO L273 TraceCheckUtils]: 1: Hoare triple {835#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {835#true} is VALID [2018-11-23 11:15:54,757 INFO L273 TraceCheckUtils]: 2: Hoare triple {835#true} assume true; {835#true} is VALID [2018-11-23 11:15:54,757 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {835#true} {835#true} #145#return; {835#true} is VALID [2018-11-23 11:15:54,758 INFO L256 TraceCheckUtils]: 4: Hoare triple {835#true} call #t~ret17 := main(); {835#true} is VALID [2018-11-23 11:15:54,766 INFO L273 TraceCheckUtils]: 5: Hoare triple {835#true} ~len~0 := 2bv32;~data~0 := 1bv32; {855#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:54,767 INFO L256 TraceCheckUtils]: 6: Hoare triple {855#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {835#true} is VALID [2018-11-23 11:15:54,767 INFO L273 TraceCheckUtils]: 7: Hoare triple {835#true} ~len := #in~len;~data := #in~data; {835#true} is VALID [2018-11-23 11:15:54,767 INFO L256 TraceCheckUtils]: 8: Hoare triple {835#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {835#true} is VALID [2018-11-23 11:15:54,768 INFO L273 TraceCheckUtils]: 9: Hoare triple {835#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {835#true} is VALID [2018-11-23 11:15:54,768 INFO L273 TraceCheckUtils]: 10: Hoare triple {835#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {835#true} is VALID [2018-11-23 11:15:54,768 INFO L273 TraceCheckUtils]: 11: Hoare triple {835#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {835#true} is VALID [2018-11-23 11:15:54,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {835#true} assume true; {835#true} is VALID [2018-11-23 11:15:54,769 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {835#true} {835#true} #141#return; {835#true} is VALID [2018-11-23 11:15:54,769 INFO L273 TraceCheckUtils]: 14: Hoare triple {835#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {835#true} is VALID [2018-11-23 11:15:54,769 INFO L273 TraceCheckUtils]: 15: Hoare triple {835#true} assume !!~bvsgt32(~len, 1bv32); {835#true} is VALID [2018-11-23 11:15:54,769 INFO L256 TraceCheckUtils]: 16: Hoare triple {835#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {835#true} is VALID [2018-11-23 11:15:54,770 INFO L273 TraceCheckUtils]: 17: Hoare triple {835#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {835#true} is VALID [2018-11-23 11:15:54,770 INFO L273 TraceCheckUtils]: 18: Hoare triple {835#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {835#true} is VALID [2018-11-23 11:15:54,770 INFO L273 TraceCheckUtils]: 19: Hoare triple {835#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {835#true} is VALID [2018-11-23 11:15:54,770 INFO L273 TraceCheckUtils]: 20: Hoare triple {835#true} assume true; {835#true} is VALID [2018-11-23 11:15:54,771 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {835#true} {835#true} #143#return; {835#true} is VALID [2018-11-23 11:15:54,771 INFO L273 TraceCheckUtils]: 22: Hoare triple {835#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {835#true} is VALID [2018-11-23 11:15:54,771 INFO L273 TraceCheckUtils]: 23: Hoare triple {835#true} assume !~bvsgt32(~len, 1bv32); {835#true} is VALID [2018-11-23 11:15:54,771 INFO L273 TraceCheckUtils]: 24: Hoare triple {835#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {835#true} is VALID [2018-11-23 11:15:54,772 INFO L273 TraceCheckUtils]: 25: Hoare triple {835#true} assume true; {835#true} is VALID [2018-11-23 11:15:54,773 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {835#true} {855#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #133#return; {855#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:54,774 INFO L273 TraceCheckUtils]: 27: Hoare triple {855#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {922#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:54,774 INFO L273 TraceCheckUtils]: 28: Hoare triple {922#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {922#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:54,775 INFO L256 TraceCheckUtils]: 29: Hoare triple {922#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {835#true} is VALID [2018-11-23 11:15:54,777 INFO L273 TraceCheckUtils]: 30: Hoare triple {835#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {932#(= sll_circular_update_at_~index |sll_circular_update_at_#in~index|)} is VALID [2018-11-23 11:15:54,779 INFO L273 TraceCheckUtils]: 31: Hoare triple {932#(= sll_circular_update_at_~index |sll_circular_update_at_#in~index|)} assume !~bvsgt32(~index, 0bv32); {936#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:15:54,781 INFO L273 TraceCheckUtils]: 32: Hoare triple {936#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {936#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:15:54,781 INFO L273 TraceCheckUtils]: 33: Hoare triple {936#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} assume true; {936#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:15:54,787 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {936#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} {922#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #135#return; {836#false} is VALID [2018-11-23 11:15:54,787 INFO L273 TraceCheckUtils]: 35: Hoare triple {836#false} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {836#false} is VALID [2018-11-23 11:15:54,787 INFO L273 TraceCheckUtils]: 36: Hoare triple {836#false} assume !~bvsgt32(~i~0, 4294967295bv32); {836#false} is VALID [2018-11-23 11:15:54,788 INFO L273 TraceCheckUtils]: 37: Hoare triple {836#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {836#false} is VALID [2018-11-23 11:15:54,788 INFO L273 TraceCheckUtils]: 38: Hoare triple {836#false} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {836#false} is VALID [2018-11-23 11:15:54,788 INFO L256 TraceCheckUtils]: 39: Hoare triple {836#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {836#false} is VALID [2018-11-23 11:15:54,788 INFO L273 TraceCheckUtils]: 40: Hoare triple {836#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {836#false} is VALID [2018-11-23 11:15:54,789 INFO L273 TraceCheckUtils]: 41: Hoare triple {836#false} assume !~bvsgt32(~index, 0bv32); {836#false} is VALID [2018-11-23 11:15:54,789 INFO L273 TraceCheckUtils]: 42: Hoare triple {836#false} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {836#false} is VALID [2018-11-23 11:15:54,789 INFO L273 TraceCheckUtils]: 43: Hoare triple {836#false} assume true; {836#false} is VALID [2018-11-23 11:15:54,790 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {836#false} {836#false} #137#return; {836#false} is VALID [2018-11-23 11:15:54,790 INFO L273 TraceCheckUtils]: 45: Hoare triple {836#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {836#false} is VALID [2018-11-23 11:15:54,790 INFO L273 TraceCheckUtils]: 46: Hoare triple {836#false} assume !false; {836#false} is VALID [2018-11-23 11:15:54,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:15:54,795 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:15:54,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:15:54,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:15:54,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-23 11:15:54,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:54,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:15:54,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:54,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:15:54,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:15:54,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:15:54,949 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 6 states. [2018-11-23 11:15:55,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:55,765 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-11-23 11:15:55,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:15:55,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-23 11:15:55,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:55,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:15:55,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2018-11-23 11:15:55,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:15:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2018-11-23 11:15:55,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2018-11-23 11:15:56,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:56,021 INFO L225 Difference]: With dead ends: 76 [2018-11-23 11:15:56,021 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 11:15:56,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:15:56,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 11:15:56,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2018-11-23 11:15:56,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:56,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 49 states. [2018-11-23 11:15:56,088 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 49 states. [2018-11-23 11:15:56,088 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 49 states. [2018-11-23 11:15:56,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:56,093 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-23 11:15:56,093 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-23 11:15:56,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:56,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:56,094 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 56 states. [2018-11-23 11:15:56,095 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 56 states. [2018-11-23 11:15:56,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:56,099 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-23 11:15:56,099 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-23 11:15:56,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:56,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:56,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:56,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:56,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 11:15:56,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-11-23 11:15:56,105 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 47 [2018-11-23 11:15:56,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:56,105 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-11-23 11:15:56,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:15:56,106 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-23 11:15:56,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:15:56,107 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:56,108 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, 1, 1, 1, 1, 1, 1] [2018-11-23 11:15:56,108 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:56,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:56,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1813199505, now seen corresponding path program 1 times [2018-11-23 11:15:56,109 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:56,109 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:15:56,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:56,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:56,376 INFO L256 TraceCheckUtils]: 0: Hoare triple {1280#true} call ULTIMATE.init(); {1280#true} is VALID [2018-11-23 11:15:56,377 INFO L273 TraceCheckUtils]: 1: Hoare triple {1280#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1280#true} is VALID [2018-11-23 11:15:56,377 INFO L273 TraceCheckUtils]: 2: Hoare triple {1280#true} assume true; {1280#true} is VALID [2018-11-23 11:15:56,378 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1280#true} {1280#true} #145#return; {1280#true} is VALID [2018-11-23 11:15:56,378 INFO L256 TraceCheckUtils]: 4: Hoare triple {1280#true} call #t~ret17 := main(); {1280#true} is VALID [2018-11-23 11:15:56,385 INFO L273 TraceCheckUtils]: 5: Hoare triple {1280#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1300#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:56,385 INFO L256 TraceCheckUtils]: 6: Hoare triple {1300#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {1280#true} is VALID [2018-11-23 11:15:56,386 INFO L273 TraceCheckUtils]: 7: Hoare triple {1280#true} ~len := #in~len;~data := #in~data; {1280#true} is VALID [2018-11-23 11:15:56,386 INFO L256 TraceCheckUtils]: 8: Hoare triple {1280#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1280#true} is VALID [2018-11-23 11:15:56,386 INFO L273 TraceCheckUtils]: 9: Hoare triple {1280#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1280#true} is VALID [2018-11-23 11:15:56,387 INFO L273 TraceCheckUtils]: 10: Hoare triple {1280#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1280#true} is VALID [2018-11-23 11:15:56,387 INFO L273 TraceCheckUtils]: 11: Hoare triple {1280#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1280#true} is VALID [2018-11-23 11:15:56,387 INFO L273 TraceCheckUtils]: 12: Hoare triple {1280#true} assume true; {1280#true} is VALID [2018-11-23 11:15:56,388 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1280#true} {1280#true} #141#return; {1280#true} is VALID [2018-11-23 11:15:56,388 INFO L273 TraceCheckUtils]: 14: Hoare triple {1280#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1280#true} is VALID [2018-11-23 11:15:56,388 INFO L273 TraceCheckUtils]: 15: Hoare triple {1280#true} assume !!~bvsgt32(~len, 1bv32); {1280#true} is VALID [2018-11-23 11:15:56,389 INFO L256 TraceCheckUtils]: 16: Hoare triple {1280#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1280#true} is VALID [2018-11-23 11:15:56,389 INFO L273 TraceCheckUtils]: 17: Hoare triple {1280#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1280#true} is VALID [2018-11-23 11:15:56,389 INFO L273 TraceCheckUtils]: 18: Hoare triple {1280#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1280#true} is VALID [2018-11-23 11:15:56,389 INFO L273 TraceCheckUtils]: 19: Hoare triple {1280#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1280#true} is VALID [2018-11-23 11:15:56,390 INFO L273 TraceCheckUtils]: 20: Hoare triple {1280#true} assume true; {1280#true} is VALID [2018-11-23 11:15:56,390 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1280#true} {1280#true} #143#return; {1280#true} is VALID [2018-11-23 11:15:56,390 INFO L273 TraceCheckUtils]: 22: Hoare triple {1280#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1280#true} is VALID [2018-11-23 11:15:56,391 INFO L273 TraceCheckUtils]: 23: Hoare triple {1280#true} assume !~bvsgt32(~len, 1bv32); {1280#true} is VALID [2018-11-23 11:15:56,391 INFO L273 TraceCheckUtils]: 24: Hoare triple {1280#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1280#true} is VALID [2018-11-23 11:15:56,391 INFO L273 TraceCheckUtils]: 25: Hoare triple {1280#true} assume true; {1280#true} is VALID [2018-11-23 11:15:56,393 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1280#true} {1300#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #133#return; {1300#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:56,395 INFO L273 TraceCheckUtils]: 27: Hoare triple {1300#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {1367#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:56,395 INFO L273 TraceCheckUtils]: 28: Hoare triple {1367#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1367#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:56,396 INFO L256 TraceCheckUtils]: 29: Hoare triple {1367#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1280#true} is VALID [2018-11-23 11:15:56,396 INFO L273 TraceCheckUtils]: 30: Hoare triple {1280#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1280#true} is VALID [2018-11-23 11:15:56,396 INFO L273 TraceCheckUtils]: 31: Hoare triple {1280#true} assume !!~bvsgt32(~index, 0bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;#t~post12 := ~index;~index := ~bvsub32(#t~post12, 1bv32);havoc #t~post12; {1280#true} is VALID [2018-11-23 11:15:56,397 INFO L273 TraceCheckUtils]: 32: Hoare triple {1280#true} assume !~bvsgt32(~index, 0bv32); {1280#true} is VALID [2018-11-23 11:15:56,397 INFO L273 TraceCheckUtils]: 33: Hoare triple {1280#true} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {1280#true} is VALID [2018-11-23 11:15:56,397 INFO L273 TraceCheckUtils]: 34: Hoare triple {1280#true} assume true; {1280#true} is VALID [2018-11-23 11:15:56,399 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1280#true} {1367#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #135#return; {1367#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:56,399 INFO L273 TraceCheckUtils]: 36: Hoare triple {1367#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {1395#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:15:56,401 INFO L273 TraceCheckUtils]: 37: Hoare triple {1395#(= main_~i~0 (_ bv0 32))} assume !~bvsgt32(~i~0, 4294967295bv32); {1281#false} is VALID [2018-11-23 11:15:56,401 INFO L273 TraceCheckUtils]: 38: Hoare triple {1281#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {1281#false} is VALID [2018-11-23 11:15:56,401 INFO L273 TraceCheckUtils]: 39: Hoare triple {1281#false} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {1281#false} is VALID [2018-11-23 11:15:56,402 INFO L256 TraceCheckUtils]: 40: Hoare triple {1281#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1281#false} is VALID [2018-11-23 11:15:56,402 INFO L273 TraceCheckUtils]: 41: Hoare triple {1281#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1281#false} is VALID [2018-11-23 11:15:56,403 INFO L273 TraceCheckUtils]: 42: Hoare triple {1281#false} assume !~bvsgt32(~index, 0bv32); {1281#false} is VALID [2018-11-23 11:15:56,403 INFO L273 TraceCheckUtils]: 43: Hoare triple {1281#false} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {1281#false} is VALID [2018-11-23 11:15:56,403 INFO L273 TraceCheckUtils]: 44: Hoare triple {1281#false} assume true; {1281#false} is VALID [2018-11-23 11:15:56,404 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1281#false} {1281#false} #137#return; {1281#false} is VALID [2018-11-23 11:15:56,404 INFO L273 TraceCheckUtils]: 46: Hoare triple {1281#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {1281#false} is VALID [2018-11-23 11:15:56,405 INFO L273 TraceCheckUtils]: 47: Hoare triple {1281#false} assume !false; {1281#false} is VALID [2018-11-23 11:15:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:15:56,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:15:56,646 INFO L273 TraceCheckUtils]: 47: Hoare triple {1281#false} assume !false; {1281#false} is VALID [2018-11-23 11:15:56,646 INFO L273 TraceCheckUtils]: 46: Hoare triple {1281#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {1281#false} is VALID [2018-11-23 11:15:56,646 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1280#true} {1281#false} #137#return; {1281#false} is VALID [2018-11-23 11:15:56,647 INFO L273 TraceCheckUtils]: 44: Hoare triple {1280#true} assume true; {1280#true} is VALID [2018-11-23 11:15:56,647 INFO L273 TraceCheckUtils]: 43: Hoare triple {1280#true} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {1280#true} is VALID [2018-11-23 11:15:56,647 INFO L273 TraceCheckUtils]: 42: Hoare triple {1280#true} assume !~bvsgt32(~index, 0bv32); {1280#true} is VALID [2018-11-23 11:15:56,647 INFO L273 TraceCheckUtils]: 41: Hoare triple {1280#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1280#true} is VALID [2018-11-23 11:15:56,647 INFO L256 TraceCheckUtils]: 40: Hoare triple {1281#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1280#true} is VALID [2018-11-23 11:15:56,648 INFO L273 TraceCheckUtils]: 39: Hoare triple {1281#false} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {1281#false} is VALID [2018-11-23 11:15:56,648 INFO L273 TraceCheckUtils]: 38: Hoare triple {1281#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {1281#false} is VALID [2018-11-23 11:15:56,648 INFO L273 TraceCheckUtils]: 37: Hoare triple {1459#(bvsgt main_~i~0 (_ bv4294967295 32))} assume !~bvsgt32(~i~0, 4294967295bv32); {1281#false} is VALID [2018-11-23 11:15:56,649 INFO L273 TraceCheckUtils]: 36: Hoare triple {1463#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {1459#(bvsgt main_~i~0 (_ bv4294967295 32))} is VALID [2018-11-23 11:15:56,652 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1280#true} {1463#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} #135#return; {1463#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} is VALID [2018-11-23 11:15:56,652 INFO L273 TraceCheckUtils]: 34: Hoare triple {1280#true} assume true; {1280#true} is VALID [2018-11-23 11:15:56,652 INFO L273 TraceCheckUtils]: 33: Hoare triple {1280#true} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {1280#true} is VALID [2018-11-23 11:15:56,653 INFO L273 TraceCheckUtils]: 32: Hoare triple {1280#true} assume !~bvsgt32(~index, 0bv32); {1280#true} is VALID [2018-11-23 11:15:56,653 INFO L273 TraceCheckUtils]: 31: Hoare triple {1280#true} assume !!~bvsgt32(~index, 0bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;#t~post12 := ~index;~index := ~bvsub32(#t~post12, 1bv32);havoc #t~post12; {1280#true} is VALID [2018-11-23 11:15:56,653 INFO L273 TraceCheckUtils]: 30: Hoare triple {1280#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1280#true} is VALID [2018-11-23 11:15:56,654 INFO L256 TraceCheckUtils]: 29: Hoare triple {1463#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1280#true} is VALID [2018-11-23 11:15:56,656 INFO L273 TraceCheckUtils]: 28: Hoare triple {1463#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1463#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} is VALID [2018-11-23 11:15:56,660 INFO L273 TraceCheckUtils]: 27: Hoare triple {1491#(bvsgt (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv4294967295 32))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {1463#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} is VALID [2018-11-23 11:15:56,661 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1280#true} {1491#(bvsgt (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv4294967295 32))} #133#return; {1491#(bvsgt (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv4294967295 32))} is VALID [2018-11-23 11:15:56,661 INFO L273 TraceCheckUtils]: 25: Hoare triple {1280#true} assume true; {1280#true} is VALID [2018-11-23 11:15:56,661 INFO L273 TraceCheckUtils]: 24: Hoare triple {1280#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1280#true} is VALID [2018-11-23 11:15:56,662 INFO L273 TraceCheckUtils]: 23: Hoare triple {1280#true} assume !~bvsgt32(~len, 1bv32); {1280#true} is VALID [2018-11-23 11:15:56,662 INFO L273 TraceCheckUtils]: 22: Hoare triple {1280#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1280#true} is VALID [2018-11-23 11:15:56,662 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1280#true} {1280#true} #143#return; {1280#true} is VALID [2018-11-23 11:15:56,662 INFO L273 TraceCheckUtils]: 20: Hoare triple {1280#true} assume true; {1280#true} is VALID [2018-11-23 11:15:56,663 INFO L273 TraceCheckUtils]: 19: Hoare triple {1280#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1280#true} is VALID [2018-11-23 11:15:56,663 INFO L273 TraceCheckUtils]: 18: Hoare triple {1280#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1280#true} is VALID [2018-11-23 11:15:56,663 INFO L273 TraceCheckUtils]: 17: Hoare triple {1280#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1280#true} is VALID [2018-11-23 11:15:56,664 INFO L256 TraceCheckUtils]: 16: Hoare triple {1280#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1280#true} is VALID [2018-11-23 11:15:56,664 INFO L273 TraceCheckUtils]: 15: Hoare triple {1280#true} assume !!~bvsgt32(~len, 1bv32); {1280#true} is VALID [2018-11-23 11:15:56,664 INFO L273 TraceCheckUtils]: 14: Hoare triple {1280#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1280#true} is VALID [2018-11-23 11:15:56,664 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1280#true} {1280#true} #141#return; {1280#true} is VALID [2018-11-23 11:15:56,665 INFO L273 TraceCheckUtils]: 12: Hoare triple {1280#true} assume true; {1280#true} is VALID [2018-11-23 11:15:56,665 INFO L273 TraceCheckUtils]: 11: Hoare triple {1280#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1280#true} is VALID [2018-11-23 11:15:56,665 INFO L273 TraceCheckUtils]: 10: Hoare triple {1280#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1280#true} is VALID [2018-11-23 11:15:56,665 INFO L273 TraceCheckUtils]: 9: Hoare triple {1280#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1280#true} is VALID [2018-11-23 11:15:56,666 INFO L256 TraceCheckUtils]: 8: Hoare triple {1280#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1280#true} is VALID [2018-11-23 11:15:56,666 INFO L273 TraceCheckUtils]: 7: Hoare triple {1280#true} ~len := #in~len;~data := #in~data; {1280#true} is VALID [2018-11-23 11:15:56,666 INFO L256 TraceCheckUtils]: 6: Hoare triple {1491#(bvsgt (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv4294967295 32))} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {1280#true} is VALID [2018-11-23 11:15:56,667 INFO L273 TraceCheckUtils]: 5: Hoare triple {1280#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1491#(bvsgt (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv4294967295 32))} is VALID [2018-11-23 11:15:56,667 INFO L256 TraceCheckUtils]: 4: Hoare triple {1280#true} call #t~ret17 := main(); {1280#true} is VALID [2018-11-23 11:15:56,667 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1280#true} {1280#true} #145#return; {1280#true} is VALID [2018-11-23 11:15:56,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {1280#true} assume true; {1280#true} is VALID [2018-11-23 11:15:56,668 INFO L273 TraceCheckUtils]: 1: Hoare triple {1280#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1280#true} is VALID [2018-11-23 11:15:56,668 INFO L256 TraceCheckUtils]: 0: Hoare triple {1280#true} call ULTIMATE.init(); {1280#true} is VALID [2018-11-23 11:15:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:15:56,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:15:56,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:15:56,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2018-11-23 11:15:56,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:56,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:15:56,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:56,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:15:56,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:15:56,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:15:56,762 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 8 states. [2018-11-23 11:15:57,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:57,889 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2018-11-23 11:15:57,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:15:57,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2018-11-23 11:15:57,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:57,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:15:57,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2018-11-23 11:15:57,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:15:57,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2018-11-23 11:15:57,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 83 transitions. [2018-11-23 11:15:58,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:58,052 INFO L225 Difference]: With dead ends: 77 [2018-11-23 11:15:58,053 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 11:15:58,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:15:58,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 11:15:58,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2018-11-23 11:15:58,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:58,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 51 states. [2018-11-23 11:15:58,229 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 51 states. [2018-11-23 11:15:58,229 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 51 states. [2018-11-23 11:15:58,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:58,233 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2018-11-23 11:15:58,234 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2018-11-23 11:15:58,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:58,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:58,235 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 65 states. [2018-11-23 11:15:58,235 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 65 states. [2018-11-23 11:15:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:58,240 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2018-11-23 11:15:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2018-11-23 11:15:58,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:58,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:58,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:58,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:58,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:15:58,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-11-23 11:15:58,244 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 48 [2018-11-23 11:15:58,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:58,245 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-11-23 11:15:58,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:15:58,245 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-23 11:15:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 11:15:58,252 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:58,253 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-23 11:15:58,253 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:58,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:58,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2073446119, now seen corresponding path program 2 times [2018-11-23 11:15:58,254 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:58,254 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:15:58,274 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:15:58,352 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:15:58,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:15:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:58,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:58,597 INFO L256 TraceCheckUtils]: 0: Hoare triple {1899#true} call ULTIMATE.init(); {1899#true} is VALID [2018-11-23 11:15:58,597 INFO L273 TraceCheckUtils]: 1: Hoare triple {1899#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1899#true} is VALID [2018-11-23 11:15:58,598 INFO L273 TraceCheckUtils]: 2: Hoare triple {1899#true} assume true; {1899#true} is VALID [2018-11-23 11:15:58,598 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1899#true} {1899#true} #145#return; {1899#true} is VALID [2018-11-23 11:15:58,598 INFO L256 TraceCheckUtils]: 4: Hoare triple {1899#true} call #t~ret17 := main(); {1899#true} is VALID [2018-11-23 11:15:58,599 INFO L273 TraceCheckUtils]: 5: Hoare triple {1899#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:58,599 INFO L256 TraceCheckUtils]: 6: Hoare triple {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {1899#true} is VALID [2018-11-23 11:15:58,599 INFO L273 TraceCheckUtils]: 7: Hoare triple {1899#true} ~len := #in~len;~data := #in~data; {1899#true} is VALID [2018-11-23 11:15:58,600 INFO L256 TraceCheckUtils]: 8: Hoare triple {1899#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1899#true} is VALID [2018-11-23 11:15:58,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {1899#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1899#true} is VALID [2018-11-23 11:15:58,600 INFO L273 TraceCheckUtils]: 10: Hoare triple {1899#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1899#true} is VALID [2018-11-23 11:15:58,600 INFO L273 TraceCheckUtils]: 11: Hoare triple {1899#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1899#true} is VALID [2018-11-23 11:15:58,600 INFO L273 TraceCheckUtils]: 12: Hoare triple {1899#true} assume true; {1899#true} is VALID [2018-11-23 11:15:58,601 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1899#true} {1899#true} #141#return; {1899#true} is VALID [2018-11-23 11:15:58,601 INFO L273 TraceCheckUtils]: 14: Hoare triple {1899#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1899#true} is VALID [2018-11-23 11:15:58,601 INFO L273 TraceCheckUtils]: 15: Hoare triple {1899#true} assume !!~bvsgt32(~len, 1bv32); {1899#true} is VALID [2018-11-23 11:15:58,602 INFO L256 TraceCheckUtils]: 16: Hoare triple {1899#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1899#true} is VALID [2018-11-23 11:15:58,602 INFO L273 TraceCheckUtils]: 17: Hoare triple {1899#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1899#true} is VALID [2018-11-23 11:15:58,602 INFO L273 TraceCheckUtils]: 18: Hoare triple {1899#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1899#true} is VALID [2018-11-23 11:15:58,602 INFO L273 TraceCheckUtils]: 19: Hoare triple {1899#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1899#true} is VALID [2018-11-23 11:15:58,603 INFO L273 TraceCheckUtils]: 20: Hoare triple {1899#true} assume true; {1899#true} is VALID [2018-11-23 11:15:58,603 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1899#true} {1899#true} #143#return; {1899#true} is VALID [2018-11-23 11:15:58,603 INFO L273 TraceCheckUtils]: 22: Hoare triple {1899#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1899#true} is VALID [2018-11-23 11:15:58,603 INFO L273 TraceCheckUtils]: 23: Hoare triple {1899#true} assume !~bvsgt32(~len, 1bv32); {1899#true} is VALID [2018-11-23 11:15:58,603 INFO L273 TraceCheckUtils]: 24: Hoare triple {1899#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1899#true} is VALID [2018-11-23 11:15:58,604 INFO L273 TraceCheckUtils]: 25: Hoare triple {1899#true} assume true; {1899#true} is VALID [2018-11-23 11:15:58,604 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1899#true} {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #133#return; {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:58,605 INFO L273 TraceCheckUtils]: 27: Hoare triple {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:58,605 INFO L273 TraceCheckUtils]: 28: Hoare triple {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:58,605 INFO L256 TraceCheckUtils]: 29: Hoare triple {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1899#true} is VALID [2018-11-23 11:15:58,606 INFO L273 TraceCheckUtils]: 30: Hoare triple {1899#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1899#true} is VALID [2018-11-23 11:15:58,606 INFO L273 TraceCheckUtils]: 31: Hoare triple {1899#true} assume !!~bvsgt32(~index, 0bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;#t~post12 := ~index;~index := ~bvsub32(#t~post12, 1bv32);havoc #t~post12; {1899#true} is VALID [2018-11-23 11:15:58,606 INFO L273 TraceCheckUtils]: 32: Hoare triple {1899#true} assume !~bvsgt32(~index, 0bv32); {1899#true} is VALID [2018-11-23 11:15:58,606 INFO L273 TraceCheckUtils]: 33: Hoare triple {1899#true} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {1899#true} is VALID [2018-11-23 11:15:58,606 INFO L273 TraceCheckUtils]: 34: Hoare triple {1899#true} assume true; {1899#true} is VALID [2018-11-23 11:15:58,607 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1899#true} {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #135#return; {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:58,608 INFO L273 TraceCheckUtils]: 36: Hoare triple {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:58,608 INFO L273 TraceCheckUtils]: 37: Hoare triple {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:58,609 INFO L256 TraceCheckUtils]: 38: Hoare triple {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1899#true} is VALID [2018-11-23 11:15:58,609 INFO L273 TraceCheckUtils]: 39: Hoare triple {1899#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1899#true} is VALID [2018-11-23 11:15:58,609 INFO L273 TraceCheckUtils]: 40: Hoare triple {1899#true} assume !~bvsgt32(~index, 0bv32); {1899#true} is VALID [2018-11-23 11:15:58,610 INFO L273 TraceCheckUtils]: 41: Hoare triple {1899#true} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {1899#true} is VALID [2018-11-23 11:15:58,610 INFO L273 TraceCheckUtils]: 42: Hoare triple {1899#true} assume true; {1899#true} is VALID [2018-11-23 11:15:58,613 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {1899#true} {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #135#return; {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:58,614 INFO L273 TraceCheckUtils]: 44: Hoare triple {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:58,633 INFO L273 TraceCheckUtils]: 45: Hoare triple {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume !~bvsgt32(~i~0, 4294967295bv32); {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:58,647 INFO L273 TraceCheckUtils]: 46: Hoare triple {1919#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~i~0 := ~bvsub32(~len~0, 1bv32); {2043#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:58,654 INFO L273 TraceCheckUtils]: 47: Hoare triple {2043#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {2043#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:58,655 INFO L256 TraceCheckUtils]: 48: Hoare triple {2043#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1899#true} is VALID [2018-11-23 11:15:58,655 INFO L273 TraceCheckUtils]: 49: Hoare triple {1899#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2053#(= sll_circular_get_data_at_~index |sll_circular_get_data_at_#in~index|)} is VALID [2018-11-23 11:15:58,656 INFO L273 TraceCheckUtils]: 50: Hoare triple {2053#(= sll_circular_get_data_at_~index |sll_circular_get_data_at_#in~index|)} assume !~bvsgt32(~index, 0bv32); {2057#(not (bvsgt |sll_circular_get_data_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:15:58,659 INFO L273 TraceCheckUtils]: 51: Hoare triple {2057#(not (bvsgt |sll_circular_get_data_at_#in~index| (_ bv0 32)))} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {2057#(not (bvsgt |sll_circular_get_data_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:15:58,659 INFO L273 TraceCheckUtils]: 52: Hoare triple {2057#(not (bvsgt |sll_circular_get_data_at_#in~index| (_ bv0 32)))} assume true; {2057#(not (bvsgt |sll_circular_get_data_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:15:58,661 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {2057#(not (bvsgt |sll_circular_get_data_at_#in~index| (_ bv0 32)))} {2043#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #137#return; {1900#false} is VALID [2018-11-23 11:15:58,661 INFO L273 TraceCheckUtils]: 54: Hoare triple {1900#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {1900#false} is VALID [2018-11-23 11:15:58,661 INFO L273 TraceCheckUtils]: 55: Hoare triple {1900#false} assume !false; {1900#false} is VALID [2018-11-23 11:15:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 11:15:58,665 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:15:58,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:15:58,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:15:58,668 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-11-23 11:15:58,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:58,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:15:58,793 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:58,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:15:58,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:15:58,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:15:58,794 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2018-11-23 11:15:59,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:59,626 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-23 11:15:59,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:15:59,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-11-23 11:15:59,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:59,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:15:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2018-11-23 11:15:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:15:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2018-11-23 11:15:59,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 76 transitions. [2018-11-23 11:15:59,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:59,778 INFO L225 Difference]: With dead ends: 72 [2018-11-23 11:15:59,778 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 11:15:59,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:15:59,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 11:15:59,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-11-23 11:15:59,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:59,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 57 states. [2018-11-23 11:15:59,836 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 57 states. [2018-11-23 11:15:59,836 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 57 states. [2018-11-23 11:15:59,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:59,839 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-11-23 11:15:59,839 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2018-11-23 11:15:59,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:59,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:59,840 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 61 states. [2018-11-23 11:15:59,840 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 61 states. [2018-11-23 11:15:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:59,843 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-11-23 11:15:59,843 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2018-11-23 11:15:59,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:59,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:59,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:59,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:59,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:15:59,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2018-11-23 11:15:59,847 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 56 [2018-11-23 11:15:59,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:59,847 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2018-11-23 11:15:59,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:15:59,848 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-11-23 11:15:59,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 11:15:59,848 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:59,849 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-23 11:15:59,849 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:59,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:59,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1451054008, now seen corresponding path program 1 times [2018-11-23 11:15:59,850 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:59,850 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:15:59,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:16:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:16:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:16:00,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:16:00,197 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:16:00,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:16:00,219 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:00,219 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_41|]. (and (= node_create_~temp~0.offset (_ bv0 32)) (= |#valid| (store |v_#valid_41| node_create_~temp~0.base (_ bv1 1)))) [2018-11-23 11:16:00,219 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (= node_create_~temp~0.offset (_ bv0 32))) [2018-11-23 11:16:00,573 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:00,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:00,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 11:16:00,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-23 11:16:00,596 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:00,596 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#valid)_AFTER_CALL_29|]. (and (= (_ bv1 1) (select |v_old(#valid)_AFTER_CALL_29| sll_circular_create_~head~0.base)) (= |sll_circular_create_#t~ret4.offset| (_ bv0 32)) (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (select |v_old(#valid)_AFTER_CALL_29| |sll_circular_create_#t~ret4.base|) (_ bv0 1))) [2018-11-23 11:16:00,596 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |sll_circular_create_#t~ret4.offset| (_ bv0 32)) (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (not (= sll_circular_create_~head~0.base |sll_circular_create_#t~ret4.base|))) [2018-11-23 11:16:00,677 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 11 treesize of output 8 [2018-11-23 11:16:00,684 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 8 treesize of output 7 [2018-11-23 11:16:00,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,715 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 11 treesize of output 8 [2018-11-23 11:16:00,719 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 8 treesize of output 7 [2018-11-23 11:16:00,721 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,724 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,739 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-11-23 11:16:00,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-11-23 11:16:00,886 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 12 treesize of output 11 [2018-11-23 11:16:00,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 11:16:00,955 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 12 treesize of output 11 [2018-11-23 11:16:00,957 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,967 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:00,988 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:41 [2018-11-23 11:16:01,010 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:01,010 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_48|, sll_circular_create_~last~0.offset]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_48| |sll_circular_create_#res.base|) (_ bv0 32)))) (and (= (store |v_#memory_$Pointer$.offset_48| .cse0 (store (select |v_#memory_$Pointer$.offset_48| .cse0) sll_circular_create_~last~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) (= (_ bv0 32) (select (select |v_#memory_$Pointer$.offset_48| |sll_circular_create_#res.base|) (_ bv0 32))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_48| .cse0 (store (select |v_#memory_$Pointer$.base_48| .cse0) sll_circular_create_~last~0.offset |sll_circular_create_#res.base|))) (not (= |sll_circular_create_#res.base| .cse0)) (= (_ bv0 32) |sll_circular_create_#res.offset|))) [2018-11-23 11:16:01,010 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [sll_circular_create_~last~0.offset]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32)))) (and (= (_ bv0 32) |sll_circular_create_#res.offset|) (= (select (select |#memory_$Pointer$.base| .cse0) sll_circular_create_~last~0.offset) |sll_circular_create_#res.base|) (= (select (select |#memory_$Pointer$.offset| |sll_circular_create_#res.base|) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| .cse0) sll_circular_create_~last~0.offset) (_ bv0 32)) (not (= .cse0 |sll_circular_create_#res.base|)))) [2018-11-23 11:16:01,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 25 treesize of output 18 [2018-11-23 11:16:01,944 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 18 treesize of output 17 [2018-11-23 11:16:01,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:01,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:01,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:01,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:104, output treesize:96 [2018-11-23 11:16:02,299 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:16:02,379 INFO L303 Elim1Store]: Index analysis took 108 ms [2018-11-23 11:16:02,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 132 [2018-11-23 11:16:02,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 21 [2018-11-23 11:16:02,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 11:16:02,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:16:02,632 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:02,633 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:16:02,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 105 [2018-11-23 11:16:02,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 21 [2018-11-23 11:16:02,713 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 11:16:02,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:16:02,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:02,764 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:16:02,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 103 [2018-11-23 11:16:02,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 38 treesize of output 9 [2018-11-23 11:16:02,818 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:02,841 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:02,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:16:02,927 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:146, output treesize:115 [2018-11-23 11:16:05,150 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:05,150 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_BEFORE_CALL_2|, |v_#memory_$Pointer$.offset_BEFORE_CALL_2|, sll_circular_create_~last~0.offset]. (let ((.cse3 (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| main_~s~0.base)) (.cse4 (select |v_#memory_$Pointer$.base_BEFORE_CALL_2| main_~s~0.base))) (let ((.cse0 (select .cse4 (_ bv0 32))) (.cse1 (select .cse4 main_~s~0.offset)) (.cse2 (bvadd (select .cse3 main_~s~0.offset) (_ bv4 32)))) (and (= (_ bv0 32) (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| .cse0) sll_circular_create_~last~0.offset)) (= (select (select |#memory_int| .cse1) .cse2) (bvadd main_~len~0 (bvneg (bvneg main_~len~0)) (_ bv4294967295 32))) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_2| .cse1 (store (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| .cse1) .cse2 (select (select |#memory_$Pointer$.offset| .cse1) .cse2))) |#memory_$Pointer$.offset|) (= (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_2| .cse0) sll_circular_create_~last~0.offset) main_~s~0.base) (= main_~s~0.offset (_ bv0 32)) (not (= .cse0 main_~s~0.base)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_BEFORE_CALL_2| .cse1 (store (select |v_#memory_$Pointer$.base_BEFORE_CALL_2| .cse1) .cse2 (select (select |#memory_$Pointer$.base| .cse1) .cse2)))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select .cse3 (_ bv0 32)) (_ bv0 32))))) [2018-11-23 11:16:05,151 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [sll_circular_create_~last~0.offset]. (let ((.cse6 (select |#memory_$Pointer$.base| main_~s~0.base))) (let ((.cse0 (select .cse6 main_~s~0.offset)) (.cse7 (select |#memory_$Pointer$.offset| main_~s~0.base))) (let ((.cse1 (= (select (select |#memory_int| .cse0) (bvadd (select .cse7 main_~s~0.offset) (_ bv4 32))) (bvadd main_~len~0 (bvneg (bvneg main_~len~0)) (_ bv4294967295 32)))) (.cse2 (= main_~s~0.offset (_ bv0 32))) (.cse4 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse3 (= (select .cse7 (_ bv0 32)) (_ bv0 32))) (.cse5 (not (= (select .cse6 (_ bv0 32)) main_~s~0.base)))) (or (and (= (select (select |#memory_$Pointer$.base| .cse0) sll_circular_create_~last~0.offset) main_~s~0.base) .cse1 .cse2 (= (select (select |#memory_$Pointer$.offset| .cse0) sll_circular_create_~last~0.offset) (_ bv0 32)) .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse4 .cse3 .cse5))))) [2018-11-23 11:16:05,469 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2018-11-23 11:16:18,108 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 11:16:18,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 50 treesize of output 43 [2018-11-23 11:16:18,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:18,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 40 [2018-11-23 11:16:18,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:18,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:18,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 49 treesize of output 42 [2018-11-23 11:16:18,449 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:18,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 39 [2018-11-23 11:16:18,474 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:18,490 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:18,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2018-11-23 11:16:18,571 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 10 treesize of output 9 [2018-11-23 11:16:18,573 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:18,585 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:18,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:18,617 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:97, output treesize:46 [2018-11-23 11:16:18,723 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:18,724 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_BEFORE_CALL_4|, |v_old(#memory_int)_AFTER_CALL_30|, |v_#memory_$Pointer$.offset_BEFORE_CALL_4|, sll_circular_update_at_~data]. (let ((.cse0 (select |v_#memory_$Pointer$.base_BEFORE_CALL_4| main_~s~0.base)) (.cse2 (select |v_#memory_$Pointer$.offset_BEFORE_CALL_4| main_~s~0.base)) (.cse1 (bvadd main_~s~0.offset (_ bv4 32)))) (and (= main_~s~0.offset (_ bv0 32)) (not (= (select .cse0 (_ bv0 32)) main_~s~0.base)) (= (store |v_#memory_$Pointer$.base_BEFORE_CALL_4| main_~s~0.base (store .cse0 .cse1 (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse1))) |#memory_$Pointer$.base|) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (store |v_old(#memory_int)_AFTER_CALL_30| main_~s~0.base (store (select |v_old(#memory_int)_AFTER_CALL_30| main_~s~0.base) .cse1 sll_circular_update_at_~data)) |#memory_int|) (= (bvadd (bvneg (bvneg main_~len~0)) main_~len~0 (_ bv4294967295 32)) (select (select |v_old(#memory_int)_AFTER_CALL_30| (select .cse0 main_~s~0.offset)) (bvadd (select .cse2 main_~s~0.offset) (_ bv4 32)))) (= (_ bv0 32) (select .cse2 (_ bv0 32))) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_4| main_~s~0.base (store .cse2 .cse1 (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse1))) |#memory_$Pointer$.offset|))) [2018-11-23 11:16:18,724 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (.cse1 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))) (and (= (bvadd (bvneg (bvneg main_~len~0)) main_~len~0 (_ bv4294967295 32)) (select (select |#memory_int| .cse0) (bvadd .cse1 (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (not (= main_~s~0.base .cse0)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= .cse1 (_ bv0 32)))) [2018-11-23 11:16:20,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 50 [2018-11-23 11:16:20,181 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 46 treesize of output 27 [2018-11-23 11:16:20,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:20,215 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 27 treesize of output 16 [2018-11-23 11:16:20,217 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:20,250 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:16:20,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-23 11:16:20,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:20,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:20,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2018-11-23 11:16:20,311 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:20,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 11:16:20,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 15 [2018-11-23 11:16:20,361 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:20,390 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 13 treesize of output 9 [2018-11-23 11:16:20,393 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:20,396 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:20,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:20,402 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:85, output treesize:7 [2018-11-23 11:16:20,414 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:20,415 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, main_~s~0.base, |#memory_int|, |#memory_$Pointer$.offset|, v_main_~s~0.base_BEFORE_CALL_3]. (let ((.cse4 (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) (.cse3 (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)))) (let ((.cse2 (select (select |#memory_int| .cse4) (bvadd .cse3 (_ bv4 32)))) (.cse0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (.cse1 (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (and (= (_ bv3 32) (select (select |#memory_int| .cse0) (bvadd .cse1 (_ bv4 32)))) (= (_ bv3 32) .cse2) (= |main_#t~ret16| .cse2) (not (= v_main_~s~0.base_BEFORE_CALL_3 .cse0)) (= (_ bv0 32) .cse1) (= .cse3 (_ bv0 32)) (= (_ bv3 32) main_~expected~0) (not (= .cse4 main_~s~0.base))))) [2018-11-23 11:16:20,415 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~ret16| (_ bv3 32)) (= (_ bv3 32) main_~expected~0)) [2018-11-23 11:16:20,509 INFO L256 TraceCheckUtils]: 0: Hoare triple {2387#true} call ULTIMATE.init(); {2387#true} is VALID [2018-11-23 11:16:20,510 INFO L273 TraceCheckUtils]: 1: Hoare triple {2387#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2387#true} is VALID [2018-11-23 11:16:20,510 INFO L273 TraceCheckUtils]: 2: Hoare triple {2387#true} assume true; {2387#true} is VALID [2018-11-23 11:16:20,510 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2387#true} {2387#true} #145#return; {2387#true} is VALID [2018-11-23 11:16:20,511 INFO L256 TraceCheckUtils]: 4: Hoare triple {2387#true} call #t~ret17 := main(); {2387#true} is VALID [2018-11-23 11:16:20,511 INFO L273 TraceCheckUtils]: 5: Hoare triple {2387#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2407#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:16:20,512 INFO L256 TraceCheckUtils]: 6: Hoare triple {2407#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {2387#true} is VALID [2018-11-23 11:16:20,512 INFO L273 TraceCheckUtils]: 7: Hoare triple {2387#true} ~len := #in~len;~data := #in~data; {2387#true} is VALID [2018-11-23 11:16:20,512 INFO L256 TraceCheckUtils]: 8: Hoare triple {2387#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {2387#true} is VALID [2018-11-23 11:16:20,513 INFO L273 TraceCheckUtils]: 9: Hoare triple {2387#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2420#(and (= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1)) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:16:20,514 INFO L273 TraceCheckUtils]: 10: Hoare triple {2420#(and (= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1)) (= node_create_~temp~0.offset (_ bv0 32)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2420#(and (= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1)) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:16:20,515 INFO L273 TraceCheckUtils]: 11: Hoare triple {2420#(and (= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1)) (= node_create_~temp~0.offset (_ bv0 32)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2427#(and (= (_ bv1 1) (select |#valid| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:16:20,515 INFO L273 TraceCheckUtils]: 12: Hoare triple {2427#(and (= (_ bv1 1) (select |#valid| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {2427#(and (= (_ bv1 1) (select |#valid| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:16:20,517 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {2427#(and (= (_ bv1 1) (select |#valid| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {2387#true} #141#return; {2434#(and (= |sll_circular_create_#t~ret3.offset| (_ bv0 32)) (= (bvadd (select |#valid| |sll_circular_create_#t~ret3.base|) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:16:20,519 INFO L273 TraceCheckUtils]: 14: Hoare triple {2434#(and (= |sll_circular_create_#t~ret3.offset| (_ bv0 32)) (= (bvadd (select |#valid| |sll_circular_create_#t~ret3.base|) (_ bv1 1)) (_ bv0 1)))} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {2438#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:16:20,520 INFO L273 TraceCheckUtils]: 15: Hoare triple {2438#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} assume !!~bvsgt32(~len, 1bv32); {2438#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:16:20,521 INFO L256 TraceCheckUtils]: 16: Hoare triple {2438#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2445#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:16:20,522 INFO L273 TraceCheckUtils]: 17: Hoare triple {2445#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2449#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:16:20,523 INFO L273 TraceCheckUtils]: 18: Hoare triple {2449#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2449#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:16:20,525 INFO L273 TraceCheckUtils]: 19: Hoare triple {2449#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2456#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:16:20,526 INFO L273 TraceCheckUtils]: 20: Hoare triple {2456#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {2456#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:16:20,529 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2456#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {2438#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} #143#return; {2463#(and (= |sll_circular_create_#t~ret4.offset| (_ bv0 32)) (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (not (= sll_circular_create_~head~0.base |sll_circular_create_#t~ret4.base|)))} is VALID [2018-11-23 11:16:20,532 INFO L273 TraceCheckUtils]: 22: Hoare triple {2463#(and (= |sll_circular_create_#t~ret4.offset| (_ bv0 32)) (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (not (= sll_circular_create_~head~0.base |sll_circular_create_#t~ret4.base|)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {2467#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= sll_circular_create_~head~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} is VALID [2018-11-23 11:16:20,540 INFO L273 TraceCheckUtils]: 23: Hoare triple {2467#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= sll_circular_create_~head~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} assume !~bvsgt32(~len, 1bv32); {2467#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= sll_circular_create_~head~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} is VALID [2018-11-23 11:16:20,544 INFO L273 TraceCheckUtils]: 24: Hoare triple {2467#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= sll_circular_create_~head~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {2474#(and (= (_ bv0 32) |sll_circular_create_#res.offset|) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |sll_circular_create_#res.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |sll_circular_create_#res.base|) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32)) |sll_circular_create_#res.base|)))} is VALID [2018-11-23 11:16:20,545 INFO L273 TraceCheckUtils]: 25: Hoare triple {2474#(and (= (_ bv0 32) |sll_circular_create_#res.offset|) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |sll_circular_create_#res.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |sll_circular_create_#res.base|) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32)) |sll_circular_create_#res.base|)))} assume true; {2474#(and (= (_ bv0 32) |sll_circular_create_#res.offset|) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |sll_circular_create_#res.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |sll_circular_create_#res.base|) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32)) |sll_circular_create_#res.base|)))} is VALID [2018-11-23 11:16:20,547 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2474#(and (= (_ bv0 32) |sll_circular_create_#res.offset|) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |sll_circular_create_#res.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |sll_circular_create_#res.base|) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32)) |sll_circular_create_#res.base|)))} {2407#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #133#return; {2481#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv0 32))) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |main_#t~ret13.base|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_#t~ret13.base|) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv0 32)) |main_#t~ret13.base|)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret13.offset| (_ bv0 32)))} is VALID [2018-11-23 11:16:20,550 INFO L273 TraceCheckUtils]: 27: Hoare triple {2481#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv0 32))) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |main_#t~ret13.base|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_#t~ret13.base|) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv0 32)) |main_#t~ret13.base|)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret13.offset| (_ bv0 32)))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {2485#(and (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} is VALID [2018-11-23 11:16:20,552 INFO L273 TraceCheckUtils]: 28: Hoare triple {2485#(and (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2489#(and (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd (bvneg main_~len~0) main_~new_data~0)) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} is VALID [2018-11-23 11:16:20,554 INFO L256 TraceCheckUtils]: 29: Hoare triple {2489#(and (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd (bvneg main_~len~0) main_~new_data~0)) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2493#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:20,554 INFO L273 TraceCheckUtils]: 30: Hoare triple {2493#(and (= |#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; {2497#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:20,563 INFO L273 TraceCheckUtils]: 31: Hoare triple {2497#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !!~bvsgt32(~index, 0bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;#t~post12 := ~index;~index := ~bvsub32(#t~post12, 1bv32);havoc #t~post12; {2501#(and (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))} is VALID [2018-11-23 11:16:20,564 INFO L273 TraceCheckUtils]: 32: Hoare triple {2501#(and (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))} assume !~bvsgt32(~index, 0bv32); {2501#(and (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))} is VALID [2018-11-23 11:16:20,582 INFO L273 TraceCheckUtils]: 33: Hoare triple {2501#(and (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {2508#(and (= (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32)) (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.offset|) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))) |sll_circular_update_at_#in~data|))} is VALID [2018-11-23 11:16:20,583 INFO L273 TraceCheckUtils]: 34: Hoare triple {2508#(and (= (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32)) (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.offset|) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))) |sll_circular_update_at_#in~data|))} assume true; {2508#(and (= (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32)) (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.offset|) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))) |sll_circular_update_at_#in~data|))} is VALID [2018-11-23 11:16:20,588 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2508#(and (= (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32)) (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.offset|) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))) |sll_circular_update_at_#in~data|))} {2489#(and (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd (bvneg main_~len~0) main_~new_data~0)) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} #135#return; {2515#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:16:20,591 INFO L273 TraceCheckUtils]: 36: Hoare triple {2515#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {2515#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:16:20,592 INFO L273 TraceCheckUtils]: 37: Hoare triple {2515#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2515#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:16:20,594 INFO L256 TraceCheckUtils]: 38: Hoare triple {2515#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2525#(and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:20,594 INFO L273 TraceCheckUtils]: 39: Hoare triple {2525#(and (= |old(#memory_int)| |#memory_int|) (= |#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; {2529#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:20,596 INFO L273 TraceCheckUtils]: 40: Hoare triple {2529#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !~bvsgt32(~index, 0bv32); {2529#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:20,622 INFO L273 TraceCheckUtils]: 41: Hoare triple {2529#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {2536#(and (exists ((sll_circular_update_at_~data (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) sll_circular_update_at_~data)))) (= (store |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32))))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)))))))} is VALID [2018-11-23 11:16:20,623 INFO L273 TraceCheckUtils]: 42: Hoare triple {2536#(and (exists ((sll_circular_update_at_~data (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) sll_circular_update_at_~data)))) (= (store |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32))))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)))))))} assume true; {2536#(and (exists ((sll_circular_update_at_~data (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) sll_circular_update_at_~data)))) (= (store |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32))))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)))))))} is VALID [2018-11-23 11:16:20,628 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2536#(and (exists ((sll_circular_update_at_~data (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) sll_circular_update_at_~data)))) (= (store |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32))))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)))))))} {2515#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} #135#return; {2515#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:16:20,630 INFO L273 TraceCheckUtils]: 44: Hoare triple {2515#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {2515#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:16:20,633 INFO L273 TraceCheckUtils]: 45: Hoare triple {2515#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} assume !~bvsgt32(~i~0, 4294967295bv32); {2515#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:16:20,634 INFO L273 TraceCheckUtils]: 46: Hoare triple {2515#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} ~i~0 := ~bvsub32(~len~0, 1bv32); {2552#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:16:20,636 INFO L273 TraceCheckUtils]: 47: Hoare triple {2552#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {2556#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv3 32) main_~expected~0) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} is VALID [2018-11-23 11:16:20,640 INFO L256 TraceCheckUtils]: 48: Hoare triple {2556#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv3 32) main_~expected~0) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {2560#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32)))) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))))} is VALID [2018-11-23 11:16:20,642 INFO L273 TraceCheckUtils]: 49: Hoare triple {2560#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32)))) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2564#(and (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32)))) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))))))} is VALID [2018-11-23 11:16:20,644 INFO L273 TraceCheckUtils]: 50: Hoare triple {2564#(and (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32)))) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))))))} assume !!~bvsgt32(~index, 0bv32);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.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; {2568#(and (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32)))) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))))))} is VALID [2018-11-23 11:16:20,645 INFO L273 TraceCheckUtils]: 51: Hoare triple {2568#(and (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32)))) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))))))} assume !~bvsgt32(~index, 0bv32); {2568#(and (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32)))) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))))))} is VALID [2018-11-23 11:16:20,648 INFO L273 TraceCheckUtils]: 52: Hoare triple {2568#(and (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32)))) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))))))} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {2575#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) (_ bv4 32))) |sll_circular_get_data_at_#res|) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32)))) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))))))} is VALID [2018-11-23 11:16:20,650 INFO L273 TraceCheckUtils]: 53: Hoare triple {2575#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) (_ bv4 32))) |sll_circular_get_data_at_#res|) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32)))) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))))))} assume true; {2575#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) (_ bv4 32))) |sll_circular_get_data_at_#res|) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32)))) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))))))} is VALID [2018-11-23 11:16:20,653 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {2575#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) (_ bv4 32))) |sll_circular_get_data_at_#res|) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32)))) (not (= v_main_~s~0.base_BEFORE_CALL_3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32))))))} {2556#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv3 32) main_~expected~0) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} #137#return; {2582#(and (= (_ bv3 32) main_~expected~0) (= (bvadd |main_#t~ret16| (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:16:20,654 INFO L273 TraceCheckUtils]: 55: Hoare triple {2582#(and (= (_ bv3 32) main_~expected~0) (= (bvadd |main_#t~ret16| (_ bv4294967293 32)) (_ bv0 32)))} assume ~expected~0 != #t~ret16;havoc #t~ret16; {2388#false} is VALID [2018-11-23 11:16:20,654 INFO L273 TraceCheckUtils]: 56: Hoare triple {2388#false} assume !false; {2388#false} is VALID [2018-11-23 11:16:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:16:20,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:16:23,057 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 11:16:23,176 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 11:16:23,464 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 11:16:23,692 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-23 11:16:24,174 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:24,190 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:24,248 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:16:24,262 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:16:24,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:24,275 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:41 [2018-11-23 11:16:26,303 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:26,304 WARN L384 uantifierElimination]: Input elimination task: ∀ [v_sll_circular_update_at_~data_8, |v_#memory_$Pointer$.base_60|, |v_#memory_$Pointer$.offset_60|]. (let ((.cse1 (select |v_#memory_$Pointer$.offset_60| main_~s~0.base)) (.cse2 (select |v_#memory_$Pointer$.base_60| main_~s~0.base)) (.cse0 (bvadd main_~s~0.offset (_ bv4 32)))) (or (not (= (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) .cse0 (select .cse1 .cse0))) |v_#memory_$Pointer$.offset_60|)) (= (bvadd (bvmul (_ bv2 32) main_~len~0) (_ bv4294967295 32)) (select (select (store |#memory_int| main_~s~0.base (store (select |#memory_int| main_~s~0.base) .cse0 v_sll_circular_update_at_~data_8)) (select .cse2 main_~s~0.offset)) (bvadd (select .cse1 main_~s~0.offset) (_ bv4 32)))) (not (= (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) .cse0 (select .cse2 .cse0))) |v_#memory_$Pointer$.base_60|)))) [2018-11-23 11:16:26,304 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_sll_circular_update_at_~data_8, v_DerPreprocessor_2, v_DerPreprocessor_4]. (= (bvadd (bvmul (_ bv2 32) main_~len~0) (_ bv4294967295 32)) (let ((.cse0 (bvadd main_~s~0.offset (_ bv4 32)))) (select (select (store |#memory_int| main_~s~0.base (store (select |#memory_int| main_~s~0.base) .cse0 v_sll_circular_update_at_~data_8)) (select (store (select |#memory_$Pointer$.base| main_~s~0.base) .cse0 v_DerPreprocessor_2) main_~s~0.offset)) (bvadd (select (store (select |#memory_$Pointer$.offset| main_~s~0.base) .cse0 v_DerPreprocessor_4) main_~s~0.offset) (_ bv4 32))))) [2018-11-23 11:16:26,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:16:26,744 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:16:26,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:16:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:16:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:16:26,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:16:26,895 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:16:26,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:26,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:26,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:16:26,912 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:26,912 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_43|]. (and (= |#valid| (store |v_#valid_43| node_create_~temp~0.base (_ bv1 1))) (= node_create_~temp~0.offset (_ bv0 32))) [2018-11-23 11:16:26,912 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (= node_create_~temp~0.offset (_ bv0 32))) [2018-11-23 11:16:27,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:27,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:27,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 11:16:27,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:27,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:27,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-11-23 11:16:27,279 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:27,279 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_4|]. (and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (select |v_#valid_BEFORE_CALL_4| |sll_circular_create_#t~ret4.base|) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |v_#valid_BEFORE_CALL_4| sll_circular_create_~head~0.base) (_ bv1 1)))) [2018-11-23 11:16:27,280 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (not (= sll_circular_create_~head~0.base |sll_circular_create_#t~ret4.base|))) [2018-11-23 11:16:27,611 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 11 treesize of output 8 [2018-11-23 11:16:27,634 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 8 treesize of output 7 [2018-11-23 11:16:27,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:27,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:27,706 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 11 treesize of output 8 [2018-11-23 11:16:27,713 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 8 treesize of output 7 [2018-11-23 11:16:27,714 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:27,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:27,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:27,732 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-11-23 11:16:27,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-11-23 11:16:27,989 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 12 treesize of output 11 [2018-11-23 11:16:27,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:28,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:28,169 INFO L303 Elim1Store]: Index analysis took 103 ms [2018-11-23 11:16:28,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 11:16:28,219 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 12 treesize of output 11 [2018-11-23 11:16:28,247 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:28,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:28,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:28,471 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:38 [2018-11-23 11:16:28,504 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:28,504 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_62|, |v_#memory_$Pointer$.offset_62|, sll_circular_create_~last~0.offset]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_62| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|))) (and (= (select (select |v_#memory_$Pointer$.offset_62| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|) (_ bv0 32)) (not (= .cse0 |sll_circular_create_#res.base|)) (= (store |v_#memory_$Pointer$.offset_62| .cse0 (store (select |v_#memory_$Pointer$.offset_62| .cse0) sll_circular_create_~last~0.offset |sll_circular_create_#res.offset|)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_62| .cse0 (store (select |v_#memory_$Pointer$.base_62| .cse0) sll_circular_create_~last~0.offset |sll_circular_create_#res.base|))))) [2018-11-23 11:16:28,505 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [sll_circular_create_~last~0.offset]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|))) (and (= |sll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| .cse0) sll_circular_create_~last~0.offset)) (= |sll_circular_create_#res.offset| (select (select |#memory_$Pointer$.offset| .cse0) sll_circular_create_~last~0.offset)) (not (= .cse0 |sll_circular_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)))) [2018-11-23 11:16:29,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 25 treesize of output 18 [2018-11-23 11:16:29,957 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 18 treesize of output 17 [2018-11-23 11:16:29,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:29,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:30,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:30,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:104, output treesize:96 [2018-11-23 11:16:30,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 114 [2018-11-23 11:16:30,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 21 [2018-11-23 11:16:30,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 11:16:30,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:16:30,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 87 [2018-11-23 11:16:30,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 38 treesize of output 9 [2018-11-23 11:16:30,428 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:30,447 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:30,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 89 [2018-11-23 11:16:30,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 21 [2018-11-23 11:16:30,537 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-23 11:16:30,573 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:16:30,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:16:30,662 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:143, output treesize:109 [2018-11-23 11:16:33,100 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:33,100 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#memory_$Pointer$.base)_AFTER_CALL_35|, |v_old(#memory_$Pointer$.offset)_AFTER_CALL_35|, sll_circular_create_~last~0.offset]. (let ((.cse0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_35| main_~s~0.base) main_~s~0.offset)) (.cse2 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| main_~s~0.base) main_~s~0.offset))) (let ((.cse1 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| .cse2)) (.cse4 (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_35| .cse2)) (.cse3 (bvadd .cse0 (_ bv4 32)))) (and (= .cse0 (_ bv0 32)) (= (select .cse1 sll_circular_create_~last~0.offset) main_~s~0.base) (not (= .cse2 main_~s~0.base)) (= (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| .cse2 (store .cse1 .cse3 (select (select |#memory_$Pointer$.base| .cse2) .cse3))) |#memory_$Pointer$.base|) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (select .cse4 sll_circular_create_~last~0.offset)) (= (select (select |#memory_int| .cse2) .cse3) (bvadd main_~len~0 (bvneg (bvneg main_~len~0)) (_ bv4294967295 32))) (= (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_35| .cse2 (store .cse4 .cse3 (select (select |#memory_$Pointer$.offset| .cse2) .cse3))) |#memory_$Pointer$.offset|)))) [2018-11-23 11:16:33,101 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [sll_circular_create_~last~0.offset]. (let ((.cse4 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (.cse5 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))) (let ((.cse0 (= (select (select |#memory_int| .cse4) (bvadd .cse5 (_ bv4 32))) (bvadd main_~len~0 (bvneg (bvneg main_~len~0)) (_ bv4294967295 32)))) (.cse1 (not (= main_~s~0.base .cse4))) (.cse2 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse3 (= .cse5 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= (select (select |#memory_$Pointer$.base| .cse4) sll_circular_create_~last~0.offset) main_~s~0.base) (= (select (select |#memory_$Pointer$.offset| .cse4) sll_circular_create_~last~0.offset) main_~s~0.offset) .cse0 .cse1 .cse2 .cse3)))) [2018-11-23 11:16:33,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2018-11-23 11:16:33,734 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 10 treesize of output 9 [2018-11-23 11:16:33,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:33,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:33,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 51 treesize of output 44 [2018-11-23 11:16:33,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:33,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 44 treesize of output 38 [2018-11-23 11:16:33,986 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:34,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:34,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 50 treesize of output 43 [2018-11-23 11:16:34,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:34,080 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 43 treesize of output 37 [2018-11-23 11:16:34,084 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:34,102 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:34,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:34,137 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:95, output treesize:44 [2018-11-23 11:16:34,220 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:34,220 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#memory_$Pointer$.base)_AFTER_CALL_36|, |v_#memory_int_BEFORE_CALL_6|, |v_#memory_$Pointer$.offset_BEFORE_CALL_10|, sll_circular_update_at_~data]. (let ((.cse1 (select |v_#memory_$Pointer$.offset_BEFORE_CALL_10| main_~s~0.base)) (.cse3 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_36| main_~s~0.base))) (let ((.cse2 (bvadd main_~s~0.offset (_ bv4 32))) (.cse4 (select .cse3 main_~s~0.offset)) (.cse0 (select .cse1 main_~s~0.offset))) (and (= (_ bv0 32) .cse0) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_10| main_~s~0.base (store .cse1 .cse2 (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse2))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_36| main_~s~0.base (store .cse3 .cse2 (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse2)))) (not (= .cse4 main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (store |v_#memory_int_BEFORE_CALL_6| main_~s~0.base (store (select |v_#memory_int_BEFORE_CALL_6| main_~s~0.base) .cse2 sll_circular_update_at_~data)) |#memory_int|) (= (bvadd (select (select |v_#memory_int_BEFORE_CALL_6| .cse4) (bvadd .cse0 (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0))))) [2018-11-23 11:16:34,220 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (.cse1 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))) (and (not (= main_~s~0.base .cse0)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= .cse1 (_ bv0 32)) (= (bvadd (select (select |#memory_int| .cse0) (bvadd .cse1 (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))) [2018-11-23 11:16:36,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 52 [2018-11-23 11:16:36,240 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 48 treesize of output 29 [2018-11-23 11:16:36,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:36,284 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 29 treesize of output 18 [2018-11-23 11:16:36,286 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:36,323 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 25 treesize of output 5 [2018-11-23 11:16:36,324 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:36,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:36,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2018-11-23 11:16:36,401 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 15 treesize of output 10 [2018-11-23 11:16:36,403 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:36,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-23 11:16:36,440 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:36,445 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:36,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 11:16:36,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 15 [2018-11-23 11:16:36,503 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:36,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2018-11-23 11:16:36,555 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:36,558 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:36,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:36,565 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:87, output treesize:9 [2018-11-23 11:16:36,579 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:36,580 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, main_~s~0.base, main_~s~0.offset, |#memory_int|, |#memory_$Pointer$.offset|, v_main_~s~0.base_BEFORE_CALL_9, v_main_~s~0.offset_BEFORE_CALL_9]. (let ((.cse3 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (.cse4 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))) (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (.cse1 (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (.cse2 (select (select |#memory_int| .cse3) (bvadd .cse4 (_ bv4 32))))) (and (not (= .cse0 v_main_~s~0.base_BEFORE_CALL_9)) (= (_ bv0 32) .cse1) (= (bvadd .cse2 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| .cse0) (bvadd .cse1 (_ bv4 32)))) (not (= main_~s~0.base .cse3)) (= .cse2 |main_#t~ret16|) (= (_ bv3 32) main_~expected~0) (= .cse4 (_ bv0 32))))) [2018-11-23 11:16:36,580 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv0 32) (bvadd |main_#t~ret16| (_ bv4294967293 32))) (= (_ bv3 32) main_~expected~0)) [2018-11-23 11:16:36,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {2387#true} call ULTIMATE.init(); {2387#true} is VALID [2018-11-23 11:16:36,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {2387#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2387#true} is VALID [2018-11-23 11:16:36,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {2387#true} assume true; {2387#true} is VALID [2018-11-23 11:16:36,676 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2387#true} {2387#true} #145#return; {2387#true} is VALID [2018-11-23 11:16:36,676 INFO L256 TraceCheckUtils]: 4: Hoare triple {2387#true} call #t~ret17 := main(); {2387#true} is VALID [2018-11-23 11:16:36,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {2387#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2407#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:16:36,678 INFO L256 TraceCheckUtils]: 6: Hoare triple {2407#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {2387#true} is VALID [2018-11-23 11:16:36,678 INFO L273 TraceCheckUtils]: 7: Hoare triple {2387#true} ~len := #in~len;~data := #in~data; {2387#true} is VALID [2018-11-23 11:16:36,678 INFO L256 TraceCheckUtils]: 8: Hoare triple {2387#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {2387#true} is VALID [2018-11-23 11:16:36,679 INFO L273 TraceCheckUtils]: 9: Hoare triple {2387#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2420#(and (= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1)) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:16:36,680 INFO L273 TraceCheckUtils]: 10: Hoare triple {2420#(and (= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1)) (= node_create_~temp~0.offset (_ bv0 32)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2420#(and (= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1)) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:16:36,680 INFO L273 TraceCheckUtils]: 11: Hoare triple {2420#(and (= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1)) (= node_create_~temp~0.offset (_ bv0 32)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2427#(and (= (_ bv1 1) (select |#valid| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:16:36,681 INFO L273 TraceCheckUtils]: 12: Hoare triple {2427#(and (= (_ bv1 1) (select |#valid| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {2427#(and (= (_ bv1 1) (select |#valid| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:16:36,683 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {2427#(and (= (_ bv1 1) (select |#valid| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {2387#true} #141#return; {2434#(and (= |sll_circular_create_#t~ret3.offset| (_ bv0 32)) (= (bvadd (select |#valid| |sll_circular_create_#t~ret3.base|) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:16:36,684 INFO L273 TraceCheckUtils]: 14: Hoare triple {2434#(and (= |sll_circular_create_#t~ret3.offset| (_ bv0 32)) (= (bvadd (select |#valid| |sll_circular_create_#t~ret3.base|) (_ bv1 1)) (_ bv0 1)))} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {2438#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:16:36,685 INFO L273 TraceCheckUtils]: 15: Hoare triple {2438#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} assume !!~bvsgt32(~len, 1bv32); {2438#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:16:36,686 INFO L256 TraceCheckUtils]: 16: Hoare triple {2438#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2445#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:16:36,686 INFO L273 TraceCheckUtils]: 17: Hoare triple {2445#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2690#(= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))} is VALID [2018-11-23 11:16:36,687 INFO L273 TraceCheckUtils]: 18: Hoare triple {2690#(= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2690#(= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))} is VALID [2018-11-23 11:16:36,688 INFO L273 TraceCheckUtils]: 19: Hoare triple {2690#(= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2697#(= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|))} is VALID [2018-11-23 11:16:36,689 INFO L273 TraceCheckUtils]: 20: Hoare triple {2697#(= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|))} assume true; {2697#(= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|))} is VALID [2018-11-23 11:16:36,691 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2697#(= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|))} {2438#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} #143#return; {2704#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (not (= sll_circular_create_~head~0.base |sll_circular_create_#t~ret4.base|)))} is VALID [2018-11-23 11:16:36,693 INFO L273 TraceCheckUtils]: 22: Hoare triple {2704#(and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (not (= sll_circular_create_~head~0.base |sll_circular_create_#t~ret4.base|)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {2708#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} is VALID [2018-11-23 11:16:36,694 INFO L273 TraceCheckUtils]: 23: Hoare triple {2708#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} assume !~bvsgt32(~len, 1bv32); {2708#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} is VALID [2018-11-23 11:16:36,696 INFO L273 TraceCheckUtils]: 24: Hoare triple {2708#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {2715#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= |sll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)) sll_circular_create_~last~0.offset)) (= |sll_circular_create_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)) sll_circular_create_~last~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|) |sll_circular_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)))} is VALID [2018-11-23 11:16:36,697 INFO L273 TraceCheckUtils]: 25: Hoare triple {2715#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= |sll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)) sll_circular_create_~last~0.offset)) (= |sll_circular_create_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)) sll_circular_create_~last~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|) |sll_circular_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)))} assume true; {2715#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= |sll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)) sll_circular_create_~last~0.offset)) (= |sll_circular_create_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)) sll_circular_create_~last~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|) |sll_circular_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)))} is VALID [2018-11-23 11:16:36,701 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2715#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= |sll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)) sll_circular_create_~last~0.offset)) (= |sll_circular_create_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)) sll_circular_create_~last~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|) |sll_circular_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_create_#res.base|) |sll_circular_create_#res.offset|)))} {2407#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #133#return; {2722#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|)) sll_circular_create_~last~0.offset) |main_#t~ret13.base|) (= |main_#t~ret13.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|)) sll_circular_create_~last~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|) |main_#t~ret13.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_#t~ret13.base|) |main_#t~ret13.offset|)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:16:36,704 INFO L273 TraceCheckUtils]: 27: Hoare triple {2722#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|)) sll_circular_create_~last~0.offset) |main_#t~ret13.base|) (= |main_#t~ret13.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|)) sll_circular_create_~last~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|) |main_#t~ret13.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_#t~ret13.base|) |main_#t~ret13.offset|)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {2726#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} is VALID [2018-11-23 11:16:36,707 INFO L273 TraceCheckUtils]: 28: Hoare triple {2726#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2730#(and (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd (bvneg main_~len~0) main_~new_data~0)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} is VALID [2018-11-23 11:16:36,708 INFO L256 TraceCheckUtils]: 29: Hoare triple {2730#(and (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd (bvneg main_~len~0) main_~new_data~0)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2493#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:36,709 INFO L273 TraceCheckUtils]: 30: Hoare triple {2493#(and (= |#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; {2497#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:36,711 INFO L273 TraceCheckUtils]: 31: Hoare triple {2497#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !!~bvsgt32(~index, 0bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;#t~post12 := ~index;~index := ~bvsub32(#t~post12, 1bv32);havoc #t~post12; {2501#(and (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))} is VALID [2018-11-23 11:16:36,712 INFO L273 TraceCheckUtils]: 32: Hoare triple {2501#(and (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))} assume !~bvsgt32(~index, 0bv32); {2501#(and (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))} is VALID [2018-11-23 11:16:36,733 INFO L273 TraceCheckUtils]: 33: Hoare triple {2501#(and (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {2508#(and (= (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32)) (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.offset|) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))) |sll_circular_update_at_#in~data|))} is VALID [2018-11-23 11:16:36,734 INFO L273 TraceCheckUtils]: 34: Hoare triple {2508#(and (= (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32)) (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.offset|) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))) |sll_circular_update_at_#in~data|))} assume true; {2508#(and (= (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32)) (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.offset|) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))) |sll_circular_update_at_#in~data|))} is VALID [2018-11-23 11:16:36,737 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2508#(and (= (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32)) (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.offset|) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (_ bv4 32))) |sll_circular_update_at_#in~data|))} {2730#(and (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd (bvneg main_~len~0) main_~new_data~0)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) sll_circular_create_~last~0.offset) main_~s~0.base))) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} #135#return; {2752#(and (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:16:36,740 INFO L273 TraceCheckUtils]: 36: Hoare triple {2752#(and (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {2752#(and (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:16:36,741 INFO L273 TraceCheckUtils]: 37: Hoare triple {2752#(and (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2752#(and (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:16:36,743 INFO L256 TraceCheckUtils]: 38: Hoare triple {2752#(and (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2525#(and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:36,743 INFO L273 TraceCheckUtils]: 39: Hoare triple {2525#(and (= |old(#memory_int)| |#memory_int|) (= |#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; {2529#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:36,744 INFO L273 TraceCheckUtils]: 40: Hoare triple {2529#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !~bvsgt32(~index, 0bv32); {2529#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:36,788 INFO L273 TraceCheckUtils]: 41: Hoare triple {2529#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {2536#(and (exists ((sll_circular_update_at_~data (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) sll_circular_update_at_~data)))) (= (store |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32))))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)))))))} is VALID [2018-11-23 11:16:36,789 INFO L273 TraceCheckUtils]: 42: Hoare triple {2536#(and (exists ((sll_circular_update_at_~data (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) sll_circular_update_at_~data)))) (= (store |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32))))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)))))))} assume true; {2536#(and (exists ((sll_circular_update_at_~data (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) sll_circular_update_at_~data)))) (= (store |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32))))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)))))))} is VALID [2018-11-23 11:16:36,794 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2536#(and (exists ((sll_circular_update_at_~data (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) sll_circular_update_at_~data)))) (= (store |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32))))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)))))))} {2752#(and (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} #135#return; {2752#(and (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:16:36,796 INFO L273 TraceCheckUtils]: 44: Hoare triple {2752#(and (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {2752#(and (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:16:36,797 INFO L273 TraceCheckUtils]: 45: Hoare triple {2752#(and (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} assume !~bvsgt32(~i~0, 4294967295bv32); {2752#(and (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:16:36,798 INFO L273 TraceCheckUtils]: 46: Hoare triple {2752#(and (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} ~i~0 := ~bvsub32(~len~0, 1bv32); {2786#(and (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:16:36,802 INFO L273 TraceCheckUtils]: 47: Hoare triple {2786#(and (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {2790#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (_ bv3 32) main_~expected~0) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} is VALID [2018-11-23 11:16:36,805 INFO L256 TraceCheckUtils]: 48: Hoare triple {2790#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (_ bv3 32) main_~expected~0) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {2794#(exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_9 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) v_main_~s~0.base_BEFORE_CALL_9)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) (_ bv4 32))))))} is VALID [2018-11-23 11:16:36,807 INFO L273 TraceCheckUtils]: 49: Hoare triple {2794#(exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_9 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) v_main_~s~0.base_BEFORE_CALL_9)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) (_ bv4 32))))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2798#(and (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_9 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) v_main_~s~0.base_BEFORE_CALL_9)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) (_ bv4 32)))))))} is VALID [2018-11-23 11:16:36,808 INFO L273 TraceCheckUtils]: 50: Hoare triple {2798#(and (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_9 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) v_main_~s~0.base_BEFORE_CALL_9)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) (_ bv4 32)))))))} assume !!~bvsgt32(~index, 0bv32);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.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; {2802#(and (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_9 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) v_main_~s~0.base_BEFORE_CALL_9)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) (_ bv4 32)))))))} is VALID [2018-11-23 11:16:36,825 INFO L273 TraceCheckUtils]: 51: Hoare triple {2802#(and (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_9 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) v_main_~s~0.base_BEFORE_CALL_9)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) (_ bv4 32)))))))} assume !~bvsgt32(~index, 0bv32); {2802#(and (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_9 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) v_main_~s~0.base_BEFORE_CALL_9)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) (_ bv4 32)))))))} is VALID [2018-11-23 11:16:36,841 INFO L273 TraceCheckUtils]: 52: Hoare triple {2802#(and (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_9 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) v_main_~s~0.base_BEFORE_CALL_9)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) (_ bv4 32)))))))} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {2809#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) (_ bv4 32))) |sll_circular_get_data_at_#res|) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_9 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) v_main_~s~0.base_BEFORE_CALL_9)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) (_ bv4 32)))))))} is VALID [2018-11-23 11:16:36,856 INFO L273 TraceCheckUtils]: 53: Hoare triple {2809#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) (_ bv4 32))) |sll_circular_get_data_at_#res|) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_9 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) v_main_~s~0.base_BEFORE_CALL_9)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) (_ bv4 32)))))))} assume true; {2809#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) (_ bv4 32))) |sll_circular_get_data_at_#res|) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_9 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) v_main_~s~0.base_BEFORE_CALL_9)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) (_ bv4 32)))))))} is VALID [2018-11-23 11:16:36,871 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {2809#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) (_ bv4 32))) |sll_circular_get_data_at_#res|) (exists ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_9 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) v_main_~s~0.base_BEFORE_CALL_9)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9)) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_9) v_main_~s~0.offset_BEFORE_CALL_9) (_ bv4 32)))))))} {2790#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= (_ bv3 32) main_~expected~0) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32)))} #137#return; {2582#(and (= (_ bv3 32) main_~expected~0) (= (bvadd |main_#t~ret16| (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:16:36,887 INFO L273 TraceCheckUtils]: 55: Hoare triple {2582#(and (= (_ bv3 32) main_~expected~0) (= (bvadd |main_#t~ret16| (_ bv4294967293 32)) (_ bv0 32)))} assume ~expected~0 != #t~ret16;havoc #t~ret16; {2388#false} is VALID [2018-11-23 11:16:36,887 INFO L273 TraceCheckUtils]: 56: Hoare triple {2388#false} assume !false; {2388#false} is VALID [2018-11-23 11:16:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:16:36,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:16:39,936 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 11:16:40,050 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 11:16:40,324 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 11:16:40,556 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-23 11:16:40,859 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:40,874 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:40,944 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:16:40,956 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:16:40,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:40,986 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:78, output treesize:48 [2018-11-23 11:16:43,016 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:43,016 WARN L384 uantifierElimination]: Input elimination task: ∀ [v_sll_circular_update_at_~data_11, |v_#memory_$Pointer$.base_74|, |v_#memory_$Pointer$.offset_74|]. (let ((.cse1 (select |v_#memory_$Pointer$.base_74| main_~s~0.base)) (.cse2 (select |v_#memory_$Pointer$.offset_74| main_~s~0.base)) (.cse0 (bvadd main_~s~0.offset (_ bv4 32)))) (or (not (bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv4294967295 32))) (= (bvadd (bvmul (_ bv2 32) main_~len~0) (_ bv4294967295 32)) (select (select (store |#memory_int| main_~s~0.base (store (select |#memory_int| main_~s~0.base) .cse0 v_sll_circular_update_at_~data_11)) (select .cse1 main_~s~0.offset)) (bvadd (select .cse2 main_~s~0.offset) (_ bv4 32)))) (not (= |v_#memory_$Pointer$.base_74| (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) .cse0 (select .cse1 .cse0))))) (not (= |v_#memory_$Pointer$.offset_74| (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) .cse0 (select .cse2 .cse0))))))) [2018-11-23 11:16:43,016 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_sll_circular_update_at_~data_11, v_DerPreprocessor_8, v_DerPreprocessor_6]. (or (not (bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv4294967295 32))) (= (bvadd (bvmul (_ bv2 32) main_~len~0) (_ bv4294967295 32)) (let ((.cse0 (bvadd main_~s~0.offset (_ bv4 32)))) (select (select (store |#memory_int| main_~s~0.base (store (select |#memory_int| main_~s~0.base) .cse0 v_sll_circular_update_at_~data_11)) (select (store (select |#memory_$Pointer$.base| main_~s~0.base) .cse0 v_DerPreprocessor_8) main_~s~0.offset)) (bvadd (select (store (select |#memory_$Pointer$.offset| main_~s~0.base) .cse0 v_DerPreprocessor_6) main_~s~0.offset) (_ bv4 32)))))) [2018-11-23 11:16:43,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:16:43,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 46 [2018-11-23 11:16:43,396 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 57 [2018-11-23 11:16:43,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:16:43,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 11:16:43,704 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:16:43,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 11:16:43,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 11:16:43,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2969, Unknown=26, NotChecked=0, Total=3192 [2018-11-23 11:16:43,707 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 46 states. [2018-11-23 11:18:17,003 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 32