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/dll2c_update_all_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:12:04,429 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:12:04,432 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:12:04,446 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:12:04,446 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:12:04,447 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:12:04,449 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:12:04,450 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:12:04,452 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:12:04,453 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:12:04,454 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:12:04,454 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:12:04,455 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:12:04,459 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:12:04,460 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:12:04,466 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:12:04,467 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:12:04,471 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:12:04,473 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:12:04,477 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:12:04,478 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:12:04,482 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:12:04,485 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:12:04,486 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:12:04,486 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:12:04,487 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:12:04,488 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:12:04,488 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:12:04,490 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:12:04,491 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:12:04,492 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:12:04,492 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:12:04,492 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:12:04,493 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:12:04,495 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:12:04,496 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:12:04,497 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:12:04,527 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:12:04,527 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:12:04,530 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:12:04,531 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:12:04,532 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:12:04,532 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:12:04,532 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:12:04,533 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:12:04,534 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:12:04,534 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:12:04,534 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:12:04,534 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:12:04,534 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:12:04,535 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:12:04,535 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:12:04,535 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:12:04,535 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:12:04,535 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:12:04,536 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:12:04,537 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:12:04,537 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:12:04,537 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:12:04,537 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:12:04,538 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:12:04,538 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:12:04,538 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:12:04,538 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:12:04,538 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:12:04,538 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:12:04,539 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:12:04,539 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:12:04,539 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:12:04,539 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:12:04,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:12:04,612 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:12:04,617 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:12:04,619 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:12:04,619 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:12:04,620 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:12:04,687 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f7b033bd/4ccd4d7b1d674885ac71f08ba5e7f558/FLAG4318a644e [2018-11-23 11:12:05,239 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:12:05,240 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:12:05,259 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f7b033bd/4ccd4d7b1d674885ac71f08ba5e7f558/FLAG4318a644e [2018-11-23 11:12:05,515 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f7b033bd/4ccd4d7b1d674885ac71f08ba5e7f558 [2018-11-23 11:12:05,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:12:05,526 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:12:05,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:12:05,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:12:05,531 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:12:05,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:12:05" (1/1) ... [2018-11-23 11:12:05,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@292b7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:05, skipping insertion in model container [2018-11-23 11:12:05,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:12:05" (1/1) ... [2018-11-23 11:12:05,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:12:05,612 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:12:06,070 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:12:06,090 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:12:06,202 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:12:06,361 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:12:06,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:06 WrapperNode [2018-11-23 11:12:06,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:12:06,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:12:06,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:12:06,363 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:12:06,371 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:12:06" (1/1) ... [2018-11-23 11:12:06,391 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:12:06" (1/1) ... [2018-11-23 11:12:06,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:12:06,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:12:06,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:12:06,403 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:12:06,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:06" (1/1) ... [2018-11-23 11:12:06,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:06" (1/1) ... [2018-11-23 11:12:06,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:06" (1/1) ... [2018-11-23 11:12:06,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:06" (1/1) ... [2018-11-23 11:12:06,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:06" (1/1) ... [2018-11-23 11:12:06,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:06" (1/1) ... [2018-11-23 11:12:06,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:06" (1/1) ... [2018-11-23 11:12:06,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:12:06,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:12:06,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:12:06,479 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:12:06,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:06" (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:12:06,542 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2018-11-23 11:12:06,542 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2018-11-23 11:12:06,542 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-11-23 11:12:06,542 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-11-23 11:12:06,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:12:06,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:12:06,543 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2018-11-23 11:12:06,545 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2018-11-23 11:12:06,545 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:12:06,545 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:12:06,545 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 11:12:06,546 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 11:12:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:12:06,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:12:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:12:06,547 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:12:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:12:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:12:06,548 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-11-23 11:12:06,548 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-11-23 11:12:06,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:12:06,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:12:06,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:12:06,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:12:07,737 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:12:07,737 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 11:12:07,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:12:07 BoogieIcfgContainer [2018-11-23 11:12:07,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:12:07,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:12:07,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:12:07,742 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:12:07,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:12:05" (1/3) ... [2018-11-23 11:12:07,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c75f458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:12:07, skipping insertion in model container [2018-11-23 11:12:07,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:06" (2/3) ... [2018-11-23 11:12:07,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c75f458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:12:07, skipping insertion in model container [2018-11-23 11:12:07,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:12:07" (3/3) ... [2018-11-23 11:12:07,746 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:12:07,756 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:12:07,766 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:12:07,784 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:12:07,815 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:12:07,816 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:12:07,816 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:12:07,816 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:12:07,816 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:12:07,816 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:12:07,816 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:12:07,816 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:12:07,816 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:12:07,833 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-11-23 11:12:07,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:12:07,842 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:07,843 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:12:07,846 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:07,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:07,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1202603355, now seen corresponding path program 1 times [2018-11-23 11:12:07,856 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:07,857 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:12:07,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:12:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:08,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:08,531 INFO L256 TraceCheckUtils]: 0: Hoare triple {62#true} call ULTIMATE.init(); {62#true} is VALID [2018-11-23 11:12:08,535 INFO L273 TraceCheckUtils]: 1: Hoare triple {62#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {62#true} is VALID [2018-11-23 11:12:08,536 INFO L273 TraceCheckUtils]: 2: Hoare triple {62#true} assume true; {62#true} is VALID [2018-11-23 11:12:08,536 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {62#true} {62#true} #152#return; {62#true} is VALID [2018-11-23 11:12:08,537 INFO L256 TraceCheckUtils]: 4: Hoare triple {62#true} call #t~ret17 := main(); {62#true} is VALID [2018-11-23 11:12:08,538 INFO L273 TraceCheckUtils]: 5: Hoare triple {62#true} ~len~0 := 2bv32;~data~0 := 1bv32; {82#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:08,539 INFO L256 TraceCheckUtils]: 6: Hoare triple {82#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {62#true} is VALID [2018-11-23 11:12:08,540 INFO L273 TraceCheckUtils]: 7: Hoare triple {62#true} ~len := #in~len;~data := #in~data; {89#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-23 11:12:08,540 INFO L256 TraceCheckUtils]: 8: Hoare triple {89#(= |dll_circular_create_#in~len| dll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {62#true} is VALID [2018-11-23 11:12:08,540 INFO L273 TraceCheckUtils]: 9: Hoare triple {62#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {62#true} is VALID [2018-11-23 11:12:08,541 INFO L273 TraceCheckUtils]: 10: Hoare triple {62#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {62#true} is VALID [2018-11-23 11:12:08,541 INFO L273 TraceCheckUtils]: 11: Hoare triple {62#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {62#true} is VALID [2018-11-23 11:12:08,541 INFO L273 TraceCheckUtils]: 12: Hoare triple {62#true} assume true; {62#true} is VALID [2018-11-23 11:12:08,556 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {62#true} {89#(= |dll_circular_create_#in~len| dll_circular_create_~len)} #148#return; {89#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-23 11:12:08,570 INFO L273 TraceCheckUtils]: 14: Hoare triple {89#(= |dll_circular_create_#in~len| dll_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; {89#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-23 11:12:08,585 INFO L273 TraceCheckUtils]: 15: Hoare triple {89#(= |dll_circular_create_#in~len| dll_circular_create_~len)} assume !~bvsgt32(~len, 1bv32); {114#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-23 11:12:08,601 INFO L273 TraceCheckUtils]: 16: Hoare triple {114#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {114#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-23 11:12:08,606 INFO L273 TraceCheckUtils]: 17: Hoare triple {114#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} assume true; {114#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-23 11:12:08,607 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {114#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} {82#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #140#return; {63#false} is VALID [2018-11-23 11:12:08,608 INFO L273 TraceCheckUtils]: 19: Hoare triple {63#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 := 0bv32; {63#false} is VALID [2018-11-23 11:12:08,608 INFO L273 TraceCheckUtils]: 20: Hoare triple {63#false} assume !~bvslt32(~i~0, ~len~0); {63#false} is VALID [2018-11-23 11:12:08,609 INFO L273 TraceCheckUtils]: 21: Hoare triple {63#false} ~i~0 := 0bv32; {63#false} is VALID [2018-11-23 11:12:08,609 INFO L273 TraceCheckUtils]: 22: Hoare triple {63#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {63#false} is VALID [2018-11-23 11:12:08,609 INFO L256 TraceCheckUtils]: 23: Hoare triple {63#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {63#false} is VALID [2018-11-23 11:12:08,609 INFO L273 TraceCheckUtils]: 24: Hoare triple {63#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {63#false} is VALID [2018-11-23 11:12:08,610 INFO L273 TraceCheckUtils]: 25: Hoare triple {63#false} assume !~bvsgt32(~index, 0bv32); {63#false} is VALID [2018-11-23 11:12:08,610 INFO L273 TraceCheckUtils]: 26: Hoare triple {63#false} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {63#false} is VALID [2018-11-23 11:12:08,610 INFO L273 TraceCheckUtils]: 27: Hoare triple {63#false} assume true; {63#false} is VALID [2018-11-23 11:12:08,610 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {63#false} {63#false} #144#return; {63#false} is VALID [2018-11-23 11:12:08,611 INFO L273 TraceCheckUtils]: 29: Hoare triple {63#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {63#false} is VALID [2018-11-23 11:12:08,611 INFO L273 TraceCheckUtils]: 30: Hoare triple {63#false} assume !false; {63#false} is VALID [2018-11-23 11:12:08,619 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:12:08,619 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:12:08,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:12:08,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:12:08,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 11:12:08,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:12:08,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:12:08,866 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:12:08,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:12:08,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:12:08,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:12:08,882 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 5 states. [2018-11-23 11:12:10,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:10,642 INFO L93 Difference]: Finished difference Result 103 states and 137 transitions. [2018-11-23 11:12:10,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:12:10,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 11:12:10,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:12:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:12:10,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2018-11-23 11:12:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:12:10,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2018-11-23 11:12:10,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 137 transitions. [2018-11-23 11:12:11,047 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:11,062 INFO L225 Difference]: With dead ends: 103 [2018-11-23 11:12:11,062 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 11:12:11,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:12:11,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 11:12:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-11-23 11:12:11,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:12:11,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 45 states. [2018-11-23 11:12:11,388 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 45 states. [2018-11-23 11:12:11,388 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 45 states. [2018-11-23 11:12:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:11,398 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-23 11:12:11,399 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-11-23 11:12:11,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:11,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:11,400 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 49 states. [2018-11-23 11:12:11,400 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 49 states. [2018-11-23 11:12:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:11,406 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-23 11:12:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-11-23 11:12:11,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:11,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:11,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:12:11,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:12:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:12:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-11-23 11:12:11,414 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 31 [2018-11-23 11:12:11,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:12:11,414 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-11-23 11:12:11,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:12:11,415 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 11:12:11,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:12:11,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:11,417 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] [2018-11-23 11:12:11,417 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:11,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:11,418 INFO L82 PathProgramCache]: Analyzing trace with hash -745395055, now seen corresponding path program 1 times [2018-11-23 11:12:11,419 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:11,419 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:12:11,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:12:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:11,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:11,686 INFO L256 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {466#true} is VALID [2018-11-23 11:12:11,686 INFO L273 TraceCheckUtils]: 1: Hoare triple {466#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {466#true} is VALID [2018-11-23 11:12:11,687 INFO L273 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2018-11-23 11:12:11,687 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #152#return; {466#true} is VALID [2018-11-23 11:12:11,688 INFO L256 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret17 := main(); {466#true} is VALID [2018-11-23 11:12:11,693 INFO L273 TraceCheckUtils]: 5: Hoare triple {466#true} ~len~0 := 2bv32;~data~0 := 1bv32; {486#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:11,694 INFO L256 TraceCheckUtils]: 6: Hoare triple {486#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {466#true} is VALID [2018-11-23 11:12:11,694 INFO L273 TraceCheckUtils]: 7: Hoare triple {466#true} ~len := #in~len;~data := #in~data; {466#true} is VALID [2018-11-23 11:12:11,694 INFO L256 TraceCheckUtils]: 8: Hoare triple {466#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {466#true} is VALID [2018-11-23 11:12:11,694 INFO L273 TraceCheckUtils]: 9: Hoare triple {466#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {466#true} is VALID [2018-11-23 11:12:11,695 INFO L273 TraceCheckUtils]: 10: Hoare triple {466#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {466#true} is VALID [2018-11-23 11:12:11,695 INFO L273 TraceCheckUtils]: 11: Hoare triple {466#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {466#true} is VALID [2018-11-23 11:12:11,695 INFO L273 TraceCheckUtils]: 12: Hoare triple {466#true} assume true; {466#true} is VALID [2018-11-23 11:12:11,695 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {466#true} {466#true} #148#return; {466#true} is VALID [2018-11-23 11:12:11,696 INFO L273 TraceCheckUtils]: 14: Hoare triple {466#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; {466#true} is VALID [2018-11-23 11:12:11,696 INFO L273 TraceCheckUtils]: 15: Hoare triple {466#true} assume !!~bvsgt32(~len, 1bv32); {466#true} is VALID [2018-11-23 11:12:11,696 INFO L256 TraceCheckUtils]: 16: Hoare triple {466#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {466#true} is VALID [2018-11-23 11:12:11,697 INFO L273 TraceCheckUtils]: 17: Hoare triple {466#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {466#true} is VALID [2018-11-23 11:12:11,697 INFO L273 TraceCheckUtils]: 18: Hoare triple {466#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {466#true} is VALID [2018-11-23 11:12:11,697 INFO L273 TraceCheckUtils]: 19: Hoare triple {466#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {466#true} is VALID [2018-11-23 11:12:11,698 INFO L273 TraceCheckUtils]: 20: Hoare triple {466#true} assume true; {466#true} is VALID [2018-11-23 11:12:11,698 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {466#true} {466#true} #150#return; {466#true} is VALID [2018-11-23 11:12:11,698 INFO L273 TraceCheckUtils]: 22: Hoare triple {466#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); {466#true} is VALID [2018-11-23 11:12:11,699 INFO L273 TraceCheckUtils]: 23: Hoare triple {466#true} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32); {466#true} is VALID [2018-11-23 11:12:11,699 INFO L273 TraceCheckUtils]: 24: Hoare triple {466#true} ~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; {466#true} is VALID [2018-11-23 11:12:11,699 INFO L273 TraceCheckUtils]: 25: Hoare triple {466#true} assume !~bvsgt32(~len, 1bv32); {466#true} is VALID [2018-11-23 11:12:11,700 INFO L273 TraceCheckUtils]: 26: Hoare triple {466#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {466#true} is VALID [2018-11-23 11:12:11,700 INFO L273 TraceCheckUtils]: 27: Hoare triple {466#true} assume true; {466#true} is VALID [2018-11-23 11:12:11,702 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {466#true} {486#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #140#return; {486#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:11,703 INFO L273 TraceCheckUtils]: 29: Hoare triple {486#(= (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 := 0bv32; {559#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:11,707 INFO L273 TraceCheckUtils]: 30: Hoare triple {559#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~len~0); {467#false} is VALID [2018-11-23 11:12:11,707 INFO L273 TraceCheckUtils]: 31: Hoare triple {467#false} ~i~0 := 0bv32; {467#false} is VALID [2018-11-23 11:12:11,707 INFO L273 TraceCheckUtils]: 32: Hoare triple {467#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {467#false} is VALID [2018-11-23 11:12:11,708 INFO L256 TraceCheckUtils]: 33: Hoare triple {467#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {467#false} is VALID [2018-11-23 11:12:11,708 INFO L273 TraceCheckUtils]: 34: Hoare triple {467#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {467#false} is VALID [2018-11-23 11:12:11,708 INFO L273 TraceCheckUtils]: 35: Hoare triple {467#false} assume !~bvsgt32(~index, 0bv32); {467#false} is VALID [2018-11-23 11:12:11,709 INFO L273 TraceCheckUtils]: 36: Hoare triple {467#false} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {467#false} is VALID [2018-11-23 11:12:11,709 INFO L273 TraceCheckUtils]: 37: Hoare triple {467#false} assume true; {467#false} is VALID [2018-11-23 11:12:11,709 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {467#false} {467#false} #144#return; {467#false} is VALID [2018-11-23 11:12:11,710 INFO L273 TraceCheckUtils]: 39: Hoare triple {467#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {467#false} is VALID [2018-11-23 11:12:11,710 INFO L273 TraceCheckUtils]: 40: Hoare triple {467#false} assume !false; {467#false} is VALID [2018-11-23 11:12:11,712 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:12:11,713 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:12:11,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:12:11,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:12:11,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-23 11:12:11,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:12:11,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:12:11,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:11,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:12:11,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:12:11,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:12:11,807 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 4 states. [2018-11-23 11:12:12,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:12,361 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2018-11-23 11:12:12,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:12:12,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-23 11:12:12,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:12:12,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:12:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2018-11-23 11:12:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:12:12,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2018-11-23 11:12:12,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 75 transitions. [2018-11-23 11:12:12,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:12,531 INFO L225 Difference]: With dead ends: 66 [2018-11-23 11:12:12,531 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 11:12:12,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:12:12,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 11:12:12,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-11-23 11:12:12,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:12:12,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 46 states. [2018-11-23 11:12:12,575 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 46 states. [2018-11-23 11:12:12,575 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 46 states. [2018-11-23 11:12:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:12,580 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 11:12:12,580 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-23 11:12:12,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:12,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:12,581 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 54 states. [2018-11-23 11:12:12,582 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 54 states. [2018-11-23 11:12:12,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:12,587 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 11:12:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-23 11:12:12,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:12,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:12,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:12:12,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:12:12,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:12:12,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-11-23 11:12:12,592 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 41 [2018-11-23 11:12:12,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:12:12,592 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-11-23 11:12:12,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:12:12,593 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-23 11:12:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 11:12:12,595 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:12,595 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, 1] [2018-11-23 11:12:12,595 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:12,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:12,596 INFO L82 PathProgramCache]: Analyzing trace with hash -558481625, now seen corresponding path program 1 times [2018-11-23 11:12:12,596 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:12,597 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:12:12,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:12:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:12,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:12,890 INFO L256 TraceCheckUtils]: 0: Hoare triple {863#true} call ULTIMATE.init(); {863#true} is VALID [2018-11-23 11:12:12,890 INFO L273 TraceCheckUtils]: 1: Hoare triple {863#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {863#true} is VALID [2018-11-23 11:12:12,891 INFO L273 TraceCheckUtils]: 2: Hoare triple {863#true} assume true; {863#true} is VALID [2018-11-23 11:12:12,891 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {863#true} {863#true} #152#return; {863#true} is VALID [2018-11-23 11:12:12,891 INFO L256 TraceCheckUtils]: 4: Hoare triple {863#true} call #t~ret17 := main(); {863#true} is VALID [2018-11-23 11:12:12,898 INFO L273 TraceCheckUtils]: 5: Hoare triple {863#true} ~len~0 := 2bv32;~data~0 := 1bv32; {883#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:12,899 INFO L256 TraceCheckUtils]: 6: Hoare triple {883#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {863#true} is VALID [2018-11-23 11:12:12,899 INFO L273 TraceCheckUtils]: 7: Hoare triple {863#true} ~len := #in~len;~data := #in~data; {863#true} is VALID [2018-11-23 11:12:12,899 INFO L256 TraceCheckUtils]: 8: Hoare triple {863#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {863#true} is VALID [2018-11-23 11:12:12,900 INFO L273 TraceCheckUtils]: 9: Hoare triple {863#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {863#true} is VALID [2018-11-23 11:12:12,900 INFO L273 TraceCheckUtils]: 10: Hoare triple {863#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {863#true} is VALID [2018-11-23 11:12:12,900 INFO L273 TraceCheckUtils]: 11: Hoare triple {863#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {863#true} is VALID [2018-11-23 11:12:12,900 INFO L273 TraceCheckUtils]: 12: Hoare triple {863#true} assume true; {863#true} is VALID [2018-11-23 11:12:12,900 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {863#true} {863#true} #148#return; {863#true} is VALID [2018-11-23 11:12:12,901 INFO L273 TraceCheckUtils]: 14: Hoare triple {863#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; {863#true} is VALID [2018-11-23 11:12:12,901 INFO L273 TraceCheckUtils]: 15: Hoare triple {863#true} assume !!~bvsgt32(~len, 1bv32); {863#true} is VALID [2018-11-23 11:12:12,901 INFO L256 TraceCheckUtils]: 16: Hoare triple {863#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {863#true} is VALID [2018-11-23 11:12:12,902 INFO L273 TraceCheckUtils]: 17: Hoare triple {863#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {863#true} is VALID [2018-11-23 11:12:12,902 INFO L273 TraceCheckUtils]: 18: Hoare triple {863#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {863#true} is VALID [2018-11-23 11:12:12,902 INFO L273 TraceCheckUtils]: 19: Hoare triple {863#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {863#true} is VALID [2018-11-23 11:12:12,902 INFO L273 TraceCheckUtils]: 20: Hoare triple {863#true} assume true; {863#true} is VALID [2018-11-23 11:12:12,903 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {863#true} {863#true} #150#return; {863#true} is VALID [2018-11-23 11:12:12,903 INFO L273 TraceCheckUtils]: 22: Hoare triple {863#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); {863#true} is VALID [2018-11-23 11:12:12,903 INFO L273 TraceCheckUtils]: 23: Hoare triple {863#true} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32); {863#true} is VALID [2018-11-23 11:12:12,904 INFO L273 TraceCheckUtils]: 24: Hoare triple {863#true} ~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; {863#true} is VALID [2018-11-23 11:12:12,904 INFO L273 TraceCheckUtils]: 25: Hoare triple {863#true} assume !~bvsgt32(~len, 1bv32); {863#true} is VALID [2018-11-23 11:12:12,904 INFO L273 TraceCheckUtils]: 26: Hoare triple {863#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {863#true} is VALID [2018-11-23 11:12:12,904 INFO L273 TraceCheckUtils]: 27: Hoare triple {863#true} assume true; {863#true} is VALID [2018-11-23 11:12:12,905 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {863#true} {883#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #140#return; {883#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:12,910 INFO L273 TraceCheckUtils]: 29: Hoare triple {883#(= (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 := 0bv32; {956#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:12,912 INFO L273 TraceCheckUtils]: 30: Hoare triple {956#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {956#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:12,912 INFO L256 TraceCheckUtils]: 31: Hoare triple {956#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {863#true} is VALID [2018-11-23 11:12:12,912 INFO L273 TraceCheckUtils]: 32: Hoare triple {863#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {863#true} is VALID [2018-11-23 11:12:12,913 INFO L273 TraceCheckUtils]: 33: Hoare triple {863#true} assume !~bvsgt32(~index, 0bv32); {863#true} is VALID [2018-11-23 11:12:12,913 INFO L273 TraceCheckUtils]: 34: Hoare triple {863#true} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32); {863#true} is VALID [2018-11-23 11:12:12,913 INFO L273 TraceCheckUtils]: 35: Hoare triple {863#true} assume true; {863#true} is VALID [2018-11-23 11:12:12,919 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {863#true} {956#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #142#return; {956#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:12,924 INFO L273 TraceCheckUtils]: 37: Hoare triple {956#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {981#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:12,927 INFO L273 TraceCheckUtils]: 38: Hoare triple {981#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~len~0); {864#false} is VALID [2018-11-23 11:12:12,927 INFO L273 TraceCheckUtils]: 39: Hoare triple {864#false} ~i~0 := 0bv32; {864#false} is VALID [2018-11-23 11:12:12,928 INFO L273 TraceCheckUtils]: 40: Hoare triple {864#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {864#false} is VALID [2018-11-23 11:12:12,928 INFO L256 TraceCheckUtils]: 41: Hoare triple {864#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {864#false} is VALID [2018-11-23 11:12:12,928 INFO L273 TraceCheckUtils]: 42: Hoare triple {864#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {864#false} is VALID [2018-11-23 11:12:12,928 INFO L273 TraceCheckUtils]: 43: Hoare triple {864#false} assume !~bvsgt32(~index, 0bv32); {864#false} is VALID [2018-11-23 11:12:12,929 INFO L273 TraceCheckUtils]: 44: Hoare triple {864#false} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {864#false} is VALID [2018-11-23 11:12:12,929 INFO L273 TraceCheckUtils]: 45: Hoare triple {864#false} assume true; {864#false} is VALID [2018-11-23 11:12:12,929 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {864#false} {864#false} #144#return; {864#false} is VALID [2018-11-23 11:12:12,930 INFO L273 TraceCheckUtils]: 47: Hoare triple {864#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {864#false} is VALID [2018-11-23 11:12:12,930 INFO L273 TraceCheckUtils]: 48: Hoare triple {864#false} assume !false; {864#false} is VALID [2018-11-23 11:12:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:12:12,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:12:13,218 INFO L273 TraceCheckUtils]: 48: Hoare triple {864#false} assume !false; {864#false} is VALID [2018-11-23 11:12:13,219 INFO L273 TraceCheckUtils]: 47: Hoare triple {864#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {864#false} is VALID [2018-11-23 11:12:13,219 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {863#true} {864#false} #144#return; {864#false} is VALID [2018-11-23 11:12:13,220 INFO L273 TraceCheckUtils]: 45: Hoare triple {863#true} assume true; {863#true} is VALID [2018-11-23 11:12:13,220 INFO L273 TraceCheckUtils]: 44: Hoare triple {863#true} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {863#true} is VALID [2018-11-23 11:12:13,220 INFO L273 TraceCheckUtils]: 43: Hoare triple {863#true} assume !~bvsgt32(~index, 0bv32); {863#true} is VALID [2018-11-23 11:12:13,221 INFO L273 TraceCheckUtils]: 42: Hoare triple {863#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {863#true} is VALID [2018-11-23 11:12:13,221 INFO L256 TraceCheckUtils]: 41: Hoare triple {864#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {863#true} is VALID [2018-11-23 11:12:13,221 INFO L273 TraceCheckUtils]: 40: Hoare triple {864#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {864#false} is VALID [2018-11-23 11:12:13,222 INFO L273 TraceCheckUtils]: 39: Hoare triple {864#false} ~i~0 := 0bv32; {864#false} is VALID [2018-11-23 11:12:13,224 INFO L273 TraceCheckUtils]: 38: Hoare triple {1045#(bvslt main_~i~0 main_~len~0)} assume !~bvslt32(~i~0, ~len~0); {864#false} is VALID [2018-11-23 11:12:13,225 INFO L273 TraceCheckUtils]: 37: Hoare triple {1049#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1045#(bvslt main_~i~0 main_~len~0)} is VALID [2018-11-23 11:12:13,226 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {863#true} {1049#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} #142#return; {1049#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-23 11:12:13,227 INFO L273 TraceCheckUtils]: 35: Hoare triple {863#true} assume true; {863#true} is VALID [2018-11-23 11:12:13,227 INFO L273 TraceCheckUtils]: 34: Hoare triple {863#true} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32); {863#true} is VALID [2018-11-23 11:12:13,227 INFO L273 TraceCheckUtils]: 33: Hoare triple {863#true} assume !~bvsgt32(~index, 0bv32); {863#true} is VALID [2018-11-23 11:12:13,227 INFO L273 TraceCheckUtils]: 32: Hoare triple {863#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {863#true} is VALID [2018-11-23 11:12:13,228 INFO L256 TraceCheckUtils]: 31: Hoare triple {1049#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {863#true} is VALID [2018-11-23 11:12:13,229 INFO L273 TraceCheckUtils]: 30: Hoare triple {1049#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1049#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-23 11:12:13,229 INFO L273 TraceCheckUtils]: 29: Hoare triple {1074#(bvslt (_ bv1 32) main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := 0bv32; {1049#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-23 11:12:13,230 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {863#true} {1074#(bvslt (_ bv1 32) main_~len~0)} #140#return; {1074#(bvslt (_ bv1 32) main_~len~0)} is VALID [2018-11-23 11:12:13,230 INFO L273 TraceCheckUtils]: 27: Hoare triple {863#true} assume true; {863#true} is VALID [2018-11-23 11:12:13,231 INFO L273 TraceCheckUtils]: 26: Hoare triple {863#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {863#true} is VALID [2018-11-23 11:12:13,231 INFO L273 TraceCheckUtils]: 25: Hoare triple {863#true} assume !~bvsgt32(~len, 1bv32); {863#true} is VALID [2018-11-23 11:12:13,231 INFO L273 TraceCheckUtils]: 24: Hoare triple {863#true} ~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; {863#true} is VALID [2018-11-23 11:12:13,231 INFO L273 TraceCheckUtils]: 23: Hoare triple {863#true} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32); {863#true} is VALID [2018-11-23 11:12:13,231 INFO L273 TraceCheckUtils]: 22: Hoare triple {863#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); {863#true} is VALID [2018-11-23 11:12:13,232 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {863#true} {863#true} #150#return; {863#true} is VALID [2018-11-23 11:12:13,232 INFO L273 TraceCheckUtils]: 20: Hoare triple {863#true} assume true; {863#true} is VALID [2018-11-23 11:12:13,232 INFO L273 TraceCheckUtils]: 19: Hoare triple {863#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {863#true} is VALID [2018-11-23 11:12:13,232 INFO L273 TraceCheckUtils]: 18: Hoare triple {863#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {863#true} is VALID [2018-11-23 11:12:13,233 INFO L273 TraceCheckUtils]: 17: Hoare triple {863#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {863#true} is VALID [2018-11-23 11:12:13,233 INFO L256 TraceCheckUtils]: 16: Hoare triple {863#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {863#true} is VALID [2018-11-23 11:12:13,233 INFO L273 TraceCheckUtils]: 15: Hoare triple {863#true} assume !!~bvsgt32(~len, 1bv32); {863#true} is VALID [2018-11-23 11:12:13,233 INFO L273 TraceCheckUtils]: 14: Hoare triple {863#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; {863#true} is VALID [2018-11-23 11:12:13,234 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {863#true} {863#true} #148#return; {863#true} is VALID [2018-11-23 11:12:13,234 INFO L273 TraceCheckUtils]: 12: Hoare triple {863#true} assume true; {863#true} is VALID [2018-11-23 11:12:13,234 INFO L273 TraceCheckUtils]: 11: Hoare triple {863#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {863#true} is VALID [2018-11-23 11:12:13,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {863#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {863#true} is VALID [2018-11-23 11:12:13,235 INFO L273 TraceCheckUtils]: 9: Hoare triple {863#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {863#true} is VALID [2018-11-23 11:12:13,235 INFO L256 TraceCheckUtils]: 8: Hoare triple {863#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {863#true} is VALID [2018-11-23 11:12:13,235 INFO L273 TraceCheckUtils]: 7: Hoare triple {863#true} ~len := #in~len;~data := #in~data; {863#true} is VALID [2018-11-23 11:12:13,235 INFO L256 TraceCheckUtils]: 6: Hoare triple {1074#(bvslt (_ bv1 32) main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {863#true} is VALID [2018-11-23 11:12:13,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {863#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1074#(bvslt (_ bv1 32) main_~len~0)} is VALID [2018-11-23 11:12:13,236 INFO L256 TraceCheckUtils]: 4: Hoare triple {863#true} call #t~ret17 := main(); {863#true} is VALID [2018-11-23 11:12:13,236 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {863#true} {863#true} #152#return; {863#true} is VALID [2018-11-23 11:12:13,237 INFO L273 TraceCheckUtils]: 2: Hoare triple {863#true} assume true; {863#true} is VALID [2018-11-23 11:12:13,237 INFO L273 TraceCheckUtils]: 1: Hoare triple {863#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {863#true} is VALID [2018-11-23 11:12:13,237 INFO L256 TraceCheckUtils]: 0: Hoare triple {863#true} call ULTIMATE.init(); {863#true} is VALID [2018-11-23 11:12:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:12:13,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:12:13,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:12:13,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-23 11:12:13,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:12:13,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:12:13,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:13,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:12:13,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:12:13,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:12:13,409 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 8 states. [2018-11-23 11:12:14,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:14,681 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2018-11-23 11:12:14,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:12:14,681 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-23 11:12:14,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:12:14,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:12:14,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2018-11-23 11:12:14,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:12:14,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2018-11-23 11:12:14,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 86 transitions. [2018-11-23 11:12:14,830 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:14,835 INFO L225 Difference]: With dead ends: 75 [2018-11-23 11:12:14,835 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 11:12:14,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:12:14,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 11:12:14,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49. [2018-11-23 11:12:14,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:12:14,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 49 states. [2018-11-23 11:12:14,920 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 49 states. [2018-11-23 11:12:14,920 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 49 states. [2018-11-23 11:12:14,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:14,925 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2018-11-23 11:12:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2018-11-23 11:12:14,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:14,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:14,927 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 63 states. [2018-11-23 11:12:14,927 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 63 states. [2018-11-23 11:12:14,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:14,932 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2018-11-23 11:12:14,932 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2018-11-23 11:12:14,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:14,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:14,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:12:14,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:12:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 11:12:14,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-11-23 11:12:14,937 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 49 [2018-11-23 11:12:14,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:12:14,938 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-11-23 11:12:14,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:12:14,938 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-23 11:12:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 11:12:14,940 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:14,940 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:12:14,941 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:14,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:14,941 INFO L82 PathProgramCache]: Analyzing trace with hash 901864381, now seen corresponding path program 2 times [2018-11-23 11:12:14,942 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:14,942 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:12:14,975 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:12:15,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:12:15,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:12:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:15,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:15,332 INFO L256 TraceCheckUtils]: 0: Hoare triple {1474#true} call ULTIMATE.init(); {1474#true} is VALID [2018-11-23 11:12:15,333 INFO L273 TraceCheckUtils]: 1: Hoare triple {1474#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1474#true} is VALID [2018-11-23 11:12:15,333 INFO L273 TraceCheckUtils]: 2: Hoare triple {1474#true} assume true; {1474#true} is VALID [2018-11-23 11:12:15,334 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1474#true} {1474#true} #152#return; {1474#true} is VALID [2018-11-23 11:12:15,334 INFO L256 TraceCheckUtils]: 4: Hoare triple {1474#true} call #t~ret17 := main(); {1474#true} is VALID [2018-11-23 11:12:15,335 INFO L273 TraceCheckUtils]: 5: Hoare triple {1474#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1474#true} is VALID [2018-11-23 11:12:15,335 INFO L256 TraceCheckUtils]: 6: Hoare triple {1474#true} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1474#true} is VALID [2018-11-23 11:12:15,335 INFO L273 TraceCheckUtils]: 7: Hoare triple {1474#true} ~len := #in~len;~data := #in~data; {1474#true} is VALID [2018-11-23 11:12:15,336 INFO L256 TraceCheckUtils]: 8: Hoare triple {1474#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1474#true} is VALID [2018-11-23 11:12:15,336 INFO L273 TraceCheckUtils]: 9: Hoare triple {1474#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1474#true} is VALID [2018-11-23 11:12:15,336 INFO L273 TraceCheckUtils]: 10: Hoare triple {1474#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1474#true} is VALID [2018-11-23 11:12:15,336 INFO L273 TraceCheckUtils]: 11: Hoare triple {1474#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1474#true} is VALID [2018-11-23 11:12:15,337 INFO L273 TraceCheckUtils]: 12: Hoare triple {1474#true} assume true; {1474#true} is VALID [2018-11-23 11:12:15,337 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1474#true} {1474#true} #148#return; {1474#true} is VALID [2018-11-23 11:12:15,337 INFO L273 TraceCheckUtils]: 14: Hoare triple {1474#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; {1474#true} is VALID [2018-11-23 11:12:15,337 INFO L273 TraceCheckUtils]: 15: Hoare triple {1474#true} assume !!~bvsgt32(~len, 1bv32); {1474#true} is VALID [2018-11-23 11:12:15,338 INFO L256 TraceCheckUtils]: 16: Hoare triple {1474#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1474#true} is VALID [2018-11-23 11:12:15,338 INFO L273 TraceCheckUtils]: 17: Hoare triple {1474#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1474#true} is VALID [2018-11-23 11:12:15,338 INFO L273 TraceCheckUtils]: 18: Hoare triple {1474#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1474#true} is VALID [2018-11-23 11:12:15,338 INFO L273 TraceCheckUtils]: 19: Hoare triple {1474#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1474#true} is VALID [2018-11-23 11:12:15,338 INFO L273 TraceCheckUtils]: 20: Hoare triple {1474#true} assume true; {1474#true} is VALID [2018-11-23 11:12:15,339 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1474#true} {1474#true} #150#return; {1474#true} is VALID [2018-11-23 11:12:15,339 INFO L273 TraceCheckUtils]: 22: Hoare triple {1474#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); {1474#true} is VALID [2018-11-23 11:12:15,339 INFO L273 TraceCheckUtils]: 23: Hoare triple {1474#true} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32); {1474#true} is VALID [2018-11-23 11:12:15,339 INFO L273 TraceCheckUtils]: 24: Hoare triple {1474#true} ~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; {1474#true} is VALID [2018-11-23 11:12:15,339 INFO L273 TraceCheckUtils]: 25: Hoare triple {1474#true} assume !~bvsgt32(~len, 1bv32); {1474#true} is VALID [2018-11-23 11:12:15,340 INFO L273 TraceCheckUtils]: 26: Hoare triple {1474#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1474#true} is VALID [2018-11-23 11:12:15,340 INFO L273 TraceCheckUtils]: 27: Hoare triple {1474#true} assume true; {1474#true} is VALID [2018-11-23 11:12:15,340 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1474#true} {1474#true} #140#return; {1474#true} is VALID [2018-11-23 11:12:15,341 INFO L273 TraceCheckUtils]: 29: Hoare triple {1474#true} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := 0bv32; {1566#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:12:15,341 INFO L273 TraceCheckUtils]: 30: Hoare triple {1566#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1566#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:12:15,341 INFO L256 TraceCheckUtils]: 31: Hoare triple {1566#(= main_~i~0 (_ bv0 32))} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1474#true} is VALID [2018-11-23 11:12:15,342 INFO L273 TraceCheckUtils]: 32: Hoare triple {1474#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1474#true} is VALID [2018-11-23 11:12:15,342 INFO L273 TraceCheckUtils]: 33: Hoare triple {1474#true} assume !~bvsgt32(~index, 0bv32); {1474#true} is VALID [2018-11-23 11:12:15,342 INFO L273 TraceCheckUtils]: 34: Hoare triple {1474#true} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32); {1474#true} is VALID [2018-11-23 11:12:15,342 INFO L273 TraceCheckUtils]: 35: Hoare triple {1474#true} assume true; {1474#true} is VALID [2018-11-23 11:12:15,349 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {1474#true} {1566#(= main_~i~0 (_ bv0 32))} #142#return; {1566#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:12:15,354 INFO L273 TraceCheckUtils]: 37: Hoare triple {1566#(= main_~i~0 (_ bv0 32))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1591#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:15,355 INFO L273 TraceCheckUtils]: 38: Hoare triple {1591#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1591#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:15,355 INFO L256 TraceCheckUtils]: 39: Hoare triple {1591#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1474#true} is VALID [2018-11-23 11:12:15,357 INFO L273 TraceCheckUtils]: 40: Hoare triple {1474#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1601#(= dll_circular_update_at_~index |dll_circular_update_at_#in~index|)} is VALID [2018-11-23 11:12:15,357 INFO L273 TraceCheckUtils]: 41: Hoare triple {1601#(= dll_circular_update_at_~index |dll_circular_update_at_#in~index|)} assume !~bvsgt32(~index, 0bv32); {1605#(not (bvsgt |dll_circular_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:12:15,360 INFO L273 TraceCheckUtils]: 42: Hoare triple {1605#(not (bvsgt |dll_circular_update_at_#in~index| (_ bv0 32)))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32); {1605#(not (bvsgt |dll_circular_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:12:15,361 INFO L273 TraceCheckUtils]: 43: Hoare triple {1605#(not (bvsgt |dll_circular_update_at_#in~index| (_ bv0 32)))} assume true; {1605#(not (bvsgt |dll_circular_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:12:15,362 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1605#(not (bvsgt |dll_circular_update_at_#in~index| (_ bv0 32)))} {1591#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #142#return; {1475#false} is VALID [2018-11-23 11:12:15,362 INFO L273 TraceCheckUtils]: 45: Hoare triple {1475#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1475#false} is VALID [2018-11-23 11:12:15,362 INFO L273 TraceCheckUtils]: 46: Hoare triple {1475#false} assume !~bvslt32(~i~0, ~len~0); {1475#false} is VALID [2018-11-23 11:12:15,362 INFO L273 TraceCheckUtils]: 47: Hoare triple {1475#false} ~i~0 := 0bv32; {1475#false} is VALID [2018-11-23 11:12:15,363 INFO L273 TraceCheckUtils]: 48: Hoare triple {1475#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {1475#false} is VALID [2018-11-23 11:12:15,363 INFO L256 TraceCheckUtils]: 49: Hoare triple {1475#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1475#false} is VALID [2018-11-23 11:12:15,363 INFO L273 TraceCheckUtils]: 50: Hoare triple {1475#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1475#false} is VALID [2018-11-23 11:12:15,363 INFO L273 TraceCheckUtils]: 51: Hoare triple {1475#false} assume !~bvsgt32(~index, 0bv32); {1475#false} is VALID [2018-11-23 11:12:15,363 INFO L273 TraceCheckUtils]: 52: Hoare triple {1475#false} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {1475#false} is VALID [2018-11-23 11:12:15,364 INFO L273 TraceCheckUtils]: 53: Hoare triple {1475#false} assume true; {1475#false} is VALID [2018-11-23 11:12:15,364 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1475#false} {1475#false} #144#return; {1475#false} is VALID [2018-11-23 11:12:15,364 INFO L273 TraceCheckUtils]: 55: Hoare triple {1475#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {1475#false} is VALID [2018-11-23 11:12:15,365 INFO L273 TraceCheckUtils]: 56: Hoare triple {1475#false} assume !false; {1475#false} is VALID [2018-11-23 11:12:15,369 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:12:15,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:12:15,741 INFO L273 TraceCheckUtils]: 56: Hoare triple {1475#false} assume !false; {1475#false} is VALID [2018-11-23 11:12:15,742 INFO L273 TraceCheckUtils]: 55: Hoare triple {1475#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {1475#false} is VALID [2018-11-23 11:12:15,742 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1474#true} {1475#false} #144#return; {1475#false} is VALID [2018-11-23 11:12:15,742 INFO L273 TraceCheckUtils]: 53: Hoare triple {1474#true} assume true; {1474#true} is VALID [2018-11-23 11:12:15,743 INFO L273 TraceCheckUtils]: 52: Hoare triple {1474#true} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {1474#true} is VALID [2018-11-23 11:12:15,743 INFO L273 TraceCheckUtils]: 51: Hoare triple {1474#true} assume !~bvsgt32(~index, 0bv32); {1474#true} is VALID [2018-11-23 11:12:15,743 INFO L273 TraceCheckUtils]: 50: Hoare triple {1474#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1474#true} is VALID [2018-11-23 11:12:15,744 INFO L256 TraceCheckUtils]: 49: Hoare triple {1475#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1474#true} is VALID [2018-11-23 11:12:15,744 INFO L273 TraceCheckUtils]: 48: Hoare triple {1475#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {1475#false} is VALID [2018-11-23 11:12:15,744 INFO L273 TraceCheckUtils]: 47: Hoare triple {1475#false} ~i~0 := 0bv32; {1475#false} is VALID [2018-11-23 11:12:15,744 INFO L273 TraceCheckUtils]: 46: Hoare triple {1475#false} assume !~bvslt32(~i~0, ~len~0); {1475#false} is VALID [2018-11-23 11:12:15,744 INFO L273 TraceCheckUtils]: 45: Hoare triple {1475#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1475#false} is VALID [2018-11-23 11:12:15,762 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1605#(not (bvsgt |dll_circular_update_at_#in~index| (_ bv0 32)))} {1687#(bvsgt main_~i~0 (_ bv0 32))} #142#return; {1475#false} is VALID [2018-11-23 11:12:15,778 INFO L273 TraceCheckUtils]: 43: Hoare triple {1605#(not (bvsgt |dll_circular_update_at_#in~index| (_ bv0 32)))} assume true; {1605#(not (bvsgt |dll_circular_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:12:15,792 INFO L273 TraceCheckUtils]: 42: Hoare triple {1605#(not (bvsgt |dll_circular_update_at_#in~index| (_ bv0 32)))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32); {1605#(not (bvsgt |dll_circular_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:12:15,803 INFO L273 TraceCheckUtils]: 41: Hoare triple {1700#(or (bvsgt dll_circular_update_at_~index (_ bv0 32)) (not (bvsgt |dll_circular_update_at_#in~index| (_ bv0 32))))} assume !~bvsgt32(~index, 0bv32); {1605#(not (bvsgt |dll_circular_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:12:15,804 INFO L273 TraceCheckUtils]: 40: Hoare triple {1474#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1700#(or (bvsgt dll_circular_update_at_~index (_ bv0 32)) (not (bvsgt |dll_circular_update_at_#in~index| (_ bv0 32))))} is VALID [2018-11-23 11:12:15,804 INFO L256 TraceCheckUtils]: 39: Hoare triple {1687#(bvsgt main_~i~0 (_ bv0 32))} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1474#true} is VALID [2018-11-23 11:12:15,805 INFO L273 TraceCheckUtils]: 38: Hoare triple {1687#(bvsgt main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1687#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:12:15,809 INFO L273 TraceCheckUtils]: 37: Hoare triple {1710#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1687#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:12:15,811 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {1474#true} {1710#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} #142#return; {1710#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:15,811 INFO L273 TraceCheckUtils]: 35: Hoare triple {1474#true} assume true; {1474#true} is VALID [2018-11-23 11:12:15,811 INFO L273 TraceCheckUtils]: 34: Hoare triple {1474#true} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32); {1474#true} is VALID [2018-11-23 11:12:15,811 INFO L273 TraceCheckUtils]: 33: Hoare triple {1474#true} assume !~bvsgt32(~index, 0bv32); {1474#true} is VALID [2018-11-23 11:12:15,812 INFO L273 TraceCheckUtils]: 32: Hoare triple {1474#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1474#true} is VALID [2018-11-23 11:12:15,812 INFO L256 TraceCheckUtils]: 31: Hoare triple {1710#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1474#true} is VALID [2018-11-23 11:12:15,815 INFO L273 TraceCheckUtils]: 30: Hoare triple {1710#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1710#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:15,818 INFO L273 TraceCheckUtils]: 29: Hoare triple {1474#true} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := 0bv32; {1710#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:15,818 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1474#true} {1474#true} #140#return; {1474#true} is VALID [2018-11-23 11:12:15,818 INFO L273 TraceCheckUtils]: 27: Hoare triple {1474#true} assume true; {1474#true} is VALID [2018-11-23 11:12:15,819 INFO L273 TraceCheckUtils]: 26: Hoare triple {1474#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1474#true} is VALID [2018-11-23 11:12:15,819 INFO L273 TraceCheckUtils]: 25: Hoare triple {1474#true} assume !~bvsgt32(~len, 1bv32); {1474#true} is VALID [2018-11-23 11:12:15,819 INFO L273 TraceCheckUtils]: 24: Hoare triple {1474#true} ~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; {1474#true} is VALID [2018-11-23 11:12:15,820 INFO L273 TraceCheckUtils]: 23: Hoare triple {1474#true} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32); {1474#true} is VALID [2018-11-23 11:12:15,820 INFO L273 TraceCheckUtils]: 22: Hoare triple {1474#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); {1474#true} is VALID [2018-11-23 11:12:15,820 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1474#true} {1474#true} #150#return; {1474#true} is VALID [2018-11-23 11:12:15,820 INFO L273 TraceCheckUtils]: 20: Hoare triple {1474#true} assume true; {1474#true} is VALID [2018-11-23 11:12:15,821 INFO L273 TraceCheckUtils]: 19: Hoare triple {1474#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1474#true} is VALID [2018-11-23 11:12:15,821 INFO L273 TraceCheckUtils]: 18: Hoare triple {1474#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1474#true} is VALID [2018-11-23 11:12:15,821 INFO L273 TraceCheckUtils]: 17: Hoare triple {1474#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1474#true} is VALID [2018-11-23 11:12:15,821 INFO L256 TraceCheckUtils]: 16: Hoare triple {1474#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1474#true} is VALID [2018-11-23 11:12:15,822 INFO L273 TraceCheckUtils]: 15: Hoare triple {1474#true} assume !!~bvsgt32(~len, 1bv32); {1474#true} is VALID [2018-11-23 11:12:15,822 INFO L273 TraceCheckUtils]: 14: Hoare triple {1474#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; {1474#true} is VALID [2018-11-23 11:12:15,822 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1474#true} {1474#true} #148#return; {1474#true} is VALID [2018-11-23 11:12:15,823 INFO L273 TraceCheckUtils]: 12: Hoare triple {1474#true} assume true; {1474#true} is VALID [2018-11-23 11:12:15,823 INFO L273 TraceCheckUtils]: 11: Hoare triple {1474#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1474#true} is VALID [2018-11-23 11:12:15,823 INFO L273 TraceCheckUtils]: 10: Hoare triple {1474#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1474#true} is VALID [2018-11-23 11:12:15,823 INFO L273 TraceCheckUtils]: 9: Hoare triple {1474#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1474#true} is VALID [2018-11-23 11:12:15,824 INFO L256 TraceCheckUtils]: 8: Hoare triple {1474#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1474#true} is VALID [2018-11-23 11:12:15,824 INFO L273 TraceCheckUtils]: 7: Hoare triple {1474#true} ~len := #in~len;~data := #in~data; {1474#true} is VALID [2018-11-23 11:12:15,824 INFO L256 TraceCheckUtils]: 6: Hoare triple {1474#true} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1474#true} is VALID [2018-11-23 11:12:15,824 INFO L273 TraceCheckUtils]: 5: Hoare triple {1474#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1474#true} is VALID [2018-11-23 11:12:15,824 INFO L256 TraceCheckUtils]: 4: Hoare triple {1474#true} call #t~ret17 := main(); {1474#true} is VALID [2018-11-23 11:12:15,825 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1474#true} {1474#true} #152#return; {1474#true} is VALID [2018-11-23 11:12:15,825 INFO L273 TraceCheckUtils]: 2: Hoare triple {1474#true} assume true; {1474#true} is VALID [2018-11-23 11:12:15,825 INFO L273 TraceCheckUtils]: 1: Hoare triple {1474#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1474#true} is VALID [2018-11-23 11:12:15,825 INFO L256 TraceCheckUtils]: 0: Hoare triple {1474#true} call ULTIMATE.init(); {1474#true} is VALID [2018-11-23 11:12:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:12:15,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:12:15,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 11:12:15,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-11-23 11:12:15,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:12:15,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:12:15,964 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:15,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:12:15,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:12:15,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:12:15,965 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 9 states. [2018-11-23 11:12:17,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:17,941 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2018-11-23 11:12:17,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:12:17,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-11-23 11:12:17,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:12:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:12:17,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2018-11-23 11:12:17,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:12:17,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2018-11-23 11:12:17,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 109 transitions. [2018-11-23 11:12:18,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:18,210 INFO L225 Difference]: With dead ends: 94 [2018-11-23 11:12:18,210 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 11:12:18,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:12:18,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 11:12:18,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2018-11-23 11:12:18,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:12:18,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 55 states. [2018-11-23 11:12:18,272 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 55 states. [2018-11-23 11:12:18,272 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 55 states. [2018-11-23 11:12:18,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:18,277 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-23 11:12:18,277 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2018-11-23 11:12:18,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:18,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:18,278 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 72 states. [2018-11-23 11:12:18,278 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 72 states. [2018-11-23 11:12:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:18,282 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-23 11:12:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2018-11-23 11:12:18,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:18,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:18,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:12:18,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:12:18,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 11:12:18,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-11-23 11:12:18,286 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 57 [2018-11-23 11:12:18,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:12:18,287 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-11-23 11:12:18,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:12:18,287 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-23 11:12:18,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 11:12:18,288 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:18,289 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, 1] [2018-11-23 11:12:18,289 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:18,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:18,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1666248678, now seen corresponding path program 1 times [2018-11-23 11:12:18,290 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:18,290 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:12:18,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:12:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:18,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:18,653 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:12:18,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:18,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:18,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 11:12:18,665 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:18,666 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_60|]. (= |#valid| (store |v_#valid_60| node_create_~temp~0.base (_ bv1 1))) [2018-11-23 11:12:18,666 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| node_create_~temp~0.base) (_ bv1 1)) [2018-11-23 11:12:18,871 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:18,875 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:18,876 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:12:18,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:18,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:18,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-11-23 11:12:18,893 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:18,893 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_2|]. (and (= (_ bv0 32) |dll_circular_create_#t~ret4.offset|) (= (_ bv0 1) (bvadd (select |v_#valid_BEFORE_CALL_2| dll_circular_create_~head~0.base) (_ bv1 1))) (= (_ bv0 1) (select |v_#valid_BEFORE_CALL_2| |dll_circular_create_#t~ret4.base|)) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) [2018-11-23 11:12:18,893 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= dll_circular_create_~head~0.base |dll_circular_create_#t~ret4.base|)) (= (_ bv0 32) |dll_circular_create_#t~ret4.offset|) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) [2018-11-23 11:12:18,960 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:12:18,965 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:12:18,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:18,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:18,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:18,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-23 11:12:19,067 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 21 treesize of output 22 [2018-11-23 11:12:19,073 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 10 treesize of output 9 [2018-11-23 11:12:19,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:19,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:19,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:12:19,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-11-23 11:12:19,136 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:19,137 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_81|, dll_circular_create_~head~0.offset]. (and (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)) (= dll_circular_create_~last~0.base (select (select |v_#memory_$Pointer$.base_81| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset)) (= (store |v_#memory_$Pointer$.base_81| dll_circular_create_~last~0.base (store (select |v_#memory_$Pointer$.base_81| dll_circular_create_~last~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) |#memory_$Pointer$.base|)) [2018-11-23 11:12:19,137 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [dll_circular_create_~head~0.offset]. (and (= dll_circular_create_~last~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset)) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)) (= (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32))) dll_circular_create_~new_head~0.base)) [2018-11-23 11:12:19,566 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 48 [2018-11-23 11:12:19,586 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 20 treesize of output 25 [2018-11-23 11:12:19,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:19,641 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 50 treesize of output 40 [2018-11-23 11:12:19,652 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:19,654 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 39 treesize of output 52 [2018-11-23 11:12:19,657 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:19,683 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:19,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:19,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:12:19,738 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:49 [2018-11-23 11:12:19,785 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:19,785 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_82|, dll_circular_create_~last~0.offset, v_subst_1]. (let ((.cse1 (select (select |v_#memory_$Pointer$.base_82| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|))) (let ((.cse0 (select |v_#memory_$Pointer$.base_82| .cse1))) (and (= (select .cse0 (bvadd v_subst_1 (_ bv4 32))) |dll_circular_create_#res.base|) (= (_ bv0 32) |dll_circular_create_#res.offset|) (not (= .cse1 |dll_circular_create_#res.base|)) (= (let ((.cse2 (store |v_#memory_$Pointer$.base_82| .cse1 (store .cse0 dll_circular_create_~last~0.offset |dll_circular_create_#res.base|)))) (store .cse2 |dll_circular_create_#res.base| (store (select .cse2 |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)) .cse1))) |#memory_$Pointer$.base|)))) [2018-11-23 11:12:19,786 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [dll_circular_create_~last~0.offset, v_subst_1]. (let ((.cse1 (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|))) (let ((.cse0 (select .cse1 |dll_circular_create_#res.offset|))) (let ((.cse2 (select |#memory_$Pointer$.base| .cse0))) (and (= .cse0 (select .cse1 (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (= |dll_circular_create_#res.base| (select .cse2 dll_circular_create_~last~0.offset)) (not (= .cse0 |dll_circular_create_#res.base|)) (= (_ bv0 32) |dll_circular_create_#res.offset|) (= (select .cse2 (bvadd v_subst_1 (_ bv4 32))) |dll_circular_create_#res.base|))))) [2018-11-23 11:12:20,513 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 13 treesize of output 10 [2018-11-23 11:12:20,524 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:12:20,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:20,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:20,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:20,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-23 11:12:20,761 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 54 treesize of output 48 [2018-11-23 11:12:20,776 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:20,778 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:20,780 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:20,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 57 [2018-11-23 11:12:20,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:20,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:20,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:12:20,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:54 [2018-11-23 11:12:23,448 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~data (_ BitVec 32)) (dll_circular_update_at_~head.offset (_ BitVec 32))) (= |c_#memory_int| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) (bvadd dll_circular_update_at_~head.offset (_ bv8 32)) dll_circular_update_at_~data))))) is different from true [2018-11-23 11:12:23,610 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 31 treesize of output 32 [2018-11-23 11:12:23,618 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 14 treesize of output 13 [2018-11-23 11:12:23,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:23,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:23,703 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:23,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2018-11-23 11:12:23,735 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 7 treesize of output 1 [2018-11-23 11:12:23,736 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:23,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:23,765 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 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-23 11:12:23,775 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:12:23,816 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:12:23,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:23,845 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:75, output treesize:18 [2018-11-23 11:12:23,861 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:23,861 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#memory_$Pointer$.base)_AFTER_CALL_34|, |v_old(#memory_int)_AFTER_CALL_34|, dll_circular_update_at_~head.offset, dll_circular_update_at_~data, v_subst_1]. (let ((.cse2 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| main_~s~0.base))) (let ((.cse1 (select .cse2 (bvadd main_~s~0.offset (_ bv4 32)))) (.cse0 (select .cse2 main_~s~0.offset))) (and (= (store |v_old(#memory_int)_AFTER_CALL_34| .cse0 (store (select |v_old(#memory_int)_AFTER_CALL_34| .cse0) (bvadd dll_circular_update_at_~head.offset (_ bv8 32)) dll_circular_update_at_~data)) |#memory_int|) (= main_~len~0 (select (select |v_old(#memory_int)_AFTER_CALL_34| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32)))) (= .cse0 .cse1) (= main_~s~0.offset (_ bv0 32)) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| .cse1) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= .cse0 main_~s~0.base))))) [2018-11-23 11:12:23,862 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) [2018-11-23 11:12:26,630 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 31 treesize of output 31 [2018-11-23 11:12:26,655 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 20 treesize of output 11 [2018-11-23 11:12:26,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:26,688 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 16 treesize of output 7 [2018-11-23 11:12:26,690 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:26,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:26,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:26,715 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2018-11-23 11:12:26,721 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:26,722 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~s~0.base, v_main_~s~0.base_BEFORE_CALL_3]. (let ((.cse0 (select (select |#memory_int| main_~s~0.base) (_ bv8 32)))) (and (= |main_#t~ret16| .cse0) (= main_~expected~0 .cse0) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv2 32) .cse0))) [2018-11-23 11:12:26,722 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~ret16| main_~expected~0) (= |main_#t~ret16| (_ bv2 32))) [2018-11-23 11:12:26,787 INFO L256 TraceCheckUtils]: 0: Hoare triple {2192#true} call ULTIMATE.init(); {2192#true} is VALID [2018-11-23 11:12:26,787 INFO L273 TraceCheckUtils]: 1: Hoare triple {2192#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2192#true} is VALID [2018-11-23 11:12:26,788 INFO L273 TraceCheckUtils]: 2: Hoare triple {2192#true} assume true; {2192#true} is VALID [2018-11-23 11:12:26,788 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2192#true} {2192#true} #152#return; {2192#true} is VALID [2018-11-23 11:12:26,788 INFO L256 TraceCheckUtils]: 4: Hoare triple {2192#true} call #t~ret17 := main(); {2192#true} is VALID [2018-11-23 11:12:26,789 INFO L273 TraceCheckUtils]: 5: Hoare triple {2192#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2212#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:26,789 INFO L256 TraceCheckUtils]: 6: Hoare triple {2212#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {2192#true} is VALID [2018-11-23 11:12:26,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {2192#true} ~len := #in~len;~data := #in~data; {2192#true} is VALID [2018-11-23 11:12:26,789 INFO L256 TraceCheckUtils]: 8: Hoare triple {2192#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {2192#true} is VALID [2018-11-23 11:12:26,790 INFO L273 TraceCheckUtils]: 9: Hoare triple {2192#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2225#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:12:26,791 INFO L273 TraceCheckUtils]: 10: Hoare triple {2225#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2225#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:12:26,792 INFO L273 TraceCheckUtils]: 11: Hoare triple {2225#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2232#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:12:26,792 INFO L273 TraceCheckUtils]: 12: Hoare triple {2232#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} assume true; {2232#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:12:26,794 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {2232#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} {2192#true} #148#return; {2239#(= (_ bv1 1) (select |#valid| |dll_circular_create_#t~ret3.base|))} is VALID [2018-11-23 11:12:26,795 INFO L273 TraceCheckUtils]: 14: Hoare triple {2239#(= (_ bv1 1) (select |#valid| |dll_circular_create_#t~ret3.base|))} ~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; {2243#(and (= (bvadd (select |#valid| dll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-23 11:12:26,796 INFO L273 TraceCheckUtils]: 15: Hoare triple {2243#(and (= (bvadd (select |#valid| dll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} assume !!~bvsgt32(~len, 1bv32); {2243#(and (= (bvadd (select |#valid| dll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-23 11:12:26,797 INFO L256 TraceCheckUtils]: 16: Hoare triple {2243#(and (= (bvadd (select |#valid| dll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2250#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:12:26,798 INFO L273 TraceCheckUtils]: 17: Hoare triple {2250#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2254#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:12:26,799 INFO L273 TraceCheckUtils]: 18: Hoare triple {2254#(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); {2254#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:12:26,802 INFO L273 TraceCheckUtils]: 19: Hoare triple {2254#(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~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2261#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:12:26,803 INFO L273 TraceCheckUtils]: 20: Hoare triple {2261#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {2261#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:12:26,805 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2261#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {2243#(and (= (bvadd (select |#valid| dll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} #150#return; {2268#(and (not (= dll_circular_create_~head~0.base |dll_circular_create_#t~ret4.base|)) (= (_ bv0 32) |dll_circular_create_#t~ret4.offset|) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-23 11:12:26,807 INFO L273 TraceCheckUtils]: 22: Hoare triple {2268#(and (not (= dll_circular_create_~head~0.base |dll_circular_create_#t~ret4.base|)) (= (_ bv0 32) |dll_circular_create_#t~ret4.offset|) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.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); {2272#(and (not (= dll_circular_create_~head~0.base dll_circular_create_~new_head~0.base)) (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset)) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-23 11:12:26,810 INFO L273 TraceCheckUtils]: 23: Hoare triple {2272#(and (not (= dll_circular_create_~head~0.base dll_circular_create_~new_head~0.base)) (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset)) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32); {2276#(and (= dll_circular_create_~last~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset)) (exists ((dll_circular_create_~head~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32))) dll_circular_create_~new_head~0.base)) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)))} is VALID [2018-11-23 11:12:26,813 INFO L273 TraceCheckUtils]: 24: Hoare triple {2276#(and (= dll_circular_create_~last~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset)) (exists ((dll_circular_create_~head~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32))) dll_circular_create_~new_head~0.base)) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)))} ~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; {2280#(and (= (select (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) dll_circular_create_~head~0.offset) dll_circular_create_~last~0.base) (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (bvadd v_subst_1 (_ bv4 32))))))} is VALID [2018-11-23 11:12:26,816 INFO L273 TraceCheckUtils]: 25: Hoare triple {2280#(and (= (select (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) dll_circular_create_~head~0.offset) dll_circular_create_~last~0.base) (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (bvadd v_subst_1 (_ bv4 32))))))} assume !~bvsgt32(~len, 1bv32); {2280#(and (= (select (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) dll_circular_create_~head~0.offset) dll_circular_create_~last~0.base) (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (bvadd v_subst_1 (_ bv4 32))))))} is VALID [2018-11-23 11:12:26,823 INFO L273 TraceCheckUtils]: 26: Hoare triple {2280#(and (= (select (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) dll_circular_create_~head~0.offset) dll_circular_create_~last~0.base) (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (bvadd v_subst_1 (_ bv4 32))))))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {2287#(and (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) |dll_circular_create_#res.base|)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|)) (bvadd v_subst_1 (_ bv4 32))) |dll_circular_create_#res.base|)) (= (_ bv0 32) |dll_circular_create_#res.offset|))} is VALID [2018-11-23 11:12:26,825 INFO L273 TraceCheckUtils]: 27: Hoare triple {2287#(and (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) |dll_circular_create_#res.base|)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|)) (bvadd v_subst_1 (_ bv4 32))) |dll_circular_create_#res.base|)) (= (_ bv0 32) |dll_circular_create_#res.offset|))} assume true; {2287#(and (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) |dll_circular_create_#res.base|)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|)) (bvadd v_subst_1 (_ bv4 32))) |dll_circular_create_#res.base|)) (= (_ bv0 32) |dll_circular_create_#res.offset|))} is VALID [2018-11-23 11:12:26,827 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2287#(and (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) |dll_circular_create_#res.base|)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|)) (bvadd v_subst_1 (_ bv4 32))) |dll_circular_create_#res.base|)) (= (_ bv0 32) |dll_circular_create_#res.offset|))} {2212#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #140#return; {2294#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|) |main_#t~ret13.base|)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|)) (bvadd v_subst_1 (_ bv4 32))) |main_#t~ret13.base|)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|) (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (bvadd |main_#t~ret13.offset| (_ bv4 32)))) (= |main_#t~ret13.offset| (_ bv0 32)))} is VALID [2018-11-23 11:12:26,830 INFO L273 TraceCheckUtils]: 29: Hoare triple {2294#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|) |main_#t~ret13.base|)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|)) (bvadd v_subst_1 (_ bv4 32))) |main_#t~ret13.base|)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|) (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (bvadd |main_#t~ret13.offset| (_ bv4 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 := 0bv32; {2298#(and (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:26,831 INFO L273 TraceCheckUtils]: 30: Hoare triple {2298#(and (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2302#(and (= main_~len~0 main_~new_data~0) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (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)))} is VALID [2018-11-23 11:12:26,832 INFO L256 TraceCheckUtils]: 31: Hoare triple {2302#(and (= main_~len~0 main_~new_data~0) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (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)))} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2306#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-23 11:12:26,833 INFO L273 TraceCheckUtils]: 32: Hoare triple {2306#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2310#(and (= |dll_circular_update_at_#in~head.base| dll_circular_update_at_~head.base) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset) (= |dll_circular_update_at_#in~data| dll_circular_update_at_~data))} is VALID [2018-11-23 11:12:26,833 INFO L273 TraceCheckUtils]: 33: Hoare triple {2310#(and (= |dll_circular_update_at_#in~head.base| dll_circular_update_at_~head.base) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset) (= |dll_circular_update_at_#in~data| dll_circular_update_at_~data))} assume !~bvsgt32(~index, 0bv32); {2310#(and (= |dll_circular_update_at_#in~head.base| dll_circular_update_at_~head.base) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset) (= |dll_circular_update_at_#in~data| dll_circular_update_at_~data))} is VALID [2018-11-23 11:12:26,846 INFO L273 TraceCheckUtils]: 34: Hoare triple {2310#(and (= |dll_circular_update_at_#in~head.base| dll_circular_update_at_~head.base) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset) (= |dll_circular_update_at_#in~data| dll_circular_update_at_~data))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32); {2317#(and (= (select (select |#memory_int| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32))) |dll_circular_update_at_#in~data|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32)) (select (select |#memory_$Pointer$.base| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32)))))))} is VALID [2018-11-23 11:12:26,847 INFO L273 TraceCheckUtils]: 35: Hoare triple {2317#(and (= (select (select |#memory_int| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32))) |dll_circular_update_at_#in~data|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32)) (select (select |#memory_$Pointer$.base| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32)))))))} assume true; {2317#(and (= (select (select |#memory_int| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32))) |dll_circular_update_at_#in~data|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32)) (select (select |#memory_$Pointer$.base| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32)))))))} is VALID [2018-11-23 11:12:26,853 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {2317#(and (= (select (select |#memory_int| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32))) |dll_circular_update_at_#in~data|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32)) (select (select |#memory_$Pointer$.base| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32)))))))} {2302#(and (= main_~len~0 main_~new_data~0) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (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)))} #142#return; {2324#(and (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (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)))} is VALID [2018-11-23 11:12:26,856 INFO L273 TraceCheckUtils]: 37: Hoare triple {2324#(and (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (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)))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {2324#(and (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (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)))} is VALID [2018-11-23 11:12:26,859 INFO L273 TraceCheckUtils]: 38: Hoare triple {2324#(and (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (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)))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2324#(and (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (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)))} is VALID [2018-11-23 11:12:26,861 INFO L256 TraceCheckUtils]: 39: Hoare triple {2324#(and (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (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)))} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2334#(and (= |old(#memory_int)| |#memory_int|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:12:26,862 INFO L273 TraceCheckUtils]: 40: Hoare triple {2334#(and (= |old(#memory_int)| |#memory_int|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2338#(and (= |old(#memory_int)| |#memory_int|) (= |dll_circular_update_at_#in~head.base| dll_circular_update_at_~head.base) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))} is VALID [2018-11-23 11:12:26,862 INFO L273 TraceCheckUtils]: 41: Hoare triple {2338#(and (= |old(#memory_int)| |#memory_int|) (= |dll_circular_update_at_#in~head.base| dll_circular_update_at_~head.base) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))} 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; {2342#(and (= |old(#memory_int)| |#memory_int|) (= dll_circular_update_at_~head.base (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|)))} is VALID [2018-11-23 11:12:26,863 INFO L273 TraceCheckUtils]: 42: Hoare triple {2342#(and (= |old(#memory_int)| |#memory_int|) (= dll_circular_update_at_~head.base (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|)))} assume !~bvsgt32(~index, 0bv32); {2342#(and (= |old(#memory_int)| |#memory_int|) (= dll_circular_update_at_~head.base (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|)))} is VALID [2018-11-23 11:12:26,865 INFO L273 TraceCheckUtils]: 43: Hoare triple {2342#(and (= |old(#memory_int)| |#memory_int|) (= dll_circular_update_at_~head.base (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|)))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32); {2349#(exists ((dll_circular_update_at_~data (_ BitVec 32)) (dll_circular_update_at_~head.offset (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|)) (bvadd dll_circular_update_at_~head.offset (_ bv8 32)) dll_circular_update_at_~data))))} is VALID [2018-11-23 11:12:26,866 INFO L273 TraceCheckUtils]: 44: Hoare triple {2349#(exists ((dll_circular_update_at_~data (_ BitVec 32)) (dll_circular_update_at_~head.offset (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|)) (bvadd dll_circular_update_at_~head.offset (_ bv8 32)) dll_circular_update_at_~data))))} assume true; {2349#(exists ((dll_circular_update_at_~data (_ BitVec 32)) (dll_circular_update_at_~head.offset (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|)) (bvadd dll_circular_update_at_~head.offset (_ bv8 32)) dll_circular_update_at_~data))))} is VALID [2018-11-23 11:12:26,870 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2349#(exists ((dll_circular_update_at_~data (_ BitVec 32)) (dll_circular_update_at_~head.offset (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|)) (bvadd dll_circular_update_at_~head.offset (_ bv8 32)) dll_circular_update_at_~data))))} {2324#(and (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (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)))} #142#return; {2356#(and (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:26,872 INFO L273 TraceCheckUtils]: 46: Hoare triple {2356#(and (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {2356#(and (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:26,873 INFO L273 TraceCheckUtils]: 47: Hoare triple {2356#(and (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~len~0); {2356#(and (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:26,873 INFO L273 TraceCheckUtils]: 48: Hoare triple {2356#(and (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} ~i~0 := 0bv32; {2366#(and (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:26,874 INFO L273 TraceCheckUtils]: 49: Hoare triple {2366#(and (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {2370#(and (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~expected~0) (= (bvadd (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:12:26,877 INFO L256 TraceCheckUtils]: 50: Hoare triple {2370#(and (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~expected~0) (= (bvadd (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)))} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {2374#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:26,878 INFO L273 TraceCheckUtils]: 51: Hoare triple {2374#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2378#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_circular_get_data_at_#in~head.base| dll_circular_get_data_at_~head.base) (= dll_circular_get_data_at_~head.offset |dll_circular_get_data_at_#in~head.offset|))} is VALID [2018-11-23 11:12:26,879 INFO L273 TraceCheckUtils]: 52: Hoare triple {2378#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_circular_get_data_at_#in~head.base| dll_circular_get_data_at_~head.base) (= dll_circular_get_data_at_~head.offset |dll_circular_get_data_at_#in~head.offset|))} assume !~bvsgt32(~index, 0bv32); {2378#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_circular_get_data_at_#in~head.base| dll_circular_get_data_at_~head.base) (= dll_circular_get_data_at_~head.offset |dll_circular_get_data_at_#in~head.offset|))} is VALID [2018-11-23 11:12:26,880 INFO L273 TraceCheckUtils]: 53: Hoare triple {2378#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_circular_get_data_at_#in~head.base| dll_circular_get_data_at_~head.base) (= dll_circular_get_data_at_~head.offset |dll_circular_get_data_at_#in~head.offset|))} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {2385#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_circular_get_data_at_#res| (select (select |#memory_int| |dll_circular_get_data_at_#in~head.base|) (bvadd |dll_circular_get_data_at_#in~head.offset| (_ bv8 32)))))} is VALID [2018-11-23 11:12:26,880 INFO L273 TraceCheckUtils]: 54: Hoare triple {2385#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_circular_get_data_at_#res| (select (select |#memory_int| |dll_circular_get_data_at_#in~head.base|) (bvadd |dll_circular_get_data_at_#in~head.offset| (_ bv8 32)))))} assume true; {2385#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_circular_get_data_at_#res| (select (select |#memory_int| |dll_circular_get_data_at_#in~head.base|) (bvadd |dll_circular_get_data_at_#in~head.offset| (_ bv8 32)))))} is VALID [2018-11-23 11:12:26,882 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {2385#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_circular_get_data_at_#res| (select (select |#memory_int| |dll_circular_get_data_at_#in~head.base|) (bvadd |dll_circular_get_data_at_#in~head.offset| (_ bv8 32)))))} {2370#(and (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~expected~0) (= (bvadd (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)))} #144#return; {2392#(and (= |main_#t~ret16| main_~expected~0) (= (bvadd |main_#t~ret16| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:26,883 INFO L273 TraceCheckUtils]: 56: Hoare triple {2392#(and (= |main_#t~ret16| main_~expected~0) (= (bvadd |main_#t~ret16| (_ bv4294967294 32)) (_ bv0 32)))} assume ~expected~0 != #t~ret16;havoc #t~ret16; {2193#false} is VALID [2018-11-23 11:12:26,883 INFO L273 TraceCheckUtils]: 57: Hoare triple {2193#false} assume !false; {2193#false} is VALID [2018-11-23 11:12:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 11:12:26,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:12:33,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:12:33,297 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:12:33,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:12:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:33,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:33,437 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:12:33,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:33,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:33,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 11:12:33,460 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:33,460 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_62|]. (= |#valid| (store |v_#valid_62| node_create_~temp~0.base (_ bv1 1))) [2018-11-23 11:12:33,461 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| node_create_~temp~0.base) (_ bv1 1)) [2018-11-23 11:12:33,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:33,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:33,588 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:12:33,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:33,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:33,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-11-23 11:12:33,609 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:33,609 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_4|]. (and (= (_ bv0 32) |dll_circular_create_#t~ret4.offset|) (= (_ bv0 1) (bvadd (select |v_#valid_BEFORE_CALL_4| dll_circular_create_~head~0.base) (_ bv1 1))) (= (select |v_#valid_BEFORE_CALL_4| |dll_circular_create_#t~ret4.base|) (_ bv0 1)) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) [2018-11-23 11:12:33,609 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= dll_circular_create_~head~0.base |dll_circular_create_#t~ret4.base|)) (= (_ bv0 32) |dll_circular_create_#t~ret4.offset|) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) [2018-11-23 11:12:33,628 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:12:33,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:12:33,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:33,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:33,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:33,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-23 11:12:33,688 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 21 treesize of output 22 [2018-11-23 11:12:33,694 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 10 treesize of output 9 [2018-11-23 11:12:33,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:33,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:33,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:12:33,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-11-23 11:12:33,743 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:33,744 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_93|, dll_circular_create_~head~0.offset]. (and (= (store |v_#memory_$Pointer$.base_93| dll_circular_create_~last~0.base (store (select |v_#memory_$Pointer$.base_93| dll_circular_create_~last~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32)) dll_circular_create_~new_head~0.base)) |#memory_$Pointer$.base|) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)) (= dll_circular_create_~last~0.base (select (select |v_#memory_$Pointer$.base_93| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset))) [2018-11-23 11:12:33,744 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [dll_circular_create_~head~0.offset]. (and (= dll_circular_create_~last~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset)) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)) (= (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32))) dll_circular_create_~new_head~0.base)) [2018-11-23 11:12:33,863 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 48 [2018-11-23 11:12:33,878 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 20 treesize of output 25 [2018-11-23 11:12:33,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:33,940 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 50 treesize of output 40 [2018-11-23 11:12:33,951 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:33,952 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 39 treesize of output 52 [2018-11-23 11:12:33,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:33,979 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:34,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:34,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:12:34,031 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:49 [2018-11-23 11:12:34,076 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:34,076 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_94|, dll_circular_create_~last~0.offset, v_subst_1]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_94| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|))) (let ((.cse1 (select |v_#memory_$Pointer$.base_94| .cse0))) (and (not (= .cse0 |dll_circular_create_#res.base|)) (= (_ bv0 32) |dll_circular_create_#res.offset|) (= (select .cse1 (bvadd v_subst_1 (_ bv4 32))) |dll_circular_create_#res.base|) (= |#memory_$Pointer$.base| (let ((.cse2 (store |v_#memory_$Pointer$.base_94| .cse0 (store .cse1 dll_circular_create_~last~0.offset |dll_circular_create_#res.base|)))) (store .cse2 |dll_circular_create_#res.base| (store (select .cse2 |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)) .cse0))))))) [2018-11-23 11:12:34,076 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [dll_circular_create_~last~0.offset, v_subst_1]. (let ((.cse1 (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|))) (let ((.cse0 (select .cse1 |dll_circular_create_#res.offset|))) (let ((.cse2 (select |#memory_$Pointer$.base| .cse0))) (and (= .cse0 (select .cse1 (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (= |dll_circular_create_#res.base| (select .cse2 dll_circular_create_~last~0.offset)) (not (= .cse0 |dll_circular_create_#res.base|)) (= (_ bv0 32) |dll_circular_create_#res.offset|) (= (select .cse2 (bvadd v_subst_1 (_ bv4 32))) |dll_circular_create_#res.base|))))) [2018-11-23 11:12:34,238 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 13 treesize of output 10 [2018-11-23 11:12:34,243 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:12:34,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:34,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:34,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:34,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-23 11:12:34,429 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 54 treesize of output 48 [2018-11-23 11:12:34,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:34,446 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:34,448 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:34,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 57 [2018-11-23 11:12:34,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:34,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:34,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:12:34,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:54 [2018-11-23 11:12:34,645 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:34,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 53 [2018-11-23 11:12:34,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:34,758 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 0 case distinctions, treesize of input 41 treesize of output 31 [2018-11-23 11:12:34,780 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:12:34,817 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 7 treesize of output 1 [2018-11-23 11:12:34,820 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:34,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:12:34,894 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 23 treesize of output 24 [2018-11-23 11:12:34,926 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:12:34,955 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:34,985 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:35,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:35,013 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:75, output treesize:18 [2018-11-23 11:12:35,032 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:35,033 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#memory_$Pointer$.base)_AFTER_CALL_40|, |v_old(#memory_int)_AFTER_CALL_40|, dll_circular_update_at_~head.offset, dll_circular_update_at_~data, v_subst_1]. (let ((.cse2 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_40| main_~s~0.base))) (let ((.cse1 (select .cse2 (bvadd main_~s~0.offset (_ bv4 32)))) (.cse0 (select .cse2 main_~s~0.offset))) (and (not (= .cse0 main_~s~0.base)) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_40| .cse1) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base) (= main_~s~0.offset (_ bv0 32)) (= .cse0 .cse1) (= (select (select |v_old(#memory_int)_AFTER_CALL_40| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= |#memory_int| (store |v_old(#memory_int)_AFTER_CALL_40| .cse0 (store (select |v_old(#memory_int)_AFTER_CALL_40| .cse0) (bvadd dll_circular_update_at_~head.offset (_ bv8 32)) dll_circular_update_at_~data)))))) [2018-11-23 11:12:35,033 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) [2018-11-23 11:12:37,213 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 31 treesize of output 31 [2018-11-23 11:12:37,224 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 20 treesize of output 11 [2018-11-23 11:12:37,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:37,264 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 18 treesize of output 9 [2018-11-23 11:12:37,266 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:37,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:37,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:37,287 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-11-23 11:12:37,292 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:37,292 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~s~0.base, v_main_~s~0.base_BEFORE_CALL_3]. (let ((.cse0 (select (select |#memory_int| main_~s~0.base) (_ bv8 32)))) (and (= |main_#t~ret16| .cse0) (= main_~expected~0 .cse0) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv2 32) .cse0))) [2018-11-23 11:12:37,293 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv0 32) (bvadd |main_#t~ret16| (_ bv4294967294 32))) (= |main_#t~ret16| main_~expected~0)) [2018-11-23 11:12:37,354 INFO L256 TraceCheckUtils]: 0: Hoare triple {2192#true} call ULTIMATE.init(); {2192#true} is VALID [2018-11-23 11:12:37,354 INFO L273 TraceCheckUtils]: 1: Hoare triple {2192#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2192#true} is VALID [2018-11-23 11:12:37,355 INFO L273 TraceCheckUtils]: 2: Hoare triple {2192#true} assume true; {2192#true} is VALID [2018-11-23 11:12:37,355 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2192#true} {2192#true} #152#return; {2192#true} is VALID [2018-11-23 11:12:37,355 INFO L256 TraceCheckUtils]: 4: Hoare triple {2192#true} call #t~ret17 := main(); {2192#true} is VALID [2018-11-23 11:12:37,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {2192#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2212#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:37,356 INFO L256 TraceCheckUtils]: 6: Hoare triple {2212#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {2192#true} is VALID [2018-11-23 11:12:37,356 INFO L273 TraceCheckUtils]: 7: Hoare triple {2192#true} ~len := #in~len;~data := #in~data; {2192#true} is VALID [2018-11-23 11:12:37,356 INFO L256 TraceCheckUtils]: 8: Hoare triple {2192#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {2192#true} is VALID [2018-11-23 11:12:37,357 INFO L273 TraceCheckUtils]: 9: Hoare triple {2192#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2225#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:12:37,360 INFO L273 TraceCheckUtils]: 10: Hoare triple {2225#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2225#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:12:37,362 INFO L273 TraceCheckUtils]: 11: Hoare triple {2225#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2232#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:12:37,381 INFO L273 TraceCheckUtils]: 12: Hoare triple {2232#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} assume true; {2232#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:12:37,382 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {2232#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} {2192#true} #148#return; {2239#(= (_ bv1 1) (select |#valid| |dll_circular_create_#t~ret3.base|))} is VALID [2018-11-23 11:12:37,383 INFO L273 TraceCheckUtils]: 14: Hoare triple {2239#(= (_ bv1 1) (select |#valid| |dll_circular_create_#t~ret3.base|))} ~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; {2243#(and (= (bvadd (select |#valid| dll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-23 11:12:37,384 INFO L273 TraceCheckUtils]: 15: Hoare triple {2243#(and (= (bvadd (select |#valid| dll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} assume !!~bvsgt32(~len, 1bv32); {2243#(and (= (bvadd (select |#valid| dll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-23 11:12:37,385 INFO L256 TraceCheckUtils]: 16: Hoare triple {2243#(and (= (bvadd (select |#valid| dll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2250#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:12:37,386 INFO L273 TraceCheckUtils]: 17: Hoare triple {2250#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2254#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:12:37,387 INFO L273 TraceCheckUtils]: 18: Hoare triple {2254#(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); {2254#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:12:37,394 INFO L273 TraceCheckUtils]: 19: Hoare triple {2254#(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~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2261#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:12:37,395 INFO L273 TraceCheckUtils]: 20: Hoare triple {2261#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {2261#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:12:37,396 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2261#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {2243#(and (= (bvadd (select |#valid| dll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} #150#return; {2268#(and (not (= dll_circular_create_~head~0.base |dll_circular_create_#t~ret4.base|)) (= (_ bv0 32) |dll_circular_create_#t~ret4.offset|) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-23 11:12:37,398 INFO L273 TraceCheckUtils]: 22: Hoare triple {2268#(and (not (= dll_circular_create_~head~0.base |dll_circular_create_#t~ret4.base|)) (= (_ bv0 32) |dll_circular_create_#t~ret4.offset|) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.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); {2272#(and (not (= dll_circular_create_~head~0.base dll_circular_create_~new_head~0.base)) (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset)) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-23 11:12:37,401 INFO L273 TraceCheckUtils]: 23: Hoare triple {2272#(and (not (= dll_circular_create_~head~0.base dll_circular_create_~new_head~0.base)) (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset)) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32); {2276#(and (= dll_circular_create_~last~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset)) (exists ((dll_circular_create_~head~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32))) dll_circular_create_~new_head~0.base)) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)))} is VALID [2018-11-23 11:12:37,404 INFO L273 TraceCheckUtils]: 24: Hoare triple {2276#(and (= dll_circular_create_~last~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset)) (exists ((dll_circular_create_~head~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (bvadd dll_circular_create_~head~0.offset (_ bv4 32))) dll_circular_create_~new_head~0.base)) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)))} ~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; {2280#(and (= (select (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) dll_circular_create_~head~0.offset) dll_circular_create_~last~0.base) (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (bvadd v_subst_1 (_ bv4 32))))))} is VALID [2018-11-23 11:12:37,406 INFO L273 TraceCheckUtils]: 25: Hoare triple {2280#(and (= (select (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) dll_circular_create_~head~0.offset) dll_circular_create_~last~0.base) (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (bvadd v_subst_1 (_ bv4 32))))))} assume !~bvsgt32(~len, 1bv32); {2280#(and (= (select (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) dll_circular_create_~head~0.offset) dll_circular_create_~last~0.base) (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (bvadd v_subst_1 (_ bv4 32))))))} is VALID [2018-11-23 11:12:37,411 INFO L273 TraceCheckUtils]: 26: Hoare triple {2280#(and (= (select (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) dll_circular_create_~head~0.offset) dll_circular_create_~last~0.base) (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (bvadd v_subst_1 (_ bv4 32))))))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {2287#(and (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) |dll_circular_create_#res.base|)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|)) (bvadd v_subst_1 (_ bv4 32))) |dll_circular_create_#res.base|)) (= (_ bv0 32) |dll_circular_create_#res.offset|))} is VALID [2018-11-23 11:12:37,413 INFO L273 TraceCheckUtils]: 27: Hoare triple {2287#(and (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) |dll_circular_create_#res.base|)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|)) (bvadd v_subst_1 (_ bv4 32))) |dll_circular_create_#res.base|)) (= (_ bv0 32) |dll_circular_create_#res.offset|))} assume true; {2287#(and (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) |dll_circular_create_#res.base|)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|)) (bvadd v_subst_1 (_ bv4 32))) |dll_circular_create_#res.base|)) (= (_ bv0 32) |dll_circular_create_#res.offset|))} is VALID [2018-11-23 11:12:37,415 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2287#(and (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) |dll_circular_create_#res.base|)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|)) (bvadd v_subst_1 (_ bv4 32))) |dll_circular_create_#res.base|)) (= (_ bv0 32) |dll_circular_create_#res.offset|))} {2212#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #140#return; {2294#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|) |main_#t~ret13.base|)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|)) (bvadd v_subst_1 (_ bv4 32))) |main_#t~ret13.base|)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|) (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (bvadd |main_#t~ret13.offset| (_ bv4 32)))) (= |main_#t~ret13.offset| (_ bv0 32)))} is VALID [2018-11-23 11:12:37,419 INFO L273 TraceCheckUtils]: 29: Hoare triple {2294#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|) |main_#t~ret13.base|)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|)) (bvadd v_subst_1 (_ bv4 32))) |main_#t~ret13.base|)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) |main_#t~ret13.offset|) (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (bvadd |main_#t~ret13.offset| (_ bv4 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 := 0bv32; {2298#(and (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:37,420 INFO L273 TraceCheckUtils]: 30: Hoare triple {2298#(and (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2302#(and (= main_~len~0 main_~new_data~0) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (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)))} is VALID [2018-11-23 11:12:37,422 INFO L256 TraceCheckUtils]: 31: Hoare triple {2302#(and (= main_~len~0 main_~new_data~0) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (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)))} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2306#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-23 11:12:37,424 INFO L273 TraceCheckUtils]: 32: Hoare triple {2306#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2310#(and (= |dll_circular_update_at_#in~head.base| dll_circular_update_at_~head.base) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset) (= |dll_circular_update_at_#in~data| dll_circular_update_at_~data))} is VALID [2018-11-23 11:12:37,424 INFO L273 TraceCheckUtils]: 33: Hoare triple {2310#(and (= |dll_circular_update_at_#in~head.base| dll_circular_update_at_~head.base) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset) (= |dll_circular_update_at_#in~data| dll_circular_update_at_~data))} assume !~bvsgt32(~index, 0bv32); {2310#(and (= |dll_circular_update_at_#in~head.base| dll_circular_update_at_~head.base) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset) (= |dll_circular_update_at_#in~data| dll_circular_update_at_~data))} is VALID [2018-11-23 11:12:37,438 INFO L273 TraceCheckUtils]: 34: Hoare triple {2310#(and (= |dll_circular_update_at_#in~head.base| dll_circular_update_at_~head.base) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset) (= |dll_circular_update_at_#in~data| dll_circular_update_at_~data))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32); {2317#(and (= (select (select |#memory_int| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32))) |dll_circular_update_at_#in~data|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32)) (select (select |#memory_$Pointer$.base| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32)))))))} is VALID [2018-11-23 11:12:37,440 INFO L273 TraceCheckUtils]: 35: Hoare triple {2317#(and (= (select (select |#memory_int| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32))) |dll_circular_update_at_#in~data|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32)) (select (select |#memory_$Pointer$.base| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32)))))))} assume true; {2317#(and (= (select (select |#memory_int| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32))) |dll_circular_update_at_#in~data|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32)) (select (select |#memory_$Pointer$.base| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32)))))))} is VALID [2018-11-23 11:12:37,447 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {2317#(and (= (select (select |#memory_int| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32))) |dll_circular_update_at_#in~data|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32)) (select (select |#memory_$Pointer$.base| |dll_circular_update_at_#in~head.base|) (bvadd |dll_circular_update_at_#in~head.offset| (_ bv8 32)))))))} {2302#(and (= main_~len~0 main_~new_data~0) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (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)))} #142#return; {2324#(and (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (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)))} is VALID [2018-11-23 11:12:37,450 INFO L273 TraceCheckUtils]: 37: Hoare triple {2324#(and (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (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)))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {2324#(and (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (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)))} is VALID [2018-11-23 11:12:37,454 INFO L273 TraceCheckUtils]: 38: Hoare triple {2324#(and (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (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)))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2324#(and (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (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)))} is VALID [2018-11-23 11:12:37,456 INFO L256 TraceCheckUtils]: 39: Hoare triple {2324#(and (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (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)))} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2334#(and (= |old(#memory_int)| |#memory_int|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:12:37,457 INFO L273 TraceCheckUtils]: 40: Hoare triple {2334#(and (= |old(#memory_int)| |#memory_int|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2338#(and (= |old(#memory_int)| |#memory_int|) (= |dll_circular_update_at_#in~head.base| dll_circular_update_at_~head.base) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))} is VALID [2018-11-23 11:12:37,458 INFO L273 TraceCheckUtils]: 41: Hoare triple {2338#(and (= |old(#memory_int)| |#memory_int|) (= |dll_circular_update_at_#in~head.base| dll_circular_update_at_~head.base) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))} 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; {2342#(and (= |old(#memory_int)| |#memory_int|) (= dll_circular_update_at_~head.base (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|)))} is VALID [2018-11-23 11:12:37,461 INFO L273 TraceCheckUtils]: 42: Hoare triple {2342#(and (= |old(#memory_int)| |#memory_int|) (= dll_circular_update_at_~head.base (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|)))} assume !~bvsgt32(~index, 0bv32); {2342#(and (= |old(#memory_int)| |#memory_int|) (= dll_circular_update_at_~head.base (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|)))} is VALID [2018-11-23 11:12:37,463 INFO L273 TraceCheckUtils]: 43: Hoare triple {2342#(and (= |old(#memory_int)| |#memory_int|) (= dll_circular_update_at_~head.base (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|)))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32); {2349#(exists ((dll_circular_update_at_~data (_ BitVec 32)) (dll_circular_update_at_~head.offset (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|)) (bvadd dll_circular_update_at_~head.offset (_ bv8 32)) dll_circular_update_at_~data))))} is VALID [2018-11-23 11:12:37,464 INFO L273 TraceCheckUtils]: 44: Hoare triple {2349#(exists ((dll_circular_update_at_~data (_ BitVec 32)) (dll_circular_update_at_~head.offset (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|)) (bvadd dll_circular_update_at_~head.offset (_ bv8 32)) dll_circular_update_at_~data))))} assume true; {2349#(exists ((dll_circular_update_at_~data (_ BitVec 32)) (dll_circular_update_at_~head.offset (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|)) (bvadd dll_circular_update_at_~head.offset (_ bv8 32)) dll_circular_update_at_~data))))} is VALID [2018-11-23 11:12:37,469 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2349#(exists ((dll_circular_update_at_~data (_ BitVec 32)) (dll_circular_update_at_~head.offset (_ BitVec 32))) (= |#memory_int| (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|)) (bvadd dll_circular_update_at_~head.offset (_ bv8 32)) dll_circular_update_at_~data))))} {2324#(and (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (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)))} #142#return; {2356#(and (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:37,471 INFO L273 TraceCheckUtils]: 46: Hoare triple {2356#(and (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {2356#(and (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:37,472 INFO L273 TraceCheckUtils]: 47: Hoare triple {2356#(and (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~len~0); {2356#(and (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:37,477 INFO L273 TraceCheckUtils]: 48: Hoare triple {2356#(and (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} ~i~0 := 0bv32; {2366#(and (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:37,481 INFO L273 TraceCheckUtils]: 49: Hoare triple {2366#(and (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {2370#(and (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~expected~0) (= (bvadd (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:12:37,485 INFO L256 TraceCheckUtils]: 50: Hoare triple {2370#(and (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~expected~0) (= (bvadd (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)))} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {2374#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:37,486 INFO L273 TraceCheckUtils]: 51: Hoare triple {2374#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2378#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_circular_get_data_at_#in~head.base| dll_circular_get_data_at_~head.base) (= dll_circular_get_data_at_~head.offset |dll_circular_get_data_at_#in~head.offset|))} is VALID [2018-11-23 11:12:37,487 INFO L273 TraceCheckUtils]: 52: Hoare triple {2378#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_circular_get_data_at_#in~head.base| dll_circular_get_data_at_~head.base) (= dll_circular_get_data_at_~head.offset |dll_circular_get_data_at_#in~head.offset|))} assume !~bvsgt32(~index, 0bv32); {2378#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_circular_get_data_at_#in~head.base| dll_circular_get_data_at_~head.base) (= dll_circular_get_data_at_~head.offset |dll_circular_get_data_at_#in~head.offset|))} is VALID [2018-11-23 11:12:37,490 INFO L273 TraceCheckUtils]: 53: Hoare triple {2378#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_circular_get_data_at_#in~head.base| dll_circular_get_data_at_~head.base) (= dll_circular_get_data_at_~head.offset |dll_circular_get_data_at_#in~head.offset|))} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {2385#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_circular_get_data_at_#res| (select (select |#memory_int| |dll_circular_get_data_at_#in~head.base|) (bvadd |dll_circular_get_data_at_#in~head.offset| (_ bv8 32)))))} is VALID [2018-11-23 11:12:37,500 INFO L273 TraceCheckUtils]: 54: Hoare triple {2385#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_circular_get_data_at_#res| (select (select |#memory_int| |dll_circular_get_data_at_#in~head.base|) (bvadd |dll_circular_get_data_at_#in~head.offset| (_ bv8 32)))))} assume true; {2385#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_circular_get_data_at_#res| (select (select |#memory_int| |dll_circular_get_data_at_#in~head.base|) (bvadd |dll_circular_get_data_at_#in~head.offset| (_ bv8 32)))))} is VALID [2018-11-23 11:12:37,506 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {2385#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_circular_get_data_at_#res| (select (select |#memory_int| |dll_circular_get_data_at_#in~head.base|) (bvadd |dll_circular_get_data_at_#in~head.offset| (_ bv8 32)))))} {2370#(and (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~expected~0) (= (bvadd (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)))} #144#return; {2392#(and (= |main_#t~ret16| main_~expected~0) (= (bvadd |main_#t~ret16| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:37,507 INFO L273 TraceCheckUtils]: 56: Hoare triple {2392#(and (= |main_#t~ret16| main_~expected~0) (= (bvadd |main_#t~ret16| (_ bv4294967294 32)) (_ bv0 32)))} assume ~expected~0 != #t~ret16;havoc #t~ret16; {2193#false} is VALID [2018-11-23 11:12:37,507 INFO L273 TraceCheckUtils]: 57: Hoare triple {2193#false} assume !false; {2193#false} is VALID [2018-11-23 11:12:37,523 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 11:12:37,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:12:43,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:12:43,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-11-23 11:12:43,130 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 58 [2018-11-23 11:12:43,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:12:43,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 11:12:43,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:43,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 11:12:43,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 11:12:43,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1378, Unknown=3, NotChecked=74, Total=1560 [2018-11-23 11:12:43,383 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 33 states. [2018-11-23 11:14:53,317 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-11-23 11:15:44,091 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20