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_remove_all_reverse_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:12:02,314 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:12:02,316 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:12:02,328 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:12:02,329 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:12:02,330 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:12:02,331 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:12:02,333 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:12:02,335 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:12:02,335 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:12:02,336 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:12:02,337 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:12:02,338 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:12:02,339 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:12:02,340 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:12:02,341 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:12:02,342 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:12:02,344 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:12:02,346 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:12:02,348 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:12:02,349 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:12:02,350 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:12:02,353 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:12:02,353 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:12:02,354 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:12:02,355 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:12:02,356 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:12:02,357 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:12:02,357 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:12:02,359 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:12:02,359 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:12:02,360 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:12:02,360 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:12:02,360 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:12:02,361 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:12:02,362 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:12:02,362 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:02,378 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:12:02,378 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:12:02,379 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:12:02,379 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:12:02,380 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:12:02,380 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:12:02,380 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:12:02,380 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:12:02,381 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:12:02,381 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:12:02,381 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:12:02,381 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:12:02,381 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:12:02,382 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:12:02,382 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:12:02,382 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:12:02,382 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:12:02,382 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:12:02,383 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:12:02,383 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:12:02,383 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:12:02,383 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:12:02,383 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:12:02,384 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:12:02,384 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:12:02,384 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:12:02,384 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:12:02,385 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:12:02,385 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:12:02,385 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:12:02,385 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:12:02,385 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:12:02,386 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:12:02,431 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:12:02,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:12:02,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:12:02,456 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:12:02,456 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:12:02,457 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:12:02,524 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf111dba/f0d7cd60838849769ddde8b95625036f/FLAGe1d8ae687 [2018-11-23 11:12:03,113 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:12:03,114 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:12:03,127 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf111dba/f0d7cd60838849769ddde8b95625036f/FLAGe1d8ae687 [2018-11-23 11:12:03,338 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf111dba/f0d7cd60838849769ddde8b95625036f [2018-11-23 11:12:03,350 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:12:03,351 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:12:03,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:12:03,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:12:03,356 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:12:03,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:12:03" (1/1) ... [2018-11-23 11:12:03,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6484c1b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:03, skipping insertion in model container [2018-11-23 11:12:03,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:12:03" (1/1) ... [2018-11-23 11:12:03,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:12:03,439 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:12:03,875 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:12:03,891 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:12:03,952 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:12:04,033 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:12:04,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:04 WrapperNode [2018-11-23 11:12:04,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:12:04,035 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:12:04,035 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:12:04,035 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:12:04,124 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:04" (1/1) ... [2018-11-23 11:12:04,145 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:04" (1/1) ... [2018-11-23 11:12:04,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:12:04,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:12:04,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:12:04,155 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:12:04,163 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:04" (1/1) ... [2018-11-23 11:12:04,164 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:04" (1/1) ... [2018-11-23 11:12:04,168 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:04" (1/1) ... [2018-11-23 11:12:04,169 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:04" (1/1) ... [2018-11-23 11:12:04,189 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:04" (1/1) ... [2018-11-23 11:12:04,196 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:04" (1/1) ... [2018-11-23 11:12:04,199 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:04" (1/1) ... [2018-11-23 11:12:04,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:12:04,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:12:04,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:12:04,204 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:12:04,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:04" (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:04,269 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-11-23 11:12:04,269 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-11-23 11:12:04,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:12:04,269 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:12:04,269 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:12:04,269 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 11:12:04,270 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 11:12:04,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:12:04,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:12:04,270 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:12:04,270 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:12:04,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:12:04,271 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_remove_last [2018-11-23 11:12:04,271 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_remove_last [2018-11-23 11:12:04,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:12:04,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:12:04,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:12:04,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 11:12:04,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:12:04,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:12:05,434 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:12:05,435 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:12:05,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:12:05 BoogieIcfgContainer [2018-11-23 11:12:05,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:12:05,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:12:05,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:12:05,440 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:12:05,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:12:03" (1/3) ... [2018-11-23 11:12:05,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c634af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:12:05, skipping insertion in model container [2018-11-23 11:12:05,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:12:04" (2/3) ... [2018-11-23 11:12:05,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c634af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:12:05, skipping insertion in model container [2018-11-23 11:12:05,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:12:05" (3/3) ... [2018-11-23 11:12:05,444 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:12:05,453 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:12:05,461 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:12:05,480 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:12:05,513 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:12:05,514 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:12:05,514 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:12:05,514 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:12:05,514 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:12:05,514 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:12:05,514 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:12:05,515 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:12:05,515 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:12:05,534 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 11:12:05,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:12:05,540 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:05,541 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] [2018-11-23 11:12:05,543 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:05,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:05,549 INFO L82 PathProgramCache]: Analyzing trace with hash 455397565, now seen corresponding path program 1 times [2018-11-23 11:12:05,554 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:05,554 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:05,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:12:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:05,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:05,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-23 11:12:05,914 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {45#true} is VALID [2018-11-23 11:12:05,915 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-23 11:12:05,916 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #89#return; {45#true} is VALID [2018-11-23 11:12:05,916 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret16 := main(); {45#true} is VALID [2018-11-23 11:12:05,917 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {45#true} is VALID [2018-11-23 11:12:05,917 INFO L256 TraceCheckUtils]: 6: Hoare triple {45#true} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {45#true} is VALID [2018-11-23 11:12:05,917 INFO L273 TraceCheckUtils]: 7: Hoare triple {45#true} ~len := #in~len;~data := #in~data; {45#true} is VALID [2018-11-23 11:12:05,918 INFO L256 TraceCheckUtils]: 8: Hoare triple {45#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {45#true} is VALID [2018-11-23 11:12:05,918 INFO L273 TraceCheckUtils]: 9: Hoare triple {45#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; {45#true} is VALID [2018-11-23 11:12:05,918 INFO L273 TraceCheckUtils]: 10: Hoare triple {45#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {45#true} is VALID [2018-11-23 11:12:05,921 INFO L273 TraceCheckUtils]: 11: Hoare triple {45#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; {45#true} is VALID [2018-11-23 11:12:05,921 INFO L273 TraceCheckUtils]: 12: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-23 11:12:05,922 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {45#true} {45#true} #85#return; {45#true} is VALID [2018-11-23 11:12:05,922 INFO L273 TraceCheckUtils]: 14: Hoare triple {45#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; {45#true} is VALID [2018-11-23 11:12:05,935 INFO L273 TraceCheckUtils]: 15: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-23 11:12:05,936 INFO L273 TraceCheckUtils]: 16: Hoare triple {46#false} 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; {46#false} is VALID [2018-11-23 11:12:05,936 INFO L273 TraceCheckUtils]: 17: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-23 11:12:05,937 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {46#false} {45#true} #81#return; {46#false} is VALID [2018-11-23 11:12:05,937 INFO L273 TraceCheckUtils]: 19: Hoare triple {46#false} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0bv32; {46#false} is VALID [2018-11-23 11:12:05,937 INFO L273 TraceCheckUtils]: 20: Hoare triple {46#false} assume !~bvslt32(~i~0, ~len~0); {46#false} is VALID [2018-11-23 11:12:05,938 INFO L273 TraceCheckUtils]: 21: Hoare triple {46#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {46#false} is VALID [2018-11-23 11:12:05,938 INFO L273 TraceCheckUtils]: 22: Hoare triple {46#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {46#false} is VALID [2018-11-23 11:12:05,938 INFO L273 TraceCheckUtils]: 23: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-23 11:12:05,953 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:05,953 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:12:05,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:12:05,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:12:05,967 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 11:12:05,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:12:05,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:12:06,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:06,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:12:06,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:12:06,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:12:06,093 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 11:12:06,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:06,435 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-11-23 11:12:06,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:12:06,435 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 11:12:06,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:12:06,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:12:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2018-11-23 11:12:06,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:12:06,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2018-11-23 11:12:06,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 72 transitions. [2018-11-23 11:12:06,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:06,784 INFO L225 Difference]: With dead ends: 61 [2018-11-23 11:12:06,784 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:12:06,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:12:06,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:12:06,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 11:12:06,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:12:06,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-23 11:12:06,917 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 11:12:06,918 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 11:12:06,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:06,924 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 11:12:06,925 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 11:12:06,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:06,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:06,926 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 11:12:06,926 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 11:12:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:06,932 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 11:12:06,932 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 11:12:06,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:06,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:06,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:12:06,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:12:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:12:06,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-23 11:12:06,939 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 24 [2018-11-23 11:12:06,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:12:06,940 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-23 11:12:06,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:12:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 11:12:06,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:12:06,942 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:06,942 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] [2018-11-23 11:12:06,942 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:06,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:06,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1817498192, now seen corresponding path program 1 times [2018-11-23 11:12:06,944 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:06,944 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:06,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:12:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:07,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:07,444 INFO L256 TraceCheckUtils]: 0: Hoare triple {319#true} call ULTIMATE.init(); {319#true} is VALID [2018-11-23 11:12:07,444 INFO L273 TraceCheckUtils]: 1: Hoare triple {319#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {319#true} is VALID [2018-11-23 11:12:07,444 INFO L273 TraceCheckUtils]: 2: Hoare triple {319#true} assume true; {319#true} is VALID [2018-11-23 11:12:07,445 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {319#true} {319#true} #89#return; {319#true} is VALID [2018-11-23 11:12:07,445 INFO L256 TraceCheckUtils]: 4: Hoare triple {319#true} call #t~ret16 := main(); {319#true} is VALID [2018-11-23 11:12:07,446 INFO L273 TraceCheckUtils]: 5: Hoare triple {319#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {339#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:07,446 INFO L256 TraceCheckUtils]: 6: Hoare triple {339#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {319#true} is VALID [2018-11-23 11:12:07,452 INFO L273 TraceCheckUtils]: 7: Hoare triple {319#true} ~len := #in~len;~data := #in~data; {346#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-23 11:12:07,452 INFO L256 TraceCheckUtils]: 8: Hoare triple {346#(= |dll_circular_create_#in~len| dll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {319#true} is VALID [2018-11-23 11:12:07,452 INFO L273 TraceCheckUtils]: 9: Hoare triple {319#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; {319#true} is VALID [2018-11-23 11:12:07,453 INFO L273 TraceCheckUtils]: 10: Hoare triple {319#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {319#true} is VALID [2018-11-23 11:12:07,453 INFO L273 TraceCheckUtils]: 11: Hoare triple {319#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; {319#true} is VALID [2018-11-23 11:12:07,453 INFO L273 TraceCheckUtils]: 12: Hoare triple {319#true} assume true; {319#true} is VALID [2018-11-23 11:12:07,454 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {319#true} {346#(= |dll_circular_create_#in~len| dll_circular_create_~len)} #85#return; {346#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-23 11:12:07,455 INFO L273 TraceCheckUtils]: 14: Hoare triple {346#(= |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; {346#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-23 11:12:07,457 INFO L273 TraceCheckUtils]: 15: Hoare triple {346#(= |dll_circular_create_#in~len| dll_circular_create_~len)} assume !~bvsgt32(~len, 1bv32); {371#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-23 11:12:07,459 INFO L273 TraceCheckUtils]: 16: Hoare triple {371#(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; {371#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-23 11:12:07,460 INFO L273 TraceCheckUtils]: 17: Hoare triple {371#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} assume true; {371#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-23 11:12:07,461 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {371#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} {339#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #81#return; {320#false} is VALID [2018-11-23 11:12:07,461 INFO L273 TraceCheckUtils]: 19: Hoare triple {320#false} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0bv32; {320#false} is VALID [2018-11-23 11:12:07,462 INFO L273 TraceCheckUtils]: 20: Hoare triple {320#false} assume !~bvslt32(~i~0, ~len~0); {320#false} is VALID [2018-11-23 11:12:07,462 INFO L273 TraceCheckUtils]: 21: Hoare triple {320#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {320#false} is VALID [2018-11-23 11:12:07,462 INFO L273 TraceCheckUtils]: 22: Hoare triple {320#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {320#false} is VALID [2018-11-23 11:12:07,462 INFO L273 TraceCheckUtils]: 23: Hoare triple {320#false} assume !false; {320#false} is VALID [2018-11-23 11:12:07,465 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:07,466 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:12:07,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:12:07,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:12:07,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 11:12:07,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:12:07,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:12:07,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:07,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:12:07,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:12:07,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:12:07,551 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2018-11-23 11:12:08,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:08,519 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-23 11:12:08,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:12:08,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 11:12:08,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:12:08,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:12:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2018-11-23 11:12:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:12:08,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2018-11-23 11:12:08,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2018-11-23 11:12:08,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:08,688 INFO L225 Difference]: With dead ends: 55 [2018-11-23 11:12:08,689 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:12:08,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:12:08,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:12:08,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-11-23 11:12:08,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:12:08,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 36 states. [2018-11-23 11:12:08,714 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 36 states. [2018-11-23 11:12:08,714 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 36 states. [2018-11-23 11:12:08,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:08,720 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-23 11:12:08,720 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-23 11:12:08,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:08,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:08,721 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 40 states. [2018-11-23 11:12:08,722 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 40 states. [2018-11-23 11:12:08,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:08,726 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-23 11:12:08,726 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-23 11:12:08,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:08,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:08,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:12:08,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:12:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:12:08,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-23 11:12:08,731 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 24 [2018-11-23 11:12:08,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:12:08,731 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-23 11:12:08,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:12:08,732 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 11:12:08,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 11:12:08,733 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:08,735 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] [2018-11-23 11:12:08,736 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:08,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:08,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1351483172, now seen corresponding path program 1 times [2018-11-23 11:12:08,737 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:08,737 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:08,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:12:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:08,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:08,974 INFO L256 TraceCheckUtils]: 0: Hoare triple {603#true} call ULTIMATE.init(); {603#true} is VALID [2018-11-23 11:12:08,974 INFO L273 TraceCheckUtils]: 1: Hoare triple {603#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {603#true} is VALID [2018-11-23 11:12:08,975 INFO L273 TraceCheckUtils]: 2: Hoare triple {603#true} assume true; {603#true} is VALID [2018-11-23 11:12:08,975 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {603#true} {603#true} #89#return; {603#true} is VALID [2018-11-23 11:12:08,976 INFO L256 TraceCheckUtils]: 4: Hoare triple {603#true} call #t~ret16 := main(); {603#true} is VALID [2018-11-23 11:12:08,979 INFO L273 TraceCheckUtils]: 5: Hoare triple {603#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {623#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:08,979 INFO L256 TraceCheckUtils]: 6: Hoare triple {623#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {603#true} is VALID [2018-11-23 11:12:08,980 INFO L273 TraceCheckUtils]: 7: Hoare triple {603#true} ~len := #in~len;~data := #in~data; {603#true} is VALID [2018-11-23 11:12:08,980 INFO L256 TraceCheckUtils]: 8: Hoare triple {603#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {603#true} is VALID [2018-11-23 11:12:08,980 INFO L273 TraceCheckUtils]: 9: Hoare triple {603#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; {603#true} is VALID [2018-11-23 11:12:08,980 INFO L273 TraceCheckUtils]: 10: Hoare triple {603#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {603#true} is VALID [2018-11-23 11:12:08,981 INFO L273 TraceCheckUtils]: 11: Hoare triple {603#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; {603#true} is VALID [2018-11-23 11:12:08,981 INFO L273 TraceCheckUtils]: 12: Hoare triple {603#true} assume true; {603#true} is VALID [2018-11-23 11:12:08,981 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {603#true} {603#true} #85#return; {603#true} is VALID [2018-11-23 11:12:08,981 INFO L273 TraceCheckUtils]: 14: Hoare triple {603#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; {603#true} is VALID [2018-11-23 11:12:08,982 INFO L273 TraceCheckUtils]: 15: Hoare triple {603#true} assume !!~bvsgt32(~len, 1bv32); {603#true} is VALID [2018-11-23 11:12:08,982 INFO L256 TraceCheckUtils]: 16: Hoare triple {603#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {603#true} is VALID [2018-11-23 11:12:08,982 INFO L273 TraceCheckUtils]: 17: Hoare triple {603#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; {603#true} is VALID [2018-11-23 11:12:08,983 INFO L273 TraceCheckUtils]: 18: Hoare triple {603#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {603#true} is VALID [2018-11-23 11:12:08,983 INFO L273 TraceCheckUtils]: 19: Hoare triple {603#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; {603#true} is VALID [2018-11-23 11:12:08,983 INFO L273 TraceCheckUtils]: 20: Hoare triple {603#true} assume true; {603#true} is VALID [2018-11-23 11:12:08,984 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {603#true} {603#true} #87#return; {603#true} is VALID [2018-11-23 11:12:08,984 INFO L273 TraceCheckUtils]: 22: Hoare triple {603#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); {603#true} is VALID [2018-11-23 11:12:08,984 INFO L273 TraceCheckUtils]: 23: Hoare triple {603#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); {603#true} is VALID [2018-11-23 11:12:08,985 INFO L273 TraceCheckUtils]: 24: Hoare triple {603#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; {603#true} is VALID [2018-11-23 11:12:08,985 INFO L273 TraceCheckUtils]: 25: Hoare triple {603#true} assume !~bvsgt32(~len, 1bv32); {603#true} is VALID [2018-11-23 11:12:08,985 INFO L273 TraceCheckUtils]: 26: Hoare triple {603#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; {603#true} is VALID [2018-11-23 11:12:08,986 INFO L273 TraceCheckUtils]: 27: Hoare triple {603#true} assume true; {603#true} is VALID [2018-11-23 11:12:08,989 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {603#true} {623#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #81#return; {623#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:08,990 INFO L273 TraceCheckUtils]: 29: Hoare triple {623#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0bv32; {696#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:08,992 INFO L273 TraceCheckUtils]: 30: Hoare triple {696#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~len~0); {604#false} is VALID [2018-11-23 11:12:08,992 INFO L273 TraceCheckUtils]: 31: Hoare triple {604#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {604#false} is VALID [2018-11-23 11:12:08,992 INFO L273 TraceCheckUtils]: 32: Hoare triple {604#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {604#false} is VALID [2018-11-23 11:12:08,993 INFO L273 TraceCheckUtils]: 33: Hoare triple {604#false} assume !false; {604#false} is VALID [2018-11-23 11:12:08,995 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:08,995 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:12:09,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:12:09,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:12:09,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 11:12:09,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:12:09,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:12:09,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:09,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:12:09,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:12:09,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:12:09,111 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 4 states. [2018-11-23 11:12:10,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:10,057 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 11:12:10,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:12:10,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 11:12:10,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:12:10,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:12:10,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2018-11-23 11:12:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:12:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2018-11-23 11:12:10,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 47 transitions. [2018-11-23 11:12:10,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:10,157 INFO L225 Difference]: With dead ends: 43 [2018-11-23 11:12:10,157 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 11:12:10,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 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:10,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 11:12:10,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 11:12:10,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:12:10,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 11:12:10,191 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 11:12:10,191 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 11:12:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:10,195 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-23 11:12:10,195 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-23 11:12:10,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:10,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:10,196 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 11:12:10,197 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 11:12:10,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:10,200 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-23 11:12:10,200 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-23 11:12:10,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:10,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:10,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:12:10,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:12:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:12:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 11:12:10,205 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 34 [2018-11-23 11:12:10,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:12:10,205 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 11:12:10,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:12:10,206 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 11:12:10,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:12:10,207 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:10,207 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:10,208 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:10,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:10,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1027668706, now seen corresponding path program 1 times [2018-11-23 11:12:10,209 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:10,209 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:10,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:12:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:10,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:10,504 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-23 11:12:10,505 INFO L273 TraceCheckUtils]: 1: Hoare triple {900#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {900#true} is VALID [2018-11-23 11:12:10,505 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 11:12:10,505 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #89#return; {900#true} is VALID [2018-11-23 11:12:10,506 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret16 := main(); {900#true} is VALID [2018-11-23 11:12:10,507 INFO L273 TraceCheckUtils]: 5: Hoare triple {900#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {920#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:10,507 INFO L256 TraceCheckUtils]: 6: Hoare triple {920#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {900#true} is VALID [2018-11-23 11:12:10,508 INFO L273 TraceCheckUtils]: 7: Hoare triple {900#true} ~len := #in~len;~data := #in~data; {900#true} is VALID [2018-11-23 11:12:10,508 INFO L256 TraceCheckUtils]: 8: Hoare triple {900#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {900#true} is VALID [2018-11-23 11:12:10,508 INFO L273 TraceCheckUtils]: 9: Hoare triple {900#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; {900#true} is VALID [2018-11-23 11:12:10,508 INFO L273 TraceCheckUtils]: 10: Hoare triple {900#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {900#true} is VALID [2018-11-23 11:12:10,509 INFO L273 TraceCheckUtils]: 11: Hoare triple {900#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; {900#true} is VALID [2018-11-23 11:12:10,509 INFO L273 TraceCheckUtils]: 12: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 11:12:10,509 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {900#true} {900#true} #85#return; {900#true} is VALID [2018-11-23 11:12:10,509 INFO L273 TraceCheckUtils]: 14: Hoare triple {900#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; {900#true} is VALID [2018-11-23 11:12:10,510 INFO L273 TraceCheckUtils]: 15: Hoare triple {900#true} assume !!~bvsgt32(~len, 1bv32); {900#true} is VALID [2018-11-23 11:12:10,510 INFO L256 TraceCheckUtils]: 16: Hoare triple {900#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {900#true} is VALID [2018-11-23 11:12:10,510 INFO L273 TraceCheckUtils]: 17: Hoare triple {900#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; {900#true} is VALID [2018-11-23 11:12:10,510 INFO L273 TraceCheckUtils]: 18: Hoare triple {900#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {900#true} is VALID [2018-11-23 11:12:10,511 INFO L273 TraceCheckUtils]: 19: Hoare triple {900#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; {900#true} is VALID [2018-11-23 11:12:10,511 INFO L273 TraceCheckUtils]: 20: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 11:12:10,511 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {900#true} {900#true} #87#return; {900#true} is VALID [2018-11-23 11:12:10,511 INFO L273 TraceCheckUtils]: 22: Hoare triple {900#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); {900#true} is VALID [2018-11-23 11:12:10,512 INFO L273 TraceCheckUtils]: 23: Hoare triple {900#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); {900#true} is VALID [2018-11-23 11:12:10,512 INFO L273 TraceCheckUtils]: 24: Hoare triple {900#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; {900#true} is VALID [2018-11-23 11:12:10,512 INFO L273 TraceCheckUtils]: 25: Hoare triple {900#true} assume !~bvsgt32(~len, 1bv32); {900#true} is VALID [2018-11-23 11:12:10,513 INFO L273 TraceCheckUtils]: 26: Hoare triple {900#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; {900#true} is VALID [2018-11-23 11:12:10,513 INFO L273 TraceCheckUtils]: 27: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 11:12:10,516 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {900#true} {920#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #81#return; {920#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:12:10,522 INFO L273 TraceCheckUtils]: 29: Hoare triple {920#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0bv32; {993#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:10,524 INFO L273 TraceCheckUtils]: 30: Hoare triple {993#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~len~0); {993#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:10,524 INFO L256 TraceCheckUtils]: 31: Hoare triple {993#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {900#true} is VALID [2018-11-23 11:12:10,524 INFO L273 TraceCheckUtils]: 32: Hoare triple {900#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {900#true} is VALID [2018-11-23 11:12:10,525 INFO L273 TraceCheckUtils]: 33: Hoare triple {900#true} assume ~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0bv32, 0bv32, ~head.base, ~head.offset, 4bv32); {900#true} is VALID [2018-11-23 11:12:10,525 INFO L273 TraceCheckUtils]: 34: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 11:12:10,526 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {900#true} {993#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #83#return; {993#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:10,531 INFO L273 TraceCheckUtils]: 36: Hoare triple {993#(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; {1015#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:12:10,532 INFO L273 TraceCheckUtils]: 37: Hoare triple {1015#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~len~0); {901#false} is VALID [2018-11-23 11:12:10,532 INFO L273 TraceCheckUtils]: 38: Hoare triple {901#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {901#false} is VALID [2018-11-23 11:12:10,532 INFO L273 TraceCheckUtils]: 39: Hoare triple {901#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {901#false} is VALID [2018-11-23 11:12:10,533 INFO L273 TraceCheckUtils]: 40: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-23 11:12:10,537 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:10,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:12:10,736 INFO L273 TraceCheckUtils]: 40: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-23 11:12:10,737 INFO L273 TraceCheckUtils]: 39: Hoare triple {901#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {901#false} is VALID [2018-11-23 11:12:10,737 INFO L273 TraceCheckUtils]: 38: Hoare triple {901#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {901#false} is VALID [2018-11-23 11:12:10,742 INFO L273 TraceCheckUtils]: 37: Hoare triple {1037#(bvslt main_~i~0 main_~len~0)} assume !~bvslt32(~i~0, ~len~0); {901#false} is VALID [2018-11-23 11:12:10,744 INFO L273 TraceCheckUtils]: 36: Hoare triple {1041#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1037#(bvslt main_~i~0 main_~len~0)} is VALID [2018-11-23 11:12:10,751 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {900#true} {1041#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} #83#return; {1041#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-23 11:12:10,751 INFO L273 TraceCheckUtils]: 34: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 11:12:10,751 INFO L273 TraceCheckUtils]: 33: Hoare triple {900#true} assume ~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0bv32, 0bv32, ~head.base, ~head.offset, 4bv32); {900#true} is VALID [2018-11-23 11:12:10,752 INFO L273 TraceCheckUtils]: 32: Hoare triple {900#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {900#true} is VALID [2018-11-23 11:12:10,752 INFO L256 TraceCheckUtils]: 31: Hoare triple {1041#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {900#true} is VALID [2018-11-23 11:12:10,752 INFO L273 TraceCheckUtils]: 30: Hoare triple {1041#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} assume !!~bvslt32(~i~0, ~len~0); {1041#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-23 11:12:10,761 INFO L273 TraceCheckUtils]: 29: Hoare triple {1063#(bvslt (_ bv1 32) main_~len~0)} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0bv32; {1041#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-23 11:12:10,762 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {900#true} {1063#(bvslt (_ bv1 32) main_~len~0)} #81#return; {1063#(bvslt (_ bv1 32) main_~len~0)} is VALID [2018-11-23 11:12:10,763 INFO L273 TraceCheckUtils]: 27: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 11:12:10,763 INFO L273 TraceCheckUtils]: 26: Hoare triple {900#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; {900#true} is VALID [2018-11-23 11:12:10,763 INFO L273 TraceCheckUtils]: 25: Hoare triple {900#true} assume !~bvsgt32(~len, 1bv32); {900#true} is VALID [2018-11-23 11:12:10,763 INFO L273 TraceCheckUtils]: 24: Hoare triple {900#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; {900#true} is VALID [2018-11-23 11:12:10,764 INFO L273 TraceCheckUtils]: 23: Hoare triple {900#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); {900#true} is VALID [2018-11-23 11:12:10,764 INFO L273 TraceCheckUtils]: 22: Hoare triple {900#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); {900#true} is VALID [2018-11-23 11:12:10,764 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {900#true} {900#true} #87#return; {900#true} is VALID [2018-11-23 11:12:10,764 INFO L273 TraceCheckUtils]: 20: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 11:12:10,765 INFO L273 TraceCheckUtils]: 19: Hoare triple {900#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; {900#true} is VALID [2018-11-23 11:12:10,765 INFO L273 TraceCheckUtils]: 18: Hoare triple {900#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {900#true} is VALID [2018-11-23 11:12:10,765 INFO L273 TraceCheckUtils]: 17: Hoare triple {900#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; {900#true} is VALID [2018-11-23 11:12:10,766 INFO L256 TraceCheckUtils]: 16: Hoare triple {900#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {900#true} is VALID [2018-11-23 11:12:10,766 INFO L273 TraceCheckUtils]: 15: Hoare triple {900#true} assume !!~bvsgt32(~len, 1bv32); {900#true} is VALID [2018-11-23 11:12:10,766 INFO L273 TraceCheckUtils]: 14: Hoare triple {900#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; {900#true} is VALID [2018-11-23 11:12:10,767 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {900#true} {900#true} #85#return; {900#true} is VALID [2018-11-23 11:12:10,767 INFO L273 TraceCheckUtils]: 12: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 11:12:10,767 INFO L273 TraceCheckUtils]: 11: Hoare triple {900#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; {900#true} is VALID [2018-11-23 11:12:10,767 INFO L273 TraceCheckUtils]: 10: Hoare triple {900#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {900#true} is VALID [2018-11-23 11:12:10,767 INFO L273 TraceCheckUtils]: 9: Hoare triple {900#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; {900#true} is VALID [2018-11-23 11:12:10,768 INFO L256 TraceCheckUtils]: 8: Hoare triple {900#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {900#true} is VALID [2018-11-23 11:12:10,768 INFO L273 TraceCheckUtils]: 7: Hoare triple {900#true} ~len := #in~len;~data := #in~data; {900#true} is VALID [2018-11-23 11:12:10,768 INFO L256 TraceCheckUtils]: 6: Hoare triple {1063#(bvslt (_ bv1 32) main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {900#true} is VALID [2018-11-23 11:12:10,769 INFO L273 TraceCheckUtils]: 5: Hoare triple {900#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1063#(bvslt (_ bv1 32) main_~len~0)} is VALID [2018-11-23 11:12:10,769 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret16 := main(); {900#true} is VALID [2018-11-23 11:12:10,769 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #89#return; {900#true} is VALID [2018-11-23 11:12:10,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 11:12:10,770 INFO L273 TraceCheckUtils]: 1: Hoare triple {900#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {900#true} is VALID [2018-11-23 11:12:10,770 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-23 11:12:10,774 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:10,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:12:10,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:12:10,778 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-23 11:12:10,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:12:10,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:12:10,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:10,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:12:10,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:12:10,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:12:10,945 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-11-23 11:12:12,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:12,446 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-11-23 11:12:12,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:12:12,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-23 11:12:12,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:12:12,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:12:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2018-11-23 11:12:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:12:12,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2018-11-23 11:12:12,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2018-11-23 11:12:12,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:12,605 INFO L225 Difference]: With dead ends: 46 [2018-11-23 11:12:12,605 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:12:12,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:12:12,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:12:12,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-23 11:12:12,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:12:12,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2018-11-23 11:12:12,678 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2018-11-23 11:12:12,678 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2018-11-23 11:12:12,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:12,682 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-23 11:12:12,682 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 11:12:12,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:12,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:12,683 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2018-11-23 11:12:12,683 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2018-11-23 11:12:12,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:12,687 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-23 11:12:12,687 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 11:12:12,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:12,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:12,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:12:12,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:12:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:12:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-11-23 11:12:12,691 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 41 [2018-11-23 11:12:12,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:12:12,692 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-23 11:12:12,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:12:12,692 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-23 11:12:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:12:12,693 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:12,694 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:12:12,694 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:12,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:12,694 INFO L82 PathProgramCache]: Analyzing trace with hash 2134127076, now seen corresponding path program 2 times [2018-11-23 11:12:12,695 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:12,695 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:12,712 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:12:12,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:12:12,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:12:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:12,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:13,148 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:13,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:13,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:13,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 11:12:13,180 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:13,181 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_52|]. (= |#valid| (store |v_#valid_52| node_create_~temp~0.base (_ bv1 1))) [2018-11-23 11:12:13,181 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| node_create_~temp~0.base) (_ bv1 1)) [2018-11-23 11:12:13,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:13,495 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:13,497 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:13,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:13,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:13,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-11-23 11:12:13,689 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-23 11:12:13,702 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:13,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:13,795 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:13,801 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:13,803 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:13,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:13,826 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:13,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:12:13,877 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2018-11-23 11:12:13,896 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:13,896 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_54|, dll_circular_create_~last~0.base, dll_circular_create_~last~0.offset]. (and (not (= |dll_circular_create_#res.base| dll_circular_create_~last~0.base)) (= |#memory_$Pointer$.base| (let ((.cse0 (store |v_#memory_$Pointer$.base_54| dll_circular_create_~last~0.base (store (select |v_#memory_$Pointer$.base_54| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset |dll_circular_create_#res.base|)))) (store .cse0 |dll_circular_create_#res.base| (store (select .cse0 |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)) dll_circular_create_~last~0.base)))) (= (_ bv0 32) |dll_circular_create_#res.offset|)) [2018-11-23 11:12:13,896 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [dll_circular_create_~last~0.offset]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32))))) (and (= (select (select |#memory_$Pointer$.base| .cse0) dll_circular_create_~last~0.offset) |dll_circular_create_#res.base|) (not (= |dll_circular_create_#res.base| .cse0)) (= (_ bv0 32) |dll_circular_create_#res.offset|))) [2018-11-23 11:12:14,659 INFO L256 TraceCheckUtils]: 0: Hoare triple {1363#true} call ULTIMATE.init(); {1363#true} is VALID [2018-11-23 11:12:14,660 INFO L273 TraceCheckUtils]: 1: Hoare triple {1363#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1363#true} is VALID [2018-11-23 11:12:14,660 INFO L273 TraceCheckUtils]: 2: Hoare triple {1363#true} assume true; {1363#true} is VALID [2018-11-23 11:12:14,660 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1363#true} {1363#true} #89#return; {1363#true} is VALID [2018-11-23 11:12:14,661 INFO L256 TraceCheckUtils]: 4: Hoare triple {1363#true} call #t~ret16 := main(); {1363#true} is VALID [2018-11-23 11:12:14,661 INFO L273 TraceCheckUtils]: 5: Hoare triple {1363#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1383#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:14,661 INFO L256 TraceCheckUtils]: 6: Hoare triple {1383#(= |main_~#s~0.offset| (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1363#true} is VALID [2018-11-23 11:12:14,662 INFO L273 TraceCheckUtils]: 7: Hoare triple {1363#true} ~len := #in~len;~data := #in~data; {1363#true} is VALID [2018-11-23 11:12:14,662 INFO L256 TraceCheckUtils]: 8: Hoare triple {1363#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1363#true} is VALID [2018-11-23 11:12:14,663 INFO L273 TraceCheckUtils]: 9: Hoare triple {1363#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; {1396#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:12:14,664 INFO L273 TraceCheckUtils]: 10: Hoare triple {1396#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1396#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:12:14,666 INFO L273 TraceCheckUtils]: 11: Hoare triple {1396#(= (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; {1403#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:12:14,666 INFO L273 TraceCheckUtils]: 12: Hoare triple {1403#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} assume true; {1403#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:12:14,669 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1403#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} {1363#true} #85#return; {1410#(= (_ bv1 1) (select |#valid| |dll_circular_create_#t~ret3.base|))} is VALID [2018-11-23 11:12:14,670 INFO L273 TraceCheckUtils]: 14: Hoare triple {1410#(= (_ 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; {1414#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:12:14,671 INFO L273 TraceCheckUtils]: 15: Hoare triple {1414#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} assume !!~bvsgt32(~len, 1bv32); {1414#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:12:14,673 INFO L256 TraceCheckUtils]: 16: Hoare triple {1414#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1421#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:12:14,674 INFO L273 TraceCheckUtils]: 17: Hoare triple {1421#(= |#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; {1425#(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:14,675 INFO L273 TraceCheckUtils]: 18: Hoare triple {1425#(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); {1425#(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:14,677 INFO L273 TraceCheckUtils]: 19: Hoare triple {1425#(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; {1432#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:12:14,678 INFO L273 TraceCheckUtils]: 20: Hoare triple {1432#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {1432#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:12:14,680 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1432#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {1414#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} #87#return; {1439#(and (= (_ bv0 32) |dll_circular_create_#t~ret4.offset|) (not (= dll_circular_create_~last~0.base |dll_circular_create_#t~ret4.base|)))} is VALID [2018-11-23 11:12:14,682 INFO L273 TraceCheckUtils]: 22: Hoare triple {1439#(and (= (_ bv0 32) |dll_circular_create_#t~ret4.offset|) (not (= dll_circular_create_~last~0.base |dll_circular_create_#t~ret4.base|)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32); {1443#(and (= (_ 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:14,683 INFO L273 TraceCheckUtils]: 23: Hoare triple {1443#(and (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_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); {1443#(and (= (_ 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:14,685 INFO L273 TraceCheckUtils]: 24: Hoare triple {1443#(and (= (_ 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; {1450#(and (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)))} is VALID [2018-11-23 11:12:14,687 INFO L273 TraceCheckUtils]: 25: Hoare triple {1450#(and (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)))} assume !~bvsgt32(~len, 1bv32); {1450#(and (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)))} is VALID [2018-11-23 11:12:14,689 INFO L273 TraceCheckUtils]: 26: Hoare triple {1450#(and (= (_ bv0 32) dll_circular_create_~head~0.offset) (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)))} 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; {1457#(and (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) dll_circular_create_~last~0.offset) |dll_circular_create_#res.base|)) (not (= |dll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32))))) (= (_ bv0 32) |dll_circular_create_#res.offset|))} is VALID [2018-11-23 11:12:14,691 INFO L273 TraceCheckUtils]: 27: Hoare triple {1457#(and (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) dll_circular_create_~last~0.offset) |dll_circular_create_#res.base|)) (not (= |dll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32))))) (= (_ bv0 32) |dll_circular_create_#res.offset|))} assume true; {1457#(and (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) dll_circular_create_~last~0.offset) |dll_circular_create_#res.base|)) (not (= |dll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32))))) (= (_ bv0 32) |dll_circular_create_#res.offset|))} is VALID [2018-11-23 11:12:14,696 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1457#(and (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) dll_circular_create_~last~0.offset) |dll_circular_create_#res.base|)) (not (= |dll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32))))) (= (_ bv0 32) |dll_circular_create_#res.offset|))} {1383#(= |main_~#s~0.offset| (_ bv0 32))} #81#return; {1464#(and (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (bvadd |main_#t~ret13.offset| (_ bv4 32)))) dll_circular_create_~last~0.offset) |main_#t~ret13.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (bvadd |main_#t~ret13.offset| (_ bv4 32))) |main_#t~ret13.base|)) (= |main_~#s~0.offset| (_ bv0 32)) (= |main_#t~ret13.offset| (_ bv0 32)))} is VALID [2018-11-23 11:12:14,698 INFO L273 TraceCheckUtils]: 29: Hoare triple {1464#(and (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (bvadd |main_#t~ret13.offset| (_ bv4 32)))) dll_circular_create_~last~0.offset) |main_#t~ret13.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (bvadd |main_#t~ret13.offset| (_ bv4 32))) |main_#t~ret13.base|)) (= |main_~#s~0.offset| (_ bv0 32)) (= |main_#t~ret13.offset| (_ bv0 32)))} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0bv32; {1468#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) dll_circular_create_~last~0.offset) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 11:12:14,702 INFO L273 TraceCheckUtils]: 30: Hoare triple {1468#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) dll_circular_create_~last~0.offset) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} assume !!~bvslt32(~i~0, ~len~0); {1468#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) dll_circular_create_~last~0.offset) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 11:12:14,703 INFO L256 TraceCheckUtils]: 31: Hoare triple {1468#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) dll_circular_create_~last~0.offset) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {1475#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:12:14,828 INFO L273 TraceCheckUtils]: 32: Hoare triple {1475#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1479#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) dll_circular_remove_last_~last~1.offset) (= |dll_circular_remove_last_#t~mem8.offset| (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= dll_circular_remove_last_~last~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) |dll_circular_remove_last_#t~mem8.base|))} is VALID [2018-11-23 11:12:14,830 INFO L273 TraceCheckUtils]: 33: Hoare triple {1479#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) dll_circular_remove_last_~last~1.offset) (= |dll_circular_remove_last_#t~mem8.offset| (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= dll_circular_remove_last_~last~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) |dll_circular_remove_last_#t~mem8.base|))} assume ~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0bv32, 0bv32, ~head.base, ~head.offset, 4bv32); {1483#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))))} is VALID [2018-11-23 11:12:14,831 INFO L273 TraceCheckUtils]: 34: Hoare triple {1483#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))))} assume true; {1483#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))))} is VALID [2018-11-23 11:12:14,833 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1483#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))))} {1468#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((dll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) dll_circular_create_~last~0.offset) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #83#return; {1364#false} is VALID [2018-11-23 11:12:14,833 INFO L273 TraceCheckUtils]: 36: Hoare triple {1364#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1364#false} is VALID [2018-11-23 11:12:14,833 INFO L273 TraceCheckUtils]: 37: Hoare triple {1364#false} assume !!~bvslt32(~i~0, ~len~0); {1364#false} is VALID [2018-11-23 11:12:14,834 INFO L256 TraceCheckUtils]: 38: Hoare triple {1364#false} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {1364#false} is VALID [2018-11-23 11:12:14,834 INFO L273 TraceCheckUtils]: 39: Hoare triple {1364#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1364#false} is VALID [2018-11-23 11:12:14,835 INFO L273 TraceCheckUtils]: 40: Hoare triple {1364#false} assume ~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0bv32, 0bv32, ~head.base, ~head.offset, 4bv32); {1364#false} is VALID [2018-11-23 11:12:14,835 INFO L273 TraceCheckUtils]: 41: Hoare triple {1364#false} assume true; {1364#false} is VALID [2018-11-23 11:12:14,836 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1364#false} {1364#false} #83#return; {1364#false} is VALID [2018-11-23 11:12:14,836 INFO L273 TraceCheckUtils]: 43: Hoare triple {1364#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1364#false} is VALID [2018-11-23 11:12:14,836 INFO L273 TraceCheckUtils]: 44: Hoare triple {1364#false} assume !~bvslt32(~i~0, ~len~0); {1364#false} is VALID [2018-11-23 11:12:14,836 INFO L273 TraceCheckUtils]: 45: Hoare triple {1364#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {1364#false} is VALID [2018-11-23 11:12:14,836 INFO L273 TraceCheckUtils]: 46: Hoare triple {1364#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1364#false} is VALID [2018-11-23 11:12:14,837 INFO L273 TraceCheckUtils]: 47: Hoare triple {1364#false} assume !false; {1364#false} is VALID [2018-11-23 11:12:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:12:14,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:12:19,192 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 53 treesize of output 51 [2018-11-23 11:12:19,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2018-11-23 11:12:19,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:19,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 25 [2018-11-23 11:12:19,306 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:19,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:19,369 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,370 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:61, output treesize:27 [2018-11-23 11:12:19,379 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:19,380 WARN L384 uantifierElimination]: Input elimination task: ∀ [|main_~#s~0.base|, |#memory_$Pointer$.offset|]. (let ((.cse2 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse1 (bvadd .cse2 (_ bv4 32))) (.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (or (not (= (select (select |#memory_$Pointer$.base| .cse0) .cse1) .cse0)) (not (= .cse2 (select (select |#memory_$Pointer$.offset| .cse0) .cse1))) (not (= .cse2 |main_#t~ret13.offset|)) (not (= .cse0 |main_#t~ret13.base|))))) [2018-11-23 11:12:19,380 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [|main_~#s~0.base|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (or (not (= (select (select |#memory_$Pointer$.base| .cse0) (bvadd |main_#t~ret13.offset| (_ bv4 32))) .cse0)) (not (= .cse0 |main_#t~ret13.base|)))) [2018-11-23 11:12:19,947 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-23 11:12:20,239 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:20,240 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 6 variables, input treesize:130, output treesize:1 [2018-11-23 11:12:22,503 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 76 [2018-11-23 11:12:23,007 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 25 [2018-11-23 11:12:23,013 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 9 treesize of output 8 [2018-11-23 11:12:23,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:23,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 17 [2018-11-23 11:12:23,057 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 6 treesize of output 1 [2018-11-23 11:12:23,058 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:23,068 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:23,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 11:12:23,100 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 10 [2018-11-23 11:12:23,101 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:23,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:23,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 11:12:23,138 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:23,141 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:23,143 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:23,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:23,146 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:131, output treesize:4 [2018-11-23 11:12:23,156 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:23,156 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_$Pointer$.base|, dll_circular_create_~last~0.offset, |main_~#s~0.base|, |v_main_~#s~0.offset_BEFORE_CALL_5|]. (let ((.cse2 (bvadd dll_circular_create_~head~0.offset (_ bv4 32)))) (let ((.cse1 (let ((.cse3 (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)))) (store .cse3 dll_circular_create_~head~0.base (store (select .cse3 dll_circular_create_~head~0.base) .cse2 dll_circular_create_~last~0.base))))) (let ((.cse0 (select (select .cse1 |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_5|))) (or (not (= dll_circular_create_~head~0.base .cse0)) (not (= (select (select .cse1 .cse0) .cse2) .cse0)))))) [2018-11-23 11:12:23,157 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) [2018-11-23 11:12:23,954 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-23 11:12:24,022 INFO L273 TraceCheckUtils]: 47: Hoare triple {1364#false} assume !false; {1364#false} is VALID [2018-11-23 11:12:24,022 INFO L273 TraceCheckUtils]: 46: Hoare triple {1364#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1364#false} is VALID [2018-11-23 11:12:24,022 INFO L273 TraceCheckUtils]: 45: Hoare triple {1364#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {1364#false} is VALID [2018-11-23 11:12:24,022 INFO L273 TraceCheckUtils]: 44: Hoare triple {1364#false} assume !~bvslt32(~i~0, ~len~0); {1364#false} is VALID [2018-11-23 11:12:24,022 INFO L273 TraceCheckUtils]: 43: Hoare triple {1364#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1364#false} is VALID [2018-11-23 11:12:24,023 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1363#true} {1364#false} #83#return; {1364#false} is VALID [2018-11-23 11:12:24,023 INFO L273 TraceCheckUtils]: 41: Hoare triple {1363#true} assume true; {1363#true} is VALID [2018-11-23 11:12:24,023 INFO L273 TraceCheckUtils]: 40: Hoare triple {1363#true} assume ~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0bv32, 0bv32, ~head.base, ~head.offset, 4bv32); {1363#true} is VALID [2018-11-23 11:12:24,023 INFO L273 TraceCheckUtils]: 39: Hoare triple {1363#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1363#true} is VALID [2018-11-23 11:12:24,023 INFO L256 TraceCheckUtils]: 38: Hoare triple {1364#false} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {1363#true} is VALID [2018-11-23 11:12:24,023 INFO L273 TraceCheckUtils]: 37: Hoare triple {1364#false} assume !!~bvslt32(~i~0, ~len~0); {1364#false} is VALID [2018-11-23 11:12:24,024 INFO L273 TraceCheckUtils]: 36: Hoare triple {1364#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1364#false} is VALID [2018-11-23 11:12:24,026 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1483#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))))} {1562#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))))))} #83#return; {1364#false} is VALID [2018-11-23 11:12:24,026 INFO L273 TraceCheckUtils]: 34: Hoare triple {1483#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))))} assume true; {1483#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))))} is VALID [2018-11-23 11:12:24,027 INFO L273 TraceCheckUtils]: 33: Hoare triple {1572#(or (and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))))) (not (= |dll_circular_remove_last_#t~mem8.base| dll_circular_remove_last_~last~1.base)) (not (= |dll_circular_remove_last_#t~mem8.offset| dll_circular_remove_last_~last~1.offset)))} assume ~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0bv32, 0bv32, ~head.base, ~head.offset, 4bv32); {1483#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))))} is VALID [2018-11-23 11:12:24,028 INFO L273 TraceCheckUtils]: 32: Hoare triple {1576#(or (and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1572#(or (and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))))) (not (= |dll_circular_remove_last_#t~mem8.base| dll_circular_remove_last_~last~1.base)) (not (= |dll_circular_remove_last_#t~mem8.offset| dll_circular_remove_last_~last~1.offset)))} is VALID [2018-11-23 11:12:24,030 INFO L256 TraceCheckUtils]: 31: Hoare triple {1562#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))))))} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {1576#(or (and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))))} is VALID [2018-11-23 11:12:24,030 INFO L273 TraceCheckUtils]: 30: Hoare triple {1562#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))))))} assume !!~bvslt32(~i~0, ~len~0); {1562#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))))))} is VALID [2018-11-23 11:12:24,033 INFO L273 TraceCheckUtils]: 29: Hoare triple {1583#(forall ((|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_#t~ret13.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~ret13.base|))))} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0bv32; {1562#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))))))} is VALID [2018-11-23 11:12:24,037 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1590#(forall ((|v_main_~#s~0.offset_BEFORE_CALL_5| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_5|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_5|)) (bvadd |dll_circular_create_#res.offset| (_ bv4 32))))) (not (= |dll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_5|)))))} {1363#true} #81#return; {1583#(forall ((|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_#t~ret13.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~ret13.base|))))} is VALID [2018-11-23 11:12:24,037 INFO L273 TraceCheckUtils]: 27: Hoare triple {1590#(forall ((|v_main_~#s~0.offset_BEFORE_CALL_5| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_5|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_5|)) (bvadd |dll_circular_create_#res.offset| (_ bv4 32))))) (not (= |dll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_5|)))))} assume true; {1590#(forall ((|v_main_~#s~0.offset_BEFORE_CALL_5| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_5|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_5|)) (bvadd |dll_circular_create_#res.offset| (_ bv4 32))))) (not (= |dll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_5|)))))} is VALID [2018-11-23 11:12:24,053 INFO L273 TraceCheckUtils]: 26: Hoare triple {1597#(not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} 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; {1590#(forall ((|v_main_~#s~0.offset_BEFORE_CALL_5| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_5|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_5|)) (bvadd |dll_circular_create_#res.offset| (_ bv4 32))))) (not (= |dll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |v_main_~#s~0.offset_BEFORE_CALL_5|)))))} is VALID [2018-11-23 11:12:24,053 INFO L273 TraceCheckUtils]: 25: Hoare triple {1597#(not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} assume !~bvsgt32(~len, 1bv32); {1597#(not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-23 11:12:24,054 INFO L273 TraceCheckUtils]: 24: Hoare triple {1604#(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; {1597#(not (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-23 11:12:24,054 INFO L273 TraceCheckUtils]: 23: Hoare triple {1604#(not (= dll_circular_create_~new_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); {1604#(not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-23 11:12:24,055 INFO L273 TraceCheckUtils]: 22: Hoare triple {1611#(not (= dll_circular_create_~last~0.base |dll_circular_create_#t~ret4.base|))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32); {1604#(not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-23 11:12:24,057 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1618#(not (= (_ bv1 1) (select |old(#valid)| |node_create_#res.base|)))} {1414#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} #87#return; {1611#(not (= dll_circular_create_~last~0.base |dll_circular_create_#t~ret4.base|))} is VALID [2018-11-23 11:12:24,057 INFO L273 TraceCheckUtils]: 20: Hoare triple {1618#(not (= (_ bv1 1) (select |old(#valid)| |node_create_#res.base|)))} assume true; {1618#(not (= (_ bv1 1) (select |old(#valid)| |node_create_#res.base|)))} is VALID [2018-11-23 11:12:24,059 INFO L273 TraceCheckUtils]: 19: Hoare triple {1625#(not (= (_ bv1 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; {1618#(not (= (_ bv1 1) (select |old(#valid)| |node_create_#res.base|)))} is VALID [2018-11-23 11:12:24,059 INFO L273 TraceCheckUtils]: 18: Hoare triple {1625#(not (= (_ bv1 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1625#(not (= (_ bv1 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:12:24,061 INFO L273 TraceCheckUtils]: 17: Hoare triple {1632#(forall ((|v_node_create_#t~malloc2.base_25| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| |v_node_create_#t~malloc2.base_25|))) (not (= (_ bv1 1) (select |old(#valid)| |v_node_create_#t~malloc2.base_25|)))))} ~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; {1625#(not (= (_ bv1 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:12:24,062 INFO L256 TraceCheckUtils]: 16: Hoare triple {1414#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1632#(forall ((|v_node_create_#t~malloc2.base_25| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| |v_node_create_#t~malloc2.base_25|))) (not (= (_ bv1 1) (select |old(#valid)| |v_node_create_#t~malloc2.base_25|)))))} is VALID [2018-11-23 11:12:24,063 INFO L273 TraceCheckUtils]: 15: Hoare triple {1414#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} assume !!~bvsgt32(~len, 1bv32); {1414#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:12:24,064 INFO L273 TraceCheckUtils]: 14: Hoare triple {1410#(= (_ 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; {1414#(= (bvadd (select |#valid| dll_circular_create_~last~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:12:24,065 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1403#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} {1363#true} #85#return; {1410#(= (_ bv1 1) (select |#valid| |dll_circular_create_#t~ret3.base|))} is VALID [2018-11-23 11:12:24,065 INFO L273 TraceCheckUtils]: 12: Hoare triple {1403#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} assume true; {1403#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:12:24,066 INFO L273 TraceCheckUtils]: 11: Hoare triple {1396#(= (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; {1403#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:12:24,067 INFO L273 TraceCheckUtils]: 10: Hoare triple {1396#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1396#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:12:24,069 INFO L273 TraceCheckUtils]: 9: Hoare triple {1363#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; {1396#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:12:24,069 INFO L256 TraceCheckUtils]: 8: Hoare triple {1363#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1363#true} is VALID [2018-11-23 11:12:24,070 INFO L273 TraceCheckUtils]: 7: Hoare triple {1363#true} ~len := #in~len;~data := #in~data; {1363#true} is VALID [2018-11-23 11:12:24,070 INFO L256 TraceCheckUtils]: 6: Hoare triple {1363#true} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1363#true} is VALID [2018-11-23 11:12:24,070 INFO L273 TraceCheckUtils]: 5: Hoare triple {1363#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1363#true} is VALID [2018-11-23 11:12:24,071 INFO L256 TraceCheckUtils]: 4: Hoare triple {1363#true} call #t~ret16 := main(); {1363#true} is VALID [2018-11-23 11:12:24,071 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1363#true} {1363#true} #89#return; {1363#true} is VALID [2018-11-23 11:12:24,071 INFO L273 TraceCheckUtils]: 2: Hoare triple {1363#true} assume true; {1363#true} is VALID [2018-11-23 11:12:24,072 INFO L273 TraceCheckUtils]: 1: Hoare triple {1363#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1363#true} is VALID [2018-11-23 11:12:24,072 INFO L256 TraceCheckUtils]: 0: Hoare triple {1363#true} call ULTIMATE.init(); {1363#true} is VALID [2018-11-23 11:12:24,079 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:12:24,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:12:24,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 30 [2018-11-23 11:12:24,087 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 48 [2018-11-23 11:12:24,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:12:24,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:12:24,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:24,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:12:24,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:12:24,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=790, Unknown=8, NotChecked=0, Total=870 [2018-11-23 11:12:24,479 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 30 states. [2018-11-23 11:12:37,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:37,732 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-11-23 11:12:37,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:12:37,733 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 48 [2018-11-23 11:12:37,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:12:37,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:12:37,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 64 transitions. [2018-11-23 11:12:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:12:37,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 64 transitions. [2018-11-23 11:12:37,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 64 transitions. [2018-11-23 11:12:38,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:38,212 INFO L225 Difference]: With dead ends: 59 [2018-11-23 11:12:38,212 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 11:12:38,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=159, Invalid=1531, Unknown=32, NotChecked=0, Total=1722 [2018-11-23 11:12:38,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 11:12:38,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-11-23 11:12:38,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:12:38,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 42 states. [2018-11-23 11:12:38,300 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 42 states. [2018-11-23 11:12:38,300 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 42 states. [2018-11-23 11:12:38,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:38,307 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-23 11:12:38,307 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-23 11:12:38,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:38,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:38,310 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 46 states. [2018-11-23 11:12:38,310 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 46 states. [2018-11-23 11:12:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:38,317 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-23 11:12:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-23 11:12:38,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:38,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:38,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:12:38,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:12:38,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:12:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-23 11:12:38,321 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 48 [2018-11-23 11:12:38,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:12:38,322 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-23 11:12:38,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:12:38,322 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 11:12:38,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:12:38,323 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:38,324 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:12:38,324 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:38,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:38,324 INFO L82 PathProgramCache]: Analyzing trace with hash 854263398, now seen corresponding path program 1 times [2018-11-23 11:12:38,325 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:38,325 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:12:38,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:12:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:38,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:38,631 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 11 treesize of output 8 [2018-11-23 11:12:38,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:12:38,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:38,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:38,652 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 11 treesize of output 8 [2018-11-23 11:12:38,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:12:38,678 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:38,681 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:38,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:38,691 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-11-23 11:12:38,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-11-23 11:12:38,782 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 11 treesize of output 3 [2018-11-23 11:12:38,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:38,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:38,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-11-23 11:12:38,802 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 11 treesize of output 3 [2018-11-23 11:12:38,802 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:38,805 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:38,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:38,811 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 11:12:38,816 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:38,816 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, |main_~#s~0.base|, |#memory_$Pointer$.base|]. (let ((.cse0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) (_ bv0 32))) (.cse1 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)))) (and (= |main_#t~mem15.offset| .cse0) (= (_ bv0 32) .cse0) (= (_ bv0 32) .cse1) (= |main_#t~mem15.base| .cse1))) [2018-11-23 11:12:38,816 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~mem15.offset| (_ bv0 32)) (= |main_#t~mem15.base| (_ bv0 32))) [2018-11-23 11:12:38,830 INFO L256 TraceCheckUtils]: 0: Hoare triple {1940#true} call ULTIMATE.init(); {1940#true} is VALID [2018-11-23 11:12:38,831 INFO L273 TraceCheckUtils]: 1: Hoare triple {1940#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1940#true} is VALID [2018-11-23 11:12:38,831 INFO L273 TraceCheckUtils]: 2: Hoare triple {1940#true} assume true; {1940#true} is VALID [2018-11-23 11:12:38,831 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1940#true} {1940#true} #89#return; {1940#true} is VALID [2018-11-23 11:12:38,832 INFO L256 TraceCheckUtils]: 4: Hoare triple {1940#true} call #t~ret16 := main(); {1940#true} is VALID [2018-11-23 11:12:38,832 INFO L273 TraceCheckUtils]: 5: Hoare triple {1940#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1960#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:38,833 INFO L256 TraceCheckUtils]: 6: Hoare triple {1960#(= |main_~#s~0.offset| (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1940#true} is VALID [2018-11-23 11:12:38,833 INFO L273 TraceCheckUtils]: 7: Hoare triple {1940#true} ~len := #in~len;~data := #in~data; {1940#true} is VALID [2018-11-23 11:12:38,833 INFO L256 TraceCheckUtils]: 8: Hoare triple {1940#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1940#true} is VALID [2018-11-23 11:12:38,833 INFO L273 TraceCheckUtils]: 9: Hoare triple {1940#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; {1940#true} is VALID [2018-11-23 11:12:38,833 INFO L273 TraceCheckUtils]: 10: Hoare triple {1940#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1940#true} is VALID [2018-11-23 11:12:38,834 INFO L273 TraceCheckUtils]: 11: Hoare triple {1940#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; {1940#true} is VALID [2018-11-23 11:12:38,834 INFO L273 TraceCheckUtils]: 12: Hoare triple {1940#true} assume true; {1940#true} is VALID [2018-11-23 11:12:38,834 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1940#true} {1940#true} #85#return; {1940#true} is VALID [2018-11-23 11:12:38,834 INFO L273 TraceCheckUtils]: 14: Hoare triple {1940#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; {1940#true} is VALID [2018-11-23 11:12:38,834 INFO L273 TraceCheckUtils]: 15: Hoare triple {1940#true} assume !!~bvsgt32(~len, 1bv32); {1940#true} is VALID [2018-11-23 11:12:38,835 INFO L256 TraceCheckUtils]: 16: Hoare triple {1940#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1940#true} is VALID [2018-11-23 11:12:38,835 INFO L273 TraceCheckUtils]: 17: Hoare triple {1940#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; {1940#true} is VALID [2018-11-23 11:12:38,835 INFO L273 TraceCheckUtils]: 18: Hoare triple {1940#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1940#true} is VALID [2018-11-23 11:12:38,835 INFO L273 TraceCheckUtils]: 19: Hoare triple {1940#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; {1940#true} is VALID [2018-11-23 11:12:38,836 INFO L273 TraceCheckUtils]: 20: Hoare triple {1940#true} assume true; {1940#true} is VALID [2018-11-23 11:12:38,836 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1940#true} {1940#true} #87#return; {1940#true} is VALID [2018-11-23 11:12:38,836 INFO L273 TraceCheckUtils]: 22: Hoare triple {1940#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); {1940#true} is VALID [2018-11-23 11:12:38,836 INFO L273 TraceCheckUtils]: 23: Hoare triple {1940#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); {1940#true} is VALID [2018-11-23 11:12:38,836 INFO L273 TraceCheckUtils]: 24: Hoare triple {1940#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; {1940#true} is VALID [2018-11-23 11:12:38,837 INFO L273 TraceCheckUtils]: 25: Hoare triple {1940#true} assume !~bvsgt32(~len, 1bv32); {1940#true} is VALID [2018-11-23 11:12:38,837 INFO L273 TraceCheckUtils]: 26: Hoare triple {1940#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; {1940#true} is VALID [2018-11-23 11:12:38,837 INFO L273 TraceCheckUtils]: 27: Hoare triple {1940#true} assume true; {1940#true} is VALID [2018-11-23 11:12:38,844 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1940#true} {1960#(= |main_~#s~0.offset| (_ bv0 32))} #81#return; {1960#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:38,844 INFO L273 TraceCheckUtils]: 29: Hoare triple {1960#(= |main_~#s~0.offset| (_ bv0 32))} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0bv32; {1960#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:38,845 INFO L273 TraceCheckUtils]: 30: Hoare triple {1960#(= |main_~#s~0.offset| (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0); {1960#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:38,845 INFO L256 TraceCheckUtils]: 31: Hoare triple {1960#(= |main_~#s~0.offset| (_ bv0 32))} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {1940#true} is VALID [2018-11-23 11:12:38,845 INFO L273 TraceCheckUtils]: 32: Hoare triple {1940#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1940#true} is VALID [2018-11-23 11:12:38,845 INFO L273 TraceCheckUtils]: 33: Hoare triple {1940#true} assume !(~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset);havoc #t~mem8.base, #t~mem8.offset;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~last~1.base, ~bvadd32(4bv32, ~last~1.offset), 4bv32);~snd_to_last~0.base, ~snd_to_last~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call ULTIMATE.dealloc(~last~1.base, ~last~1.offset);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, #t~mem11.base, ~bvadd32(4bv32, #t~mem11.offset), 4bv32);havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem12.base, #t~mem12.offset, ~snd_to_last~0.base, ~snd_to_last~0.offset, 4bv32);havoc #t~mem12.base, #t~mem12.offset; {1940#true} is VALID [2018-11-23 11:12:38,845 INFO L273 TraceCheckUtils]: 34: Hoare triple {1940#true} assume true; {1940#true} is VALID [2018-11-23 11:12:38,846 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1940#true} {1960#(= |main_~#s~0.offset| (_ bv0 32))} #83#return; {1960#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:38,846 INFO L273 TraceCheckUtils]: 36: Hoare triple {1960#(= |main_~#s~0.offset| (_ bv0 32))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1960#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:38,847 INFO L273 TraceCheckUtils]: 37: Hoare triple {1960#(= |main_~#s~0.offset| (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0); {1960#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:12:38,847 INFO L256 TraceCheckUtils]: 38: Hoare triple {1960#(= |main_~#s~0.offset| (_ bv0 32))} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {1940#true} is VALID [2018-11-23 11:12:38,847 INFO L273 TraceCheckUtils]: 39: Hoare triple {1940#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {2063#(and (= dll_circular_remove_last_~head.offset |dll_circular_remove_last_#in~head.offset|) (= |dll_circular_remove_last_#in~head.base| dll_circular_remove_last_~head.base))} is VALID [2018-11-23 11:12:38,849 INFO L273 TraceCheckUtils]: 40: Hoare triple {2063#(and (= dll_circular_remove_last_~head.offset |dll_circular_remove_last_#in~head.offset|) (= |dll_circular_remove_last_#in~head.base| dll_circular_remove_last_~head.base))} assume ~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0bv32, 0bv32, ~head.base, ~head.offset, 4bv32); {2067#(and (= (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-23 11:12:38,849 INFO L273 TraceCheckUtils]: 41: Hoare triple {2067#(and (= (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv0 32)))} assume true; {2067#(and (= (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-23 11:12:38,851 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {2067#(and (= (select (select |#memory_$Pointer$.offset| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv0 32)))} {1960#(= |main_~#s~0.offset| (_ bv0 32))} #83#return; {2074#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 11:12:38,853 INFO L273 TraceCheckUtils]: 43: Hoare triple {2074#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {2074#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 11:12:38,854 INFO L273 TraceCheckUtils]: 44: Hoare triple {2074#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} assume !~bvslt32(~i~0, ~len~0); {2074#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 11:12:38,855 INFO L273 TraceCheckUtils]: 45: Hoare triple {2074#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {2084#(and (= |main_#t~mem15.offset| (_ bv0 32)) (= |main_#t~mem15.base| (_ bv0 32)))} is VALID [2018-11-23 11:12:38,856 INFO L273 TraceCheckUtils]: 46: Hoare triple {2084#(and (= |main_#t~mem15.offset| (_ bv0 32)) (= |main_#t~mem15.base| (_ bv0 32)))} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1941#false} is VALID [2018-11-23 11:12:38,856 INFO L273 TraceCheckUtils]: 47: Hoare triple {1941#false} assume !false; {1941#false} is VALID [2018-11-23 11:12:38,859 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 11:12:38,860 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:12:38,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:12:38,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:12:38,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-23 11:12:38,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:12:38,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:12:38,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:38,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:12:38,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:12:38,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:12:38,946 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 7 states. [2018-11-23 11:12:40,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:40,841 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-23 11:12:40,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:12:40,841 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-23 11:12:40,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:12:40,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:12:40,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2018-11-23 11:12:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:12:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2018-11-23 11:12:40,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2018-11-23 11:12:40,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:12:40,977 INFO L225 Difference]: With dead ends: 51 [2018-11-23 11:12:40,977 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 11:12:40,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:12:40,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 11:12:41,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2018-11-23 11:12:41,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:12:41,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 42 states. [2018-11-23 11:12:41,030 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 42 states. [2018-11-23 11:12:41,030 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 42 states. [2018-11-23 11:12:41,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:41,034 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-23 11:12:41,034 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-23 11:12:41,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:41,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:41,035 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 47 states. [2018-11-23 11:12:41,035 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 47 states. [2018-11-23 11:12:41,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:12:41,038 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-23 11:12:41,038 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-23 11:12:41,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:12:41,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:12:41,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:12:41,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:12:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:12:41,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-23 11:12:41,041 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 48 [2018-11-23 11:12:41,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:12:41,041 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-23 11:12:41,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:12:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 11:12:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:12:41,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:12:41,042 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:12:41,043 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:12:41,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:12:41,043 INFO L82 PathProgramCache]: Analyzing trace with hash 44916772, now seen corresponding path program 1 times [2018-11-23 11:12:41,043 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:12:41,043 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:12:41,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:12:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:12:41,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:12:41,412 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:41,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:41,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:41,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:12:41,427 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:41,427 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_104|]. (and (= |#valid| (store |v_#valid_104| |main_~#s~0.base| (_ bv1 1))) (= |main_~#s~0.offset| (_ bv0 32))) [2018-11-23 11:12:41,427 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (= |main_~#s~0.offset| (_ bv0 32))) [2018-11-23 11:12:41,754 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 11 treesize of output 8 [2018-11-23 11:12:41,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:12:41,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:41,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:41,803 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 11 treesize of output 8 [2018-11-23 11:12:41,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:12:41,810 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:41,814 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:41,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:41,832 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-11-23 11:12:42,017 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-11-23 11:12:42,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-11-23 11:12:42,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:42,110 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:42,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:42,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2018-11-23 11:12:42,169 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 22 treesize of output 18 [2018-11-23 11:12:42,192 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:42,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:42,255 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:42,329 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-11-23 11:12:42,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-23 11:12:42,341 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:42,369 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:42,384 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 40 treesize of output 51 [2018-11-23 11:12:42,397 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:42,402 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:42,419 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:42,435 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:42,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:42,476 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:84, output treesize:89 [2018-11-23 11:12:43,207 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-23 11:12:43,216 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:43,217 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:43,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 11:12:43,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:43,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:43,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:83, output treesize:78 [2018-11-23 11:12:43,264 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:43,265 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#valid)_AFTER_CALL_48|]. (let ((.cse2 (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32)))) (let ((.cse0 (select |#memory_$Pointer$.base| .cse2))) (let ((.cse1 (select |#memory_$Pointer$.offset| .cse2)) (.cse3 (select .cse0 (_ bv4 32)))) (and (= (select .cse0 (_ bv0 32)) |main_#t~ret13.base|) (= (_ bv0 32) (select .cse1 (_ bv0 32))) (= (_ bv1 1) (select |v_old(#valid)_AFTER_CALL_48| |main_~#s~0.base|)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 1) (select (store |v_old(#valid)_AFTER_CALL_48| .cse2 (_ bv1 1)) |main_#t~ret13.base|)) (= .cse3 |main_#t~ret13.base|) (= (_ bv0 32) (select .cse1 (_ bv4 32))) (= |main_#t~ret13.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse3) (_ bv4 32))))))) [2018-11-23 11:12:43,265 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32)))) (let ((.cse2 (select |#memory_$Pointer$.base| .cse0))) (let ((.cse1 (select |#memory_$Pointer$.offset| .cse0)) (.cse3 (select .cse2 (_ bv4 32)))) (and (not (= .cse0 |main_#t~ret13.base|)) (= (_ bv0 32) (select .cse1 (_ bv0 32))) (= (select .cse2 (_ bv0 32)) |main_#t~ret13.base|) (= |main_~#s~0.offset| (_ bv0 32)) (not (= |main_~#s~0.base| |main_#t~ret13.base|)) (= (_ bv0 32) (select .cse1 (_ bv4 32))) (= .cse3 |main_#t~ret13.base|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse3) (_ bv4 32))) (= |main_#t~ret13.offset| (_ bv0 32)))))) [2018-11-23 11:12:44,994 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-23 11:12:51,164 WARN L180 SmtUtils]: Spent 6.08 s on a formula simplification. DAG size of input: 141 DAG size of output: 55 [2018-11-23 11:12:51,189 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:51,210 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:12:51,302 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:12:51,532 INFO L303 Elim1Store]: Index analysis took 355 ms [2018-11-23 11:12:51,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 515 treesize of output 524 [2018-11-23 11:12:51,608 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:12:51,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 373 treesize of output 268 [2018-11-23 11:12:51,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:51,917 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:12:51,922 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:52,019 INFO L303 Elim1Store]: Index analysis took 107 ms [2018-11-23 11:12:52,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 281 treesize of output 335 [2018-11-23 11:12:52,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:52,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 95 [2018-11-23 11:12:52,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:52,183 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:52,263 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:52,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:52,431 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:12:52,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:52,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:52,530 INFO L303 Elim1Store]: Index analysis took 117 ms [2018-11-23 11:12:52,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 213 [2018-11-23 11:12:52,560 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:12:52,667 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 215 treesize of output 193 [2018-11-23 11:12:52,704 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-23 11:12:54,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 151 [2018-11-23 11:12:54,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:54,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 66 [2018-11-23 11:12:54,105 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:12:54,130 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:12:54,195 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:12:54,213 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:54,222 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:54,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 155 [2018-11-23 11:12:54,306 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:54,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:54,313 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:54,433 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 167 [2018-11-23 11:12:54,491 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-11-23 11:12:54,663 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:12:54,680 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:54,694 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:54,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 253 treesize of output 176 [2018-11-23 11:12:54,775 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:54,778 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:54,781 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:54,798 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:12:54,872 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 178 treesize of output 218 [2018-11-23 11:12:55,158 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:12:57,099 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:12:58,415 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:12:59,774 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:13:01,253 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:13:02,592 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:13:04,014 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:13:05,439 INFO L267 ElimStorePlain]: Start of recursive call 14: 6 dim-0 vars, 7 dim-1 vars, End of recursive call: 13 dim-0 vars, and 7 xjuncts. [2018-11-23 11:13:06,828 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 13 dim-0 vars, and 7 xjuncts. [2018-11-23 11:13:09,305 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 22 dim-0 vars, and 10 xjuncts. [2018-11-23 11:13:12,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 22 dim-0 vars, and 10 xjuncts. [2018-11-23 11:13:12,324 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 4 variables, input treesize:1429, output treesize:1752 [2018-11-23 11:13:14,331 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:13:14,331 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_4, v_prenex_3, |v_#memory_$Pointer$.base_BEFORE_CALL_7|, |v_old(#memory_$Pointer$.offset)_AFTER_CALL_40|]. (let ((.cse5 (= |main_~#s~0.offset| (_ bv0 32)))) (or (let ((.cse3 (select (select v_prenex_3 |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse0 (select (select v_prenex_4 |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse10 (select v_prenex_3 .cse0)) (.cse11 (bvadd .cse3 (_ bv4 32))) (.cse14 (select v_prenex_4 .cse0))) (let ((.cse12 (select .cse14 (_ bv4 32))) (.cse6 (select .cse10 .cse11))) (let ((.cse15 (select .cse14 .cse11)) (.cse16 (bvadd .cse6 (_ bv4 32))) (.cse4 (select v_prenex_4 .cse12))) (let ((.cse1 (select .cse4 (_ bv4 32))) (.cse9 (select (select v_prenex_3 .cse15) .cse16)) (.cse8 (select (select v_prenex_4 .cse15) .cse16)) (.cse2 (select v_prenex_3 .cse12))) (and (= .cse0 .cse1) (= (select .cse2 (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) .cse3) (= .cse0 (select .cse4 (_ bv0 32))) .cse5 (not (= .cse3 .cse6)) (= (let ((.cse7 (store v_prenex_3 .cse0 (store .cse10 .cse11 .cse9)))) (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 (select (select .cse7 |main_~#s~0.base|) |main_~#s~0.offset|)))) |#memory_$Pointer$.offset|) (= (select (select v_prenex_3 .cse1) (_ bv4 32)) (_ bv0 32)) (not (= .cse0 .cse12)) (= |#memory_$Pointer$.base| (let ((.cse13 (store v_prenex_4 .cse0 (store .cse14 .cse11 .cse8)))) (store .cse13 .cse8 (store (select .cse13 .cse8) .cse9 (select (select .cse13 |main_~#s~0.base|) |main_~#s~0.offset|))))) (not (= .cse0 |main_~#s~0.base|)) (= (_ bv0 32) (select .cse2 (_ bv4 32))))))))) (let ((.cse18 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_7| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse28 (select |v_#memory_$Pointer$.base_BEFORE_CALL_7| .cse18)) (.cse20 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_40| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse25 (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_40| .cse18)) (.cse26 (bvadd .cse20 (_ bv4 32))) (.cse21 (select .cse28 (_ bv4 32)))) (let ((.cse30 (select |v_#memory_$Pointer$.base_BEFORE_CALL_7| .cse21)) (.cse19 (select .cse28 .cse26)) (.cse31 (bvadd (select .cse25 .cse26) (_ bv4 32)))) (let ((.cse24 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_40| .cse19) .cse31)) (.cse23 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_7| .cse19) .cse31)) (.cse17 (select .cse30 (_ bv4 32))) (.cse29 (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_40| .cse21))) (and (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_40| .cse17) (_ bv4 32)) (_ bv0 32)) (not (= .cse18 .cse19)) (= (_ bv0 32) .cse20) (not (= .cse18 .cse21)) (= (let ((.cse22 (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_40| .cse18 (store .cse25 .cse26 .cse24)))) (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 (select (select .cse22 |main_~#s~0.base|) |main_~#s~0.offset|)))) |#memory_$Pointer$.offset|) (not (= .cse18 |main_~#s~0.base|)) (= |#memory_$Pointer$.base| (let ((.cse27 (store |v_#memory_$Pointer$.base_BEFORE_CALL_7| .cse18 (store .cse28 .cse26 .cse23)))) (store .cse27 .cse23 (store (select .cse27 .cse23) .cse24 (select (select .cse27 |main_~#s~0.base|) |main_~#s~0.offset|))))) (= (_ bv0 32) (select .cse29 (_ bv4 32))) .cse5 (= .cse18 (select .cse30 (_ bv0 32))) (= .cse18 .cse17) (= (select .cse29 (_ bv0 32)) (_ bv0 32)))))))))) [2018-11-23 11:13:14,332 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_DerPreprocessor_8, v_prenex_5, v_prenex_14, v_DerPreprocessor_6, v_arrayElimCell_30, v_prenex_16, v_DerPreprocessor_5, v_prenex_20, v_DerPreprocessor_2, v_prenex_11, v_DerPreprocessor_4, v_prenex_21, v_antiDerIndex_3, v_prenex_18, v_DerPreprocessor_3, v_prenex_19, v_arrayElimCell_22, v_antiDerIndex_1, v_DerPreprocessor_7, v_arrayElimCell_29, v_arrayElimCell_23, v_DerPreprocessor_1]. (let ((.cse4 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse5 (= .cse0 (_ bv0 32))) (.cse12 (= |main_~#s~0.offset| (_ bv0 32))) (.cse13 (not (= |main_~#s~0.base| .cse4))) (.cse6 (bvadd .cse0 (_ bv4 32)))) (or (let ((.cse3 (select |#memory_$Pointer$.base| v_DerPreprocessor_8))) (let ((.cse10 (select .cse3 v_prenex_5))) (let ((.cse11 (select |#memory_$Pointer$.base| .cse10))) (let ((.cse7 (select |#memory_$Pointer$.offset| .cse10)) (.cse8 (select .cse11 (_ bv4 32)))) (let ((.cse1 (select |#memory_$Pointer$.offset| .cse8)) (.cse9 (select .cse3 .cse6)) (.cse2 (select .cse7 (_ bv4 32)))) (and (= .cse0 (select .cse1 .cse2)) (= (select .cse3 (_ bv0 32)) .cse4) .cse5 (= (select .cse1 .cse6) .cse2) (= (_ bv0 32) (select .cse7 (_ bv0 32))) (= .cse8 .cse9) (not (= .cse10 (select .cse11 v_prenex_5))) (= .cse9 v_DerPreprocessor_8) .cse12 (not (= .cse10 (select .cse11 v_prenex_14))) (= .cse8 .cse4) (= (_ bv0 32) .cse2) (= .cse4 (select .cse11 (_ bv0 32))) (= .cse10 (select .cse3 v_prenex_14)) .cse13)))))) (let ((.cse17 (select |#memory_$Pointer$.base| v_arrayElimCell_30))) (let ((.cse20 (select |#memory_$Pointer$.offset| v_arrayElimCell_30)) (.cse15 (select .cse17 (_ bv4 32))) (.cse14 (select |#memory_$Pointer$.base| v_DerPreprocessor_6))) (let ((.cse16 (select .cse14 .cse6)) (.cse18 (select |#memory_$Pointer$.offset| .cse15)) (.cse19 (select .cse20 (_ bv4 32)))) (and (= (select .cse14 (_ bv0 32)) .cse4) (= .cse15 .cse16) .cse5 (= .cse4 (select .cse17 (_ bv0 32))) (= .cse0 (select .cse18 .cse19)) (= v_DerPreprocessor_6 .cse16) (= (_ bv0 32) .cse19) .cse12 (= (select .cse18 .cse6) .cse19) (= (_ bv0 32) (select .cse20 (_ bv0 32))) (= .cse15 .cse4) .cse13 (not (= (select .cse17 v_prenex_16) (select .cse14 v_prenex_16))))))) (let ((.cse26 (select |#memory_$Pointer$.base| v_DerPreprocessor_5))) (let ((.cse21 (select .cse26 v_prenex_20))) (let ((.cse22 (select |#memory_$Pointer$.base| .cse21))) (let ((.cse25 (select |#memory_$Pointer$.offset| .cse21)) (.cse24 (select .cse22 (_ bv4 32)))) (let ((.cse27 (select |#memory_$Pointer$.offset| .cse24)) (.cse28 (select .cse25 (_ bv4 32))) (.cse23 (select .cse26 .cse6))) (and (not (= .cse21 (select .cse22 v_prenex_20))) (= .cse23 .cse24) (= (select .cse25 (_ bv0 32)) (_ bv0 32)) (= .cse4 (select .cse26 (_ bv0 32))) .cse5 (= (select .cse27 .cse6) .cse28) (= .cse24 .cse4) (= (select .cse22 (_ bv0 32)) .cse4) .cse12 (= .cse0 (select .cse27 .cse28)) .cse13 (= .cse28 (_ bv0 32)) (= .cse23 v_DerPreprocessor_5))))))) (let ((.cse32 (select |#memory_$Pointer$.base| v_DerPreprocessor_2))) (let ((.cse35 (select .cse32 v_prenex_11))) (let ((.cse29 (select |#memory_$Pointer$.base| .cse35))) (let ((.cse36 (select |#memory_$Pointer$.offset| .cse35)) (.cse30 (select .cse29 (_ bv4 32)))) (let ((.cse31 (select .cse32 .cse6)) (.cse33 (select |#memory_$Pointer$.offset| .cse30)) (.cse34 (select .cse36 (_ bv4 32)))) (and (= (select .cse29 (_ bv0 32)) .cse4) (= .cse30 .cse31) (= .cse4 (select .cse32 (_ bv0 32))) .cse5 (= .cse30 .cse4) (= (select .cse33 .cse6) .cse34) (= v_DerPreprocessor_2 .cse31) (not (= (select .cse29 v_prenex_11) .cse35)) .cse12 (= (_ bv0 32) (select .cse36 (_ bv0 32))) (= (_ bv0 32) .cse34) .cse13 (= .cse0 (select .cse33 .cse34)))))))) (let ((.cse43 (select |#memory_$Pointer$.base| v_DerPreprocessor_4))) (let ((.cse37 (select .cse43 v_prenex_21))) (let ((.cse38 (select |#memory_$Pointer$.base| .cse37))) (let ((.cse44 (select |#memory_$Pointer$.offset| .cse37)) (.cse40 (select .cse38 (_ bv4 32)))) (let ((.cse39 (select .cse43 .cse6)) (.cse41 (select |#memory_$Pointer$.offset| .cse40)) (.cse42 (select .cse44 (_ bv4 32)))) (and (not (= .cse37 (select .cse38 v_prenex_21))) (= .cse39 .cse40) .cse5 (= .cse4 .cse40) (= .cse39 v_DerPreprocessor_4) (= .cse0 (select .cse41 .cse42)) (not (= (select .cse38 v_antiDerIndex_3) (select .cse43 v_antiDerIndex_3))) (= (select .cse41 .cse6) .cse42) (= (select .cse44 (_ bv0 32)) (_ bv0 32)) .cse12 (= (select .cse38 (_ bv0 32)) .cse4) (= .cse42 (_ bv0 32)) (not (= v_antiDerIndex_3 v_prenex_21)) .cse13 (= (select .cse43 (_ bv0 32)) .cse4))))))) (let ((.cse45 (select |#memory_$Pointer$.base| v_prenex_18))) (let ((.cse46 (select .cse45 (_ bv4 32)))) (let ((.cse51 (select |#memory_$Pointer$.offset| v_prenex_18)) (.cse50 (select |#memory_$Pointer$.offset| .cse46))) (let ((.cse47 (select |#memory_$Pointer$.base| .cse46)) (.cse48 (select .cse50 .cse6)) (.cse49 (select .cse51 (_ bv4 32)))) (and (= .cse4 (select .cse45 (_ bv0 32))) (= .cse46 (select .cse47 .cse6)) (= .cse48 .cse49) (= .cse0 (select .cse50 .cse49)) .cse5 .cse12 (= .cse46 .cse4) (= (_ bv0 32) (select .cse51 (_ bv0 32))) (= (select .cse47 .cse48) .cse4) (= (_ bv0 32) .cse49) .cse13 (not (= .cse46 v_prenex_18))))))) (let ((.cse59 (select |#memory_$Pointer$.base| v_DerPreprocessor_3))) (let ((.cse56 (select .cse59 v_prenex_19))) (let ((.cse57 (select |#memory_$Pointer$.base| .cse56))) (let ((.cse58 (select |#memory_$Pointer$.offset| .cse56)) (.cse55 (select .cse57 (_ bv4 32)))) (let ((.cse53 (select |#memory_$Pointer$.offset| .cse55)) (.cse54 (select .cse58 (_ bv4 32))) (.cse52 (select .cse59 .cse6))) (and (= .cse52 v_DerPreprocessor_3) (= (select .cse53 .cse6) .cse54) .cse5 (= .cse55 .cse4) (not (= .cse56 (select .cse57 v_prenex_19))) (= (_ bv0 32) .cse54) (= .cse0 (select .cse53 .cse54)) (= (_ bv0 32) (select .cse58 (_ bv0 32))) (= .cse4 (select .cse57 (_ bv0 32))) .cse12 (= (select .cse59 (_ bv0 32)) .cse4) (= .cse52 .cse55) .cse13)))))) (let ((.cse60 (select |#memory_$Pointer$.base| v_arrayElimCell_22))) (let ((.cse65 (select .cse60 (_ bv4 32)))) (let ((.cse62 (select |#memory_$Pointer$.offset| v_arrayElimCell_22)) (.cse66 (select |#memory_$Pointer$.offset| .cse65))) (let ((.cse63 (select .cse66 .cse6)) (.cse61 (select |#memory_$Pointer$.base| .cse65)) (.cse64 (select .cse62 (_ bv4 32)))) (and (not (= (select .cse60 v_antiDerIndex_1) (select .cse61 v_antiDerIndex_1))) (= (_ bv0 32) (select .cse62 (_ bv0 32))) (= .cse63 .cse64) .cse5 (= (select .cse61 .cse63) .cse4) .cse12 (= .cse65 (select .cse61 .cse6)) (= .cse4 (select .cse60 (_ bv0 32))) (= (_ bv0 32) .cse64) .cse13 (= .cse65 .cse4) (= .cse0 (select .cse66 .cse64))))))) (let ((.cse68 (select |#memory_$Pointer$.base| v_arrayElimCell_29))) (let ((.cse70 (select |#memory_$Pointer$.base| v_DerPreprocessor_7)) (.cse67 (select |#memory_$Pointer$.offset| v_arrayElimCell_29)) (.cse69 (select .cse68 (_ bv4 32)))) (let ((.cse72 (select |#memory_$Pointer$.offset| .cse69)) (.cse71 (select .cse67 (_ bv4 32))) (.cse73 (select .cse70 .cse6))) (and (= (_ bv0 32) (select .cse67 (_ bv0 32))) (= .cse4 (select .cse68 (_ bv0 32))) (= .cse69 .cse4) .cse5 (= (select .cse70 (_ bv0 32)) .cse4) (= (_ bv0 32) .cse71) (= (select .cse72 .cse6) .cse71) (= .cse73 v_DerPreprocessor_7) .cse12 (not (= .cse69 v_arrayElimCell_29)) .cse13 (= .cse0 (select .cse72 .cse71)) (= .cse73 .cse69))))) (let ((.cse80 (select |#memory_$Pointer$.base| v_arrayElimCell_23))) (let ((.cse79 (select .cse80 (_ bv4 32)))) (let ((.cse74 (select |#memory_$Pointer$.offset| v_arrayElimCell_23)) (.cse81 (select |#memory_$Pointer$.offset| .cse79)) (.cse77 (select |#memory_$Pointer$.base| v_DerPreprocessor_1))) (let ((.cse76 (select .cse77 .cse6)) (.cse78 (select .cse81 .cse6)) (.cse75 (select .cse74 (_ bv4 32)))) (and (= (select .cse74 (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) .cse75) (= .cse76 v_DerPreprocessor_1) .cse5 (= (select .cse77 .cse78) .cse4) (= .cse79 .cse76) (= (select .cse80 (_ bv0 32)) .cse4) .cse12 (= .cse78 .cse75) (= .cse0 (select .cse81 .cse75)) (not (= .cse79 v_arrayElimCell_23)) (= .cse79 .cse4) .cse13)))))))) [2018-11-23 11:13:15,231 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 43 [2018-11-23 11:13:15,957 INFO L256 TraceCheckUtils]: 0: Hoare triple {2322#true} call ULTIMATE.init(); {2322#true} is VALID [2018-11-23 11:13:15,957 INFO L273 TraceCheckUtils]: 1: Hoare triple {2322#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2322#true} is VALID [2018-11-23 11:13:15,958 INFO L273 TraceCheckUtils]: 2: Hoare triple {2322#true} assume true; {2322#true} is VALID [2018-11-23 11:13:15,958 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2322#true} {2322#true} #89#return; {2322#true} is VALID [2018-11-23 11:13:15,958 INFO L256 TraceCheckUtils]: 4: Hoare triple {2322#true} call #t~ret16 := main(); {2322#true} is VALID [2018-11-23 11:13:15,959 INFO L273 TraceCheckUtils]: 5: Hoare triple {2322#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {2342#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:13:15,960 INFO L256 TraceCheckUtils]: 6: Hoare triple {2342#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {2346#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:13:15,960 INFO L273 TraceCheckUtils]: 7: Hoare triple {2346#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data; {2346#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:13:15,961 INFO L256 TraceCheckUtils]: 8: Hoare triple {2346#(= |#valid| |old(#valid)|)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {2346#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:13:15,962 INFO L273 TraceCheckUtils]: 9: Hoare triple {2346#(= |#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; {2356#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-23 11:13:15,962 INFO L273 TraceCheckUtils]: 10: Hoare triple {2356#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2356#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-23 11:13:15,964 INFO L273 TraceCheckUtils]: 11: Hoare triple {2356#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} 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; {2363#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:13:15,965 INFO L273 TraceCheckUtils]: 12: Hoare triple {2363#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {2363#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:13:15,966 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {2363#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= |node_create_#res.offset| (_ bv0 32)))} {2346#(= |#valid| |old(#valid)|)} #85#return; {2370#(and (= |dll_circular_create_#t~ret3.offset| (_ bv0 32)) (= |#valid| (store |old(#valid)| |dll_circular_create_#t~ret3.base| (_ bv1 1))))} is VALID [2018-11-23 11:13:15,968 INFO L273 TraceCheckUtils]: 14: Hoare triple {2370#(and (= |dll_circular_create_#t~ret3.offset| (_ bv0 32)) (= |#valid| (store |old(#valid)| |dll_circular_create_#t~ret3.base| (_ bv1 1))))} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {2374#(and (= (store |old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |#valid|) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= dll_circular_create_~head~0.offset dll_circular_create_~last~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-23 11:13:15,969 INFO L273 TraceCheckUtils]: 15: Hoare triple {2374#(and (= (store |old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |#valid|) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= dll_circular_create_~head~0.offset dll_circular_create_~last~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} assume !!~bvsgt32(~len, 1bv32); {2374#(and (= (store |old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |#valid|) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= dll_circular_create_~head~0.offset dll_circular_create_~last~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-23 11:13:15,970 INFO L256 TraceCheckUtils]: 16: Hoare triple {2374#(and (= (store |old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |#valid|) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= dll_circular_create_~head~0.offset dll_circular_create_~last~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2346#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:13:15,971 INFO L273 TraceCheckUtils]: 17: Hoare triple {2346#(= |#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; {2384#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:13:15,972 INFO L273 TraceCheckUtils]: 18: Hoare triple {2384#(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); {2384#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:13:15,974 INFO L273 TraceCheckUtils]: 19: Hoare triple {2384#(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; {2391#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:13:15,992 INFO L273 TraceCheckUtils]: 20: Hoare triple {2391#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {2391#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:13:16,006 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2391#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {2374#(and (= (store |old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |#valid|) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= dll_circular_create_~head~0.offset dll_circular_create_~last~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} #87#return; {2398#(and (= (_ bv0 32) |dll_circular_create_#t~ret4.offset|) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= (select (store |old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |dll_circular_create_#t~ret4.base|) (_ bv0 1)) (= dll_circular_create_~head~0.offset dll_circular_create_~last~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-23 11:13:16,022 INFO L273 TraceCheckUtils]: 22: Hoare triple {2398#(and (= (_ bv0 32) |dll_circular_create_#t~ret4.offset|) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= (select (store |old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) |dll_circular_create_#t~ret4.base|) (_ bv0 1)) (= dll_circular_create_~head~0.offset dll_circular_create_~last~0.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); {2402#(and (= (_ bv0 1) (select (store |old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) dll_circular_create_~new_head~0.base)) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (= dll_circular_create_~head~0.offset dll_circular_create_~last~0.offset) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))} is VALID [2018-11-23 11:13:16,026 INFO L273 TraceCheckUtils]: 23: Hoare triple {2402#(and (= (_ bv0 1) (select (store |old(#valid)| dll_circular_create_~head~0.base (_ bv1 1)) dll_circular_create_~new_head~0.base)) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (= dll_circular_create_~head~0.offset dll_circular_create_~last~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); {2406#(and (= dll_circular_create_~new_head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (_ bv4 32))) (= (_ bv0 32) dll_circular_create_~last~0.offset) (= (_ bv0 1) (select (store |old(#valid)| dll_circular_create_~last~0.base (_ bv1 1)) dll_circular_create_~new_head~0.base)) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (= dll_circular_create_~new_head~0.offset (select (select |#memory_$Pointer$.offset| dll_circular_create_~last~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:13:16,028 INFO L273 TraceCheckUtils]: 24: Hoare triple {2406#(and (= dll_circular_create_~new_head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (_ bv4 32))) (= (_ bv0 32) dll_circular_create_~last~0.offset) (= (_ bv0 1) (select (store |old(#valid)| dll_circular_create_~last~0.base (_ bv1 1)) dll_circular_create_~new_head~0.base)) (= (_ bv0 32) dll_circular_create_~new_head~0.offset) (= dll_circular_create_~new_head~0.offset (select (select |#memory_$Pointer$.offset| dll_circular_create_~last~0.base) (_ bv4 32))))} ~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; {2410#(and (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (_ bv4 32))) (= dll_circular_create_~head~0.offset (select (select |#memory_$Pointer$.offset| dll_circular_create_~last~0.base) (_ bv4 32))) (= (_ bv0 32) dll_circular_create_~last~0.offset) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= (select (store |old(#valid)| dll_circular_create_~last~0.base (_ bv1 1)) dll_circular_create_~head~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:13:16,029 INFO L273 TraceCheckUtils]: 25: Hoare triple {2410#(and (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (_ bv4 32))) (= dll_circular_create_~head~0.offset (select (select |#memory_$Pointer$.offset| dll_circular_create_~last~0.base) (_ bv4 32))) (= (_ bv0 32) dll_circular_create_~last~0.offset) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= (select (store |old(#valid)| dll_circular_create_~last~0.base (_ bv1 1)) dll_circular_create_~head~0.base) (_ bv0 1)))} assume !~bvsgt32(~len, 1bv32); {2410#(and (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (_ bv4 32))) (= dll_circular_create_~head~0.offset (select (select |#memory_$Pointer$.offset| dll_circular_create_~last~0.base) (_ bv4 32))) (= (_ bv0 32) dll_circular_create_~last~0.offset) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= (select (store |old(#valid)| dll_circular_create_~last~0.base (_ bv1 1)) dll_circular_create_~head~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:13:16,033 INFO L273 TraceCheckUtils]: 26: Hoare triple {2410#(and (= dll_circular_create_~head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (_ bv4 32))) (= dll_circular_create_~head~0.offset (select (select |#memory_$Pointer$.offset| dll_circular_create_~last~0.base) (_ bv4 32))) (= (_ bv0 32) dll_circular_create_~last~0.offset) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= (select (store |old(#valid)| dll_circular_create_~last~0.base (_ bv1 1)) dll_circular_create_~head~0.base) (_ bv0 1)))} 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; {2417#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32)) |dll_circular_create_#res.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv0 32)) |dll_circular_create_#res.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) |dll_circular_create_#res.offset|) |dll_circular_create_#res.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (= |dll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (= (_ bv0 32) |dll_circular_create_#res.offset|) (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_circular_create_#res.base|)))} is VALID [2018-11-23 11:13:16,035 INFO L273 TraceCheckUtils]: 27: Hoare triple {2417#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32)) |dll_circular_create_#res.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv0 32)) |dll_circular_create_#res.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) |dll_circular_create_#res.offset|) |dll_circular_create_#res.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (= |dll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (= (_ bv0 32) |dll_circular_create_#res.offset|) (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_circular_create_#res.base|)))} assume true; {2417#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32)) |dll_circular_create_#res.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv0 32)) |dll_circular_create_#res.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) |dll_circular_create_#res.offset|) |dll_circular_create_#res.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (= |dll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (= (_ bv0 32) |dll_circular_create_#res.offset|) (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_circular_create_#res.base|)))} is VALID [2018-11-23 11:13:16,038 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2417#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32)) |dll_circular_create_#res.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv0 32)) |dll_circular_create_#res.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) |dll_circular_create_#res.offset|) |dll_circular_create_#res.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (= |dll_circular_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (= (_ bv0 32) |dll_circular_create_#res.offset|) (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) (bvadd |dll_circular_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_circular_create_#res.base|)))} {2342#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} #81#return; {2424#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32)) |main_#t~ret13.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (_ bv0 32)) |main_#t~ret13.base|) (= |main_~#s~0.offset| (_ bv0 32)) (not (= |main_~#s~0.base| |main_#t~ret13.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (_ bv4 32)) |main_#t~ret13.base|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= |main_#t~ret13.offset| (_ bv0 32)))} is VALID [2018-11-23 11:13:16,039 INFO L273 TraceCheckUtils]: 29: Hoare triple {2424#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32)) |main_#t~ret13.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (_ bv0 32)) |main_#t~ret13.base|) (= |main_~#s~0.offset| (_ bv0 32)) (not (= |main_~#s~0.base| |main_#t~ret13.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (_ bv4 32)) |main_#t~ret13.base|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= |main_#t~ret13.offset| (_ bv0 32)))} call write~init~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset;havoc ~i~0;~i~0 := 0bv32; {2428#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ 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|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))))} is VALID [2018-11-23 11:13:16,040 INFO L273 TraceCheckUtils]: 30: Hoare triple {2428#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ 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|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))))} assume !!~bvslt32(~i~0, ~len~0); {2428#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ 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|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))))} is VALID [2018-11-23 11:13:16,041 INFO L256 TraceCheckUtils]: 31: Hoare triple {2428#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ 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|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))))} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {2435#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:13:16,043 INFO L273 TraceCheckUtils]: 32: Hoare triple {2435#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {2439#(and (= dll_circular_remove_last_~last~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_circular_remove_last_~head.base) dll_circular_remove_last_~head.offset)) (bvadd (select (select |#memory_$Pointer$.offset| dll_circular_remove_last_~head.base) dll_circular_remove_last_~head.offset) (_ bv4 32)))) (= dll_circular_remove_last_~head.offset |dll_circular_remove_last_#in~head.offset|) (= |dll_circular_remove_last_#in~head.base| dll_circular_remove_last_~head.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= dll_circular_remove_last_~last~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_circular_remove_last_~head.base) dll_circular_remove_last_~head.offset)) (bvadd (select (select |#memory_$Pointer$.offset| dll_circular_remove_last_~head.base) dll_circular_remove_last_~head.offset) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| dll_circular_remove_last_~head.base) dll_circular_remove_last_~head.offset) |dll_circular_remove_last_#t~mem8.base|) (= |dll_circular_remove_last_#t~mem8.offset| (select (select |#memory_$Pointer$.offset| dll_circular_remove_last_~head.base) dll_circular_remove_last_~head.offset)))} is VALID [2018-11-23 11:13:18,048 INFO L273 TraceCheckUtils]: 33: Hoare triple {2439#(and (= dll_circular_remove_last_~last~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_circular_remove_last_~head.base) dll_circular_remove_last_~head.offset)) (bvadd (select (select |#memory_$Pointer$.offset| dll_circular_remove_last_~head.base) dll_circular_remove_last_~head.offset) (_ bv4 32)))) (= dll_circular_remove_last_~head.offset |dll_circular_remove_last_#in~head.offset|) (= |dll_circular_remove_last_#in~head.base| dll_circular_remove_last_~head.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= dll_circular_remove_last_~last~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_circular_remove_last_~head.base) dll_circular_remove_last_~head.offset)) (bvadd (select (select |#memory_$Pointer$.offset| dll_circular_remove_last_~head.base) dll_circular_remove_last_~head.offset) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| dll_circular_remove_last_~head.base) dll_circular_remove_last_~head.offset) |dll_circular_remove_last_#t~mem8.base|) (= |dll_circular_remove_last_#t~mem8.offset| (select (select |#memory_$Pointer$.offset| dll_circular_remove_last_~head.base) dll_circular_remove_last_~head.offset)))} assume !(~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset);havoc #t~mem8.base, #t~mem8.offset;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~last~1.base, ~bvadd32(4bv32, ~last~1.offset), 4bv32);~snd_to_last~0.base, ~snd_to_last~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call ULTIMATE.dealloc(~last~1.base, ~last~1.offset);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, #t~mem11.base, ~bvadd32(4bv32, #t~mem11.offset), 4bv32);havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem12.base, #t~mem12.offset, ~snd_to_last~0.base, ~snd_to_last~0.offset, 4bv32);havoc #t~mem12.base, #t~mem12.offset; {2443#(and (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (select (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))))) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))) (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (select (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))))} is UNKNOWN [2018-11-23 11:13:18,049 INFO L273 TraceCheckUtils]: 34: Hoare triple {2443#(and (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (select (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))))) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))) (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (select (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))))} assume true; {2443#(and (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (select (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))))) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))) (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (select (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))))} is VALID [2018-11-23 11:13:18,199 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2443#(and (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (select (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))))) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))) (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))) (select (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)) (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (_ bv4 32))))) |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)))))} {2428#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ 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|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))))} #83#return; {2450#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_23 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_1) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) v_DerPreprocessor_1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_1) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32)) v_arrayElimCell_23)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32)) (select (select |#memory_$Pointer$.base| v_DerPreprocessor_1) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 11:13:18,201 INFO L273 TraceCheckUtils]: 36: Hoare triple {2450#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_23 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_1) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) v_DerPreprocessor_1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_1) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32)) v_arrayElimCell_23)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32)) (select (select |#memory_$Pointer$.base| v_DerPreprocessor_1) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {2450#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_23 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_1) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) v_DerPreprocessor_1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_1) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32)) v_arrayElimCell_23)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32)) (select (select |#memory_$Pointer$.base| v_DerPreprocessor_1) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 11:13:18,202 INFO L273 TraceCheckUtils]: 37: Hoare triple {2450#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_23 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_1) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) v_DerPreprocessor_1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_1) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32)) v_arrayElimCell_23)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32)) (select (select |#memory_$Pointer$.base| v_DerPreprocessor_1) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} assume !!~bvslt32(~i~0, ~len~0); {2450#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_23 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_1) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) v_DerPreprocessor_1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_1) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32)) v_arrayElimCell_23)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32)) (select (select |#memory_$Pointer$.base| v_DerPreprocessor_1) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 11:13:18,203 INFO L256 TraceCheckUtils]: 38: Hoare triple {2450#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_23 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_1) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) v_DerPreprocessor_1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_1) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32)) v_arrayElimCell_23)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32)) (select (select |#memory_$Pointer$.base| v_DerPreprocessor_1) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call dll_circular_remove_last(~#s~0.base, ~#s~0.offset); {2435#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:13:18,347 INFO L273 TraceCheckUtils]: 39: Hoare triple {2435#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {2463#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) dll_circular_remove_last_~last~1.offset) (= |dll_circular_remove_last_#t~mem8.offset| (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= dll_circular_remove_last_~last~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) |dll_circular_remove_last_#t~mem8.base|))} is VALID [2018-11-23 11:13:18,350 INFO L273 TraceCheckUtils]: 40: Hoare triple {2463#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) dll_circular_remove_last_~last~1.offset) (= |dll_circular_remove_last_#t~mem8.offset| (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (= dll_circular_remove_last_~last~1.base (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32)))) (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) |dll_circular_remove_last_#t~mem8.base|))} assume !(~last~1.base == #t~mem8.base && ~last~1.offset == #t~mem8.offset);havoc #t~mem8.base, #t~mem8.offset;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~last~1.base, ~bvadd32(4bv32, ~last~1.offset), 4bv32);~snd_to_last~0.base, ~snd_to_last~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call ULTIMATE.dealloc(~last~1.base, ~last~1.offset);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, #t~mem11.base, ~bvadd32(4bv32, #t~mem11.offset), 4bv32);havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem12.base, #t~mem12.offset, ~snd_to_last~0.base, ~snd_to_last~0.offset, 4bv32);havoc #t~mem12.base, #t~mem12.offset; {2467#(or (not (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))))) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))))} is VALID [2018-11-23 11:13:18,351 INFO L273 TraceCheckUtils]: 41: Hoare triple {2467#(or (not (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))))) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))))} assume true; {2467#(or (not (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))))) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))))} is VALID [2018-11-23 11:13:18,356 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {2467#(or (not (= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))))) (not (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|) (_ bv4 32))) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_last_#in~head.base|) |dll_circular_remove_last_#in~head.offset|))))} {2450#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_23 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_1) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) v_DerPreprocessor_1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| v_DerPreprocessor_1) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32)) v_arrayElimCell_23)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) (_ bv4 32)) (select (select |#memory_$Pointer$.base| v_DerPreprocessor_1) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #83#return; {2323#false} is VALID [2018-11-23 11:13:18,357 INFO L273 TraceCheckUtils]: 43: Hoare triple {2323#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {2323#false} is VALID [2018-11-23 11:13:18,357 INFO L273 TraceCheckUtils]: 44: Hoare triple {2323#false} assume !~bvslt32(~i~0, ~len~0); {2323#false} is VALID [2018-11-23 11:13:18,357 INFO L273 TraceCheckUtils]: 45: Hoare triple {2323#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {2323#false} is VALID [2018-11-23 11:13:18,357 INFO L273 TraceCheckUtils]: 46: Hoare triple {2323#false} assume 0bv32 != #t~mem15.base || 0bv32 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {2323#false} is VALID [2018-11-23 11:13:18,357 INFO L273 TraceCheckUtils]: 47: Hoare triple {2323#false} assume !false; {2323#false} is VALID [2018-11-23 11:13:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:13:18,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:13:18,699 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-23 11:13:22,412 WARN L180 SmtUtils]: Spent 728.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-23 11:13:22,921 WARN L180 SmtUtils]: Spent 508.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-23 11:13:23,716 WARN L180 SmtUtils]: Spent 791.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-11-23 11:13:24,566 WARN L180 SmtUtils]: Spent 842.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-23 11:13:30,238 WARN L833 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2018-11-23 11:13:39,585 WARN L180 SmtUtils]: Spent 6.27 s on a formula simplification that was a NOOP. DAG size: 49 [2018-11-23 11:13:49,925 WARN L180 SmtUtils]: Spent 6.48 s on a formula simplification that was a NOOP. DAG size: 68 [2018-11-23 11:14:05,675 WARN L180 SmtUtils]: Spent 8.08 s on a formula simplification that was a NOOP. DAG size: 103 [2018-11-23 11:14:26,060 WARN L180 SmtUtils]: Spent 14.03 s on a formula simplification that was a NOOP. DAG size: 99 [2018-11-23 11:14:34,395 WARN L180 SmtUtils]: Spent 6.40 s on a formula simplification that was a NOOP. DAG size: 55 [2018-11-23 11:14:37,027 WARN L180 SmtUtils]: Spent 2.34 s on a formula simplification that was a NOOP. DAG size: 95 [2018-11-23 11:14:37,413 WARN L180 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-23 11:14:38,111 WARN L180 SmtUtils]: Spent 696.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-23 11:14:38,560 WARN L180 SmtUtils]: Spent 447.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-23 11:15:24,412 WARN L180 SmtUtils]: Spent 37.37 s on a formula simplification. DAG size of input: 618 DAG size of output: 1 [2018-11-23 11:15:24,414 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:24,414 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 20 variables, input treesize:23009, output treesize:1 [2018-11-23 11:15:36,720 WARN L180 SmtUtils]: Spent 1.74 s on a formula simplification that was a NOOP. DAG size: 186