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_update_all_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:15:24,540 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:15:24,542 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:15:24,559 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:15:24,559 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:15:24,560 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:15:24,561 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:15:24,565 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:15:24,567 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:15:24,569 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:15:24,570 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:15:24,570 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:15:24,573 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:15:24,576 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:15:24,577 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:15:24,578 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:15:24,580 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:15:24,583 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:15:24,591 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:15:24,595 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:15:24,597 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:15:24,598 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:15:24,600 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:15:24,601 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:15:24,601 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:15:24,602 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:15:24,603 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:15:24,604 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:15:24,604 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:15:24,608 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:15:24,608 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:15:24,609 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:15:24,609 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:15:24,610 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:15:24,611 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:15:24,612 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:15:24,612 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:24,636 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:15:24,636 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:15:24,637 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:15:24,637 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:15:24,638 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:15:24,638 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:15:24,638 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:15:24,639 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:15:24,640 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:15:24,640 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:15:24,640 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:15:24,640 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:15:24,640 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:15:24,641 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:15:24,641 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:15:24,641 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:15:24,641 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:15:24,641 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:15:24,642 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:15:24,643 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:15:24,643 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:15:24,643 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:15:24,643 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:15:24,643 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:15:24,644 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:15:24,644 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:15:24,644 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:15:24,644 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:15:24,645 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:15:24,645 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:15:24,645 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:15:24,645 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:15:24,645 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:15:24,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:15:24,717 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:15:24,721 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:15:24,722 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:15:24,723 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:15:24,724 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:15:24,784 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c97c3953/c369037fb6ce4b048ac5f2f2cb88d9e7/FLAG9a32980a4 [2018-11-23 11:15:25,322 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:15:25,323 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:15:25,338 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c97c3953/c369037fb6ce4b048ac5f2f2cb88d9e7/FLAG9a32980a4 [2018-11-23 11:15:25,569 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c97c3953/c369037fb6ce4b048ac5f2f2cb88d9e7 [2018-11-23 11:15:25,584 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:15:25,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:15:25,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:15:25,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:15:25,592 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:15:25,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:15:25" (1/1) ... [2018-11-23 11:15:25,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f57c199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:25, skipping insertion in model container [2018-11-23 11:15:25,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:15:25" (1/1) ... [2018-11-23 11:15:25,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:15:25,662 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:15:26,099 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:15:26,116 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:15:26,327 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:15:26,387 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:15:26,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:26 WrapperNode [2018-11-23 11:15:26,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:15:26,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:15:26,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:15:26,389 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:15:26,399 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:26" (1/1) ... [2018-11-23 11:15:26,426 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:26" (1/1) ... [2018-11-23 11:15:26,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:15:26,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:15:26,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:15:26,442 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:15:26,454 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:26" (1/1) ... [2018-11-23 11:15:26,454 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:26" (1/1) ... [2018-11-23 11:15:26,459 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:26" (1/1) ... [2018-11-23 11:15:26,460 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:26" (1/1) ... [2018-11-23 11:15:26,488 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:26" (1/1) ... [2018-11-23 11:15:26,495 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:26" (1/1) ... [2018-11-23 11:15:26,498 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:26" (1/1) ... [2018-11-23 11:15:26,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:15:26,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:15:26,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:15:26,504 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:15:26,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:26" (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:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-11-23 11:15:26,558 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-11-23 11:15:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:15:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:15:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2018-11-23 11:15:26,558 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2018-11-23 11:15:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:15:26,559 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:15:26,559 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2018-11-23 11:15:26,559 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2018-11-23 11:15:26,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:15:26,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:15:26,559 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:15:26,560 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:15:26,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:15:26,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:15:26,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:15:26,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:15:26,560 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-23 11:15:26,561 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-23 11:15:26,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:15:26,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:15:27,809 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:15:27,809 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 11:15:27,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:15:27 BoogieIcfgContainer [2018-11-23 11:15:27,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:15:27,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:15:27,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:15:27,814 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:15:27,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:15:25" (1/3) ... [2018-11-23 11:15:27,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba9bf03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:15:27, skipping insertion in model container [2018-11-23 11:15:27,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:26" (2/3) ... [2018-11-23 11:15:27,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba9bf03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:15:27, skipping insertion in model container [2018-11-23 11:15:27,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:15:27" (3/3) ... [2018-11-23 11:15:27,818 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:15:27,828 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:15:27,836 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:15:27,854 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:15:27,885 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:15:27,886 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:15:27,886 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:15:27,886 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:15:27,887 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:15:27,887 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:15:27,887 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:15:27,887 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:15:27,887 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:15:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-23 11:15:27,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:15:27,911 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:27,912 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:15:27,914 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:27,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:27,920 INFO L82 PathProgramCache]: Analyzing trace with hash 821800959, now seen corresponding path program 1 times [2018-11-23 11:15:27,924 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:27,925 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:27,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:28,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:28,281 INFO L256 TraceCheckUtils]: 0: Hoare triple {53#true} call ULTIMATE.init(); {53#true} is VALID [2018-11-23 11:15:28,284 INFO L273 TraceCheckUtils]: 1: Hoare triple {53#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {53#true} is VALID [2018-11-23 11:15:28,285 INFO L273 TraceCheckUtils]: 2: Hoare triple {53#true} assume true; {53#true} is VALID [2018-11-23 11:15:28,286 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53#true} {53#true} #137#return; {53#true} is VALID [2018-11-23 11:15:28,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {53#true} call #t~ret15 := main(); {53#true} is VALID [2018-11-23 11:15:28,294 INFO L273 TraceCheckUtils]: 5: Hoare triple {53#true} ~len~0 := 2bv32;~data~0 := 1bv32; {73#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:28,294 INFO L256 TraceCheckUtils]: 6: Hoare triple {73#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {53#true} is VALID [2018-11-23 11:15:28,295 INFO L273 TraceCheckUtils]: 7: Hoare triple {53#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {80#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:15:28,300 INFO L273 TraceCheckUtils]: 8: Hoare triple {80#(= dll_create_~len |dll_create_#in~len|)} assume !~bvsgt32(~len, 0bv32); {84#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:15:28,311 INFO L273 TraceCheckUtils]: 9: Hoare triple {84#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {84#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:15:28,312 INFO L273 TraceCheckUtils]: 10: Hoare triple {84#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} assume true; {84#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:15:28,330 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {84#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} {73#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #127#return; {54#false} is VALID [2018-11-23 11:15:28,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {54#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {54#false} is VALID [2018-11-23 11:15:28,332 INFO L273 TraceCheckUtils]: 13: Hoare triple {54#false} assume !~bvslt32(~i~0, ~len~0); {54#false} is VALID [2018-11-23 11:15:28,332 INFO L273 TraceCheckUtils]: 14: Hoare triple {54#false} ~i~0 := 0bv32; {54#false} is VALID [2018-11-23 11:15:28,333 INFO L273 TraceCheckUtils]: 15: Hoare triple {54#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {54#false} is VALID [2018-11-23 11:15:28,333 INFO L256 TraceCheckUtils]: 16: Hoare triple {54#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {54#false} is VALID [2018-11-23 11:15:28,333 INFO L273 TraceCheckUtils]: 17: Hoare triple {54#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {54#false} is VALID [2018-11-23 11:15:28,334 INFO L273 TraceCheckUtils]: 18: Hoare triple {54#false} assume !~bvsgt32(~index, 0bv32); {54#false} is VALID [2018-11-23 11:15:28,334 INFO L273 TraceCheckUtils]: 19: Hoare triple {54#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {54#false} is VALID [2018-11-23 11:15:28,335 INFO L273 TraceCheckUtils]: 20: Hoare triple {54#false} assume true; {54#false} is VALID [2018-11-23 11:15:28,335 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {54#false} {54#false} #131#return; {54#false} is VALID [2018-11-23 11:15:28,336 INFO L273 TraceCheckUtils]: 22: Hoare triple {54#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {54#false} is VALID [2018-11-23 11:15:28,336 INFO L273 TraceCheckUtils]: 23: Hoare triple {54#false} assume !false; {54#false} is VALID [2018-11-23 11:15:28,343 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:28,343 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:15:28,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:15:28,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:15:28,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 11:15:28,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:28,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:15:28,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:28,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:15:28,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:15:28,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:15:28,478 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 5 states. [2018-11-23 11:15:30,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:30,121 INFO L93 Difference]: Finished difference Result 93 states and 124 transitions. [2018-11-23 11:15:30,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:15:30,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 11:15:30,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:30,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:15:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2018-11-23 11:15:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:15:30,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2018-11-23 11:15:30,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 124 transitions. [2018-11-23 11:15:30,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:30,495 INFO L225 Difference]: With dead ends: 93 [2018-11-23 11:15:30,495 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:15:30,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:15:30,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:15:30,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-11-23 11:15:30,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:30,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 38 states. [2018-11-23 11:15:30,580 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 38 states. [2018-11-23 11:15:30,580 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 38 states. [2018-11-23 11:15:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:30,585 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-23 11:15:30,585 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 11:15:30,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:30,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:30,587 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 42 states. [2018-11-23 11:15:30,587 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 42 states. [2018-11-23 11:15:30,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:30,592 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-23 11:15:30,592 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 11:15:30,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:30,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:30,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:30,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:15:30,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-23 11:15:30,599 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 24 [2018-11-23 11:15:30,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:30,600 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 11:15:30,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:15:30,600 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 11:15:30,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:15:30,601 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:30,602 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:15:30,602 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:30,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:30,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1631243427, now seen corresponding path program 1 times [2018-11-23 11:15:30,603 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:30,603 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:30,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:30,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:30,765 INFO L256 TraceCheckUtils]: 0: Hoare triple {399#true} call ULTIMATE.init(); {399#true} is VALID [2018-11-23 11:15:30,765 INFO L273 TraceCheckUtils]: 1: Hoare triple {399#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {399#true} is VALID [2018-11-23 11:15:30,766 INFO L273 TraceCheckUtils]: 2: Hoare triple {399#true} assume true; {399#true} is VALID [2018-11-23 11:15:30,766 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {399#true} {399#true} #137#return; {399#true} is VALID [2018-11-23 11:15:30,766 INFO L256 TraceCheckUtils]: 4: Hoare triple {399#true} call #t~ret15 := main(); {399#true} is VALID [2018-11-23 11:15:30,766 INFO L273 TraceCheckUtils]: 5: Hoare triple {399#true} ~len~0 := 2bv32;~data~0 := 1bv32; {399#true} is VALID [2018-11-23 11:15:30,767 INFO L256 TraceCheckUtils]: 6: Hoare triple {399#true} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {399#true} is VALID [2018-11-23 11:15:30,768 INFO L273 TraceCheckUtils]: 7: Hoare triple {399#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {425#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-23 11:15:30,770 INFO L273 TraceCheckUtils]: 8: Hoare triple {425#(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; {425#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-23 11:15:30,770 INFO L273 TraceCheckUtils]: 9: Hoare triple {425#(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); {425#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-23 11:15:30,772 INFO L273 TraceCheckUtils]: 10: Hoare triple {425#(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); {425#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-23 11:15:30,777 INFO L273 TraceCheckUtils]: 11: Hoare triple {425#(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); {400#false} is VALID [2018-11-23 11:15:30,777 INFO L273 TraceCheckUtils]: 12: Hoare triple {400#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; {400#false} is VALID [2018-11-23 11:15:30,778 INFO L273 TraceCheckUtils]: 13: Hoare triple {400#false} assume !~bvsgt32(~len, 0bv32); {400#false} is VALID [2018-11-23 11:15:30,778 INFO L273 TraceCheckUtils]: 14: Hoare triple {400#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {400#false} is VALID [2018-11-23 11:15:30,779 INFO L273 TraceCheckUtils]: 15: Hoare triple {400#false} assume true; {400#false} is VALID [2018-11-23 11:15:30,779 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {400#false} {399#true} #127#return; {400#false} is VALID [2018-11-23 11:15:30,780 INFO L273 TraceCheckUtils]: 17: Hoare triple {400#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {400#false} is VALID [2018-11-23 11:15:30,780 INFO L273 TraceCheckUtils]: 18: Hoare triple {400#false} assume !~bvslt32(~i~0, ~len~0); {400#false} is VALID [2018-11-23 11:15:30,780 INFO L273 TraceCheckUtils]: 19: Hoare triple {400#false} ~i~0 := 0bv32; {400#false} is VALID [2018-11-23 11:15:30,780 INFO L273 TraceCheckUtils]: 20: Hoare triple {400#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {400#false} is VALID [2018-11-23 11:15:30,781 INFO L256 TraceCheckUtils]: 21: Hoare triple {400#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {400#false} is VALID [2018-11-23 11:15:30,781 INFO L273 TraceCheckUtils]: 22: Hoare triple {400#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {400#false} is VALID [2018-11-23 11:15:30,781 INFO L273 TraceCheckUtils]: 23: Hoare triple {400#false} assume !~bvsgt32(~index, 0bv32); {400#false} is VALID [2018-11-23 11:15:30,781 INFO L273 TraceCheckUtils]: 24: Hoare triple {400#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {400#false} is VALID [2018-11-23 11:15:30,782 INFO L273 TraceCheckUtils]: 25: Hoare triple {400#false} assume true; {400#false} is VALID [2018-11-23 11:15:30,782 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {400#false} {400#false} #131#return; {400#false} is VALID [2018-11-23 11:15:30,782 INFO L273 TraceCheckUtils]: 27: Hoare triple {400#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {400#false} is VALID [2018-11-23 11:15:30,783 INFO L273 TraceCheckUtils]: 28: Hoare triple {400#false} assume !false; {400#false} is VALID [2018-11-23 11:15:30,785 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:30,785 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:15:30,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:15:30,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:15:30,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 11:15:30,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:30,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:15:30,859 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:30,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:15:30,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:15:30,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:15:30,860 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 3 states. [2018-11-23 11:15:31,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:31,576 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-11-23 11:15:31,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:15:31,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 11:15:31,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:15:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 11:15:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:15:31,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 11:15:31,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2018-11-23 11:15:31,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:31,829 INFO L225 Difference]: With dead ends: 71 [2018-11-23 11:15:31,829 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:15:31,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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:31,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:15:31,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 11:15:31,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:31,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-23 11:15:31,866 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-23 11:15:31,866 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-23 11:15:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:31,870 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-23 11:15:31,870 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 11:15:31,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:31,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:31,871 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-23 11:15:31,871 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-23 11:15:31,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:31,875 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-23 11:15:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 11:15:31,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:31,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:31,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:31,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:15:31,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-23 11:15:31,879 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 29 [2018-11-23 11:15:31,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:31,879 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-23 11:15:31,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:15:31,880 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 11:15:31,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:15:31,881 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:31,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:15:31,881 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:31,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:31,882 INFO L82 PathProgramCache]: Analyzing trace with hash -362901279, now seen corresponding path program 1 times [2018-11-23 11:15:31,882 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:31,882 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:31,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:31,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:32,089 INFO L256 TraceCheckUtils]: 0: Hoare triple {728#true} call ULTIMATE.init(); {728#true} is VALID [2018-11-23 11:15:32,090 INFO L273 TraceCheckUtils]: 1: Hoare triple {728#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {728#true} is VALID [2018-11-23 11:15:32,090 INFO L273 TraceCheckUtils]: 2: Hoare triple {728#true} assume true; {728#true} is VALID [2018-11-23 11:15:32,091 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {728#true} {728#true} #137#return; {728#true} is VALID [2018-11-23 11:15:32,091 INFO L256 TraceCheckUtils]: 4: Hoare triple {728#true} call #t~ret15 := main(); {728#true} is VALID [2018-11-23 11:15:32,092 INFO L273 TraceCheckUtils]: 5: Hoare triple {728#true} ~len~0 := 2bv32;~data~0 := 1bv32; {748#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:32,092 INFO L256 TraceCheckUtils]: 6: Hoare triple {748#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {728#true} is VALID [2018-11-23 11:15:32,093 INFO L273 TraceCheckUtils]: 7: Hoare triple {728#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {755#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:15:32,093 INFO L273 TraceCheckUtils]: 8: Hoare triple {755#(= 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; {755#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:15:32,095 INFO L273 TraceCheckUtils]: 9: Hoare triple {755#(= dll_create_~len |dll_create_#in~len|)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {755#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:15:32,100 INFO L273 TraceCheckUtils]: 10: Hoare triple {755#(= 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); {755#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:15:32,105 INFO L273 TraceCheckUtils]: 11: Hoare triple {755#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {755#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 11:15:32,105 INFO L273 TraceCheckUtils]: 12: Hoare triple {755#(= 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; {771#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} is VALID [2018-11-23 11:15:32,106 INFO L273 TraceCheckUtils]: 13: Hoare triple {771#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} assume !~bvsgt32(~len, 0bv32); {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:32,107 INFO L273 TraceCheckUtils]: 14: Hoare triple {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:32,107 INFO L273 TraceCheckUtils]: 15: Hoare triple {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:32,113 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {748#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #127#return; {729#false} is VALID [2018-11-23 11:15:32,113 INFO L273 TraceCheckUtils]: 17: Hoare triple {729#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {729#false} is VALID [2018-11-23 11:15:32,114 INFO L273 TraceCheckUtils]: 18: Hoare triple {729#false} assume !~bvslt32(~i~0, ~len~0); {729#false} is VALID [2018-11-23 11:15:32,114 INFO L273 TraceCheckUtils]: 19: Hoare triple {729#false} ~i~0 := 0bv32; {729#false} is VALID [2018-11-23 11:15:32,114 INFO L273 TraceCheckUtils]: 20: Hoare triple {729#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {729#false} is VALID [2018-11-23 11:15:32,114 INFO L256 TraceCheckUtils]: 21: Hoare triple {729#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {729#false} is VALID [2018-11-23 11:15:32,115 INFO L273 TraceCheckUtils]: 22: Hoare triple {729#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {729#false} is VALID [2018-11-23 11:15:32,115 INFO L273 TraceCheckUtils]: 23: Hoare triple {729#false} assume !~bvsgt32(~index, 0bv32); {729#false} is VALID [2018-11-23 11:15:32,115 INFO L273 TraceCheckUtils]: 24: Hoare triple {729#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {729#false} is VALID [2018-11-23 11:15:32,115 INFO L273 TraceCheckUtils]: 25: Hoare triple {729#false} assume true; {729#false} is VALID [2018-11-23 11:15:32,116 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {729#false} {729#false} #131#return; {729#false} is VALID [2018-11-23 11:15:32,116 INFO L273 TraceCheckUtils]: 27: Hoare triple {729#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {729#false} is VALID [2018-11-23 11:15:32,116 INFO L273 TraceCheckUtils]: 28: Hoare triple {729#false} assume !false; {729#false} is VALID [2018-11-23 11:15:32,119 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:32,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:15:32,466 INFO L273 TraceCheckUtils]: 28: Hoare triple {729#false} assume !false; {729#false} is VALID [2018-11-23 11:15:32,467 INFO L273 TraceCheckUtils]: 27: Hoare triple {729#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {729#false} is VALID [2018-11-23 11:15:32,467 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {728#true} {729#false} #131#return; {729#false} is VALID [2018-11-23 11:15:32,468 INFO L273 TraceCheckUtils]: 25: Hoare triple {728#true} assume true; {728#true} is VALID [2018-11-23 11:15:32,468 INFO L273 TraceCheckUtils]: 24: Hoare triple {728#true} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {728#true} is VALID [2018-11-23 11:15:32,468 INFO L273 TraceCheckUtils]: 23: Hoare triple {728#true} assume !~bvsgt32(~index, 0bv32); {728#true} is VALID [2018-11-23 11:15:32,469 INFO L273 TraceCheckUtils]: 22: Hoare triple {728#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {728#true} is VALID [2018-11-23 11:15:32,469 INFO L256 TraceCheckUtils]: 21: Hoare triple {729#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {728#true} is VALID [2018-11-23 11:15:32,469 INFO L273 TraceCheckUtils]: 20: Hoare triple {729#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {729#false} is VALID [2018-11-23 11:15:32,470 INFO L273 TraceCheckUtils]: 19: Hoare triple {729#false} ~i~0 := 0bv32; {729#false} is VALID [2018-11-23 11:15:32,470 INFO L273 TraceCheckUtils]: 18: Hoare triple {729#false} assume !~bvslt32(~i~0, ~len~0); {729#false} is VALID [2018-11-23 11:15:32,470 INFO L273 TraceCheckUtils]: 17: Hoare triple {729#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {729#false} is VALID [2018-11-23 11:15:32,471 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {857#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} #127#return; {729#false} is VALID [2018-11-23 11:15:32,472 INFO L273 TraceCheckUtils]: 15: Hoare triple {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:32,472 INFO L273 TraceCheckUtils]: 14: Hoare triple {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:32,492 INFO L273 TraceCheckUtils]: 13: Hoare triple {870#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !~bvsgt32(~len, 0bv32); {775#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:32,508 INFO L273 TraceCheckUtils]: 12: Hoare triple {874#(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; {870#(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:32,508 INFO L273 TraceCheckUtils]: 11: Hoare triple {874#(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); {874#(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:32,509 INFO L273 TraceCheckUtils]: 10: Hoare triple {874#(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); {874#(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:32,511 INFO L273 TraceCheckUtils]: 9: Hoare triple {874#(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); {874#(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:32,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {874#(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; {874#(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:32,513 INFO L273 TraceCheckUtils]: 7: Hoare triple {728#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {874#(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:32,513 INFO L256 TraceCheckUtils]: 6: Hoare triple {857#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {728#true} is VALID [2018-11-23 11:15:32,519 INFO L273 TraceCheckUtils]: 5: Hoare triple {728#true} ~len~0 := 2bv32;~data~0 := 1bv32; {857#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:32,519 INFO L256 TraceCheckUtils]: 4: Hoare triple {728#true} call #t~ret15 := main(); {728#true} is VALID [2018-11-23 11:15:32,519 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {728#true} {728#true} #137#return; {728#true} is VALID [2018-11-23 11:15:32,520 INFO L273 TraceCheckUtils]: 2: Hoare triple {728#true} assume true; {728#true} is VALID [2018-11-23 11:15:32,520 INFO L273 TraceCheckUtils]: 1: Hoare triple {728#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {728#true} is VALID [2018-11-23 11:15:32,520 INFO L256 TraceCheckUtils]: 0: Hoare triple {728#true} call ULTIMATE.init(); {728#true} is VALID [2018-11-23 11:15:32,523 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:32,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:15:32,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 11:15:32,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-23 11:15:32,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:32,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:15:32,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:32,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:15:32,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:15:32,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:15:32,655 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 9 states. [2018-11-23 11:15:34,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:34,116 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-11-23 11:15:34,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:15:34,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-23 11:15:34,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:34,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:15:34,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2018-11-23 11:15:34,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:15:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2018-11-23 11:15:34,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2018-11-23 11:15:34,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:34,325 INFO L225 Difference]: With dead ends: 71 [2018-11-23 11:15:34,326 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 11:15:34,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:15:34,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 11:15:34,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-11-23 11:15:34,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:34,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 43 states. [2018-11-23 11:15:34,365 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 43 states. [2018-11-23 11:15:34,365 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 43 states. [2018-11-23 11:15:34,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:34,368 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-11-23 11:15:34,368 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-23 11:15:34,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:34,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:34,369 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 47 states. [2018-11-23 11:15:34,370 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 47 states. [2018-11-23 11:15:34,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:34,372 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-11-23 11:15:34,372 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-23 11:15:34,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:34,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:34,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:34,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:34,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:15:34,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-23 11:15:34,376 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 29 [2018-11-23 11:15:34,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:34,376 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-23 11:15:34,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:15:34,377 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 11:15:34,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 11:15:34,378 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:34,378 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:15:34,378 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:34,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:34,379 INFO L82 PathProgramCache]: Analyzing trace with hash -196400895, now seen corresponding path program 1 times [2018-11-23 11:15:34,380 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:34,380 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:34,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:34,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:34,578 INFO L256 TraceCheckUtils]: 0: Hoare triple {1167#true} call ULTIMATE.init(); {1167#true} is VALID [2018-11-23 11:15:34,579 INFO L273 TraceCheckUtils]: 1: Hoare triple {1167#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1167#true} is VALID [2018-11-23 11:15:34,579 INFO L273 TraceCheckUtils]: 2: Hoare triple {1167#true} assume true; {1167#true} is VALID [2018-11-23 11:15:34,579 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1167#true} {1167#true} #137#return; {1167#true} is VALID [2018-11-23 11:15:34,580 INFO L256 TraceCheckUtils]: 4: Hoare triple {1167#true} call #t~ret15 := main(); {1167#true} is VALID [2018-11-23 11:15:34,580 INFO L273 TraceCheckUtils]: 5: Hoare triple {1167#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1187#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:34,581 INFO L256 TraceCheckUtils]: 6: Hoare triple {1187#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {1167#true} is VALID [2018-11-23 11:15:34,581 INFO L273 TraceCheckUtils]: 7: Hoare triple {1167#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1167#true} is VALID [2018-11-23 11:15:34,581 INFO L273 TraceCheckUtils]: 8: Hoare triple {1167#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; {1167#true} is VALID [2018-11-23 11:15:34,581 INFO L273 TraceCheckUtils]: 9: Hoare triple {1167#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1167#true} is VALID [2018-11-23 11:15:34,582 INFO L273 TraceCheckUtils]: 10: Hoare triple {1167#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); {1167#true} is VALID [2018-11-23 11:15:34,582 INFO L273 TraceCheckUtils]: 11: Hoare triple {1167#true} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1167#true} is VALID [2018-11-23 11:15:34,582 INFO L273 TraceCheckUtils]: 12: Hoare triple {1167#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; {1167#true} is VALID [2018-11-23 11:15:34,582 INFO L273 TraceCheckUtils]: 13: Hoare triple {1167#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; {1167#true} is VALID [2018-11-23 11:15:34,583 INFO L273 TraceCheckUtils]: 14: Hoare triple {1167#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1167#true} is VALID [2018-11-23 11:15:34,583 INFO L273 TraceCheckUtils]: 15: Hoare triple {1167#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); {1167#true} is VALID [2018-11-23 11:15:34,584 INFO L273 TraceCheckUtils]: 16: Hoare triple {1167#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); {1167#true} is VALID [2018-11-23 11:15:34,584 INFO L273 TraceCheckUtils]: 17: Hoare triple {1167#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; {1167#true} is VALID [2018-11-23 11:15:34,584 INFO L273 TraceCheckUtils]: 18: Hoare triple {1167#true} assume !~bvsgt32(~len, 0bv32); {1167#true} is VALID [2018-11-23 11:15:34,585 INFO L273 TraceCheckUtils]: 19: Hoare triple {1167#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1167#true} is VALID [2018-11-23 11:15:34,585 INFO L273 TraceCheckUtils]: 20: Hoare triple {1167#true} assume true; {1167#true} is VALID [2018-11-23 11:15:34,598 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1167#true} {1187#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #127#return; {1187#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:34,600 INFO L273 TraceCheckUtils]: 22: Hoare triple {1187#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {1239#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:34,603 INFO L273 TraceCheckUtils]: 23: Hoare triple {1239#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~len~0); {1168#false} is VALID [2018-11-23 11:15:34,603 INFO L273 TraceCheckUtils]: 24: Hoare triple {1168#false} ~i~0 := 0bv32; {1168#false} is VALID [2018-11-23 11:15:34,603 INFO L273 TraceCheckUtils]: 25: Hoare triple {1168#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {1168#false} is VALID [2018-11-23 11:15:34,604 INFO L256 TraceCheckUtils]: 26: Hoare triple {1168#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1168#false} is VALID [2018-11-23 11:15:34,604 INFO L273 TraceCheckUtils]: 27: Hoare triple {1168#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1168#false} is VALID [2018-11-23 11:15:34,606 INFO L273 TraceCheckUtils]: 28: Hoare triple {1168#false} assume !~bvsgt32(~index, 0bv32); {1168#false} is VALID [2018-11-23 11:15:34,607 INFO L273 TraceCheckUtils]: 29: Hoare triple {1168#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {1168#false} is VALID [2018-11-23 11:15:34,607 INFO L273 TraceCheckUtils]: 30: Hoare triple {1168#false} assume true; {1168#false} is VALID [2018-11-23 11:15:34,607 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1168#false} {1168#false} #131#return; {1168#false} is VALID [2018-11-23 11:15:34,607 INFO L273 TraceCheckUtils]: 32: Hoare triple {1168#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1168#false} is VALID [2018-11-23 11:15:34,607 INFO L273 TraceCheckUtils]: 33: Hoare triple {1168#false} assume !false; {1168#false} is VALID [2018-11-23 11:15:34,610 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:34,610 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:15:34,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:15:34,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:15:34,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 11:15:34,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:34,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:15:34,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:34,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:15:34,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:15:34,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:15:34,664 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-11-23 11:15:34,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:34,998 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-11-23 11:15:34,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:15:34,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 11:15:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:34,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:15:35,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2018-11-23 11:15:35,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:15:35,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2018-11-23 11:15:35,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2018-11-23 11:15:35,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:35,131 INFO L225 Difference]: With dead ends: 64 [2018-11-23 11:15:35,131 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 11:15:35,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:15:35,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 11:15:35,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2018-11-23 11:15:35,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:35,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 44 states. [2018-11-23 11:15:35,218 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 44 states. [2018-11-23 11:15:35,219 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 44 states. [2018-11-23 11:15:35,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:35,222 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-11-23 11:15:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-23 11:15:35,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:35,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:35,224 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 52 states. [2018-11-23 11:15:35,224 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 52 states. [2018-11-23 11:15:35,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:35,227 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-11-23 11:15:35,227 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-23 11:15:35,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:35,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:35,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:35,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:15:35,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-23 11:15:35,231 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 34 [2018-11-23 11:15:35,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:35,231 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-23 11:15:35,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:15:35,231 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-23 11:15:35,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 11:15:35,233 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:35,233 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:15:35,233 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:35,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:35,234 INFO L82 PathProgramCache]: Analyzing trace with hash 951671223, now seen corresponding path program 1 times [2018-11-23 11:15:35,234 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:35,234 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:35,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:35,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:35,496 INFO L256 TraceCheckUtils]: 0: Hoare triple {1531#true} call ULTIMATE.init(); {1531#true} is VALID [2018-11-23 11:15:35,497 INFO L273 TraceCheckUtils]: 1: Hoare triple {1531#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1531#true} is VALID [2018-11-23 11:15:35,497 INFO L273 TraceCheckUtils]: 2: Hoare triple {1531#true} assume true; {1531#true} is VALID [2018-11-23 11:15:35,497 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1531#true} {1531#true} #137#return; {1531#true} is VALID [2018-11-23 11:15:35,497 INFO L256 TraceCheckUtils]: 4: Hoare triple {1531#true} call #t~ret15 := main(); {1531#true} is VALID [2018-11-23 11:15:35,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {1531#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1551#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:35,498 INFO L256 TraceCheckUtils]: 6: Hoare triple {1551#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {1531#true} is VALID [2018-11-23 11:15:35,498 INFO L273 TraceCheckUtils]: 7: Hoare triple {1531#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1531#true} is VALID [2018-11-23 11:15:35,499 INFO L273 TraceCheckUtils]: 8: Hoare triple {1531#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; {1531#true} is VALID [2018-11-23 11:15:35,499 INFO L273 TraceCheckUtils]: 9: Hoare triple {1531#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1531#true} is VALID [2018-11-23 11:15:35,499 INFO L273 TraceCheckUtils]: 10: Hoare triple {1531#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); {1531#true} is VALID [2018-11-23 11:15:35,499 INFO L273 TraceCheckUtils]: 11: Hoare triple {1531#true} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1531#true} is VALID [2018-11-23 11:15:35,499 INFO L273 TraceCheckUtils]: 12: Hoare triple {1531#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; {1531#true} is VALID [2018-11-23 11:15:35,500 INFO L273 TraceCheckUtils]: 13: Hoare triple {1531#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; {1531#true} is VALID [2018-11-23 11:15:35,500 INFO L273 TraceCheckUtils]: 14: Hoare triple {1531#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1531#true} is VALID [2018-11-23 11:15:35,500 INFO L273 TraceCheckUtils]: 15: Hoare triple {1531#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); {1531#true} is VALID [2018-11-23 11:15:35,500 INFO L273 TraceCheckUtils]: 16: Hoare triple {1531#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); {1531#true} is VALID [2018-11-23 11:15:35,500 INFO L273 TraceCheckUtils]: 17: Hoare triple {1531#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; {1531#true} is VALID [2018-11-23 11:15:35,501 INFO L273 TraceCheckUtils]: 18: Hoare triple {1531#true} assume !~bvsgt32(~len, 0bv32); {1531#true} is VALID [2018-11-23 11:15:35,501 INFO L273 TraceCheckUtils]: 19: Hoare triple {1531#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1531#true} is VALID [2018-11-23 11:15:35,501 INFO L273 TraceCheckUtils]: 20: Hoare triple {1531#true} assume true; {1531#true} is VALID [2018-11-23 11:15:35,502 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1531#true} {1551#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #127#return; {1551#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:35,503 INFO L273 TraceCheckUtils]: 22: Hoare triple {1551#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {1603#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:35,503 INFO L273 TraceCheckUtils]: 23: Hoare triple {1603#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1603#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:35,504 INFO L256 TraceCheckUtils]: 24: Hoare triple {1603#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1531#true} is VALID [2018-11-23 11:15:35,504 INFO L273 TraceCheckUtils]: 25: Hoare triple {1531#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1531#true} is VALID [2018-11-23 11:15:35,504 INFO L273 TraceCheckUtils]: 26: Hoare triple {1531#true} assume !~bvsgt32(~index, 0bv32); {1531#true} is VALID [2018-11-23 11:15:35,504 INFO L273 TraceCheckUtils]: 27: Hoare triple {1531#true} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {1531#true} is VALID [2018-11-23 11:15:35,504 INFO L273 TraceCheckUtils]: 28: Hoare triple {1531#true} assume true; {1531#true} is VALID [2018-11-23 11:15:35,505 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1531#true} {1603#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #129#return; {1603#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:35,506 INFO L273 TraceCheckUtils]: 30: Hoare triple {1603#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {1628#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:35,507 INFO L273 TraceCheckUtils]: 31: Hoare triple {1628#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~len~0); {1532#false} is VALID [2018-11-23 11:15:35,507 INFO L273 TraceCheckUtils]: 32: Hoare triple {1532#false} ~i~0 := 0bv32; {1532#false} is VALID [2018-11-23 11:15:35,507 INFO L273 TraceCheckUtils]: 33: Hoare triple {1532#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {1532#false} is VALID [2018-11-23 11:15:35,507 INFO L256 TraceCheckUtils]: 34: Hoare triple {1532#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1532#false} is VALID [2018-11-23 11:15:35,507 INFO L273 TraceCheckUtils]: 35: Hoare triple {1532#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1532#false} is VALID [2018-11-23 11:15:35,508 INFO L273 TraceCheckUtils]: 36: Hoare triple {1532#false} assume !~bvsgt32(~index, 0bv32); {1532#false} is VALID [2018-11-23 11:15:35,508 INFO L273 TraceCheckUtils]: 37: Hoare triple {1532#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {1532#false} is VALID [2018-11-23 11:15:35,508 INFO L273 TraceCheckUtils]: 38: Hoare triple {1532#false} assume true; {1532#false} is VALID [2018-11-23 11:15:35,508 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1532#false} {1532#false} #131#return; {1532#false} is VALID [2018-11-23 11:15:35,508 INFO L273 TraceCheckUtils]: 40: Hoare triple {1532#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1532#false} is VALID [2018-11-23 11:15:35,509 INFO L273 TraceCheckUtils]: 41: Hoare triple {1532#false} assume !false; {1532#false} is VALID [2018-11-23 11:15:35,512 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:35,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:15:35,669 INFO L273 TraceCheckUtils]: 41: Hoare triple {1532#false} assume !false; {1532#false} is VALID [2018-11-23 11:15:35,670 INFO L273 TraceCheckUtils]: 40: Hoare triple {1532#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1532#false} is VALID [2018-11-23 11:15:35,670 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1531#true} {1532#false} #131#return; {1532#false} is VALID [2018-11-23 11:15:35,671 INFO L273 TraceCheckUtils]: 38: Hoare triple {1531#true} assume true; {1531#true} is VALID [2018-11-23 11:15:35,671 INFO L273 TraceCheckUtils]: 37: Hoare triple {1531#true} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {1531#true} is VALID [2018-11-23 11:15:35,671 INFO L273 TraceCheckUtils]: 36: Hoare triple {1531#true} assume !~bvsgt32(~index, 0bv32); {1531#true} is VALID [2018-11-23 11:15:35,672 INFO L273 TraceCheckUtils]: 35: Hoare triple {1531#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1531#true} is VALID [2018-11-23 11:15:35,672 INFO L256 TraceCheckUtils]: 34: Hoare triple {1532#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1531#true} is VALID [2018-11-23 11:15:35,673 INFO L273 TraceCheckUtils]: 33: Hoare triple {1532#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {1532#false} is VALID [2018-11-23 11:15:35,673 INFO L273 TraceCheckUtils]: 32: Hoare triple {1532#false} ~i~0 := 0bv32; {1532#false} is VALID [2018-11-23 11:15:35,675 INFO L273 TraceCheckUtils]: 31: Hoare triple {1692#(bvslt main_~i~0 main_~len~0)} assume !~bvslt32(~i~0, ~len~0); {1532#false} is VALID [2018-11-23 11:15:35,676 INFO L273 TraceCheckUtils]: 30: Hoare triple {1696#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {1692#(bvslt main_~i~0 main_~len~0)} is VALID [2018-11-23 11:15:35,677 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1531#true} {1696#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} #129#return; {1696#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-23 11:15:35,677 INFO L273 TraceCheckUtils]: 28: Hoare triple {1531#true} assume true; {1531#true} is VALID [2018-11-23 11:15:35,677 INFO L273 TraceCheckUtils]: 27: Hoare triple {1531#true} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {1531#true} is VALID [2018-11-23 11:15:35,678 INFO L273 TraceCheckUtils]: 26: Hoare triple {1531#true} assume !~bvsgt32(~index, 0bv32); {1531#true} is VALID [2018-11-23 11:15:35,678 INFO L273 TraceCheckUtils]: 25: Hoare triple {1531#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1531#true} is VALID [2018-11-23 11:15:35,678 INFO L256 TraceCheckUtils]: 24: Hoare triple {1696#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1531#true} is VALID [2018-11-23 11:15:35,683 INFO L273 TraceCheckUtils]: 23: Hoare triple {1696#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1696#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-23 11:15:35,684 INFO L273 TraceCheckUtils]: 22: Hoare triple {1721#(bvslt (_ bv1 32) main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {1696#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-23 11:15:35,685 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1531#true} {1721#(bvslt (_ bv1 32) main_~len~0)} #127#return; {1721#(bvslt (_ bv1 32) main_~len~0)} is VALID [2018-11-23 11:15:35,685 INFO L273 TraceCheckUtils]: 20: Hoare triple {1531#true} assume true; {1531#true} is VALID [2018-11-23 11:15:35,685 INFO L273 TraceCheckUtils]: 19: Hoare triple {1531#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1531#true} is VALID [2018-11-23 11:15:35,685 INFO L273 TraceCheckUtils]: 18: Hoare triple {1531#true} assume !~bvsgt32(~len, 0bv32); {1531#true} is VALID [2018-11-23 11:15:35,686 INFO L273 TraceCheckUtils]: 17: Hoare triple {1531#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; {1531#true} is VALID [2018-11-23 11:15:35,686 INFO L273 TraceCheckUtils]: 16: Hoare triple {1531#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); {1531#true} is VALID [2018-11-23 11:15:35,686 INFO L273 TraceCheckUtils]: 15: Hoare triple {1531#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); {1531#true} is VALID [2018-11-23 11:15:35,686 INFO L273 TraceCheckUtils]: 14: Hoare triple {1531#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1531#true} is VALID [2018-11-23 11:15:35,686 INFO L273 TraceCheckUtils]: 13: Hoare triple {1531#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; {1531#true} is VALID [2018-11-23 11:15:35,687 INFO L273 TraceCheckUtils]: 12: Hoare triple {1531#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; {1531#true} is VALID [2018-11-23 11:15:35,687 INFO L273 TraceCheckUtils]: 11: Hoare triple {1531#true} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1531#true} is VALID [2018-11-23 11:15:35,687 INFO L273 TraceCheckUtils]: 10: Hoare triple {1531#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); {1531#true} is VALID [2018-11-23 11:15:35,687 INFO L273 TraceCheckUtils]: 9: Hoare triple {1531#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1531#true} is VALID [2018-11-23 11:15:35,687 INFO L273 TraceCheckUtils]: 8: Hoare triple {1531#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; {1531#true} is VALID [2018-11-23 11:15:35,688 INFO L273 TraceCheckUtils]: 7: Hoare triple {1531#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1531#true} is VALID [2018-11-23 11:15:35,688 INFO L256 TraceCheckUtils]: 6: Hoare triple {1721#(bvslt (_ bv1 32) main_~len~0)} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {1531#true} is VALID [2018-11-23 11:15:35,689 INFO L273 TraceCheckUtils]: 5: Hoare triple {1531#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1721#(bvslt (_ bv1 32) main_~len~0)} is VALID [2018-11-23 11:15:35,689 INFO L256 TraceCheckUtils]: 4: Hoare triple {1531#true} call #t~ret15 := main(); {1531#true} is VALID [2018-11-23 11:15:35,689 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1531#true} {1531#true} #137#return; {1531#true} is VALID [2018-11-23 11:15:35,689 INFO L273 TraceCheckUtils]: 2: Hoare triple {1531#true} assume true; {1531#true} is VALID [2018-11-23 11:15:35,690 INFO L273 TraceCheckUtils]: 1: Hoare triple {1531#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1531#true} is VALID [2018-11-23 11:15:35,690 INFO L256 TraceCheckUtils]: 0: Hoare triple {1531#true} call ULTIMATE.init(); {1531#true} is VALID [2018-11-23 11:15:35,692 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:35,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:15:35,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:15:35,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-11-23 11:15:35,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:35,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:15:35,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:35,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:15:35,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:15:35,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:15:35,792 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 8 states. [2018-11-23 11:15:36,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:36,825 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2018-11-23 11:15:36,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:15:36,826 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-11-23 11:15:36,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:15:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2018-11-23 11:15:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:15:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2018-11-23 11:15:36,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2018-11-23 11:15:37,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:37,015 INFO L225 Difference]: With dead ends: 73 [2018-11-23 11:15:37,015 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 11:15:37,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:15:37,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 11:15:37,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2018-11-23 11:15:37,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:37,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 47 states. [2018-11-23 11:15:37,081 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 47 states. [2018-11-23 11:15:37,081 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 47 states. [2018-11-23 11:15:37,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:37,085 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-11-23 11:15:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2018-11-23 11:15:37,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:37,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:37,086 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 61 states. [2018-11-23 11:15:37,086 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 61 states. [2018-11-23 11:15:37,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:37,090 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-11-23 11:15:37,090 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2018-11-23 11:15:37,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:37,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:37,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:37,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:37,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:15:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-23 11:15:37,093 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 42 [2018-11-23 11:15:37,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:37,094 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-23 11:15:37,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:15:37,094 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-23 11:15:37,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 11:15:37,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:37,096 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:15:37,096 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:37,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:37,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1822323821, now seen corresponding path program 2 times [2018-11-23 11:15:37,097 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:37,097 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:37,150 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:15:37,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:15:37,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:15:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:37,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:37,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {2088#true} call ULTIMATE.init(); {2088#true} is VALID [2018-11-23 11:15:37,393 INFO L273 TraceCheckUtils]: 1: Hoare triple {2088#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2088#true} is VALID [2018-11-23 11:15:37,393 INFO L273 TraceCheckUtils]: 2: Hoare triple {2088#true} assume true; {2088#true} is VALID [2018-11-23 11:15:37,394 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2088#true} {2088#true} #137#return; {2088#true} is VALID [2018-11-23 11:15:37,394 INFO L256 TraceCheckUtils]: 4: Hoare triple {2088#true} call #t~ret15 := main(); {2088#true} is VALID [2018-11-23 11:15:37,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {2088#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2088#true} is VALID [2018-11-23 11:15:37,395 INFO L256 TraceCheckUtils]: 6: Hoare triple {2088#true} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {2088#true} is VALID [2018-11-23 11:15:37,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {2088#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2088#true} is VALID [2018-11-23 11:15:37,395 INFO L273 TraceCheckUtils]: 8: Hoare triple {2088#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; {2088#true} is VALID [2018-11-23 11:15:37,395 INFO L273 TraceCheckUtils]: 9: Hoare triple {2088#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2088#true} is VALID [2018-11-23 11:15:37,395 INFO L273 TraceCheckUtils]: 10: Hoare triple {2088#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); {2088#true} is VALID [2018-11-23 11:15:37,395 INFO L273 TraceCheckUtils]: 11: Hoare triple {2088#true} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {2088#true} is VALID [2018-11-23 11:15:37,396 INFO L273 TraceCheckUtils]: 12: Hoare triple {2088#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; {2088#true} is VALID [2018-11-23 11:15:37,396 INFO L273 TraceCheckUtils]: 13: Hoare triple {2088#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; {2088#true} is VALID [2018-11-23 11:15:37,396 INFO L273 TraceCheckUtils]: 14: Hoare triple {2088#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2088#true} is VALID [2018-11-23 11:15:37,396 INFO L273 TraceCheckUtils]: 15: Hoare triple {2088#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); {2088#true} is VALID [2018-11-23 11:15:37,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {2088#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); {2088#true} is VALID [2018-11-23 11:15:37,397 INFO L273 TraceCheckUtils]: 17: Hoare triple {2088#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; {2088#true} is VALID [2018-11-23 11:15:37,397 INFO L273 TraceCheckUtils]: 18: Hoare triple {2088#true} assume !~bvsgt32(~len, 0bv32); {2088#true} is VALID [2018-11-23 11:15:37,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {2088#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2088#true} is VALID [2018-11-23 11:15:37,397 INFO L273 TraceCheckUtils]: 20: Hoare triple {2088#true} assume true; {2088#true} is VALID [2018-11-23 11:15:37,397 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2088#true} {2088#true} #127#return; {2088#true} is VALID [2018-11-23 11:15:37,398 INFO L273 TraceCheckUtils]: 22: Hoare triple {2088#true} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {2159#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:15:37,398 INFO L273 TraceCheckUtils]: 23: Hoare triple {2159#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2159#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:15:37,398 INFO L256 TraceCheckUtils]: 24: Hoare triple {2159#(= main_~i~0 (_ bv0 32))} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2088#true} is VALID [2018-11-23 11:15:37,398 INFO L273 TraceCheckUtils]: 25: Hoare triple {2088#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2088#true} is VALID [2018-11-23 11:15:37,399 INFO L273 TraceCheckUtils]: 26: Hoare triple {2088#true} assume !~bvsgt32(~index, 0bv32); {2088#true} is VALID [2018-11-23 11:15:37,399 INFO L273 TraceCheckUtils]: 27: Hoare triple {2088#true} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2088#true} is VALID [2018-11-23 11:15:37,399 INFO L273 TraceCheckUtils]: 28: Hoare triple {2088#true} assume true; {2088#true} is VALID [2018-11-23 11:15:37,403 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2088#true} {2159#(= main_~i~0 (_ bv0 32))} #129#return; {2159#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:15:37,405 INFO L273 TraceCheckUtils]: 30: Hoare triple {2159#(= main_~i~0 (_ bv0 32))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2184#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:37,405 INFO L273 TraceCheckUtils]: 31: Hoare triple {2184#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2184#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:37,405 INFO L256 TraceCheckUtils]: 32: Hoare triple {2184#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2088#true} is VALID [2018-11-23 11:15:37,407 INFO L273 TraceCheckUtils]: 33: Hoare triple {2088#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2194#(= dll_update_at_~index |dll_update_at_#in~index|)} is VALID [2018-11-23 11:15:37,407 INFO L273 TraceCheckUtils]: 34: Hoare triple {2194#(= dll_update_at_~index |dll_update_at_#in~index|)} assume !~bvsgt32(~index, 0bv32); {2198#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:15:37,410 INFO L273 TraceCheckUtils]: 35: Hoare triple {2198#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2198#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:15:37,410 INFO L273 TraceCheckUtils]: 36: Hoare triple {2198#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} assume true; {2198#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:15:37,412 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2198#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} {2184#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #129#return; {2089#false} is VALID [2018-11-23 11:15:37,412 INFO L273 TraceCheckUtils]: 38: Hoare triple {2089#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2089#false} is VALID [2018-11-23 11:15:37,412 INFO L273 TraceCheckUtils]: 39: Hoare triple {2089#false} assume !~bvslt32(~i~0, ~len~0); {2089#false} is VALID [2018-11-23 11:15:37,412 INFO L273 TraceCheckUtils]: 40: Hoare triple {2089#false} ~i~0 := 0bv32; {2089#false} is VALID [2018-11-23 11:15:37,412 INFO L273 TraceCheckUtils]: 41: Hoare triple {2089#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {2089#false} is VALID [2018-11-23 11:15:37,412 INFO L256 TraceCheckUtils]: 42: Hoare triple {2089#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {2089#false} is VALID [2018-11-23 11:15:37,413 INFO L273 TraceCheckUtils]: 43: Hoare triple {2089#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2089#false} is VALID [2018-11-23 11:15:37,413 INFO L273 TraceCheckUtils]: 44: Hoare triple {2089#false} assume !~bvsgt32(~index, 0bv32); {2089#false} is VALID [2018-11-23 11:15:37,413 INFO L273 TraceCheckUtils]: 45: Hoare triple {2089#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {2089#false} is VALID [2018-11-23 11:15:37,413 INFO L273 TraceCheckUtils]: 46: Hoare triple {2089#false} assume true; {2089#false} is VALID [2018-11-23 11:15:37,413 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {2089#false} {2089#false} #131#return; {2089#false} is VALID [2018-11-23 11:15:37,413 INFO L273 TraceCheckUtils]: 48: Hoare triple {2089#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {2089#false} is VALID [2018-11-23 11:15:37,414 INFO L273 TraceCheckUtils]: 49: Hoare triple {2089#false} assume !false; {2089#false} is VALID [2018-11-23 11:15:37,415 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 11:15:37,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:15:37,729 INFO L273 TraceCheckUtils]: 49: Hoare triple {2089#false} assume !false; {2089#false} is VALID [2018-11-23 11:15:37,729 INFO L273 TraceCheckUtils]: 48: Hoare triple {2089#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {2089#false} is VALID [2018-11-23 11:15:37,729 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {2088#true} {2089#false} #131#return; {2089#false} is VALID [2018-11-23 11:15:37,729 INFO L273 TraceCheckUtils]: 46: Hoare triple {2088#true} assume true; {2088#true} is VALID [2018-11-23 11:15:37,730 INFO L273 TraceCheckUtils]: 45: Hoare triple {2088#true} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {2088#true} is VALID [2018-11-23 11:15:37,730 INFO L273 TraceCheckUtils]: 44: Hoare triple {2088#true} assume !~bvsgt32(~index, 0bv32); {2088#true} is VALID [2018-11-23 11:15:37,730 INFO L273 TraceCheckUtils]: 43: Hoare triple {2088#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2088#true} is VALID [2018-11-23 11:15:37,730 INFO L256 TraceCheckUtils]: 42: Hoare triple {2089#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {2088#true} is VALID [2018-11-23 11:15:37,730 INFO L273 TraceCheckUtils]: 41: Hoare triple {2089#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {2089#false} is VALID [2018-11-23 11:15:37,730 INFO L273 TraceCheckUtils]: 40: Hoare triple {2089#false} ~i~0 := 0bv32; {2089#false} is VALID [2018-11-23 11:15:37,731 INFO L273 TraceCheckUtils]: 39: Hoare triple {2089#false} assume !~bvslt32(~i~0, ~len~0); {2089#false} is VALID [2018-11-23 11:15:37,731 INFO L273 TraceCheckUtils]: 38: Hoare triple {2089#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2089#false} is VALID [2018-11-23 11:15:37,732 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2198#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} {2280#(bvsgt main_~i~0 (_ bv0 32))} #129#return; {2089#false} is VALID [2018-11-23 11:15:37,733 INFO L273 TraceCheckUtils]: 36: Hoare triple {2198#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} assume true; {2198#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:15:37,733 INFO L273 TraceCheckUtils]: 35: Hoare triple {2198#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2198#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:15:37,734 INFO L273 TraceCheckUtils]: 34: Hoare triple {2293#(or (bvsgt dll_update_at_~index (_ bv0 32)) (not (bvsgt |dll_update_at_#in~index| (_ bv0 32))))} assume !~bvsgt32(~index, 0bv32); {2198#(not (bvsgt |dll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:15:37,735 INFO L273 TraceCheckUtils]: 33: Hoare triple {2088#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2293#(or (bvsgt dll_update_at_~index (_ bv0 32)) (not (bvsgt |dll_update_at_#in~index| (_ bv0 32))))} is VALID [2018-11-23 11:15:37,735 INFO L256 TraceCheckUtils]: 32: Hoare triple {2280#(bvsgt main_~i~0 (_ bv0 32))} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2088#true} is VALID [2018-11-23 11:15:37,736 INFO L273 TraceCheckUtils]: 31: Hoare triple {2280#(bvsgt main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2280#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:15:37,737 INFO L273 TraceCheckUtils]: 30: Hoare triple {2303#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2280#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:15:37,738 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2088#true} {2303#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} #129#return; {2303#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:37,739 INFO L273 TraceCheckUtils]: 28: Hoare triple {2088#true} assume true; {2088#true} is VALID [2018-11-23 11:15:37,739 INFO L273 TraceCheckUtils]: 27: Hoare triple {2088#true} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2088#true} is VALID [2018-11-23 11:15:37,739 INFO L273 TraceCheckUtils]: 26: Hoare triple {2088#true} assume !~bvsgt32(~index, 0bv32); {2088#true} is VALID [2018-11-23 11:15:37,739 INFO L273 TraceCheckUtils]: 25: Hoare triple {2088#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2088#true} is VALID [2018-11-23 11:15:37,740 INFO L256 TraceCheckUtils]: 24: Hoare triple {2303#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2088#true} is VALID [2018-11-23 11:15:37,745 INFO L273 TraceCheckUtils]: 23: Hoare triple {2303#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2303#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:37,746 INFO L273 TraceCheckUtils]: 22: Hoare triple {2088#true} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {2303#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:37,746 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2088#true} {2088#true} #127#return; {2088#true} is VALID [2018-11-23 11:15:37,746 INFO L273 TraceCheckUtils]: 20: Hoare triple {2088#true} assume true; {2088#true} is VALID [2018-11-23 11:15:37,746 INFO L273 TraceCheckUtils]: 19: Hoare triple {2088#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2088#true} is VALID [2018-11-23 11:15:37,746 INFO L273 TraceCheckUtils]: 18: Hoare triple {2088#true} assume !~bvsgt32(~len, 0bv32); {2088#true} is VALID [2018-11-23 11:15:37,747 INFO L273 TraceCheckUtils]: 17: Hoare triple {2088#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; {2088#true} is VALID [2018-11-23 11:15:37,747 INFO L273 TraceCheckUtils]: 16: Hoare triple {2088#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); {2088#true} is VALID [2018-11-23 11:15:37,747 INFO L273 TraceCheckUtils]: 15: Hoare triple {2088#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); {2088#true} is VALID [2018-11-23 11:15:37,747 INFO L273 TraceCheckUtils]: 14: Hoare triple {2088#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2088#true} is VALID [2018-11-23 11:15:37,747 INFO L273 TraceCheckUtils]: 13: Hoare triple {2088#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; {2088#true} is VALID [2018-11-23 11:15:37,748 INFO L273 TraceCheckUtils]: 12: Hoare triple {2088#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; {2088#true} is VALID [2018-11-23 11:15:37,748 INFO L273 TraceCheckUtils]: 11: Hoare triple {2088#true} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {2088#true} is VALID [2018-11-23 11:15:37,748 INFO L273 TraceCheckUtils]: 10: Hoare triple {2088#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); {2088#true} is VALID [2018-11-23 11:15:37,748 INFO L273 TraceCheckUtils]: 9: Hoare triple {2088#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2088#true} is VALID [2018-11-23 11:15:37,748 INFO L273 TraceCheckUtils]: 8: Hoare triple {2088#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; {2088#true} is VALID [2018-11-23 11:15:37,748 INFO L273 TraceCheckUtils]: 7: Hoare triple {2088#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2088#true} is VALID [2018-11-23 11:15:37,749 INFO L256 TraceCheckUtils]: 6: Hoare triple {2088#true} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {2088#true} is VALID [2018-11-23 11:15:37,749 INFO L273 TraceCheckUtils]: 5: Hoare triple {2088#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2088#true} is VALID [2018-11-23 11:15:37,749 INFO L256 TraceCheckUtils]: 4: Hoare triple {2088#true} call #t~ret15 := main(); {2088#true} is VALID [2018-11-23 11:15:37,749 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2088#true} {2088#true} #137#return; {2088#true} is VALID [2018-11-23 11:15:37,749 INFO L273 TraceCheckUtils]: 2: Hoare triple {2088#true} assume true; {2088#true} is VALID [2018-11-23 11:15:37,750 INFO L273 TraceCheckUtils]: 1: Hoare triple {2088#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2088#true} is VALID [2018-11-23 11:15:37,750 INFO L256 TraceCheckUtils]: 0: Hoare triple {2088#true} call ULTIMATE.init(); {2088#true} is VALID [2018-11-23 11:15:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 11:15:37,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:15:37,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 11:15:37,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-11-23 11:15:37,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:37,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:15:37,829 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:37,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:15:37,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:15:37,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:15:37,830 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 9 states. [2018-11-23 11:15:39,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:39,447 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2018-11-23 11:15:39,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:15:39,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-11-23 11:15:39,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:15:39,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2018-11-23 11:15:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:15:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2018-11-23 11:15:39,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 101 transitions. [2018-11-23 11:15:39,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:39,599 INFO L225 Difference]: With dead ends: 92 [2018-11-23 11:15:39,599 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 11:15:39,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:15:39,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 11:15:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 53. [2018-11-23 11:15:39,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:39,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 53 states. [2018-11-23 11:15:39,681 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 53 states. [2018-11-23 11:15:39,681 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 53 states. [2018-11-23 11:15:39,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:39,684 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-11-23 11:15:39,684 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2018-11-23 11:15:39,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:39,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:39,685 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 70 states. [2018-11-23 11:15:39,685 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 70 states. [2018-11-23 11:15:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:39,691 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-11-23 11:15:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2018-11-23 11:15:39,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:39,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:39,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:39,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:39,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 11:15:39,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-11-23 11:15:39,696 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 50 [2018-11-23 11:15:39,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:39,696 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-11-23 11:15:39,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:15:39,696 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-11-23 11:15:39,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 11:15:39,697 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:39,697 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:15:39,697 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:39,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:39,698 INFO L82 PathProgramCache]: Analyzing trace with hash -736573926, now seen corresponding path program 1 times [2018-11-23 11:15:39,698 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:39,698 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:39,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:15:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:39,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:39,960 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:39,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:39,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:39,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 11:15:39,979 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:39,979 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_38|]. (= |#valid| (store |v_#valid_38| dll_create_~new_head~0.base (_ bv1 1))) [2018-11-23 11:15:39,979 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base)) [2018-11-23 11:15:40,047 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:40,048 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:40,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 11:15:40,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:40,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:40,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-11-23 11:15:40,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-23 11:15:40,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, 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:40,123 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:40,149 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:40,171 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:40,183 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:40,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:40,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:40,211 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2018-11-23 11:15:40,313 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 45 treesize of output 39 [2018-11-23 11:15:40,321 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 16 treesize of output 15 [2018-11-23 11:15:40,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:40,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:40,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:40,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-11-23 11:15:40,378 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:40,378 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_49|, dll_create_~head~0.offset]. (let ((.cse0 (select |v_#memory_$Pointer$.base_49| dll_create_~new_head~0.base))) (let ((.cse1 (select .cse0 (bvadd dll_create_~new_head~0.offset (_ bv4 32))))) (and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (select .cse0 (bvadd dll_create_~new_head~0.offset (_ bv8 32))) (_ bv0 32)) (= (store |v_#memory_$Pointer$.base_49| .cse1 (store (select |v_#memory_$Pointer$.base_49| .cse1) (bvadd dll_create_~head~0.offset (_ bv8 32)) dll_create_~new_head~0.base)) |#memory_$Pointer$.base|) (not (= dll_create_~new_head~0.base .cse1))))) [2018-11-23 11:15:40,379 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [dll_create_~head~0.offset]. (let ((.cse1 (select |#memory_$Pointer$.base| dll_create_~new_head~0.base))) (let ((.cse0 (select .cse1 (bvadd dll_create_~new_head~0.offset (_ bv4 32))))) (and (= (_ bv0 32) dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base .cse0)) (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| .cse0) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) (select .cse1 (bvadd dll_create_~new_head~0.offset (_ bv8 32))))))) [2018-11-23 11:15:41,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:15:41,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:15:41,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:41,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:41,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:41,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-23 11:15:41,345 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 44 treesize of output 38 [2018-11-23 11:15:41,363 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:41,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:41,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-11-23 11:15:41,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:41,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:41,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:41,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:44 [2018-11-23 11:15:43,802 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset (_ BitVec 32)) (dll_update_at_~data (_ BitVec 32))) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) (bvadd |c_dll_update_at_#in~head.offset| (_ bv4 32))))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) dll_update_at_~head.offset dll_update_at_~data))) |c_#memory_int|)) is different from true [2018-11-23 11:15:43,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-11-23 11:15:43,845 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:43,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-11-23 11:15:43,948 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:44,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 11:15:44,054 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:44,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:44,126 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 19 treesize of output 20 [2018-11-23 11:15:44,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:15:44,135 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:44,146 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:44,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:44,166 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:67, output treesize:16 [2018-11-23 11:15:44,180 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:44,181 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_BEFORE_CALL_4|, |v_old(#memory_int)_AFTER_CALL_21|, dll_update_at_~head.offset, dll_update_at_~data, v_subst_1]. (let ((.cse0 (select |v_#memory_$Pointer$.base_BEFORE_CALL_4| main_~s~0.base))) (let ((.cse2 (select .cse0 (_ bv4 32)))) (and (= (_ bv0 32) (select .cse0 (_ bv8 32))) (= (select (select |v_old(#memory_int)_AFTER_CALL_21| main_~s~0.base) main_~s~0.offset) main_~len~0) (= main_~s~0.offset (_ bv0 32)) (= (let ((.cse1 (select .cse0 (bvadd main_~s~0.offset (_ bv4 32))))) (store |v_old(#memory_int)_AFTER_CALL_21| .cse1 (store (select |v_old(#memory_int)_AFTER_CALL_21| .cse1) dll_update_at_~head.offset dll_update_at_~data))) |#memory_int|) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.base (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_4| .cse2) (bvadd v_subst_1 (_ bv8 32)))) (not (= .cse2 main_~s~0.base))))) [2018-11-23 11:15:44,181 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) [2018-11-23 11:15:46,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-11-23 11:15:46,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-11-23 11:15:46,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:46,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-23 11:15:46,769 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:46,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:46,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:46,792 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2018-11-23 11:15:46,796 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:46,796 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~s~0.base, v_main_~s~0.base_BEFORE_CALL_3]. (let ((.cse0 (select (select |#memory_int| main_~s~0.base) (_ bv0 32)))) (and (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv2 32) .cse0) (= main_~expected~0 .cse0) (= |main_#t~ret14| .cse0))) [2018-11-23 11:15:46,796 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~ret14| main_~expected~0) (= |main_#t~ret14| (_ bv2 32))) [2018-11-23 11:15:46,879 INFO L256 TraceCheckUtils]: 0: Hoare triple {2752#true} call ULTIMATE.init(); {2752#true} is VALID [2018-11-23 11:15:46,879 INFO L273 TraceCheckUtils]: 1: Hoare triple {2752#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2752#true} is VALID [2018-11-23 11:15:46,880 INFO L273 TraceCheckUtils]: 2: Hoare triple {2752#true} assume true; {2752#true} is VALID [2018-11-23 11:15:46,880 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2752#true} {2752#true} #137#return; {2752#true} is VALID [2018-11-23 11:15:46,880 INFO L256 TraceCheckUtils]: 4: Hoare triple {2752#true} call #t~ret15 := main(); {2752#true} is VALID [2018-11-23 11:15:46,881 INFO L273 TraceCheckUtils]: 5: Hoare triple {2752#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2772#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:46,882 INFO L256 TraceCheckUtils]: 6: Hoare triple {2772#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {2752#true} is VALID [2018-11-23 11:15:46,882 INFO L273 TraceCheckUtils]: 7: Hoare triple {2752#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2752#true} is VALID [2018-11-23 11:15:46,883 INFO L273 TraceCheckUtils]: 8: Hoare triple {2752#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; {2782#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} is VALID [2018-11-23 11:15:46,883 INFO L273 TraceCheckUtils]: 9: Hoare triple {2782#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2782#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} is VALID [2018-11-23 11:15:46,884 INFO L273 TraceCheckUtils]: 10: Hoare triple {2782#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {2782#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} is VALID [2018-11-23 11:15:46,884 INFO L273 TraceCheckUtils]: 11: Hoare triple {2782#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {2782#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} is VALID [2018-11-23 11:15:46,885 INFO L273 TraceCheckUtils]: 12: Hoare triple {2782#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} ~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; {2795#(= (bvadd (select |#valid| dll_create_~head~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:15:46,886 INFO L273 TraceCheckUtils]: 13: Hoare triple {2795#(= (bvadd (select |#valid| dll_create_~head~0.base) (_ bv1 1)) (_ bv0 1))} 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; {2799#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} is VALID [2018-11-23 11:15:46,887 INFO L273 TraceCheckUtils]: 14: Hoare triple {2799#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2799#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} is VALID [2018-11-23 11:15:46,889 INFO L273 TraceCheckUtils]: 15: Hoare triple {2799#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {2806#(and (= (_ bv0 32) dll_create_~new_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) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))))} is VALID [2018-11-23 11:15:46,891 INFO L273 TraceCheckUtils]: 16: Hoare triple {2806#(and (= (_ bv0 32) dll_create_~new_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) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))))} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {2810#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (exists ((dll_create_~head~0.offset (_ BitVec 32))) (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (bvadd dll_create_~head~0.offset (_ bv8 32))))) (not (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_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)))))} is VALID [2018-11-23 11:15:46,894 INFO L273 TraceCheckUtils]: 17: Hoare triple {2810#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (exists ((dll_create_~head~0.offset (_ BitVec 32))) (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (bvadd dll_create_~head~0.offset (_ bv8 32))))) (not (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_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)))))} ~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; {2814#(and (= (_ 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) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) dll_create_~head~0.base)))} is VALID [2018-11-23 11:15:46,895 INFO L273 TraceCheckUtils]: 18: Hoare triple {2814#(and (= (_ 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) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) dll_create_~head~0.base)))} assume !~bvsgt32(~len, 0bv32); {2814#(and (= (_ 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) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) dll_create_~head~0.base)))} is VALID [2018-11-23 11:15:46,904 INFO L273 TraceCheckUtils]: 19: Hoare triple {2814#(and (= (_ 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) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) dll_create_~head~0.base)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2821#(and (= |dll_create_#res.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) |dll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} is VALID [2018-11-23 11:15:46,905 INFO L273 TraceCheckUtils]: 20: Hoare triple {2821#(and (= |dll_create_#res.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) |dll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} assume true; {2821#(and (= |dll_create_#res.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) |dll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} is VALID [2018-11-23 11:15:46,923 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2821#(and (= |dll_create_#res.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) |dll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} {2772#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #127#return; {2828#(and (not (= |main_#t~ret11.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv4 32))))) (= |main_#t~ret11.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) |main_#t~ret11.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv8 32)))))} is VALID [2018-11-23 11:15:46,925 INFO L273 TraceCheckUtils]: 22: Hoare triple {2828#(and (not (= |main_#t~ret11.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv4 32))))) (= |main_#t~ret11.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) |main_#t~ret11.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv8 32)))))} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {2832#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-23 11:15:46,926 INFO L273 TraceCheckUtils]: 23: Hoare triple {2832#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2836#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-23 11:15:46,928 INFO L256 TraceCheckUtils]: 24: Hoare triple {2836#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2840#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-23 11:15:46,932 INFO L273 TraceCheckUtils]: 25: Hoare triple {2840#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2844#(and (= dll_update_at_~data |dll_update_at_#in~data|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} is VALID [2018-11-23 11:15:46,935 INFO L273 TraceCheckUtils]: 26: Hoare triple {2844#(and (= dll_update_at_~data |dll_update_at_#in~data|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} assume !~bvsgt32(~index, 0bv32); {2844#(and (= dll_update_at_~data |dll_update_at_#in~data|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} is VALID [2018-11-23 11:15:46,936 INFO L273 TraceCheckUtils]: 27: Hoare triple {2844#(and (= dll_update_at_~data |dll_update_at_#in~data|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2851#(and (= (select (select |#memory_int| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|) |dll_update_at_#in~data|) (= (store |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|))) |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:15:46,937 INFO L273 TraceCheckUtils]: 28: Hoare triple {2851#(and (= (select (select |#memory_int| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|) |dll_update_at_#in~data|) (= (store |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|))) |#memory_$Pointer$.base|))} assume true; {2851#(and (= (select (select |#memory_int| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|) |dll_update_at_#in~data|) (= (store |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|))) |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:15:46,942 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2851#(and (= (select (select |#memory_int| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|) |dll_update_at_#in~data|) (= (store |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|))) |#memory_$Pointer$.base|))} {2836#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} #129#return; {2858#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-23 11:15:46,943 INFO L273 TraceCheckUtils]: 30: Hoare triple {2858#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2858#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-23 11:15:46,947 INFO L273 TraceCheckUtils]: 31: Hoare triple {2858#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2858#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-23 11:15:46,949 INFO L256 TraceCheckUtils]: 32: Hoare triple {2858#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2868#(and (= |old(#memory_int)| |#memory_int|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:15:46,949 INFO L273 TraceCheckUtils]: 33: Hoare triple {2868#(and (= |old(#memory_int)| |#memory_int|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2872#(and (= |old(#memory_int)| |#memory_int|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} is VALID [2018-11-23 11:15:46,951 INFO L273 TraceCheckUtils]: 34: Hoare triple {2872#(and (= |old(#memory_int)| |#memory_int|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} assume !!~bvsgt32(~index, 0bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);~head.base, ~head.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;#t~post10 := ~index;~index := ~bvsub32(#t~post10, 1bv32);havoc #t~post10; {2876#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) dll_update_at_~head.base))} is VALID [2018-11-23 11:15:46,951 INFO L273 TraceCheckUtils]: 35: Hoare triple {2876#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) dll_update_at_~head.base))} assume !~bvsgt32(~index, 0bv32); {2876#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) dll_update_at_~head.base))} is VALID [2018-11-23 11:15:46,953 INFO L273 TraceCheckUtils]: 36: Hoare triple {2876#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) dll_update_at_~head.base))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2883#(exists ((dll_update_at_~head.offset (_ BitVec 32)) (dll_update_at_~data (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) dll_update_at_~head.offset dll_update_at_~data)) |#memory_int|))} is VALID [2018-11-23 11:15:46,953 INFO L273 TraceCheckUtils]: 37: Hoare triple {2883#(exists ((dll_update_at_~head.offset (_ BitVec 32)) (dll_update_at_~data (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) dll_update_at_~head.offset dll_update_at_~data)) |#memory_int|))} assume true; {2883#(exists ((dll_update_at_~head.offset (_ BitVec 32)) (dll_update_at_~data (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) dll_update_at_~head.offset dll_update_at_~data)) |#memory_int|))} is VALID [2018-11-23 11:15:46,959 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2883#(exists ((dll_update_at_~head.offset (_ BitVec 32)) (dll_update_at_~data (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) dll_update_at_~head.offset dll_update_at_~data)) |#memory_int|))} {2858#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} #129#return; {2890#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:15:46,961 INFO L273 TraceCheckUtils]: 39: Hoare triple {2890#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2890#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:15:46,961 INFO L273 TraceCheckUtils]: 40: Hoare triple {2890#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume !~bvslt32(~i~0, ~len~0); {2890#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:15:46,963 INFO L273 TraceCheckUtils]: 41: Hoare triple {2890#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} ~i~0 := 0bv32; {2900#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:15:46,964 INFO L273 TraceCheckUtils]: 42: Hoare triple {2900#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {2904#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:15:46,966 INFO L256 TraceCheckUtils]: 43: Hoare triple {2904#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {2908#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:46,968 INFO L273 TraceCheckUtils]: 44: Hoare triple {2908#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2912#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base))} is VALID [2018-11-23 11:15:46,970 INFO L273 TraceCheckUtils]: 45: Hoare triple {2912#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base))} assume !~bvsgt32(~index, 0bv32); {2912#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base))} is VALID [2018-11-23 11:15:46,971 INFO L273 TraceCheckUtils]: 46: Hoare triple {2912#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base))} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {2919#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_get_data_at_#res| (select (select |#memory_int| |dll_get_data_at_#in~head.base|) |dll_get_data_at_#in~head.offset|)))} is VALID [2018-11-23 11:15:46,972 INFO L273 TraceCheckUtils]: 47: Hoare triple {2919#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_get_data_at_#res| (select (select |#memory_int| |dll_get_data_at_#in~head.base|) |dll_get_data_at_#in~head.offset|)))} assume true; {2919#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_get_data_at_#res| (select (select |#memory_int| |dll_get_data_at_#in~head.base|) |dll_get_data_at_#in~head.offset|)))} is VALID [2018-11-23 11:15:46,973 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {2919#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_get_data_at_#res| (select (select |#memory_int| |dll_get_data_at_#in~head.base|) |dll_get_data_at_#in~head.offset|)))} {2904#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #131#return; {2926#(and (= (bvadd |main_#t~ret14| (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret14| main_~expected~0))} is VALID [2018-11-23 11:15:46,975 INFO L273 TraceCheckUtils]: 49: Hoare triple {2926#(and (= (bvadd |main_#t~ret14| (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret14| main_~expected~0))} assume ~expected~0 != #t~ret14;havoc #t~ret14; {2753#false} is VALID [2018-11-23 11:15:46,975 INFO L273 TraceCheckUtils]: 50: Hoare triple {2753#false} assume !false; {2753#false} is VALID [2018-11-23 11:15:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 11:15:46,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:15:50,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:15:50,097 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:15:50,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:50,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:50,264 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:50,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:50,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:50,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 11:15:50,272 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:50,272 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_40|]. (= |#valid| (store |v_#valid_40| dll_create_~new_head~0.base (_ bv1 1))) [2018-11-23 11:15:50,273 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base)) [2018-11-23 11:15:50,332 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:50,333 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:50,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 11:15:50,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:50,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:50,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-11-23 11:15:50,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-23 11:15:50,384 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:50,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:50,392 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:50,394 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:50,404 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:50,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:50,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:50,430 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2018-11-23 11:15:50,493 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 45 treesize of output 39 [2018-11-23 11:15:50,500 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 16 treesize of output 15 [2018-11-23 11:15:50,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:50,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:50,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:50,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-11-23 11:15:50,555 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:50,555 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_60|, dll_create_~head~0.offset]. (let ((.cse1 (select |v_#memory_$Pointer$.base_60| dll_create_~new_head~0.base))) (let ((.cse0 (select .cse1 (bvadd dll_create_~new_head~0.offset (_ bv4 32))))) (and (= (_ bv0 32) dll_create_~new_head~0.offset) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_60| .cse0 (store (select |v_#memory_$Pointer$.base_60| .cse0) (bvadd dll_create_~head~0.offset (_ bv8 32)) dll_create_~new_head~0.base))) (not (= .cse0 dll_create_~new_head~0.base)) (= (_ bv0 32) (select .cse1 (bvadd dll_create_~new_head~0.offset (_ bv8 32))))))) [2018-11-23 11:15:50,556 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [dll_create_~head~0.offset]. (let ((.cse1 (select |#memory_$Pointer$.base| dll_create_~new_head~0.base))) (let ((.cse0 (select .cse1 (bvadd dll_create_~new_head~0.offset (_ bv4 32))))) (and (= (_ bv0 32) dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base .cse0)) (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| .cse0) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) (select .cse1 (bvadd dll_create_~new_head~0.offset (_ bv8 32))))))) [2018-11-23 11:15:50,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:15:50,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:15:50,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:50,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:50,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:50,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-23 11:15:50,889 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 44 treesize of output 38 [2018-11-23 11:15:50,929 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:50,932 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, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-11-23 11:15:50,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:50,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:50,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:50,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:44 [2018-11-23 11:15:51,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:15:51,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-11-23 11:15:51,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 11:15:51,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:51,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:51,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-11-23 11:15:51,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 11:15:51,250 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:51,267 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:15:51,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-11-23 11:15:51,277 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:51,290 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:15:51,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:51,313 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:67, output treesize:16 [2018-11-23 11:15:51,328 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:51,329 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#memory_$Pointer$.base)_AFTER_CALL_25|, |v_#memory_int_BEFORE_CALL_6|, dll_update_at_~head.offset, dll_update_at_~data, v_subst_1]. (let ((.cse1 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_25| main_~s~0.base))) (let ((.cse0 (select .cse1 (_ bv4 32)))) (and (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_25| .cse0) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base) (= main_~s~0.offset (_ bv0 32)) (= (_ bv0 32) (select .cse1 (_ bv8 32))) (not (= .cse0 main_~s~0.base)) (= (let ((.cse2 (select .cse1 (bvadd main_~s~0.offset (_ bv4 32))))) (store |v_#memory_int_BEFORE_CALL_6| .cse2 (store (select |v_#memory_int_BEFORE_CALL_6| .cse2) dll_update_at_~head.offset dll_update_at_~data))) |#memory_int|) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |v_#memory_int_BEFORE_CALL_6| main_~s~0.base) main_~s~0.offset) main_~len~0)))) [2018-11-23 11:15:51,329 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) [2018-11-23 11:15:53,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-11-23 11:15:53,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-23 11:15:53,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:53,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:53,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:53,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2018-11-23 11:15:53,717 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:53,717 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~s~0.base, v_main_~s~0.base_BEFORE_CALL_3]. (let ((.cse0 (select (select |#memory_int| main_~s~0.base) (_ bv0 32)))) (and (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv2 32) .cse0) (= main_~expected~0 .cse0) (= |main_#t~ret14| .cse0))) [2018-11-23 11:15:53,718 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~ret14| main_~expected~0) (= |main_#t~ret14| (_ bv2 32))) [2018-11-23 11:15:53,719 INFO L256 TraceCheckUtils]: 0: Hoare triple {2752#true} call ULTIMATE.init(); {2752#true} is VALID [2018-11-23 11:15:53,719 INFO L273 TraceCheckUtils]: 1: Hoare triple {2752#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2752#true} is VALID [2018-11-23 11:15:53,719 INFO L273 TraceCheckUtils]: 2: Hoare triple {2752#true} assume true; {2752#true} is VALID [2018-11-23 11:15:53,719 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2752#true} {2752#true} #137#return; {2752#true} is VALID [2018-11-23 11:15:53,719 INFO L256 TraceCheckUtils]: 4: Hoare triple {2752#true} call #t~ret15 := main(); {2752#true} is VALID [2018-11-23 11:15:53,724 INFO L273 TraceCheckUtils]: 5: Hoare triple {2752#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2772#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:53,725 INFO L256 TraceCheckUtils]: 6: Hoare triple {2772#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {2752#true} is VALID [2018-11-23 11:15:53,725 INFO L273 TraceCheckUtils]: 7: Hoare triple {2752#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2752#true} is VALID [2018-11-23 11:15:53,727 INFO L273 TraceCheckUtils]: 8: Hoare triple {2752#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; {2782#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} is VALID [2018-11-23 11:15:53,728 INFO L273 TraceCheckUtils]: 9: Hoare triple {2782#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2782#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} is VALID [2018-11-23 11:15:53,728 INFO L273 TraceCheckUtils]: 10: Hoare triple {2782#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {2782#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} is VALID [2018-11-23 11:15:53,729 INFO L273 TraceCheckUtils]: 11: Hoare triple {2782#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {2782#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} is VALID [2018-11-23 11:15:53,730 INFO L273 TraceCheckUtils]: 12: Hoare triple {2782#(= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))} ~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; {2795#(= (bvadd (select |#valid| dll_create_~head~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:15:53,731 INFO L273 TraceCheckUtils]: 13: Hoare triple {2795#(= (bvadd (select |#valid| dll_create_~head~0.base) (_ bv1 1)) (_ bv0 1))} 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; {2799#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} is VALID [2018-11-23 11:15:53,731 INFO L273 TraceCheckUtils]: 14: Hoare triple {2799#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2799#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} is VALID [2018-11-23 11:15:53,734 INFO L273 TraceCheckUtils]: 15: Hoare triple {2799#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {2806#(and (= (_ bv0 32) dll_create_~new_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) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))))} is VALID [2018-11-23 11:15:53,737 INFO L273 TraceCheckUtils]: 16: Hoare triple {2806#(and (= (_ bv0 32) dll_create_~new_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) (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))))} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {2810#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (exists ((dll_create_~head~0.offset (_ BitVec 32))) (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (bvadd dll_create_~head~0.offset (_ bv8 32))))) (not (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_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)))))} is VALID [2018-11-23 11:15:53,740 INFO L273 TraceCheckUtils]: 17: Hoare triple {2810#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (exists ((dll_create_~head~0.offset (_ BitVec 32))) (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (bvadd dll_create_~head~0.offset (_ bv8 32))))) (not (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_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)))))} ~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; {2814#(and (= (_ 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) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) dll_create_~head~0.base)))} is VALID [2018-11-23 11:15:53,742 INFO L273 TraceCheckUtils]: 18: Hoare triple {2814#(and (= (_ 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) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) dll_create_~head~0.base)))} assume !~bvsgt32(~len, 0bv32); {2814#(and (= (_ 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) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) dll_create_~head~0.base)))} is VALID [2018-11-23 11:15:53,744 INFO L273 TraceCheckUtils]: 19: Hoare triple {2814#(and (= (_ 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) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) dll_create_~head~0.base)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2821#(and (= |dll_create_#res.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) |dll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} is VALID [2018-11-23 11:15:53,746 INFO L273 TraceCheckUtils]: 20: Hoare triple {2821#(and (= |dll_create_#res.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) |dll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} assume true; {2821#(and (= |dll_create_#res.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) |dll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} is VALID [2018-11-23 11:15:53,749 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2821#(and (= |dll_create_#res.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) |dll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} {2772#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #127#return; {2828#(and (not (= |main_#t~ret11.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv4 32))))) (= |main_#t~ret11.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) |main_#t~ret11.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv8 32)))))} is VALID [2018-11-23 11:15:53,751 INFO L273 TraceCheckUtils]: 22: Hoare triple {2828#(and (not (= |main_#t~ret11.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv4 32))))) (= |main_#t~ret11.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) |main_#t~ret11.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (bvadd |main_#t~ret11.offset| (_ bv8 32)))))} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {2832#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-23 11:15:53,752 INFO L273 TraceCheckUtils]: 23: Hoare triple {2832#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2836#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-23 11:15:53,753 INFO L256 TraceCheckUtils]: 24: Hoare triple {2836#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2840#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-23 11:15:53,754 INFO L273 TraceCheckUtils]: 25: Hoare triple {2840#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2844#(and (= dll_update_at_~data |dll_update_at_#in~data|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} is VALID [2018-11-23 11:15:53,755 INFO L273 TraceCheckUtils]: 26: Hoare triple {2844#(and (= dll_update_at_~data |dll_update_at_#in~data|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} assume !~bvsgt32(~index, 0bv32); {2844#(and (= dll_update_at_~data |dll_update_at_#in~data|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} is VALID [2018-11-23 11:15:53,757 INFO L273 TraceCheckUtils]: 27: Hoare triple {2844#(and (= dll_update_at_~data |dll_update_at_#in~data|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2851#(and (= (select (select |#memory_int| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|) |dll_update_at_#in~data|) (= (store |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|))) |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:15:53,758 INFO L273 TraceCheckUtils]: 28: Hoare triple {2851#(and (= (select (select |#memory_int| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|) |dll_update_at_#in~data|) (= (store |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|))) |#memory_$Pointer$.base|))} assume true; {2851#(and (= (select (select |#memory_int| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|) |dll_update_at_#in~data|) (= (store |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|))) |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:15:53,764 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2851#(and (= (select (select |#memory_int| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|) |dll_update_at_#in~data|) (= (store |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |dll_update_at_#in~head.base|) |dll_update_at_#in~head.offset|))) |#memory_$Pointer$.base|))} {2836#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} #129#return; {2858#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-23 11:15:53,765 INFO L273 TraceCheckUtils]: 30: Hoare triple {2858#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2858#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-23 11:15:53,766 INFO L273 TraceCheckUtils]: 31: Hoare triple {2858#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2858#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} is VALID [2018-11-23 11:15:53,768 INFO L256 TraceCheckUtils]: 32: Hoare triple {2858#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} call dll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2868#(and (= |old(#memory_int)| |#memory_int|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:15:53,768 INFO L273 TraceCheckUtils]: 33: Hoare triple {2868#(and (= |old(#memory_int)| |#memory_int|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2872#(and (= |old(#memory_int)| |#memory_int|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} is VALID [2018-11-23 11:15:53,769 INFO L273 TraceCheckUtils]: 34: Hoare triple {2872#(and (= |old(#memory_int)| |#memory_int|) (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base))} assume !!~bvsgt32(~index, 0bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);~head.base, ~head.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;#t~post10 := ~index;~index := ~bvsub32(#t~post10, 1bv32);havoc #t~post10; {2876#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) dll_update_at_~head.base))} is VALID [2018-11-23 11:15:53,770 INFO L273 TraceCheckUtils]: 35: Hoare triple {2876#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) dll_update_at_~head.base))} assume !~bvsgt32(~index, 0bv32); {2876#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) dll_update_at_~head.base))} is VALID [2018-11-23 11:15:53,772 INFO L273 TraceCheckUtils]: 36: Hoare triple {2876#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) dll_update_at_~head.base))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2883#(exists ((dll_update_at_~head.offset (_ BitVec 32)) (dll_update_at_~data (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) dll_update_at_~head.offset dll_update_at_~data)) |#memory_int|))} is VALID [2018-11-23 11:15:53,773 INFO L273 TraceCheckUtils]: 37: Hoare triple {2883#(exists ((dll_update_at_~head.offset (_ BitVec 32)) (dll_update_at_~data (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) dll_update_at_~head.offset dll_update_at_~data)) |#memory_int|))} assume true; {2883#(exists ((dll_update_at_~head.offset (_ BitVec 32)) (dll_update_at_~data (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) dll_update_at_~head.offset dll_update_at_~data)) |#memory_int|))} is VALID [2018-11-23 11:15:53,777 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2883#(exists ((dll_update_at_~head.offset (_ BitVec 32)) (dll_update_at_~data (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) dll_update_at_~head.offset dll_update_at_~data)) |#memory_int|))} {2858#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv8 32))))} #129#return; {2890#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:15:53,778 INFO L273 TraceCheckUtils]: 39: Hoare triple {2890#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2890#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:15:53,779 INFO L273 TraceCheckUtils]: 40: Hoare triple {2890#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume !~bvslt32(~i~0, ~len~0); {2890#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:15:53,779 INFO L273 TraceCheckUtils]: 41: Hoare triple {2890#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} ~i~0 := 0bv32; {2900#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:15:53,780 INFO L273 TraceCheckUtils]: 42: Hoare triple {2900#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {2904#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:15:53,782 INFO L256 TraceCheckUtils]: 43: Hoare triple {2904#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {2908#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:53,783 INFO L273 TraceCheckUtils]: 44: Hoare triple {2908#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2912#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base))} is VALID [2018-11-23 11:15:53,784 INFO L273 TraceCheckUtils]: 45: Hoare triple {2912#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base))} assume !~bvsgt32(~index, 0bv32); {2912#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base))} is VALID [2018-11-23 11:15:53,785 INFO L273 TraceCheckUtils]: 46: Hoare triple {2912#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base))} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {2919#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_get_data_at_#res| (select (select |#memory_int| |dll_get_data_at_#in~head.base|) |dll_get_data_at_#in~head.offset|)))} is VALID [2018-11-23 11:15:53,786 INFO L273 TraceCheckUtils]: 47: Hoare triple {2919#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_get_data_at_#res| (select (select |#memory_int| |dll_get_data_at_#in~head.base|) |dll_get_data_at_#in~head.offset|)))} assume true; {2919#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_get_data_at_#res| (select (select |#memory_int| |dll_get_data_at_#in~head.base|) |dll_get_data_at_#in~head.offset|)))} is VALID [2018-11-23 11:15:53,789 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {2919#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |dll_get_data_at_#res| (select (select |#memory_int| |dll_get_data_at_#in~head.base|) |dll_get_data_at_#in~head.offset|)))} {2904#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #131#return; {2926#(and (= (bvadd |main_#t~ret14| (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret14| main_~expected~0))} is VALID [2018-11-23 11:15:53,790 INFO L273 TraceCheckUtils]: 49: Hoare triple {2926#(and (= (bvadd |main_#t~ret14| (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret14| main_~expected~0))} assume ~expected~0 != #t~ret14;havoc #t~ret14; {2753#false} is VALID [2018-11-23 11:15:53,790 INFO L273 TraceCheckUtils]: 50: Hoare triple {2753#false} assume !false; {2753#false} is VALID [2018-11-23 11:15:53,804 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 11:15:53,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:15:56,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:15:56,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-11-23 11:15:56,452 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2018-11-23 11:15:56,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:56,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:15:56,661 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:56,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:15:56,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:15:56,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1027, Unknown=3, NotChecked=64, Total=1190 [2018-11-23 11:15:56,662 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 28 states. [2018-11-23 11:16:50,881 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-23 11:17:01,642 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-23 11:17:13,797 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40