java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:15:07,285 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:15:07,287 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:15:07,299 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:15:07,300 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:15:07,301 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:15:07,302 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:15:07,305 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:15:07,306 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:15:07,308 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:15:07,309 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:15:07,309 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:15:07,312 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:15:07,313 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:15:07,317 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:15:07,318 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:15:07,319 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:15:07,330 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:15:07,334 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:15:07,340 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:15:07,341 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:15:07,342 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:15:07,346 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:15:07,346 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:15:07,346 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:15:07,348 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:15:07,351 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:15:07,352 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:15:07,353 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:15:07,356 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:15:07,357 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:15:07,357 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:15:07,357 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:15:07,358 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:15:07,360 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:15:07,361 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:15:07,361 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:15:07,392 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:15:07,393 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:15:07,393 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:15:07,394 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:15:07,394 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:15:07,394 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:15:07,396 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:15:07,396 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:15:07,396 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:15:07,396 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:15:07,396 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:15:07,397 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:15:07,397 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:15:07,397 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:15:07,397 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:15:07,397 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:15:07,399 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:15:07,399 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:15:07,399 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:15:07,399 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:15:07,400 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:15:07,400 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:15:07,400 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:15:07,400 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:15:07,400 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:15:07,401 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:15:07,401 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:15:07,401 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:15:07,402 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:15:07,402 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:15:07,402 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:15:07,402 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:15:07,402 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:15:07,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:15:07,466 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:15:07,470 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:15:07,471 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:15:07,472 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:15:07,473 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:15:07,537 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c91e023f/b013be59a3f14bd3b9803fe107c7f06e/FLAGc15d3c6e4 [2018-11-23 11:15:08,109 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:15:08,110 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:15:08,131 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c91e023f/b013be59a3f14bd3b9803fe107c7f06e/FLAGc15d3c6e4 [2018-11-23 11:15:08,375 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c91e023f/b013be59a3f14bd3b9803fe107c7f06e [2018-11-23 11:15:08,386 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:15:08,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:15:08,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:15:08,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:15:08,395 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:15:08,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:15:08" (1/1) ... [2018-11-23 11:15:08,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5c8908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:08, skipping insertion in model container [2018-11-23 11:15:08,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:15:08" (1/1) ... [2018-11-23 11:15:08,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:15:08,483 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:15:09,010 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:15:09,030 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:15:09,105 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:15:09,247 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:15:09,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:09 WrapperNode [2018-11-23 11:15:09,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:15:09,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:15:09,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:15:09,249 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:15:09,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:09" (1/1) ... [2018-11-23 11:15:09,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:09" (1/1) ... [2018-11-23 11:15:09,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:15:09,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:15:09,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:15:09,304 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:15:09,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:09" (1/1) ... [2018-11-23 11:15:09,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:09" (1/1) ... [2018-11-23 11:15:09,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:09" (1/1) ... [2018-11-23 11:15:09,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:09" (1/1) ... [2018-11-23 11:15:09,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:09" (1/1) ... [2018-11-23 11:15:09,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:09" (1/1) ... [2018-11-23 11:15:09,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:09" (1/1) ... [2018-11-23 11:15:09,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:15:09,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:15:09,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:15:09,350 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:15:09,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:15:09,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:15:09,409 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:15:09,409 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:15:09,409 INFO L130 BoogieDeclarations]: Found specification of procedure dll_remove_first [2018-11-23 11:15:09,409 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_remove_first [2018-11-23 11:15:09,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:15:09,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:15:09,410 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:15:09,410 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:15:09,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:15:09,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:15:09,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:15:09,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:15:09,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 11:15:09,412 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-23 11:15:09,412 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-23 11:15:09,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:15:09,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:15:10,613 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:15:10,614 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:15:10,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:15:10 BoogieIcfgContainer [2018-11-23 11:15:10,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:15:10,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:15:10,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:15:10,619 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:15:10,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:15:08" (1/3) ... [2018-11-23 11:15:10,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a9299c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:15:10, skipping insertion in model container [2018-11-23 11:15:10,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:09" (2/3) ... [2018-11-23 11:15:10,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a9299c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:15:10, skipping insertion in model container [2018-11-23 11:15:10,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:15:10" (3/3) ... [2018-11-23 11:15:10,625 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:15:10,636 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:15:10,645 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:15:10,663 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:15:10,698 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:15:10,701 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:15:10,701 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:15:10,701 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:15:10,701 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:15:10,702 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:15:10,702 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:15:10,702 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:15:10,702 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:15:10,727 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-23 11:15:10,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:15:10,734 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:10,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:15:10,738 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:10,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:10,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1142562166, now seen corresponding path program 1 times [2018-11-23 11:15:10,749 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:10,750 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:15:10,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:10,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:10,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-23 11:15:10,942 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {39#true} is VALID [2018-11-23 11:15:10,943 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 11:15:10,943 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #78#return; {39#true} is VALID [2018-11-23 11:15:10,943 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret11 := main(); {39#true} is VALID [2018-11-23 11:15:10,944 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {39#true} is VALID [2018-11-23 11:15:10,944 INFO L256 TraceCheckUtils]: 6: Hoare triple {39#true} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {39#true} is VALID [2018-11-23 11:15:10,944 INFO L273 TraceCheckUtils]: 7: Hoare triple {39#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {39#true} is VALID [2018-11-23 11:15:10,946 INFO L273 TraceCheckUtils]: 8: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-23 11:15:10,946 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {40#false} is VALID [2018-11-23 11:15:10,947 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-23 11:15:10,947 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {40#false} {39#true} #82#return; {40#false} is VALID [2018-11-23 11:15:10,947 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {40#false} is VALID [2018-11-23 11:15:10,947 INFO L273 TraceCheckUtils]: 13: Hoare triple {40#false} assume !~bvsge32(~i~0, 0bv32); {40#false} is VALID [2018-11-23 11:15:10,948 INFO L273 TraceCheckUtils]: 14: Hoare triple {40#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {40#false} is VALID [2018-11-23 11:15:10,948 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0bv32 != #t~mem10.base || 0bv32 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {40#false} is VALID [2018-11-23 11:15:10,949 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-23 11:15:10,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:15:10,953 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:15:10,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:15:10,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:15:10,967 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 11:15:10,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:10,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:15:11,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:11,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:15:11,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:15:11,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:15:11,104 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-23 11:15:11,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:11,522 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-23 11:15:11,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:15:11,522 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 11:15:11,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:11,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:15:11,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2018-11-23 11:15:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:15:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2018-11-23 11:15:11,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 66 transitions. [2018-11-23 11:15:12,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:12,027 INFO L225 Difference]: With dead ends: 56 [2018-11-23 11:15:12,027 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:15:12,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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:15:12,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:15:12,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 11:15:12,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:12,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 11:15:12,078 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 11:15:12,078 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 11:15:12,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:12,084 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 11:15:12,084 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 11:15:12,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:12,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:12,088 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 11:15:12,089 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 11:15:12,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:12,099 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 11:15:12,099 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 11:15:12,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:12,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:12,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:12,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:15:12,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-23 11:15:12,106 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 17 [2018-11-23 11:15:12,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:12,107 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-23 11:15:12,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:15:12,107 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 11:15:12,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:15:12,111 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:12,111 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:15:12,111 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:12,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:12,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1124458595, now seen corresponding path program 1 times [2018-11-23 11:15:12,112 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:12,113 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:15:12,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:12,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:12,809 INFO L256 TraceCheckUtils]: 0: Hoare triple {263#true} call ULTIMATE.init(); {263#true} is VALID [2018-11-23 11:15:12,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {263#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {263#true} is VALID [2018-11-23 11:15:12,811 INFO L273 TraceCheckUtils]: 2: Hoare triple {263#true} assume true; {263#true} is VALID [2018-11-23 11:15:12,811 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {263#true} {263#true} #78#return; {263#true} is VALID [2018-11-23 11:15:12,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {263#true} call #t~ret11 := main(); {263#true} is VALID [2018-11-23 11:15:12,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {263#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {283#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:12,822 INFO L256 TraceCheckUtils]: 6: Hoare triple {283#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {263#true} is VALID [2018-11-23 11:15:12,833 INFO L273 TraceCheckUtils]: 7: Hoare triple {263#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {290#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:15:12,848 INFO L273 TraceCheckUtils]: 8: Hoare triple {290#(= dll_create_~len |dll_create_#in~len|)} assume !~bvsgt32(~len, 0bv32); {294#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:15:12,862 INFO L273 TraceCheckUtils]: 9: Hoare triple {294#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {294#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:15:12,879 INFO L273 TraceCheckUtils]: 10: Hoare triple {294#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} assume true; {294#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:15:12,886 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {294#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} {283#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #82#return; {264#false} is VALID [2018-11-23 11:15:12,886 INFO L273 TraceCheckUtils]: 12: Hoare triple {264#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {264#false} is VALID [2018-11-23 11:15:12,887 INFO L273 TraceCheckUtils]: 13: Hoare triple {264#false} assume !~bvsge32(~i~0, 0bv32); {264#false} is VALID [2018-11-23 11:15:12,887 INFO L273 TraceCheckUtils]: 14: Hoare triple {264#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {264#false} is VALID [2018-11-23 11:15:12,887 INFO L273 TraceCheckUtils]: 15: Hoare triple {264#false} assume 0bv32 != #t~mem10.base || 0bv32 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {264#false} is VALID [2018-11-23 11:15:12,888 INFO L273 TraceCheckUtils]: 16: Hoare triple {264#false} assume !false; {264#false} is VALID [2018-11-23 11:15:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:15:12,890 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:15:12,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:15:12,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:15:12,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:15:12,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:12,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:15:12,936 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:12,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:15:12,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:15:12,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:15:12,938 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 5 states. [2018-11-23 11:15:14,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:14,342 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-23 11:15:14,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:15:14,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:15:14,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:14,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:15:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2018-11-23 11:15:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:15:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2018-11-23 11:15:14,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2018-11-23 11:15:14,487 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:14,490 INFO L225 Difference]: With dead ends: 50 [2018-11-23 11:15:14,490 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 11:15:14,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:15:14,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 11:15:14,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-11-23 11:15:14,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:14,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 30 states. [2018-11-23 11:15:14,524 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 30 states. [2018-11-23 11:15:14,525 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 30 states. [2018-11-23 11:15:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:14,527 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 11:15:14,528 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 11:15:14,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:14,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:14,529 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 34 states. [2018-11-23 11:15:14,529 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 34 states. [2018-11-23 11:15:14,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:14,532 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 11:15:14,532 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 11:15:14,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:14,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:14,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:14,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:15:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-23 11:15:14,536 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 17 [2018-11-23 11:15:14,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:14,536 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-23 11:15:14,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:15:14,537 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 11:15:14,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:15:14,538 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:14,538 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] [2018-11-23 11:15:14,538 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:14,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:14,539 INFO L82 PathProgramCache]: Analyzing trace with hash 467179213, now seen corresponding path program 1 times [2018-11-23 11:15:14,540 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:14,540 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:15:14,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:14,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:14,727 INFO L256 TraceCheckUtils]: 0: Hoare triple {496#true} call ULTIMATE.init(); {496#true} is VALID [2018-11-23 11:15:14,727 INFO L273 TraceCheckUtils]: 1: Hoare triple {496#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {496#true} is VALID [2018-11-23 11:15:14,728 INFO L273 TraceCheckUtils]: 2: Hoare triple {496#true} assume true; {496#true} is VALID [2018-11-23 11:15:14,728 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {496#true} {496#true} #78#return; {496#true} is VALID [2018-11-23 11:15:14,728 INFO L256 TraceCheckUtils]: 4: Hoare triple {496#true} call #t~ret11 := main(); {496#true} is VALID [2018-11-23 11:15:14,729 INFO L273 TraceCheckUtils]: 5: Hoare triple {496#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {496#true} is VALID [2018-11-23 11:15:14,729 INFO L256 TraceCheckUtils]: 6: Hoare triple {496#true} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {496#true} is VALID [2018-11-23 11:15:14,730 INFO L273 TraceCheckUtils]: 7: Hoare triple {496#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {522#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-23 11:15:14,732 INFO L273 TraceCheckUtils]: 8: Hoare triple {522#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {522#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-23 11:15:14,732 INFO L273 TraceCheckUtils]: 9: Hoare triple {522#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {522#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-23 11:15:14,735 INFO L273 TraceCheckUtils]: 10: Hoare triple {522#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {522#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-23 11:15:14,741 INFO L273 TraceCheckUtils]: 11: Hoare triple {522#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {497#false} is VALID [2018-11-23 11:15:14,742 INFO L273 TraceCheckUtils]: 12: Hoare triple {497#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {497#false} is VALID [2018-11-23 11:15:14,742 INFO L273 TraceCheckUtils]: 13: Hoare triple {497#false} assume !~bvsgt32(~len, 0bv32); {497#false} is VALID [2018-11-23 11:15:14,742 INFO L273 TraceCheckUtils]: 14: Hoare triple {497#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {497#false} is VALID [2018-11-23 11:15:14,742 INFO L273 TraceCheckUtils]: 15: Hoare triple {497#false} assume true; {497#false} is VALID [2018-11-23 11:15:14,743 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {497#false} {496#true} #82#return; {497#false} is VALID [2018-11-23 11:15:14,743 INFO L273 TraceCheckUtils]: 17: Hoare triple {497#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {497#false} is VALID [2018-11-23 11:15:14,743 INFO L273 TraceCheckUtils]: 18: Hoare triple {497#false} assume !~bvsge32(~i~0, 0bv32); {497#false} is VALID [2018-11-23 11:15:14,744 INFO L273 TraceCheckUtils]: 19: Hoare triple {497#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {497#false} is VALID [2018-11-23 11:15:14,744 INFO L273 TraceCheckUtils]: 20: Hoare triple {497#false} assume 0bv32 != #t~mem10.base || 0bv32 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {497#false} is VALID [2018-11-23 11:15:14,744 INFO L273 TraceCheckUtils]: 21: Hoare triple {497#false} assume !false; {497#false} is VALID [2018-11-23 11:15:14,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:15:14,746 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:15:14,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:15:14,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:15:14,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 11:15:14,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:14,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:15:14,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:14,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:15:14,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:15:14,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:15:14,799 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 3 states. [2018-11-23 11:15:15,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:15,790 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-23 11:15:15,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:15:15,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 11:15:15,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:15,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:15:15,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-23 11:15:15,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:15:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-23 11:15:15,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2018-11-23 11:15:15,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:15,934 INFO L225 Difference]: With dead ends: 55 [2018-11-23 11:15:15,934 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 11:15:15,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:15:15,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 11:15:15,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 11:15:15,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:15,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 11:15:15,954 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 11:15:15,954 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 11:15:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:15,957 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 11:15:15,957 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 11:15:15,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:15,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:15,958 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 11:15:15,958 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 11:15:15,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:15,961 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 11:15:15,961 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 11:15:15,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:15,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:15,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:15,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:15,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:15:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-23 11:15:15,965 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 22 [2018-11-23 11:15:15,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:15,965 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-23 11:15:15,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:15:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-23 11:15:15,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:15:15,967 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:15,967 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] [2018-11-23 11:15:15,967 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:15,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:15,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1168243791, now seen corresponding path program 1 times [2018-11-23 11:15:15,968 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:15,968 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:15:15,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:16,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:16,149 INFO L256 TraceCheckUtils]: 0: Hoare triple {749#true} call ULTIMATE.init(); {749#true} is VALID [2018-11-23 11:15:16,149 INFO L273 TraceCheckUtils]: 1: Hoare triple {749#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {749#true} is VALID [2018-11-23 11:15:16,149 INFO L273 TraceCheckUtils]: 2: Hoare triple {749#true} assume true; {749#true} is VALID [2018-11-23 11:15:16,150 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {749#true} {749#true} #78#return; {749#true} is VALID [2018-11-23 11:15:16,150 INFO L256 TraceCheckUtils]: 4: Hoare triple {749#true} call #t~ret11 := main(); {749#true} is VALID [2018-11-23 11:15:16,151 INFO L273 TraceCheckUtils]: 5: Hoare triple {749#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {769#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:16,151 INFO L256 TraceCheckUtils]: 6: Hoare triple {769#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {749#true} is VALID [2018-11-23 11:15:16,153 INFO L273 TraceCheckUtils]: 7: Hoare triple {749#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {776#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:15:16,156 INFO L273 TraceCheckUtils]: 8: Hoare triple {776#(= dll_create_~len |dll_create_#in~len|)} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {776#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:15:16,156 INFO L273 TraceCheckUtils]: 9: Hoare triple {776#(= dll_create_~len |dll_create_#in~len|)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {776#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:15:16,157 INFO L273 TraceCheckUtils]: 10: Hoare triple {776#(= dll_create_~len |dll_create_#in~len|)} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {776#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:15:16,157 INFO L273 TraceCheckUtils]: 11: Hoare triple {776#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {776#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:15:16,158 INFO L273 TraceCheckUtils]: 12: Hoare triple {776#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {792#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} is VALID [2018-11-23 11:15:16,159 INFO L273 TraceCheckUtils]: 13: Hoare triple {792#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} assume !~bvsgt32(~len, 0bv32); {796#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:16,159 INFO L273 TraceCheckUtils]: 14: Hoare triple {796#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {796#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:16,160 INFO L273 TraceCheckUtils]: 15: Hoare triple {796#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {796#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:16,163 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {796#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {769#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #82#return; {750#false} is VALID [2018-11-23 11:15:16,164 INFO L273 TraceCheckUtils]: 17: Hoare triple {750#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {750#false} is VALID [2018-11-23 11:15:16,164 INFO L273 TraceCheckUtils]: 18: Hoare triple {750#false} assume !~bvsge32(~i~0, 0bv32); {750#false} is VALID [2018-11-23 11:15:16,165 INFO L273 TraceCheckUtils]: 19: Hoare triple {750#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {750#false} is VALID [2018-11-23 11:15:16,165 INFO L273 TraceCheckUtils]: 20: Hoare triple {750#false} assume 0bv32 != #t~mem10.base || 0bv32 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {750#false} is VALID [2018-11-23 11:15:16,165 INFO L273 TraceCheckUtils]: 21: Hoare triple {750#false} assume !false; {750#false} is VALID [2018-11-23 11:15:16,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:15:16,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:15:16,541 INFO L273 TraceCheckUtils]: 21: Hoare triple {750#false} assume !false; {750#false} is VALID [2018-11-23 11:15:16,542 INFO L273 TraceCheckUtils]: 20: Hoare triple {750#false} assume 0bv32 != #t~mem10.base || 0bv32 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {750#false} is VALID [2018-11-23 11:15:16,542 INFO L273 TraceCheckUtils]: 19: Hoare triple {750#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {750#false} is VALID [2018-11-23 11:15:16,543 INFO L273 TraceCheckUtils]: 18: Hoare triple {750#false} assume !~bvsge32(~i~0, 0bv32); {750#false} is VALID [2018-11-23 11:15:16,543 INFO L273 TraceCheckUtils]: 17: Hoare triple {750#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {750#false} is VALID [2018-11-23 11:15:16,545 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {796#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {836#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} #82#return; {750#false} is VALID [2018-11-23 11:15:16,546 INFO L273 TraceCheckUtils]: 15: Hoare triple {796#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {796#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:16,547 INFO L273 TraceCheckUtils]: 14: Hoare triple {796#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {796#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:16,547 INFO L273 TraceCheckUtils]: 13: Hoare triple {849#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !~bvsgt32(~len, 0bv32); {796#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:16,551 INFO L273 TraceCheckUtils]: 12: Hoare triple {853#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {849#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:15:16,551 INFO L273 TraceCheckUtils]: 11: Hoare triple {853#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {853#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:15:16,557 INFO L273 TraceCheckUtils]: 10: Hoare triple {853#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {853#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:15:16,558 INFO L273 TraceCheckUtils]: 9: Hoare triple {853#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {853#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:15:16,559 INFO L273 TraceCheckUtils]: 8: Hoare triple {853#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {853#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:15:16,561 INFO L273 TraceCheckUtils]: 7: Hoare triple {749#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {853#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:15:16,561 INFO L256 TraceCheckUtils]: 6: Hoare triple {836#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {749#true} is VALID [2018-11-23 11:15:16,566 INFO L273 TraceCheckUtils]: 5: Hoare triple {749#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {836#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:16,566 INFO L256 TraceCheckUtils]: 4: Hoare triple {749#true} call #t~ret11 := main(); {749#true} is VALID [2018-11-23 11:15:16,566 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {749#true} {749#true} #78#return; {749#true} is VALID [2018-11-23 11:15:16,567 INFO L273 TraceCheckUtils]: 2: Hoare triple {749#true} assume true; {749#true} is VALID [2018-11-23 11:15:16,567 INFO L273 TraceCheckUtils]: 1: Hoare triple {749#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {749#true} is VALID [2018-11-23 11:15:16,567 INFO L256 TraceCheckUtils]: 0: Hoare triple {749#true} call ULTIMATE.init(); {749#true} is VALID [2018-11-23 11:15:16,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:15:16,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:15:16,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 11:15:16,576 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 11:15:16,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:16,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:15:16,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:16,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:15:16,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:15:16,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:15:16,683 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 9 states. [2018-11-23 11:15:18,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:18,041 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-11-23 11:15:18,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:15:18,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 11:15:18,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:15:18,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2018-11-23 11:15:18,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:15:18,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2018-11-23 11:15:18,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 61 transitions. [2018-11-23 11:15:18,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:18,243 INFO L225 Difference]: With dead ends: 55 [2018-11-23 11:15:18,243 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 11:15:18,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:15:18,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 11:15:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-11-23 11:15:18,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:18,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 35 states. [2018-11-23 11:15:18,263 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 35 states. [2018-11-23 11:15:18,264 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 35 states. [2018-11-23 11:15:18,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:18,267 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 11:15:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 11:15:18,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:18,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:18,268 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 39 states. [2018-11-23 11:15:18,268 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 39 states. [2018-11-23 11:15:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:18,271 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 11:15:18,271 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 11:15:18,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:18,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:18,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:18,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:15:18,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-23 11:15:18,275 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 22 [2018-11-23 11:15:18,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:18,275 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-23 11:15:18,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:15:18,276 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 11:15:18,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:15:18,276 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:18,277 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] [2018-11-23 11:15:18,277 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:18,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:18,277 INFO L82 PathProgramCache]: Analyzing trace with hash 5049953, now seen corresponding path program 1 times [2018-11-23 11:15:18,278 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:18,278 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:15:18,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:18,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:18,441 INFO L256 TraceCheckUtils]: 0: Hoare triple {1091#true} call ULTIMATE.init(); {1091#true} is VALID [2018-11-23 11:15:18,442 INFO L273 TraceCheckUtils]: 1: Hoare triple {1091#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1091#true} is VALID [2018-11-23 11:15:18,442 INFO L273 TraceCheckUtils]: 2: Hoare triple {1091#true} assume true; {1091#true} is VALID [2018-11-23 11:15:18,442 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1091#true} {1091#true} #78#return; {1091#true} is VALID [2018-11-23 11:15:18,442 INFO L256 TraceCheckUtils]: 4: Hoare triple {1091#true} call #t~ret11 := main(); {1091#true} is VALID [2018-11-23 11:15:18,448 INFO L273 TraceCheckUtils]: 5: Hoare triple {1091#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1111#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:18,448 INFO L256 TraceCheckUtils]: 6: Hoare triple {1111#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {1091#true} is VALID [2018-11-23 11:15:18,449 INFO L273 TraceCheckUtils]: 7: Hoare triple {1091#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1091#true} is VALID [2018-11-23 11:15:18,449 INFO L273 TraceCheckUtils]: 8: Hoare triple {1091#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1091#true} is VALID [2018-11-23 11:15:18,449 INFO L273 TraceCheckUtils]: 9: Hoare triple {1091#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1091#true} is VALID [2018-11-23 11:15:18,449 INFO L273 TraceCheckUtils]: 10: Hoare triple {1091#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1091#true} is VALID [2018-11-23 11:15:18,450 INFO L273 TraceCheckUtils]: 11: Hoare triple {1091#true} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1091#true} is VALID [2018-11-23 11:15:18,450 INFO L273 TraceCheckUtils]: 12: Hoare triple {1091#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1091#true} is VALID [2018-11-23 11:15:18,450 INFO L273 TraceCheckUtils]: 13: Hoare triple {1091#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1091#true} is VALID [2018-11-23 11:15:18,451 INFO L273 TraceCheckUtils]: 14: Hoare triple {1091#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1091#true} is VALID [2018-11-23 11:15:18,451 INFO L273 TraceCheckUtils]: 15: Hoare triple {1091#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1091#true} is VALID [2018-11-23 11:15:18,451 INFO L273 TraceCheckUtils]: 16: Hoare triple {1091#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(8bv32, ~head~0.offset), 4bv32); {1091#true} is VALID [2018-11-23 11:15:18,451 INFO L273 TraceCheckUtils]: 17: Hoare triple {1091#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1091#true} is VALID [2018-11-23 11:15:18,451 INFO L273 TraceCheckUtils]: 18: Hoare triple {1091#true} assume !~bvsgt32(~len, 0bv32); {1091#true} is VALID [2018-11-23 11:15:18,452 INFO L273 TraceCheckUtils]: 19: Hoare triple {1091#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1091#true} is VALID [2018-11-23 11:15:18,452 INFO L273 TraceCheckUtils]: 20: Hoare triple {1091#true} assume true; {1091#true} is VALID [2018-11-23 11:15:18,463 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1091#true} {1111#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #82#return; {1111#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:18,476 INFO L273 TraceCheckUtils]: 22: Hoare triple {1111#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {1163#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:18,480 INFO L273 TraceCheckUtils]: 23: Hoare triple {1163#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsge32(~i~0, 0bv32); {1092#false} is VALID [2018-11-23 11:15:18,481 INFO L273 TraceCheckUtils]: 24: Hoare triple {1092#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {1092#false} is VALID [2018-11-23 11:15:18,481 INFO L273 TraceCheckUtils]: 25: Hoare triple {1092#false} assume 0bv32 != #t~mem10.base || 0bv32 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1092#false} is VALID [2018-11-23 11:15:18,481 INFO L273 TraceCheckUtils]: 26: Hoare triple {1092#false} assume !false; {1092#false} is VALID [2018-11-23 11:15:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:15:18,483 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:15:18,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:15:18,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:15:18,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 11:15:18,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:18,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:15:18,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:18,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:15:18,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:15:18,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:15:18,542 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 4 states. [2018-11-23 11:15:19,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:19,040 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-23 11:15:19,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:15:19,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 11:15:19,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:19,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:15:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2018-11-23 11:15:19,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:15:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2018-11-23 11:15:19,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2018-11-23 11:15:19,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:19,136 INFO L225 Difference]: With dead ends: 42 [2018-11-23 11:15:19,136 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 11:15:19,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:15:19,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 11:15:19,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-23 11:15:19,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:19,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 36 states. [2018-11-23 11:15:19,220 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 36 states. [2018-11-23 11:15:19,221 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 36 states. [2018-11-23 11:15:19,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:19,224 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 11:15:19,225 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 11:15:19,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:19,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:19,226 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 38 states. [2018-11-23 11:15:19,226 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 38 states. [2018-11-23 11:15:19,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:19,228 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 11:15:19,228 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 11:15:19,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:19,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:19,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:19,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:19,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:15:19,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-11-23 11:15:19,232 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 27 [2018-11-23 11:15:19,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:19,232 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-11-23 11:15:19,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:15:19,233 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-23 11:15:19,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:15:19,234 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:19,234 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] [2018-11-23 11:15:19,234 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:19,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:19,235 INFO L82 PathProgramCache]: Analyzing trace with hash 760831495, now seen corresponding path program 1 times [2018-11-23 11:15:19,235 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:19,235 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:15:19,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:19,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:19,460 INFO L256 TraceCheckUtils]: 0: Hoare triple {1361#true} call ULTIMATE.init(); {1361#true} is VALID [2018-11-23 11:15:19,460 INFO L273 TraceCheckUtils]: 1: Hoare triple {1361#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1361#true} is VALID [2018-11-23 11:15:19,461 INFO L273 TraceCheckUtils]: 2: Hoare triple {1361#true} assume true; {1361#true} is VALID [2018-11-23 11:15:19,461 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1361#true} {1361#true} #78#return; {1361#true} is VALID [2018-11-23 11:15:19,462 INFO L256 TraceCheckUtils]: 4: Hoare triple {1361#true} call #t~ret11 := main(); {1361#true} is VALID [2018-11-23 11:15:19,466 INFO L273 TraceCheckUtils]: 5: Hoare triple {1361#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1381#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:19,466 INFO L256 TraceCheckUtils]: 6: Hoare triple {1381#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {1361#true} is VALID [2018-11-23 11:15:19,466 INFO L273 TraceCheckUtils]: 7: Hoare triple {1361#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1361#true} is VALID [2018-11-23 11:15:19,467 INFO L273 TraceCheckUtils]: 8: Hoare triple {1361#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1361#true} is VALID [2018-11-23 11:15:19,467 INFO L273 TraceCheckUtils]: 9: Hoare triple {1361#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1361#true} is VALID [2018-11-23 11:15:19,467 INFO L273 TraceCheckUtils]: 10: Hoare triple {1361#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1361#true} is VALID [2018-11-23 11:15:19,467 INFO L273 TraceCheckUtils]: 11: Hoare triple {1361#true} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1361#true} is VALID [2018-11-23 11:15:19,467 INFO L273 TraceCheckUtils]: 12: Hoare triple {1361#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1361#true} is VALID [2018-11-23 11:15:19,468 INFO L273 TraceCheckUtils]: 13: Hoare triple {1361#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1361#true} is VALID [2018-11-23 11:15:19,468 INFO L273 TraceCheckUtils]: 14: Hoare triple {1361#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1361#true} is VALID [2018-11-23 11:15:19,468 INFO L273 TraceCheckUtils]: 15: Hoare triple {1361#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1361#true} is VALID [2018-11-23 11:15:19,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {1361#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(8bv32, ~head~0.offset), 4bv32); {1361#true} is VALID [2018-11-23 11:15:19,469 INFO L273 TraceCheckUtils]: 17: Hoare triple {1361#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1361#true} is VALID [2018-11-23 11:15:19,469 INFO L273 TraceCheckUtils]: 18: Hoare triple {1361#true} assume !~bvsgt32(~len, 0bv32); {1361#true} is VALID [2018-11-23 11:15:19,469 INFO L273 TraceCheckUtils]: 19: Hoare triple {1361#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1361#true} is VALID [2018-11-23 11:15:19,470 INFO L273 TraceCheckUtils]: 20: Hoare triple {1361#true} assume true; {1361#true} is VALID [2018-11-23 11:15:19,476 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1361#true} {1381#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #82#return; {1381#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:19,477 INFO L273 TraceCheckUtils]: 22: Hoare triple {1381#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {1433#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:19,482 INFO L273 TraceCheckUtils]: 23: Hoare triple {1433#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsge32(~i~0, 0bv32); {1433#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:19,482 INFO L256 TraceCheckUtils]: 24: Hoare triple {1433#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call dll_remove_first(~#s~0.base, ~#s~0.offset); {1361#true} is VALID [2018-11-23 11:15:19,482 INFO L273 TraceCheckUtils]: 25: Hoare triple {1361#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, ~bvadd32(4bv32, #t~mem5.offset), 4bv32);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1361#true} is VALID [2018-11-23 11:15:19,483 INFO L273 TraceCheckUtils]: 26: Hoare triple {1361#true} assume ~temp~1.base != 0bv32 || ~temp~1.offset != 0bv32;call write~$Pointer$(0bv32, 0bv32, ~temp~1.base, ~bvadd32(8bv32, ~temp~1.offset), 4bv32); {1361#true} is VALID [2018-11-23 11:15:19,483 INFO L273 TraceCheckUtils]: 27: Hoare triple {1361#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4bv32); {1361#true} is VALID [2018-11-23 11:15:19,483 INFO L273 TraceCheckUtils]: 28: Hoare triple {1361#true} assume true; {1361#true} is VALID [2018-11-23 11:15:19,484 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1361#true} {1433#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #84#return; {1433#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:19,485 INFO L273 TraceCheckUtils]: 30: Hoare triple {1433#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post9 := ~i~0;~i~0 := ~bvsub32(#t~post9, 1bv32);havoc #t~post9; {1458#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:15:19,486 INFO L273 TraceCheckUtils]: 31: Hoare triple {1458#(= main_~i~0 (_ bv0 32))} assume !~bvsge32(~i~0, 0bv32); {1362#false} is VALID [2018-11-23 11:15:19,486 INFO L273 TraceCheckUtils]: 32: Hoare triple {1362#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {1362#false} is VALID [2018-11-23 11:15:19,486 INFO L273 TraceCheckUtils]: 33: Hoare triple {1362#false} assume 0bv32 != #t~mem10.base || 0bv32 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1362#false} is VALID [2018-11-23 11:15:19,487 INFO L273 TraceCheckUtils]: 34: Hoare triple {1362#false} assume !false; {1362#false} is VALID [2018-11-23 11:15:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:15:19,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:15:19,583 INFO L273 TraceCheckUtils]: 34: Hoare triple {1362#false} assume !false; {1362#false} is VALID [2018-11-23 11:15:19,584 INFO L273 TraceCheckUtils]: 33: Hoare triple {1362#false} assume 0bv32 != #t~mem10.base || 0bv32 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1362#false} is VALID [2018-11-23 11:15:19,584 INFO L273 TraceCheckUtils]: 32: Hoare triple {1362#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {1362#false} is VALID [2018-11-23 11:15:19,585 INFO L273 TraceCheckUtils]: 31: Hoare triple {1480#(bvsge main_~i~0 (_ bv0 32))} assume !~bvsge32(~i~0, 0bv32); {1362#false} is VALID [2018-11-23 11:15:19,587 INFO L273 TraceCheckUtils]: 30: Hoare triple {1484#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post9 := ~i~0;~i~0 := ~bvsub32(#t~post9, 1bv32);havoc #t~post9; {1480#(bvsge main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:15:19,588 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1361#true} {1484#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #84#return; {1484#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:19,588 INFO L273 TraceCheckUtils]: 28: Hoare triple {1361#true} assume true; {1361#true} is VALID [2018-11-23 11:15:19,588 INFO L273 TraceCheckUtils]: 27: Hoare triple {1361#true} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4bv32); {1361#true} is VALID [2018-11-23 11:15:19,589 INFO L273 TraceCheckUtils]: 26: Hoare triple {1361#true} assume ~temp~1.base != 0bv32 || ~temp~1.offset != 0bv32;call write~$Pointer$(0bv32, 0bv32, ~temp~1.base, ~bvadd32(8bv32, ~temp~1.offset), 4bv32); {1361#true} is VALID [2018-11-23 11:15:19,589 INFO L273 TraceCheckUtils]: 25: Hoare triple {1361#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, ~bvadd32(4bv32, #t~mem5.offset), 4bv32);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1361#true} is VALID [2018-11-23 11:15:19,590 INFO L256 TraceCheckUtils]: 24: Hoare triple {1484#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call dll_remove_first(~#s~0.base, ~#s~0.offset); {1361#true} is VALID [2018-11-23 11:15:19,590 INFO L273 TraceCheckUtils]: 23: Hoare triple {1484#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsge32(~i~0, 0bv32); {1484#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:19,594 INFO L273 TraceCheckUtils]: 22: Hoare triple {1509#(bvsge (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {1484#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:19,595 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1361#true} {1509#(bvsge (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #82#return; {1509#(bvsge (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:19,596 INFO L273 TraceCheckUtils]: 20: Hoare triple {1361#true} assume true; {1361#true} is VALID [2018-11-23 11:15:19,596 INFO L273 TraceCheckUtils]: 19: Hoare triple {1361#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1361#true} is VALID [2018-11-23 11:15:19,596 INFO L273 TraceCheckUtils]: 18: Hoare triple {1361#true} assume !~bvsgt32(~len, 0bv32); {1361#true} is VALID [2018-11-23 11:15:19,596 INFO L273 TraceCheckUtils]: 17: Hoare triple {1361#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1361#true} is VALID [2018-11-23 11:15:19,597 INFO L273 TraceCheckUtils]: 16: Hoare triple {1361#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(8bv32, ~head~0.offset), 4bv32); {1361#true} is VALID [2018-11-23 11:15:19,597 INFO L273 TraceCheckUtils]: 15: Hoare triple {1361#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1361#true} is VALID [2018-11-23 11:15:19,597 INFO L273 TraceCheckUtils]: 14: Hoare triple {1361#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1361#true} is VALID [2018-11-23 11:15:19,597 INFO L273 TraceCheckUtils]: 13: Hoare triple {1361#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1361#true} is VALID [2018-11-23 11:15:19,598 INFO L273 TraceCheckUtils]: 12: Hoare triple {1361#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1361#true} is VALID [2018-11-23 11:15:19,598 INFO L273 TraceCheckUtils]: 11: Hoare triple {1361#true} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1361#true} is VALID [2018-11-23 11:15:19,598 INFO L273 TraceCheckUtils]: 10: Hoare triple {1361#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1361#true} is VALID [2018-11-23 11:15:19,598 INFO L273 TraceCheckUtils]: 9: Hoare triple {1361#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1361#true} is VALID [2018-11-23 11:15:19,598 INFO L273 TraceCheckUtils]: 8: Hoare triple {1361#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1361#true} is VALID [2018-11-23 11:15:19,599 INFO L273 TraceCheckUtils]: 7: Hoare triple {1361#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1361#true} is VALID [2018-11-23 11:15:19,599 INFO L256 TraceCheckUtils]: 6: Hoare triple {1509#(bvsge (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {1361#true} is VALID [2018-11-23 11:15:19,600 INFO L273 TraceCheckUtils]: 5: Hoare triple {1361#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1509#(bvsge (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:19,600 INFO L256 TraceCheckUtils]: 4: Hoare triple {1361#true} call #t~ret11 := main(); {1361#true} is VALID [2018-11-23 11:15:19,600 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1361#true} {1361#true} #78#return; {1361#true} is VALID [2018-11-23 11:15:19,600 INFO L273 TraceCheckUtils]: 2: Hoare triple {1361#true} assume true; {1361#true} is VALID [2018-11-23 11:15:19,601 INFO L273 TraceCheckUtils]: 1: Hoare triple {1361#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1361#true} is VALID [2018-11-23 11:15:19,601 INFO L256 TraceCheckUtils]: 0: Hoare triple {1361#true} call ULTIMATE.init(); {1361#true} is VALID [2018-11-23 11:15:19,603 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (7)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:15:19,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:15:19,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:15:19,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-11-23 11:15:19,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:19,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:15:19,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:19,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:15:19,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:15:19,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:15:19,684 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 8 states. [2018-11-23 11:15:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:20,822 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-23 11:15:20,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:15:20,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-11-23 11:15:20,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:20,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:15:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2018-11-23 11:15:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:15:20,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2018-11-23 11:15:20,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2018-11-23 11:15:20,942 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:20,944 INFO L225 Difference]: With dead ends: 45 [2018-11-23 11:15:20,944 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 11:15:20,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:15:20,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 11:15:20,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-23 11:15:20,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:20,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 39 states. [2018-11-23 11:15:20,990 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 39 states. [2018-11-23 11:15:20,990 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 39 states. [2018-11-23 11:15:20,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:20,994 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 11:15:20,995 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 11:15:20,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:20,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:20,995 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 41 states. [2018-11-23 11:15:20,996 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 41 states. [2018-11-23 11:15:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:20,998 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 11:15:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 11:15:20,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:20,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:20,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:20,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:21,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:15:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 11:15:21,002 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 35 [2018-11-23 11:15:21,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:21,002 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 11:15:21,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:15:21,003 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 11:15:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 11:15:21,004 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:21,004 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:15:21,004 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:21,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:21,005 INFO L82 PathProgramCache]: Analyzing trace with hash -788093011, now seen corresponding path program 2 times [2018-11-23 11:15:21,005 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:21,005 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:15:21,031 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:15:21,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:15:21,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:15:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:21,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:21,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 11:15:21,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:21,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:21,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:15:21,396 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:21,396 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_43|]. (and (= |main_~#s~0.offset| (_ bv0 32)) (= |#valid| (store |v_#valid_43| |main_~#s~0.base| (_ bv1 1)))) [2018-11-23 11:15:21,396 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (= |main_~#s~0.offset| (_ bv0 32))) [2018-11-23 11:15:21,666 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 18 treesize of output 15 [2018-11-23 11:15:21,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 11:15:21,703 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:21,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-23 11:15:21,715 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:21,729 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:21,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:21,786 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 18 treesize of output 15 [2018-11-23 11:15:21,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 11:15:21,802 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:21,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-23 11:15:21,805 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:21,817 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:21,827 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:21,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:21,874 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:51, output treesize:51 [2018-11-23 11:15:22,366 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:22,533 INFO L303 Elim1Store]: Index analysis took 205 ms [2018-11-23 11:15:22,534 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 34 treesize of output 35 [2018-11-23 11:15:22,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-23 11:15:22,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:22,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:22,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:22,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-11-23 11:15:22,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 11:15:22,898 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:22,899 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:22,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 36 [2018-11-23 11:15:22,903 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:22,937 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:22,985 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:23,130 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:23,169 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 34 treesize of output 35 [2018-11-23 11:15:23,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-23 11:15:23,180 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:23,231 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:23,303 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:23,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-11-23 11:15:23,331 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 11:15:23,348 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:23,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-23 11:15:23,355 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:23,366 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:23,386 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:23,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:23,446 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:122, output treesize:92 [2018-11-23 11:15:25,457 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:25,458 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_38|, |v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_39|, |v_#memory_$Pointer$.base_38|]. (let ((.cse4 (select |v_#memory_$Pointer$.offset_38| dll_create_~new_head~0.base)) (.cse0 (select |v_#memory_$Pointer$.base_39| dll_create_~head~0.base)) (.cse3 (bvadd dll_create_~head~0.offset (_ bv4 32))) (.cse2 (select |v_#memory_$Pointer$.offset_39| dll_create_~head~0.base)) (.cse1 (bvadd dll_create_~head~0.offset (_ bv8 32))) (.cse7 (select |v_#memory_$Pointer$.base_38| dll_create_~new_head~0.base)) (.cse5 (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (.cse6 (bvadd dll_create_~new_head~0.offset (_ bv8 32)))) (and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (_ bv0 1) (select (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= (_ bv0 32) (select .cse0 .cse1)) (= (select .cse2 .cse3) (_ bv0 32)) (= (_ bv0 32) dll_create_~head~0.offset) (= (store |v_#memory_$Pointer$.offset_39| dll_create_~new_head~0.base (store (select |v_#memory_$Pointer$.offset_39| dll_create_~new_head~0.base) dll_create_~new_head~0.offset (select .cse4 dll_create_~new_head~0.offset))) |v_#memory_$Pointer$.offset_38|) (= (store |v_#memory_$Pointer$.offset_38| dll_create_~new_head~0.base (store (store .cse4 .cse5 dll_create_~head~0.offset) .cse6 (_ bv0 32))) |#memory_$Pointer$.offset|) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)) (= |v_#memory_$Pointer$.base_38| (store |v_#memory_$Pointer$.base_39| dll_create_~new_head~0.base (store (select |v_#memory_$Pointer$.base_39| dll_create_~new_head~0.base) dll_create_~new_head~0.offset (select .cse7 dll_create_~new_head~0.offset)))) (= (_ bv0 32) (select .cse0 .cse3)) (= (select .cse2 .cse1) (_ bv0 32)) (= (store |v_#memory_$Pointer$.base_38| dll_create_~new_head~0.base (store (store .cse7 .cse5 dll_create_~head~0.base) .cse6 (_ bv0 32))) |#memory_$Pointer$.base|))) [2018-11-23 11:15:25,458 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (bvadd dll_create_~head~0.offset (_ bv8 32))) (.cse2 (select |#memory_$Pointer$.base| dll_create_~head~0.base)) (.cse3 (select |#memory_$Pointer$.base| dll_create_~new_head~0.base)) (.cse6 (bvadd dll_create_~new_head~0.offset (_ bv8 32))) (.cse0 (select |#memory_$Pointer$.offset| dll_create_~head~0.base)) (.cse7 (bvadd dll_create_~head~0.offset (_ bv4 32))) (.cse5 (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base)) (.cse4 (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (select .cse0 .cse1) (_ bv0 32)) (= (_ bv0 1) (select (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= (_ bv0 32) (select .cse2 .cse1)) (= (_ bv0 32) dll_create_~head~0.offset) (= (select .cse3 .cse4) dll_create_~head~0.base) (= (_ bv0 32) (select .cse5 .cse6)) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)) (= (_ bv0 32) (select .cse2 .cse7)) (= (_ bv0 32) (select .cse3 .cse6)) (= (select .cse0 .cse7) (_ bv0 32)) (= (select .cse5 .cse4) dll_create_~head~0.offset))) [2018-11-23 11:15:25,674 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:25,687 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:25,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 130 [2018-11-23 11:15:25,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2018-11-23 11:15:25,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:26,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:26,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:26,160 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:26,162 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 68 treesize of output 58 [2018-11-23 11:15:26,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2018-11-23 11:15:26,182 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:26,202 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:26,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:26,247 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:154, output treesize:108 [2018-11-23 11:15:28,262 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:28,263 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_40|, |v_#memory_$Pointer$.offset_40|]. (let ((.cse6 (select |v_#memory_$Pointer$.base_40| dll_create_~new_head~0.base)) (.cse1 (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (let ((.cse3 (select .cse6 .cse1))) (let ((.cse0 (select |v_#memory_$Pointer$.offset_40| dll_create_~new_head~0.base)) (.cse4 (select |v_#memory_$Pointer$.offset_40| .cse3)) (.cse2 (bvadd dll_create_~new_head~0.offset (_ bv8 32))) (.cse5 (select |v_#memory_$Pointer$.base_40| .cse3))) (and (= (_ bv0 32) (select .cse0 .cse1)) (= (_ bv0 32) dll_create_~new_head~0.offset) (= (select .cse0 .cse2) (_ bv0 32)) (= (store |v_#memory_$Pointer$.offset_40| .cse3 (store .cse4 (_ bv8 32) dll_create_~new_head~0.offset)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_40| .cse3 (store .cse5 (_ bv8 32) dll_create_~new_head~0.base))) (= (_ bv0 1) (select |old(#valid)| .cse3)) (= (_ bv0 32) (select .cse4 (_ bv4 32))) (= (_ bv0 1) (select (store |old(#valid)| .cse3 (_ bv1 1)) dll_create_~new_head~0.base)) (= (_ bv0 32) (select .cse4 (_ bv8 32))) (= (_ bv0 32) (select .cse6 .cse2)) (= (_ bv0 32) (select .cse5 (_ bv8 32))) (= (_ bv0 32) (select .cse5 (_ bv4 32))))))) [2018-11-23 11:15:28,263 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse6 (select |#memory_$Pointer$.base| dll_create_~new_head~0.base)) (.cse2 (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (let ((.cse0 (select .cse6 .cse2))) (let ((.cse1 (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base)) (.cse4 (bvadd dll_create_~new_head~0.offset (_ bv8 32))) (.cse5 (select |#memory_$Pointer$.base| .cse0)) (.cse3 (select |#memory_$Pointer$.offset| .cse0))) (and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (select (store |old(#valid)| .cse0 (_ bv1 1)) dll_create_~new_head~0.base) (_ bv0 1)) (= (select .cse1 .cse2) (_ bv0 32)) (= (select .cse3 (_ bv8 32)) dll_create_~new_head~0.offset) (= (select |old(#valid)| .cse0) (_ bv0 1)) (= (_ bv0 32) (select .cse1 .cse4)) (= (select .cse5 (_ bv8 32)) dll_create_~new_head~0.base) (= (_ bv0 32) (select .cse6 .cse4)) (= (select .cse5 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse3 (_ bv4 32))))))) [2018-11-23 11:15:29,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:29,026 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:29,028 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:29,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-23 11:15:29,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:29,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:29,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:100, output treesize:92 [2018-11-23 11:15:31,059 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 11:15:31,222 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:31,297 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:31,600 INFO L303 Elim1Store]: Index analysis took 404 ms [2018-11-23 11:15:31,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 392 treesize of output 295 [2018-11-23 11:15:31,660 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:31,684 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:31,788 INFO L303 Elim1Store]: Index analysis took 166 ms [2018-11-23 11:15:31,833 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 179 [2018-11-23 11:15:31,889 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 11:15:32,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:32,685 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:32,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:32,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:32,886 INFO L303 Elim1Store]: Index analysis took 282 ms [2018-11-23 11:15:32,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 359 treesize of output 300 [2018-11-23 11:15:32,926 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 368 treesize of output 313 [2018-11-23 11:15:32,938 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:33,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:33,279 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:33,300 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:33,361 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:33,453 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:33,504 INFO L303 Elim1Store]: Index analysis took 272 ms [2018-11-23 11:15:33,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 291 [2018-11-23 11:15:33,557 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 347 treesize of output 296 [2018-11-23 11:15:33,563 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:33,850 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:33,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:33,927 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:34,105 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:34,149 INFO L303 Elim1Store]: Index analysis took 290 ms [2018-11-23 11:15:34,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 336 treesize of output 295 [2018-11-23 11:15:34,221 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 325 treesize of output 276 [2018-11-23 11:15:34,225 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:34,445 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:15:38,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-23 11:15:42,673 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:42,704 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:42,713 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:42,859 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:42,914 INFO L303 Elim1Store]: Index analysis took 320 ms [2018-11-23 11:15:42,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 259 [2018-11-23 11:15:42,979 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:42,994 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:42,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 66 [2018-11-23 11:15:43,020 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:43,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:43,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:43,427 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:43,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 182 [2018-11-23 11:15:43,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 121 [2018-11-23 11:15:43,451 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:43,511 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:43,583 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:43,612 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:43,621 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:43,622 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:43,740 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:43,792 INFO L303 Elim1Store]: Index analysis took 202 ms [2018-11-23 11:15:43,793 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 0 case distinctions, treesize of input 255 treesize of output 243 [2018-11-23 11:15:43,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:43,815 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:43,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 66 [2018-11-23 11:15:43,821 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:43,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:43,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:43,961 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:43,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 180 [2018-11-23 11:15:43,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 119 [2018-11-23 11:15:43,991 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:44,048 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:44,103 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:44,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:44,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:44,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:44,180 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:44,308 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:44,353 INFO L303 Elim1Store]: Index analysis took 240 ms [2018-11-23 11:15:44,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 276 [2018-11-23 11:15:44,373 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:44,374 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:44,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 66 [2018-11-23 11:15:44,378 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:44,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:44,545 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:44,571 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:44,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 197 [2018-11-23 11:15:44,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 134 [2018-11-23 11:15:44,599 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:44,668 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:44,762 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:45,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-23 11:15:45,120 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 2 variables, input treesize:402, output treesize:457 [2018-11-23 11:15:47,635 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:47,635 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_BEFORE_CALL_2|, |v_#memory_$Pointer$.offset_BEFORE_CALL_2|]. (let ((.cse11 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse8 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_2| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse0 (select |v_#memory_$Pointer$.base_BEFORE_CALL_2| .cse8)) (.cse2 (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| .cse8)) (.cse12 (bvadd .cse11 (_ bv4 32)))) (let ((.cse4 (select .cse2 .cse12)) (.cse7 (select .cse0 (_ bv4 32)))) (let ((.cse1 (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| .cse7)) (.cse5 (select .cse0 .cse12)) (.cse6 (bvadd .cse4 (_ bv8 32))) (.cse9 (select |v_#memory_$Pointer$.base_BEFORE_CALL_2| .cse7))) (and (= (_ bv0 32) (select .cse0 (_ bv8 32))) (= (_ bv0 32) (select .cse1 (_ bv8 32))) (= (select .cse2 (_ bv8 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse2 (_ bv4 32))) (= (let ((.cse3 (store |v_#memory_$Pointer$.offset_BEFORE_CALL_2| .cse5 (store (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| .cse5) .cse6 (_ bv0 32))))) (store .cse3 |main_~#s~0.base| (store (select .cse3 |main_~#s~0.base|) |main_~#s~0.offset| .cse4))) |#memory_$Pointer$.offset|) (not (= .cse7 .cse8)) (= (select .cse9 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse1 (_ bv4 32))) (= (let ((.cse10 (store |v_#memory_$Pointer$.base_BEFORE_CALL_2| .cse5 (store (select |v_#memory_$Pointer$.base_BEFORE_CALL_2| .cse5) .cse6 (_ bv0 32))))) (store .cse10 |main_~#s~0.base| (store (select .cse10 |main_~#s~0.base|) |main_~#s~0.offset| .cse5))) |#memory_$Pointer$.base|) (not (= |main_~#s~0.base| .cse7)) (= (_ bv0 32) .cse11) (= |main_~#s~0.offset| (_ bv0 32)) (not (= |main_~#s~0.base| .cse8)) (= (select .cse9 (_ bv8 32)) .cse8)))))) [2018-11-23 11:15:47,636 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_12, v_prenex_1, v_arrayElimCell_16, v_arrayElimCell_14, v_antiDerIndex_1]. (let ((.cse4 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse6 (select |#memory_$Pointer$.offset| .cse4))) (let ((.cse9 (= (_ bv0 32) (select .cse6 (_ bv4 32)))) (.cse7 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse10 (= |main_~#s~0.offset| (_ bv0 32))) (.cse11 (bvadd |main_~#s~0.offset| (_ bv4 32)))) (or (let ((.cse8 (select |#memory_$Pointer$.base| v_arrayElimCell_16)) (.cse2 (select |#memory_$Pointer$.offset| v_arrayElimCell_16))) (let ((.cse5 (select .cse2 .cse11)) (.cse3 (select .cse8 .cse11))) (let ((.cse0 (select |#memory_$Pointer$.base| .cse3)) (.cse1 (bvadd .cse5 (_ bv8 32)))) (and (= (_ bv0 32) (select .cse0 .cse1)) (not (= |main_~#s~0.base| v_arrayElimCell_16)) (= (_ bv0 32) (select .cse0 (_ bv4 32))) (= (_ bv0 32) (select .cse2 (_ bv8 32))) (= .cse3 .cse4) (= |main_~#s~0.offset| .cse5) (= (_ bv0 32) (select .cse6 .cse1)) (= .cse7 .cse5) (= (_ bv0 32) (select .cse8 (_ bv8 32))) (not (= (select .cse8 .cse1) v_arrayElimCell_16)) (not (= |main_~#s~0.base| (select .cse8 (_ bv4 32)))) .cse9 .cse10)))) (let ((.cse12 (select |#memory_$Pointer$.base| v_arrayElimCell_12))) (let ((.cse17 (select .cse12 .cse11)) (.cse14 (select |#memory_$Pointer$.offset| v_arrayElimCell_12))) (let ((.cse18 (select .cse14 .cse11)) (.cse13 (select |#memory_$Pointer$.base| .cse17))) (let ((.cse15 (select .cse13 v_prenex_1)) (.cse16 (bvadd .cse18 (_ bv8 32)))) (and (= (select .cse12 (_ bv8 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse13 (_ bv4 32))) (= (_ bv0 32) (select .cse14 (_ bv8 32))) (= .cse15 v_arrayElimCell_12) (= (_ bv0 32) (select .cse13 .cse16)) (not (= (select .cse12 v_prenex_1) .cse15)) (= .cse17 .cse4) (not (= |main_~#s~0.base| v_arrayElimCell_12)) (= .cse7 .cse18) .cse9 .cse10 (= (select .cse6 .cse16) (_ bv0 32)) (not (= (select .cse12 (_ bv4 32)) |main_~#s~0.base|)) (= .cse16 (_ bv8 32))))))) (let ((.cse24 (select |#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse20 (select |#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse22 (select .cse20 .cse11)) (.cse23 (select .cse24 .cse11))) (let ((.cse19 (bvadd .cse23 (_ bv8 32))) (.cse21 (select |#memory_$Pointer$.base| .cse22))) (and (= (_ bv0 32) (select .cse6 .cse19)) (not (= (select .cse20 v_antiDerIndex_1) (select .cse21 v_antiDerIndex_1))) (= (_ bv0 32) (select .cse20 (_ bv8 32))) (not (= |main_~#s~0.base| v_arrayElimCell_14)) (= (_ bv0 32) (select .cse21 .cse19)) (= .cse22 .cse4) .cse9 (= .cse7 .cse23) .cse10 (= (_ bv0 32) (select .cse24 (_ bv8 32))) (not (= |main_~#s~0.base| (select .cse20 (_ bv4 32)))) (= (_ bv8 32) .cse19) (= (select .cse21 (_ bv4 32)) (_ bv0 32)))))))))) [2018-11-23 11:15:48,689 WARN L180 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 82 [2018-11-23 11:15:49,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-11-23 11:15:49,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-23 11:15:49,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:49,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:49,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-11-23 11:15:49,764 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 22 treesize of output 21 [2018-11-23 11:15:49,766 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:49,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:49,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:49,792 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2018-11-23 11:15:50,129 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:50,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:50,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 184 [2018-11-23 11:15:50,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:50,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2018-11-23 11:15:50,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:50,320 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:50,321 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:50,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-23 11:15:50,332 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:50,443 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 44 treesize of output 38 [2018-11-23 11:15:50,446 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:50,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:50,794 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:50,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:50,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 98 [2018-11-23 11:15:50,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-23 11:15:50,828 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:50,911 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:50,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:50,923 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:50,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 47 [2018-11-23 11:15:50,949 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-23 11:15:51,064 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:51,069 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:51,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:51,076 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:51,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 55 [2018-11-23 11:15:51,107 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-23 11:15:51,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:51,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:51,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2018-11-23 11:15:51,165 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:51,226 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:15:51,491 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:51,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:51,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 167 [2018-11-23 11:15:51,518 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:51,519 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:51,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 55 [2018-11-23 11:15:51,555 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:51,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:51,664 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:51,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-23 11:15:51,669 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:51,750 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 54 treesize of output 46 [2018-11-23 11:15:51,753 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:51,825 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:52,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:52,084 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:52,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 83 [2018-11-23 11:15:52,130 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:52,132 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:52,134 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:52,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2018-11-23 11:15:52,154 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:52,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 11:15:52,234 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:52,276 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:52,279 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:52,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-11-23 11:15:52,290 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:52,314 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:52,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:15:52,454 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 7 variables, input treesize:390, output treesize:49 [2018-11-23 11:15:52,484 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:52,485 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_3, v_prenex_2, v_arrayElimCell_12, v_prenex_1, |v_old(#memory_$Pointer$.base)_AFTER_CALL_15|, |v_#memory_$Pointer$.offset_BEFORE_CALL_4|, v_arrayElimCell_16]. (let ((.cse6 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse7 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse9 (= |main_~#s~0.offset| (_ bv0 32))) (.cse14 (bvadd |main_~#s~0.offset| (_ bv4 32)))) (or (let ((.cse1 (select v_prenex_3 v_arrayElimCell_12))) (let ((.cse13 (select v_prenex_2 v_arrayElimCell_12)) (.cse12 (select .cse1 .cse14))) (let ((.cse8 (select v_prenex_3 .cse12)) (.cse4 (select (select v_prenex_3 |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse10 (select .cse13 .cse14)) (.cse11 (select (select v_prenex_2 |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse5 (bvadd .cse11 (_ bv4 32))) (.cse3 (bvadd .cse10 (_ bv8 32))) (.cse2 (select v_prenex_2 .cse4)) (.cse0 (select .cse8 v_prenex_1))) (and (= .cse0 v_arrayElimCell_12) (not (= (select .cse1 (_ bv4 32)) |main_~#s~0.base|)) (= (_ bv0 32) (select .cse2 .cse3)) (= (select (select v_prenex_3 .cse4) .cse5) .cse6) (= .cse7 (select .cse2 .cse5)) (= (_ bv0 32) (select .cse8 (_ bv4 32))) (not (= |main_~#s~0.base| v_arrayElimCell_12)) .cse9 (= (select .cse1 (_ bv8 32)) (_ bv0 32)) (= .cse10 (_ bv0 32)) (= (_ bv0 32) (select .cse8 .cse3)) (= .cse10 .cse11) (= (select .cse2 (_ bv4 32)) (_ bv0 32)) (= .cse12 .cse4) (not (= .cse0 (select .cse1 v_prenex_1))) (= (select .cse13 (_ bv8 32)) (_ bv0 32))))))) (let ((.cse23 (select |v_#memory_$Pointer$.offset_BEFORE_CALL_4| v_arrayElimCell_16)) (.cse20 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_15| v_arrayElimCell_16))) (let ((.cse24 (select .cse20 .cse14)) (.cse21 (select .cse23 .cse14)) (.cse16 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_15| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse22 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_4| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse17 (bvadd .cse22 (_ bv4 32))) (.cse15 (select |v_#memory_$Pointer$.offset_BEFORE_CALL_4| .cse16)) (.cse19 (bvadd .cse21 (_ bv8 32))) (.cse18 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_15| .cse24))) (and (= (select .cse15 (_ bv4 32)) (_ bv0 32)) (not (= |main_~#s~0.base| v_arrayElimCell_16)) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_15| .cse16) .cse17) .cse6) (= (select .cse18 .cse19) (_ bv0 32)) (= .cse7 (select .cse15 .cse17)) (= (_ bv0 32) (select .cse15 .cse19)) (= (select .cse20 (_ bv8 32)) (_ bv0 32)) (= .cse21 .cse22) (not (= (select .cse20 .cse19) v_arrayElimCell_16)) (= (select .cse23 (_ bv8 32)) (_ bv0 32)) (not (= (select .cse20 (_ bv4 32)) |main_~#s~0.base|)) (= .cse24 .cse16) .cse9 (= |main_~#s~0.offset| .cse21) (= (_ bv0 32) (select .cse18 (_ bv4 32))))))))) [2018-11-23 11:15:52,485 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse3 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse0 (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32))) (.cse1 (= (_ bv0 32) .cse3)) (.cse2 (= (bvadd |main_~#s~0.offset| (_ bv4 32)) (_ bv4 32)))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (not (= |main_~#s~0.base| .cse3)))))) [2018-11-23 11:15:52,683 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:15:52,713 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:15:52,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:52,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:52,737 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:15:52,743 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:15:52,744 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:52,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:52,753 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:15:52,753 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 11:15:52,758 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:52,758 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, |main_~#s~0.base|, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (.cse0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) (_ bv0 32)))) (and (= (_ bv0 32) .cse0) (= (_ bv0 32) .cse1) (= |main_#t~mem10.base| .cse1) (= |main_#t~mem10.offset| .cse0))) [2018-11-23 11:15:52,758 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~mem10.offset| (_ bv0 32)) (= |main_#t~mem10.base| (_ bv0 32))) [2018-11-23 11:15:52,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {1784#true} call ULTIMATE.init(); {1784#true} is VALID [2018-11-23 11:15:52,933 INFO L273 TraceCheckUtils]: 1: Hoare triple {1784#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1784#true} is VALID [2018-11-23 11:15:52,934 INFO L273 TraceCheckUtils]: 2: Hoare triple {1784#true} assume true; {1784#true} is VALID [2018-11-23 11:15:52,934 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1784#true} {1784#true} #78#return; {1784#true} is VALID [2018-11-23 11:15:52,934 INFO L256 TraceCheckUtils]: 4: Hoare triple {1784#true} call #t~ret11 := main(); {1784#true} is VALID [2018-11-23 11:15:52,943 INFO L273 TraceCheckUtils]: 5: Hoare triple {1784#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1804#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:15:52,957 INFO L256 TraceCheckUtils]: 6: Hoare triple {1804#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {1808#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:15:52,970 INFO L273 TraceCheckUtils]: 7: Hoare triple {1808#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1812#(and (= |#valid| |old(#valid)|) (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-23 11:15:52,986 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(and (= |#valid| |old(#valid)|) (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1816#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset) (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} is VALID [2018-11-23 11:15:52,995 INFO L273 TraceCheckUtils]: 9: Hoare triple {1816#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset) (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1816#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset) (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} is VALID [2018-11-23 11:15:53,009 INFO L273 TraceCheckUtils]: 10: Hoare triple {1816#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset) (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1823#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))) (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} is VALID [2018-11-23 11:15:53,022 INFO L273 TraceCheckUtils]: 11: Hoare triple {1823#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))) (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1823#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))) (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} is VALID [2018-11-23 11:15:53,024 INFO L273 TraceCheckUtils]: 12: Hoare triple {1823#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))) (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1830#(and (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= |#valid| (store |old(#valid)| dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:15:53,027 INFO L273 TraceCheckUtils]: 13: Hoare triple {1830#(and (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= |#valid| (store |old(#valid)| dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv0 32)))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1834#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= (_ bv0 1) (select (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:15:53,028 INFO L273 TraceCheckUtils]: 14: Hoare triple {1834#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= (_ bv0 1) (select (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv0 32)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1834#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= (_ bv0 1) (select (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:15:53,034 INFO L273 TraceCheckUtils]: 15: Hoare triple {1834#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= (_ bv0 1) (select (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv0 32)))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1841#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= (_ bv0 1) (select (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) dll_create_~head~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) dll_create_~head~0.offset))} is VALID [2018-11-23 11:15:53,038 INFO L273 TraceCheckUtils]: 16: Hoare triple {1841#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= (_ bv0 1) (select (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) dll_create_~head~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) dll_create_~head~0.offset))} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {1845#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~new_head~0.base) (_ bv0 1)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (_ bv8 32)) dll_create_~new_head~0.offset) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (_ bv8 32)) dll_create_~new_head~0.base) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (_ bv4 32))))} is VALID [2018-11-23 11:15:53,040 INFO L273 TraceCheckUtils]: 17: Hoare triple {1845#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~new_head~0.base) (_ bv0 1)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (_ bv8 32)) dll_create_~new_head~0.offset) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (_ bv8 32)) dll_create_~new_head~0.base) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (_ bv4 32))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1849#(and (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv8 32)) dll_create_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (= dll_create_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv8 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv0 1)) (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:15:53,041 INFO L273 TraceCheckUtils]: 18: Hoare triple {1849#(and (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv8 32)) dll_create_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (= dll_create_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv8 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv0 1)) (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {1849#(and (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv8 32)) dll_create_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (= dll_create_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv8 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv0 1)) (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:15:53,045 INFO L273 TraceCheckUtils]: 19: Hoare triple {1849#(and (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv8 32)) dll_create_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) dll_create_~head~0.offset) (= dll_create_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv8 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv0 1)) (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1856#(and (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_create_#res.base|) (_ bv0 1)) (= (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv0 32)) (= |dll_create_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (_ bv8 32))) (= |dll_create_#res.offset| (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (_ bv8 32)) |dll_create_#res.base|))} is VALID [2018-11-23 11:15:53,046 INFO L273 TraceCheckUtils]: 20: Hoare triple {1856#(and (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_create_#res.base|) (_ bv0 1)) (= (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv0 32)) (= |dll_create_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (_ bv8 32))) (= |dll_create_#res.offset| (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (_ bv8 32)) |dll_create_#res.base|))} assume true; {1856#(and (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_create_#res.base|) (_ bv0 1)) (= (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv0 32)) (= |dll_create_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (_ bv8 32))) (= |dll_create_#res.offset| (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (_ bv8 32)) |dll_create_#res.base|))} is VALID [2018-11-23 11:15:53,051 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1856#(and (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_create_#res.base|) (_ bv0 1)) (= (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv0 32)) (= |dll_create_#res.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (_ bv8 32))) (= |dll_create_#res.offset| (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (_ bv8 32)) |dll_create_#res.base|))} {1804#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} #82#return; {1863#(and (not (= |main_~#s~0.base| |main_#t~ret8.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (_ bv4 32))) (_ bv8 32)) |main_#t~ret8.base|) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) |main_#t~ret8.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (_ bv4 32))) (_ bv8 32)) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_#t~ret8.base|) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_#t~ret8.base|) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (_ bv4 32)) |main_#t~ret8.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:53,054 INFO L273 TraceCheckUtils]: 22: Hoare triple {1863#(and (not (= |main_~#s~0.base| |main_#t~ret8.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (_ bv4 32))) (_ bv8 32)) |main_#t~ret8.base|) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) |main_#t~ret8.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (_ bv4 32))) (_ bv8 32)) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_#t~ret8.base|) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_#t~ret8.base|) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (_ bv4 32)) |main_#t~ret8.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)))} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {1867#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (_ 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))) (_ bv8 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (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|))) (= (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)) (_ 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))) (_ bv8 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:15:53,055 INFO L273 TraceCheckUtils]: 23: Hoare triple {1867#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (_ 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))) (_ bv8 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (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|))) (= (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)) (_ 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))) (_ bv8 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 !!~bvsge32(~i~0, 0bv32); {1867#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (_ 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))) (_ bv8 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (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|))) (= (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)) (_ 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))) (_ bv8 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:15:53,057 INFO L256 TraceCheckUtils]: 24: Hoare triple {1867#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (_ 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))) (_ bv8 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (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|))) (= (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)) (_ 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))) (_ bv8 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_remove_first(~#s~0.base, ~#s~0.offset); {1874#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:15:53,057 INFO L273 TraceCheckUtils]: 25: Hoare triple {1874#(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~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, ~bvadd32(4bv32, #t~mem5.offset), 4bv32);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1878#(and (= dll_remove_first_~temp~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (bvadd (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) (_ bv4 32)))) (= dll_remove_first_~temp~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (bvadd (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) (_ bv4 32)))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |dll_remove_first_#in~head.offset| dll_remove_first_~head.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_remove_first_#in~head.base| dll_remove_first_~head.base))} is VALID [2018-11-23 11:15:53,060 INFO L273 TraceCheckUtils]: 26: Hoare triple {1878#(and (= dll_remove_first_~temp~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (bvadd (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) (_ bv4 32)))) (= dll_remove_first_~temp~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (bvadd (select (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset) (_ bv4 32)))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |dll_remove_first_#in~head.offset| dll_remove_first_~head.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_remove_first_#in~head.base| dll_remove_first_~head.base))} assume ~temp~1.base != 0bv32 || ~temp~1.offset != 0bv32;call write~$Pointer$(0bv32, 0bv32, ~temp~1.base, ~bvadd32(8bv32, ~temp~1.offset), 4bv32); {1882#(and (= (store |old(#memory_$Pointer$.base)| dll_remove_first_~temp~1.base (store (select |old(#memory_$Pointer$.base)| dll_remove_first_~temp~1.base) (bvadd dll_remove_first_~temp~1.offset (_ bv8 32)) (_ bv0 32))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base (store (select |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base) (bvadd dll_remove_first_~temp~1.offset (_ bv8 32)) (_ bv0 32))) |#memory_$Pointer$.offset|) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (bvadd (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) (_ bv4 32))) dll_remove_first_~temp~1.base) (= |dll_remove_first_#in~head.offset| dll_remove_first_~head.offset) (= dll_remove_first_~temp~1.offset (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (bvadd (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) (_ bv4 32)))) (= |dll_remove_first_#in~head.base| dll_remove_first_~head.base))} is VALID [2018-11-23 11:15:55,069 INFO L273 TraceCheckUtils]: 27: Hoare triple {1882#(and (= (store |old(#memory_$Pointer$.base)| dll_remove_first_~temp~1.base (store (select |old(#memory_$Pointer$.base)| dll_remove_first_~temp~1.base) (bvadd dll_remove_first_~temp~1.offset (_ bv8 32)) (_ bv0 32))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base (store (select |old(#memory_$Pointer$.offset)| dll_remove_first_~temp~1.base) (bvadd dll_remove_first_~temp~1.offset (_ bv8 32)) (_ bv0 32))) |#memory_$Pointer$.offset|) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (bvadd (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) (_ bv4 32))) dll_remove_first_~temp~1.base) (= |dll_remove_first_#in~head.offset| dll_remove_first_~head.offset) (= dll_remove_first_~temp~1.offset (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (bvadd (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) (_ bv4 32)))) (= |dll_remove_first_#in~head.base| dll_remove_first_~head.base))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4bv32); {1886#(and (= (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (_ bv8 32)) (_ bv0 32))) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (_ bv8 32)) (_ bv0 32))) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.base|) (= (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (_ bv8 32)) (_ bv0 32))) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (_ bv8 32)) (_ bv0 32))) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.offset|))} is UNKNOWN [2018-11-23 11:15:55,071 INFO L273 TraceCheckUtils]: 28: Hoare triple {1886#(and (= (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (_ bv8 32)) (_ bv0 32))) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (_ bv8 32)) (_ bv0 32))) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.base|) (= (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (_ bv8 32)) (_ bv0 32))) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (_ bv8 32)) (_ bv0 32))) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.offset|))} assume true; {1886#(and (= (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (_ bv8 32)) (_ bv0 32))) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (_ bv8 32)) (_ bv0 32))) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.base|) (= (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (_ bv8 32)) (_ bv0 32))) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (_ bv8 32)) (_ bv0 32))) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.offset|))} is VALID [2018-11-23 11:15:55,153 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1886#(and (= (store (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (_ bv8 32)) (_ bv0 32))) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (_ bv8 32)) (_ bv0 32))) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.base|) (= (store (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (_ bv8 32)) (_ bv0 32))) |dll_remove_first_#in~head.base| (store (select (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32)))) (bvadd (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (_ bv8 32)) (_ bv0 32))) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.offset|))} {1867#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (_ 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))) (_ bv8 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (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|))) (= (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)) (_ 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))) (_ bv8 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))))} #84#return; {1893#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_12 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) v_prenex_1) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) v_prenex_1))) (not (= |main_~#s~0.base| v_arrayElimCell_12)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (_ bv8 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (_ bv8 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) v_prenex_1) v_arrayElimCell_12) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (_ bv4 32)) |main_~#s~0.base|))))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32)))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32))) v_arrayElimCell_16)) (not (= |main_~#s~0.base| v_arrayElimCell_16)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (_ bv8 32))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= |main_~#s~0.offset| (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32))))))))} is VALID [2018-11-23 11:15:55,154 INFO L273 TraceCheckUtils]: 30: Hoare triple {1893#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_12 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) v_prenex_1) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) v_prenex_1))) (not (= |main_~#s~0.base| v_arrayElimCell_12)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (_ bv8 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (_ bv8 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) v_prenex_1) v_arrayElimCell_12) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (_ bv4 32)) |main_~#s~0.base|))))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32)))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32))) v_arrayElimCell_16)) (not (= |main_~#s~0.base| v_arrayElimCell_16)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (_ bv8 32))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= |main_~#s~0.offset| (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32))))))))} #t~post9 := ~i~0;~i~0 := ~bvsub32(#t~post9, 1bv32);havoc #t~post9; {1893#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_12 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) v_prenex_1) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) v_prenex_1))) (not (= |main_~#s~0.base| v_arrayElimCell_12)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (_ bv8 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (_ bv8 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) v_prenex_1) v_arrayElimCell_12) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (_ bv4 32)) |main_~#s~0.base|))))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32)))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32))) v_arrayElimCell_16)) (not (= |main_~#s~0.base| v_arrayElimCell_16)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (_ bv8 32))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= |main_~#s~0.offset| (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32))))))))} is VALID [2018-11-23 11:15:55,155 INFO L273 TraceCheckUtils]: 31: Hoare triple {1893#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_12 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) v_prenex_1) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) v_prenex_1))) (not (= |main_~#s~0.base| v_arrayElimCell_12)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (_ bv8 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (_ bv8 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) v_prenex_1) v_arrayElimCell_12) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (_ bv4 32)) |main_~#s~0.base|))))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32)))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32))) v_arrayElimCell_16)) (not (= |main_~#s~0.base| v_arrayElimCell_16)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (_ bv8 32))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= |main_~#s~0.offset| (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32))))))))} assume !!~bvsge32(~i~0, 0bv32); {1893#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_12 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) v_prenex_1) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) v_prenex_1))) (not (= |main_~#s~0.base| v_arrayElimCell_12)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (_ bv8 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (_ bv8 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) v_prenex_1) v_arrayElimCell_12) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (_ bv4 32)) |main_~#s~0.base|))))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32)))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32))) v_arrayElimCell_16)) (not (= |main_~#s~0.base| v_arrayElimCell_16)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (_ bv8 32))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= |main_~#s~0.offset| (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32))))))))} is VALID [2018-11-23 11:15:55,163 INFO L256 TraceCheckUtils]: 32: Hoare triple {1893#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_12 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) v_prenex_1) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) v_prenex_1))) (not (= |main_~#s~0.base| v_arrayElimCell_12)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (_ bv8 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (_ bv8 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) v_prenex_1) v_arrayElimCell_12) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (_ bv4 32)) |main_~#s~0.base|))))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32)))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32))) v_arrayElimCell_16)) (not (= |main_~#s~0.base| v_arrayElimCell_16)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (_ bv8 32))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= |main_~#s~0.offset| (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32))))))))} call dll_remove_first(~#s~0.base, ~#s~0.offset); {1874#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:15:55,165 INFO L273 TraceCheckUtils]: 33: Hoare triple {1874#(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~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, ~bvadd32(4bv32, #t~mem5.offset), 4bv32);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1906#(and (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (bvadd (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) (_ bv4 32))) dll_remove_first_~temp~1.base) (= |dll_remove_first_#in~head.offset| dll_remove_first_~head.offset) (= dll_remove_first_~temp~1.offset (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (bvadd (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) (_ bv4 32)))) (= |dll_remove_first_#in~head.base| dll_remove_first_~head.base))} is VALID [2018-11-23 11:15:55,168 INFO L273 TraceCheckUtils]: 34: Hoare triple {1906#(and (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (bvadd (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) (_ bv4 32))) dll_remove_first_~temp~1.base) (= |dll_remove_first_#in~head.offset| dll_remove_first_~head.offset) (= dll_remove_first_~temp~1.offset (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (bvadd (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) (_ bv4 32)))) (= |dll_remove_first_#in~head.base| dll_remove_first_~head.base))} assume ~temp~1.base != 0bv32 || ~temp~1.offset != 0bv32;call write~$Pointer$(0bv32, 0bv32, ~temp~1.base, ~bvadd32(8bv32, ~temp~1.offset), 4bv32); {1906#(and (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (bvadd (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) (_ bv4 32))) dll_remove_first_~temp~1.base) (= |dll_remove_first_#in~head.offset| dll_remove_first_~head.offset) (= dll_remove_first_~temp~1.offset (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (bvadd (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) (_ bv4 32)))) (= |dll_remove_first_#in~head.base| dll_remove_first_~head.base))} is VALID [2018-11-23 11:15:55,170 INFO L273 TraceCheckUtils]: 35: Hoare triple {1906#(and (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (bvadd (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) (_ bv4 32))) dll_remove_first_~temp~1.base) (= |dll_remove_first_#in~head.offset| dll_remove_first_~head.offset) (= dll_remove_first_~temp~1.offset (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| dll_remove_first_~head.base) dll_remove_first_~head.offset)) (bvadd (select (select |old(#memory_$Pointer$.offset)| dll_remove_first_~head.base) dll_remove_first_~head.offset) (_ bv4 32)))) (= |dll_remove_first_#in~head.base| dll_remove_first_~head.base))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4bv32); {1913#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32)))))} is VALID [2018-11-23 11:15:55,171 INFO L273 TraceCheckUtils]: 36: Hoare triple {1913#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32)))))} assume true; {1913#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32)))))} is VALID [2018-11-23 11:15:55,182 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1913#(and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32)))))} {1893#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_12 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) v_prenex_1) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) v_prenex_1))) (not (= |main_~#s~0.base| v_arrayElimCell_12)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (_ bv8 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_12) (_ bv8 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (bvadd |main_~#s~0.offset| (_ bv4 32)))) v_prenex_1) v_arrayElimCell_12) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_12) (_ bv4 32)) |main_~#s~0.base|))))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (_ bv8 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32)))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32))) v_arrayElimCell_16)) (not (= |main_~#s~0.base| v_arrayElimCell_16)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (_ bv8 32))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= |main_~#s~0.offset| (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_16) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv8 32))))))))} #84#return; {1920#(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:15:55,200 INFO L273 TraceCheckUtils]: 38: Hoare triple {1920#(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~post9 := ~i~0;~i~0 := ~bvsub32(#t~post9, 1bv32);havoc #t~post9; {1920#(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:15:55,215 INFO L273 TraceCheckUtils]: 39: Hoare triple {1920#(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 !~bvsge32(~i~0, 0bv32); {1920#(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:15:55,229 INFO L273 TraceCheckUtils]: 40: Hoare triple {1920#(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~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {1930#(and (= |main_#t~mem10.offset| (_ bv0 32)) (= |main_#t~mem10.base| (_ bv0 32)))} is VALID [2018-11-23 11:15:55,245 INFO L273 TraceCheckUtils]: 41: Hoare triple {1930#(and (= |main_#t~mem10.offset| (_ bv0 32)) (= |main_#t~mem10.base| (_ bv0 32)))} assume 0bv32 != #t~mem10.base || 0bv32 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1785#false} is VALID [2018-11-23 11:15:55,245 INFO L273 TraceCheckUtils]: 42: Hoare triple {1785#false} assume !false; {1785#false} is VALID [2018-11-23 11:15:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:15:55,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:15:55,782 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-23 11:15:55,919 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-23 11:15:59,023 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-23 11:15:59,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2018-11-23 11:15:59,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-23 11:15:59,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:59,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:59,064 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 47 treesize of output 45 [2018-11-23 11:15:59,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-23 11:15:59,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:59,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:59,095 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 47 treesize of output 45 [2018-11-23 11:15:59,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-23 11:15:59,115 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:59,133 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:59,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:15:59,772 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:105, output treesize:161 [2018-11-23 11:15:59,787 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:59,787 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_$Pointer$.offset|, |#memory_$Pointer$.base|]. (let ((.cse2 (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (.cse3 (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32)))) (let ((.cse0 (not (= (_ bv0 32) (select (select |old(#memory_$Pointer$.offset)| .cse2) .cse3)))) (.cse1 (not (= (select (select |old(#memory_$Pointer$.base)| .cse2) .cse3) (_ bv0 32))))) (and (or .cse0 (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| dll_remove_first_~head.base (store (select |#memory_$Pointer$.offset| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.offset)) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) .cse1) (or .cse0 (= (select (select (store |#memory_$Pointer$.base| dll_remove_first_~head.base (store (select |#memory_$Pointer$.base| dll_remove_first_~head.base) dll_remove_first_~head.offset dll_remove_first_~temp~1.base)) |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv0 32)) .cse1)))) [2018-11-23 11:15:59,787 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (let ((.cse2 (select (select |old(#memory_$Pointer$.base)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|)) (.cse3 (bvadd (select (select |old(#memory_$Pointer$.offset)| |dll_remove_first_#in~head.base|) |dll_remove_first_#in~head.offset|) (_ bv4 32)))) (let ((.cse0 (not (= (_ bv0 32) (select (select |old(#memory_$Pointer$.offset)| .cse2) .cse3)))) (.cse1 (not (= (select (select |old(#memory_$Pointer$.base)| .cse2) .cse3) (_ bv0 32))))) (and (or .cse0 .cse1 (= |dll_remove_first_#in~head.base| dll_remove_first_~head.base)) (or .cse0 (= dll_remove_first_~temp~1.offset (_ bv0 32)) .cse1) (or (= dll_remove_first_~temp~1.base (_ bv0 32)) .cse0 .cse1) (or .cse0 (= |dll_remove_first_#in~head.offset| dll_remove_first_~head.offset) .cse1)))) [2018-11-23 11:16:03,253 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 11:16:03,553 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-23 11:16:04,197 WARN L180 SmtUtils]: Spent 641.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-23 11:16:04,791 WARN L180 SmtUtils]: Spent 586.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-23 11:16:07,394 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-23 11:16:13,231 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-23 11:16:22,381 WARN L180 SmtUtils]: Spent 599.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-11-23 11:16:27,443 WARN L180 SmtUtils]: Spent 551.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-11-23 11:16:30,710 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-23 11:16:40,225 WARN L180 SmtUtils]: Spent 9.51 s on a formula simplification that was a NOOP. DAG size: 97 [2018-11-23 11:16:44,871 WARN L180 SmtUtils]: Spent 4.64 s on a formula simplification that was a NOOP. DAG size: 70 [2018-11-23 11:16:49,628 WARN L180 SmtUtils]: Spent 4.75 s on a formula simplification that was a NOOP. DAG size: 78 [2018-11-23 11:16:55,511 WARN L180 SmtUtils]: Spent 5.88 s on a formula simplification that was a NOOP. DAG size: 76 [2018-11-23 11:17:00,924 WARN L833 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2018-11-23 11:17:20,085 WARN L180 SmtUtils]: Spent 12.99 s on a formula simplification. DAG size of input: 315 DAG size of output: 80 [2018-11-23 11:17:20,105 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:17:20,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:17:20,870 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:17:21,057 INFO L303 Elim1Store]: Index analysis took 261 ms [2018-11-23 11:17:21,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-11-23 11:17:21,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2018-11-23 11:17:21,158 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 16 treesize of output 17 [2018-11-23 11:17:21,159 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:21,309 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:21,608 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:17:21,792 INFO L303 Elim1Store]: Index analysis took 229 ms [2018-11-23 11:17:21,793 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 25 treesize of output 25 [2018-11-23 11:17:21,836 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 13 treesize of output 1 [2018-11-23 11:17:21,837 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:21,955 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:22,014 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:22,487 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:17:22,684 INFO L303 Elim1Store]: Index analysis took 235 ms [2018-11-23 11:17:22,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1415 treesize of output 1287 [2018-11-23 11:17:26,019 WARN L180 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 108 DAG size of output: 62 [2018-11-23 11:17:26,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2018-11-23 11:17:26,105 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 16 treesize of output 17 [2018-11-23 11:17:26,106 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:26,252 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:26,714 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:17:26,716 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:17:26,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:17:26,923 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:17:26,999 INFO L303 Elim1Store]: Index analysis took 335 ms [2018-11-23 11:17:27,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1208 treesize of output 1359 [2018-11-23 11:17:27,031 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:17:27,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 1161 treesize of output 1171 [2018-11-23 11:17:27,037 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:27,536 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:17:27,611 INFO L303 Elim1Store]: Index analysis took 104 ms [2018-11-23 11:17:27,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1296 treesize of output 1047 [2018-11-23 11:17:27,628 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:17:27,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 972 treesize of output 927 [2018-11-23 11:17:27,633 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:27,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 936 treesize of output 911 [2018-11-23 11:17:27,776 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:27,784 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:27,835 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:27,872 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:28,071 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:17:28,172 INFO L303 Elim1Store]: Index analysis took 124 ms [2018-11-23 11:17:28,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 972 treesize of output 613 [2018-11-23 11:17:28,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2018-11-23 11:17:28,226 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 16 treesize of output 17 [2018-11-23 11:17:28,227 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:28,288 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:28,391 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:17:28,454 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:17:28,492 INFO L303 Elim1Store]: Index analysis took 114 ms [2018-11-23 11:17:28,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 614 treesize of output 281 [2018-11-23 11:17:29,214 WARN L180 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2018-11-23 11:17:29,225 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 39 treesize of output 36 [2018-11-23 11:17:29,227 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:29,447 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:17:29,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 141 [2018-11-23 11:17:29,661 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:17:29,662 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.classInvariant(MultiDimensionalSelect.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:90) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.isCompatibleSelect(MultiDimensionalStore.java:105) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.(MultiDimensionalStore.java:73) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.(MultiDimensionalSelectOverStore.java:48) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.convert(MultiDimensionalSelectOverStore.java:75) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ArrayQuantifierEliminationUtils.elimAllSos(ArrayQuantifierEliminationUtils.java:57) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:232) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 11:17:29,667 INFO L168 Benchmark]: Toolchain (without parser) took 141279.75 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -492.1 MB). Peak memory consumption was 522.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:17:29,667 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:17:29,667 INFO L168 Benchmark]: CACSL2BoogieTranslator took 859.02 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.0 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:17:29,668 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.97 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:17:29,668 INFO L168 Benchmark]: Boogie Preprocessor took 45.86 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:17:29,669 INFO L168 Benchmark]: RCFGBuilder took 1264.85 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:17:29,669 INFO L168 Benchmark]: TraceAbstraction took 139049.90 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 280.0 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 250.5 MB). Peak memory consumption was 530.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:17:29,671 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 859.02 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.0 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.97 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.86 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1264.85 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 139049.90 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 280.0 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 250.5 MB). Peak memory consumption was 530.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...