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/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:18:33,933 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:18:33,936 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:18:33,948 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:18:33,948 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:18:33,949 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:18:33,951 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:18:33,954 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:18:33,956 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:18:33,957 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:18:33,958 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:18:33,958 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:18:33,959 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:18:33,960 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:18:33,961 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:18:33,962 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:18:33,963 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:18:33,965 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:18:33,967 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:18:33,969 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:18:33,970 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:18:33,971 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:18:33,974 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:18:33,974 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:18:33,975 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:18:33,976 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:18:33,977 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:18:33,977 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:18:33,978 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:18:33,980 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:18:33,980 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:18:33,981 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:18:33,981 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:18:33,981 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:18:33,982 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:18:33,983 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:18:33,983 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:18:33,999 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:18:33,999 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:18:34,000 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:18:34,000 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:18:34,001 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:18:34,001 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:18:34,001 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:18:34,002 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:18:34,002 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:18:34,002 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:18:34,002 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:18:34,002 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:18:34,003 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:18:34,003 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:18:34,003 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:18:34,003 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:18:34,003 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:18:34,004 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:18:34,004 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:18:34,004 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:18:34,004 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:18:34,004 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:18:34,005 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:18:34,005 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:18:34,005 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:18:34,005 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:18:34,005 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:18:34,006 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:18:34,006 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:18:34,006 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:18:34,006 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:18:34,006 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:18:34,006 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:18:34,052 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:18:34,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:18:34,069 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:18:34,070 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:18:34,071 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:18:34,071 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:18:34,135 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad58bd4da/ba3da475ff774cddbd3c15bb42768848/FLAG1451309ee [2018-11-23 11:18:34,716 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:18:34,717 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:18:34,732 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad58bd4da/ba3da475ff774cddbd3c15bb42768848/FLAG1451309ee [2018-11-23 11:18:35,003 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad58bd4da/ba3da475ff774cddbd3c15bb42768848 [2018-11-23 11:18:35,014 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:18:35,016 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:18:35,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:18:35,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:18:35,023 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:18:35,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:18:35" (1/1) ... [2018-11-23 11:18:35,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5c8908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:35, skipping insertion in model container [2018-11-23 11:18:35,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:18:35" (1/1) ... [2018-11-23 11:18:35,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:18:35,103 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:18:35,559 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:18:35,578 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:18:35,733 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:18:35,809 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:18:35,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:35 WrapperNode [2018-11-23 11:18:35,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:18:35,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:18:35,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:18:35,811 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:18:35,821 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:18:35" (1/1) ... [2018-11-23 11:18:35,855 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:18:35" (1/1) ... [2018-11-23 11:18:35,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:18:35,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:18:35,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:18:35,873 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:18:35,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:35" (1/1) ... [2018-11-23 11:18:35,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:35" (1/1) ... [2018-11-23 11:18:35,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:35" (1/1) ... [2018-11-23 11:18:35,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:35" (1/1) ... [2018-11-23 11:18:35,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:35" (1/1) ... [2018-11-23 11:18:35,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:35" (1/1) ... [2018-11-23 11:18:35,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:35" (1/1) ... [2018-11-23 11:18:35,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:18:35,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:18:35,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:18:35,968 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:18:35,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:35" (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:18:36,033 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-11-23 11:18:36,034 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-11-23 11:18:36,034 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 11:18:36,034 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 11:18:36,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:18:36,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:18:36,035 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-11-23 11:18:36,035 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-11-23 11:18:36,035 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:18:36,035 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:18:36,035 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 11:18:36,036 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 11:18:36,036 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 11:18:36,036 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 11:18:36,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:18:36,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:18:36,037 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:18:36,037 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:18:36,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:18:36,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:18:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:18:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:18:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:18:36,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:18:37,120 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:18:37,121 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 11:18:37,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:18:37 BoogieIcfgContainer [2018-11-23 11:18:37,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:18:37,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:18:37,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:18:37,126 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:18:37,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:18:35" (1/3) ... [2018-11-23 11:18:37,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7039e0b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:18:37, skipping insertion in model container [2018-11-23 11:18:37,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:35" (2/3) ... [2018-11-23 11:18:37,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7039e0b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:18:37, skipping insertion in model container [2018-11-23 11:18:37,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:18:37" (3/3) ... [2018-11-23 11:18:37,130 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:18:37,141 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:18:37,151 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:18:37,170 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:18:37,211 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:18:37,212 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:18:37,213 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:18:37,213 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:18:37,213 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:18:37,213 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:18:37,213 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:18:37,213 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:18:37,213 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:18:37,233 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-23 11:18:37,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:18:37,241 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:18:37,242 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:18:37,244 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:18:37,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:18:37,254 INFO L82 PathProgramCache]: Analyzing trace with hash 197480979, now seen corresponding path program 1 times [2018-11-23 11:18:37,259 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:18:37,260 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:18:37,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:18:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:18:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:18:37,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:18:37,711 INFO L256 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {57#true} is VALID [2018-11-23 11:18:37,715 INFO L273 TraceCheckUtils]: 1: Hoare triple {57#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {57#true} is VALID [2018-11-23 11:18:37,716 INFO L273 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-23 11:18:37,716 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #135#return; {57#true} is VALID [2018-11-23 11:18:37,716 INFO L256 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret15 := main(); {57#true} is VALID [2018-11-23 11:18:37,717 INFO L273 TraceCheckUtils]: 5: Hoare triple {57#true} ~len~0 := 2bv32;~data~0 := 1bv32; {77#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:37,718 INFO L256 TraceCheckUtils]: 6: Hoare triple {77#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {57#true} is VALID [2018-11-23 11:18:37,719 INFO L273 TraceCheckUtils]: 7: Hoare triple {57#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {84#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:18:37,720 INFO L273 TraceCheckUtils]: 8: Hoare triple {84#(= |sll_create_#in~len| sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {88#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:18:37,725 INFO L273 TraceCheckUtils]: 9: Hoare triple {88#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {88#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:18:37,742 INFO L273 TraceCheckUtils]: 10: Hoare triple {88#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {88#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:18:37,753 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {88#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {77#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #125#return; {58#false} is VALID [2018-11-23 11:18:37,753 INFO L273 TraceCheckUtils]: 12: Hoare triple {58#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 := ~bvsub32(~len~0, 1bv32); {58#false} is VALID [2018-11-23 11:18:37,754 INFO L273 TraceCheckUtils]: 13: Hoare triple {58#false} assume !~bvsge32(~i~0, 0bv32); {58#false} is VALID [2018-11-23 11:18:37,754 INFO L273 TraceCheckUtils]: 14: Hoare triple {58#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {58#false} is VALID [2018-11-23 11:18:37,754 INFO L273 TraceCheckUtils]: 15: Hoare triple {58#false} assume !!~bvsge32(~i~0, 0bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {58#false} is VALID [2018-11-23 11:18:37,755 INFO L256 TraceCheckUtils]: 16: Hoare triple {58#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {58#false} is VALID [2018-11-23 11:18:37,755 INFO L273 TraceCheckUtils]: 17: Hoare triple {58#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {58#false} is VALID [2018-11-23 11:18:37,755 INFO L273 TraceCheckUtils]: 18: Hoare triple {58#false} assume !~bvsgt32(~index, 0bv32); {58#false} is VALID [2018-11-23 11:18:37,756 INFO L273 TraceCheckUtils]: 19: Hoare triple {58#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {58#false} is VALID [2018-11-23 11:18:37,756 INFO L273 TraceCheckUtils]: 20: Hoare triple {58#false} assume true; {58#false} is VALID [2018-11-23 11:18:37,757 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {58#false} {58#false} #129#return; {58#false} is VALID [2018-11-23 11:18:37,757 INFO L273 TraceCheckUtils]: 22: Hoare triple {58#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {58#false} is VALID [2018-11-23 11:18:37,757 INFO L273 TraceCheckUtils]: 23: Hoare triple {58#false} assume !false; {58#false} is VALID [2018-11-23 11:18:37,763 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:18:37,764 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:18:37,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:18:37,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:18:37,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 11:18:37,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:18:37,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:18:38,009 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:18:38,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:18:38,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:18:38,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:18:38,025 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 5 states. [2018-11-23 11:18:39,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:18:39,495 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2018-11-23 11:18:39,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:18:39,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 11:18:39,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:18:39,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:18:39,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2018-11-23 11:18:39,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:18:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2018-11-23 11:18:39,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 124 transitions. [2018-11-23 11:18:39,882 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:18:39,898 INFO L225 Difference]: With dead ends: 95 [2018-11-23 11:18:39,898 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:18:39,902 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:18:39,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:18:40,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-23 11:18:40,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:18:40,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 42 states. [2018-11-23 11:18:40,112 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 42 states. [2018-11-23 11:18:40,112 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 42 states. [2018-11-23 11:18:40,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:18:40,119 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-23 11:18:40,119 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-23 11:18:40,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:18:40,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:18:40,121 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 45 states. [2018-11-23 11:18:40,121 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 45 states. [2018-11-23 11:18:40,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:18:40,127 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-23 11:18:40,127 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-23 11:18:40,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:18:40,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:18:40,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:18:40,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:18:40,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:18:40,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-23 11:18:40,137 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 24 [2018-11-23 11:18:40,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:18:40,138 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-23 11:18:40,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:18:40,138 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-23 11:18:40,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:18:40,140 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:18:40,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:18:40,140 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:18:40,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:18:40,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2132511215, now seen corresponding path program 1 times [2018-11-23 11:18:40,142 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:18:40,142 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:18:40,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:18:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:18:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:18:40,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:18:40,387 INFO L256 TraceCheckUtils]: 0: Hoare triple {419#true} call ULTIMATE.init(); {419#true} is VALID [2018-11-23 11:18:40,387 INFO L273 TraceCheckUtils]: 1: Hoare triple {419#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {419#true} is VALID [2018-11-23 11:18:40,388 INFO L273 TraceCheckUtils]: 2: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-23 11:18:40,388 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {419#true} {419#true} #135#return; {419#true} is VALID [2018-11-23 11:18:40,389 INFO L256 TraceCheckUtils]: 4: Hoare triple {419#true} call #t~ret15 := main(); {419#true} is VALID [2018-11-23 11:18:40,390 INFO L273 TraceCheckUtils]: 5: Hoare triple {419#true} ~len~0 := 2bv32;~data~0 := 1bv32; {439#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:40,390 INFO L256 TraceCheckUtils]: 6: Hoare triple {439#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {419#true} is VALID [2018-11-23 11:18:40,390 INFO L273 TraceCheckUtils]: 7: Hoare triple {419#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {446#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:18:40,391 INFO L273 TraceCheckUtils]: 8: Hoare triple {446#(= |sll_create_#in~len| sll_create_~len)} assume !!~bvsgt32(~len, 0bv32); {446#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:18:40,391 INFO L256 TraceCheckUtils]: 9: Hoare triple {446#(= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {419#true} is VALID [2018-11-23 11:18:40,391 INFO L273 TraceCheckUtils]: 10: Hoare triple {419#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {419#true} is VALID [2018-11-23 11:18:40,392 INFO L273 TraceCheckUtils]: 11: Hoare triple {419#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {419#true} is VALID [2018-11-23 11:18:40,392 INFO L273 TraceCheckUtils]: 12: Hoare triple {419#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {419#true} is VALID [2018-11-23 11:18:40,393 INFO L273 TraceCheckUtils]: 13: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-23 11:18:40,396 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {419#true} {446#(= |sll_create_#in~len| sll_create_~len)} #133#return; {446#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:18:40,397 INFO L273 TraceCheckUtils]: 15: Hoare triple {446#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {446#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:18:40,398 INFO L273 TraceCheckUtils]: 16: Hoare triple {446#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {474#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:18:40,402 INFO L273 TraceCheckUtils]: 17: Hoare triple {474#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:18:40,403 INFO L273 TraceCheckUtils]: 18: Hoare triple {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:18:40,403 INFO L273 TraceCheckUtils]: 19: Hoare triple {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:18:40,418 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {439#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #125#return; {420#false} is VALID [2018-11-23 11:18:40,418 INFO L273 TraceCheckUtils]: 21: Hoare triple {420#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 := ~bvsub32(~len~0, 1bv32); {420#false} is VALID [2018-11-23 11:18:40,419 INFO L273 TraceCheckUtils]: 22: Hoare triple {420#false} assume !~bvsge32(~i~0, 0bv32); {420#false} is VALID [2018-11-23 11:18:40,419 INFO L273 TraceCheckUtils]: 23: Hoare triple {420#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {420#false} is VALID [2018-11-23 11:18:40,419 INFO L273 TraceCheckUtils]: 24: Hoare triple {420#false} assume !!~bvsge32(~i~0, 0bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {420#false} is VALID [2018-11-23 11:18:40,420 INFO L256 TraceCheckUtils]: 25: Hoare triple {420#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {420#false} is VALID [2018-11-23 11:18:40,420 INFO L273 TraceCheckUtils]: 26: Hoare triple {420#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {420#false} is VALID [2018-11-23 11:18:40,420 INFO L273 TraceCheckUtils]: 27: Hoare triple {420#false} assume !~bvsgt32(~index, 0bv32); {420#false} is VALID [2018-11-23 11:18:40,421 INFO L273 TraceCheckUtils]: 28: Hoare triple {420#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {420#false} is VALID [2018-11-23 11:18:40,421 INFO L273 TraceCheckUtils]: 29: Hoare triple {420#false} assume true; {420#false} is VALID [2018-11-23 11:18:40,421 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {420#false} {420#false} #129#return; {420#false} is VALID [2018-11-23 11:18:40,422 INFO L273 TraceCheckUtils]: 31: Hoare triple {420#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {420#false} is VALID [2018-11-23 11:18:40,422 INFO L273 TraceCheckUtils]: 32: Hoare triple {420#false} assume !false; {420#false} is VALID [2018-11-23 11:18:40,425 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:18:40,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:18:40,829 INFO L273 TraceCheckUtils]: 32: Hoare triple {420#false} assume !false; {420#false} is VALID [2018-11-23 11:18:40,830 INFO L273 TraceCheckUtils]: 31: Hoare triple {420#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {420#false} is VALID [2018-11-23 11:18:40,830 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {419#true} {420#false} #129#return; {420#false} is VALID [2018-11-23 11:18:40,831 INFO L273 TraceCheckUtils]: 29: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-23 11:18:40,831 INFO L273 TraceCheckUtils]: 28: Hoare triple {419#true} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {419#true} is VALID [2018-11-23 11:18:40,832 INFO L273 TraceCheckUtils]: 27: Hoare triple {419#true} assume !~bvsgt32(~index, 0bv32); {419#true} is VALID [2018-11-23 11:18:40,832 INFO L273 TraceCheckUtils]: 26: Hoare triple {419#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {419#true} is VALID [2018-11-23 11:18:40,832 INFO L256 TraceCheckUtils]: 25: Hoare triple {420#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {419#true} is VALID [2018-11-23 11:18:40,833 INFO L273 TraceCheckUtils]: 24: Hoare triple {420#false} assume !!~bvsge32(~i~0, 0bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {420#false} is VALID [2018-11-23 11:18:40,833 INFO L273 TraceCheckUtils]: 23: Hoare triple {420#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {420#false} is VALID [2018-11-23 11:18:40,833 INFO L273 TraceCheckUtils]: 22: Hoare triple {420#false} assume !~bvsge32(~i~0, 0bv32); {420#false} is VALID [2018-11-23 11:18:40,833 INFO L273 TraceCheckUtils]: 21: Hoare triple {420#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 := ~bvsub32(~len~0, 1bv32); {420#false} is VALID [2018-11-23 11:18:40,838 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {560#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} #125#return; {420#false} is VALID [2018-11-23 11:18:40,840 INFO L273 TraceCheckUtils]: 19: Hoare triple {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:18:40,842 INFO L273 TraceCheckUtils]: 18: Hoare triple {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:18:40,842 INFO L273 TraceCheckUtils]: 17: Hoare triple {573#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:18:40,845 INFO L273 TraceCheckUtils]: 16: Hoare triple {577#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {573#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:18:40,851 INFO L273 TraceCheckUtils]: 15: Hoare triple {577#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {577#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:18:40,854 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {419#true} {577#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #133#return; {577#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:18:40,854 INFO L273 TraceCheckUtils]: 13: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-23 11:18:40,855 INFO L273 TraceCheckUtils]: 12: Hoare triple {419#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {419#true} is VALID [2018-11-23 11:18:40,855 INFO L273 TraceCheckUtils]: 11: Hoare triple {419#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {419#true} is VALID [2018-11-23 11:18:40,855 INFO L273 TraceCheckUtils]: 10: Hoare triple {419#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {419#true} is VALID [2018-11-23 11:18:40,856 INFO L256 TraceCheckUtils]: 9: Hoare triple {577#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {419#true} is VALID [2018-11-23 11:18:40,857 INFO L273 TraceCheckUtils]: 8: Hoare triple {577#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsgt32(~len, 0bv32); {577#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:18:40,861 INFO L273 TraceCheckUtils]: 7: Hoare triple {419#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {577#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:18:40,861 INFO L256 TraceCheckUtils]: 6: Hoare triple {560#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {419#true} is VALID [2018-11-23 11:18:40,880 INFO L273 TraceCheckUtils]: 5: Hoare triple {419#true} ~len~0 := 2bv32;~data~0 := 1bv32; {560#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:40,880 INFO L256 TraceCheckUtils]: 4: Hoare triple {419#true} call #t~ret15 := main(); {419#true} is VALID [2018-11-23 11:18:40,881 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {419#true} {419#true} #135#return; {419#true} is VALID [2018-11-23 11:18:40,881 INFO L273 TraceCheckUtils]: 2: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-23 11:18:40,881 INFO L273 TraceCheckUtils]: 1: Hoare triple {419#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {419#true} is VALID [2018-11-23 11:18:40,882 INFO L256 TraceCheckUtils]: 0: Hoare triple {419#true} call ULTIMATE.init(); {419#true} is VALID [2018-11-23 11:18:40,885 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:18:40,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:18:40,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 11:18:40,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-23 11:18:40,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:18:40,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:18:41,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:18:41,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:18:41,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:18:41,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:18:41,011 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 9 states. [2018-11-23 11:18:42,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:18:42,174 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-11-23 11:18:42,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:18:42,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-23 11:18:42,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:18:42,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:18:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2018-11-23 11:18:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:18:42,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2018-11-23 11:18:42,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 83 transitions. [2018-11-23 11:18:42,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:18:42,349 INFO L225 Difference]: With dead ends: 73 [2018-11-23 11:18:42,350 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 11:18:42,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:18:42,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 11:18:42,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-11-23 11:18:42,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:18:42,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 46 states. [2018-11-23 11:18:42,383 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 46 states. [2018-11-23 11:18:42,383 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 46 states. [2018-11-23 11:18:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:18:42,387 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-23 11:18:42,387 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-23 11:18:42,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:18:42,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:18:42,388 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 49 states. [2018-11-23 11:18:42,389 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 49 states. [2018-11-23 11:18:42,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:18:42,393 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-23 11:18:42,393 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-23 11:18:42,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:18:42,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:18:42,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:18:42,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:18:42,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:18:42,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-11-23 11:18:42,398 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 33 [2018-11-23 11:18:42,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:18:42,398 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-11-23 11:18:42,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:18:42,399 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 11:18:42,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 11:18:42,400 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:18:42,401 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:18:42,401 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:18:42,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:18:42,401 INFO L82 PathProgramCache]: Analyzing trace with hash -906301485, now seen corresponding path program 2 times [2018-11-23 11:18:42,402 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:18:42,403 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:18:42,424 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:18:42,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:18:42,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:18:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:18:42,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:18:42,654 INFO L256 TraceCheckUtils]: 0: Hoare triple {898#true} call ULTIMATE.init(); {898#true} is VALID [2018-11-23 11:18:42,655 INFO L273 TraceCheckUtils]: 1: Hoare triple {898#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {898#true} is VALID [2018-11-23 11:18:42,655 INFO L273 TraceCheckUtils]: 2: Hoare triple {898#true} assume true; {898#true} is VALID [2018-11-23 11:18:42,656 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {898#true} {898#true} #135#return; {898#true} is VALID [2018-11-23 11:18:42,656 INFO L256 TraceCheckUtils]: 4: Hoare triple {898#true} call #t~ret15 := main(); {898#true} is VALID [2018-11-23 11:18:42,657 INFO L273 TraceCheckUtils]: 5: Hoare triple {898#true} ~len~0 := 2bv32;~data~0 := 1bv32; {918#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:42,657 INFO L256 TraceCheckUtils]: 6: Hoare triple {918#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {898#true} is VALID [2018-11-23 11:18:42,658 INFO L273 TraceCheckUtils]: 7: Hoare triple {898#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {898#true} is VALID [2018-11-23 11:18:42,658 INFO L273 TraceCheckUtils]: 8: Hoare triple {898#true} assume !!~bvsgt32(~len, 0bv32); {898#true} is VALID [2018-11-23 11:18:42,658 INFO L256 TraceCheckUtils]: 9: Hoare triple {898#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {898#true} is VALID [2018-11-23 11:18:42,658 INFO L273 TraceCheckUtils]: 10: Hoare triple {898#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {898#true} is VALID [2018-11-23 11:18:42,659 INFO L273 TraceCheckUtils]: 11: Hoare triple {898#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {898#true} is VALID [2018-11-23 11:18:42,659 INFO L273 TraceCheckUtils]: 12: Hoare triple {898#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {898#true} is VALID [2018-11-23 11:18:42,659 INFO L273 TraceCheckUtils]: 13: Hoare triple {898#true} assume true; {898#true} is VALID [2018-11-23 11:18:42,660 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {898#true} {898#true} #133#return; {898#true} is VALID [2018-11-23 11:18:42,660 INFO L273 TraceCheckUtils]: 15: Hoare triple {898#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {898#true} is VALID [2018-11-23 11:18:42,661 INFO L273 TraceCheckUtils]: 16: Hoare triple {898#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {898#true} is VALID [2018-11-23 11:18:42,661 INFO L273 TraceCheckUtils]: 17: Hoare triple {898#true} assume !!~bvsgt32(~len, 0bv32); {898#true} is VALID [2018-11-23 11:18:42,662 INFO L256 TraceCheckUtils]: 18: Hoare triple {898#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {898#true} is VALID [2018-11-23 11:18:42,662 INFO L273 TraceCheckUtils]: 19: Hoare triple {898#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {898#true} is VALID [2018-11-23 11:18:42,662 INFO L273 TraceCheckUtils]: 20: Hoare triple {898#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {898#true} is VALID [2018-11-23 11:18:42,663 INFO L273 TraceCheckUtils]: 21: Hoare triple {898#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {898#true} is VALID [2018-11-23 11:18:42,663 INFO L273 TraceCheckUtils]: 22: Hoare triple {898#true} assume true; {898#true} is VALID [2018-11-23 11:18:42,663 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {898#true} {898#true} #133#return; {898#true} is VALID [2018-11-23 11:18:42,664 INFO L273 TraceCheckUtils]: 24: Hoare triple {898#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {898#true} is VALID [2018-11-23 11:18:42,664 INFO L273 TraceCheckUtils]: 25: Hoare triple {898#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {898#true} is VALID [2018-11-23 11:18:42,664 INFO L273 TraceCheckUtils]: 26: Hoare triple {898#true} assume !~bvsgt32(~len, 0bv32); {898#true} is VALID [2018-11-23 11:18:42,665 INFO L273 TraceCheckUtils]: 27: Hoare triple {898#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {898#true} is VALID [2018-11-23 11:18:42,665 INFO L273 TraceCheckUtils]: 28: Hoare triple {898#true} assume true; {898#true} is VALID [2018-11-23 11:18:42,668 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {898#true} {918#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #125#return; {918#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:42,668 INFO L273 TraceCheckUtils]: 30: Hoare triple {918#(= (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 := ~bvsub32(~len~0, 1bv32); {918#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:42,685 INFO L273 TraceCheckUtils]: 31: Hoare triple {918#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume !~bvsge32(~i~0, 0bv32); {918#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:42,686 INFO L273 TraceCheckUtils]: 32: Hoare triple {918#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~i~0 := ~bvsub32(~len~0, 1bv32); {1000#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:42,687 INFO L273 TraceCheckUtils]: 33: Hoare triple {1000#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsge32(~i~0, 0bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {1000#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:42,687 INFO L256 TraceCheckUtils]: 34: Hoare triple {1000#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {898#true} is VALID [2018-11-23 11:18:42,688 INFO L273 TraceCheckUtils]: 35: Hoare triple {898#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1010#(= |sll_get_data_at_#in~index| sll_get_data_at_~index)} is VALID [2018-11-23 11:18:42,690 INFO L273 TraceCheckUtils]: 36: Hoare triple {1010#(= |sll_get_data_at_#in~index| sll_get_data_at_~index)} assume !~bvsgt32(~index, 0bv32); {1014#(not (bvsgt |sll_get_data_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:18:42,692 INFO L273 TraceCheckUtils]: 37: Hoare triple {1014#(not (bvsgt |sll_get_data_at_#in~index| (_ bv0 32)))} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {1014#(not (bvsgt |sll_get_data_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:18:42,695 INFO L273 TraceCheckUtils]: 38: Hoare triple {1014#(not (bvsgt |sll_get_data_at_#in~index| (_ bv0 32)))} assume true; {1014#(not (bvsgt |sll_get_data_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:18:42,697 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1014#(not (bvsgt |sll_get_data_at_#in~index| (_ bv0 32)))} {1000#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #129#return; {899#false} is VALID [2018-11-23 11:18:42,697 INFO L273 TraceCheckUtils]: 40: Hoare triple {899#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {899#false} is VALID [2018-11-23 11:18:42,698 INFO L273 TraceCheckUtils]: 41: Hoare triple {899#false} assume !false; {899#false} is VALID [2018-11-23 11:18:42,701 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 11:18:42,702 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:18:42,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:18:42,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:18:42,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-11-23 11:18:42,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:18:42,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:18:42,809 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:18:42,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:18:42,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:18:42,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:18:42,811 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 6 states. [2018-11-23 11:18:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:18:43,536 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-11-23 11:18:43,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:18:43,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-11-23 11:18:43,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:18:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:18:43,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2018-11-23 11:18:43,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:18:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2018-11-23 11:18:43,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 76 transitions. [2018-11-23 11:18:43,746 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:18:43,750 INFO L225 Difference]: With dead ends: 71 [2018-11-23 11:18:43,750 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 11:18:43,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:18:43,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 11:18:43,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-11-23 11:18:43,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:18:43,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 53 states. [2018-11-23 11:18:43,854 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 53 states. [2018-11-23 11:18:43,854 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 53 states. [2018-11-23 11:18:43,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:18:43,858 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-11-23 11:18:43,859 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2018-11-23 11:18:43,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:18:43,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:18:43,860 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 59 states. [2018-11-23 11:18:43,860 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 59 states. [2018-11-23 11:18:43,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:18:43,865 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-11-23 11:18:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2018-11-23 11:18:43,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:18:43,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:18:43,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:18:43,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:18:43,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 11:18:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-11-23 11:18:43,870 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 42 [2018-11-23 11:18:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:18:43,871 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-11-23 11:18:43,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:18:43,871 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-11-23 11:18:43,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 11:18:43,873 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:18:43,873 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:18:43,873 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:18:43,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:18:43,874 INFO L82 PathProgramCache]: Analyzing trace with hash 36601123, now seen corresponding path program 1 times [2018-11-23 11:18:43,874 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:18:43,875 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:18:43,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:18:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:18:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:18:44,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:18:44,135 INFO L256 TraceCheckUtils]: 0: Hoare triple {1332#true} call ULTIMATE.init(); {1332#true} is VALID [2018-11-23 11:18:44,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {1332#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1332#true} is VALID [2018-11-23 11:18:44,136 INFO L273 TraceCheckUtils]: 2: Hoare triple {1332#true} assume true; {1332#true} is VALID [2018-11-23 11:18:44,136 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1332#true} {1332#true} #135#return; {1332#true} is VALID [2018-11-23 11:18:44,137 INFO L256 TraceCheckUtils]: 4: Hoare triple {1332#true} call #t~ret15 := main(); {1332#true} is VALID [2018-11-23 11:18:44,145 INFO L273 TraceCheckUtils]: 5: Hoare triple {1332#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1352#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:44,145 INFO L256 TraceCheckUtils]: 6: Hoare triple {1352#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1332#true} is VALID [2018-11-23 11:18:44,145 INFO L273 TraceCheckUtils]: 7: Hoare triple {1332#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1332#true} is VALID [2018-11-23 11:18:44,146 INFO L273 TraceCheckUtils]: 8: Hoare triple {1332#true} assume !!~bvsgt32(~len, 0bv32); {1332#true} is VALID [2018-11-23 11:18:44,146 INFO L256 TraceCheckUtils]: 9: Hoare triple {1332#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1332#true} is VALID [2018-11-23 11:18:44,146 INFO L273 TraceCheckUtils]: 10: Hoare triple {1332#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1332#true} is VALID [2018-11-23 11:18:44,146 INFO L273 TraceCheckUtils]: 11: Hoare triple {1332#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1332#true} is VALID [2018-11-23 11:18:44,146 INFO L273 TraceCheckUtils]: 12: Hoare triple {1332#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1332#true} is VALID [2018-11-23 11:18:44,147 INFO L273 TraceCheckUtils]: 13: Hoare triple {1332#true} assume true; {1332#true} is VALID [2018-11-23 11:18:44,147 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1332#true} {1332#true} #133#return; {1332#true} is VALID [2018-11-23 11:18:44,147 INFO L273 TraceCheckUtils]: 15: Hoare triple {1332#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1332#true} is VALID [2018-11-23 11:18:44,147 INFO L273 TraceCheckUtils]: 16: Hoare triple {1332#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1332#true} is VALID [2018-11-23 11:18:44,148 INFO L273 TraceCheckUtils]: 17: Hoare triple {1332#true} assume !!~bvsgt32(~len, 0bv32); {1332#true} is VALID [2018-11-23 11:18:44,148 INFO L256 TraceCheckUtils]: 18: Hoare triple {1332#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1332#true} is VALID [2018-11-23 11:18:44,148 INFO L273 TraceCheckUtils]: 19: Hoare triple {1332#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1332#true} is VALID [2018-11-23 11:18:44,148 INFO L273 TraceCheckUtils]: 20: Hoare triple {1332#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1332#true} is VALID [2018-11-23 11:18:44,148 INFO L273 TraceCheckUtils]: 21: Hoare triple {1332#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1332#true} is VALID [2018-11-23 11:18:44,148 INFO L273 TraceCheckUtils]: 22: Hoare triple {1332#true} assume true; {1332#true} is VALID [2018-11-23 11:18:44,149 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1332#true} {1332#true} #133#return; {1332#true} is VALID [2018-11-23 11:18:44,149 INFO L273 TraceCheckUtils]: 24: Hoare triple {1332#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1332#true} is VALID [2018-11-23 11:18:44,149 INFO L273 TraceCheckUtils]: 25: Hoare triple {1332#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1332#true} is VALID [2018-11-23 11:18:44,149 INFO L273 TraceCheckUtils]: 26: Hoare triple {1332#true} assume !~bvsgt32(~len, 0bv32); {1332#true} is VALID [2018-11-23 11:18:44,149 INFO L273 TraceCheckUtils]: 27: Hoare triple {1332#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1332#true} is VALID [2018-11-23 11:18:44,149 INFO L273 TraceCheckUtils]: 28: Hoare triple {1332#true} assume true; {1332#true} is VALID [2018-11-23 11:18:44,150 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1332#true} {1352#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #125#return; {1352#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:44,151 INFO L273 TraceCheckUtils]: 30: Hoare triple {1352#(= (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 := ~bvsub32(~len~0, 1bv32); {1428#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:44,152 INFO L273 TraceCheckUtils]: 31: Hoare triple {1428#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsge32(~i~0, 0bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1428#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:44,152 INFO L256 TraceCheckUtils]: 32: Hoare triple {1428#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1332#true} is VALID [2018-11-23 11:18:44,152 INFO L273 TraceCheckUtils]: 33: Hoare triple {1332#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1438#(= |sll_update_at_#in~index| sll_update_at_~index)} is VALID [2018-11-23 11:18:44,153 INFO L273 TraceCheckUtils]: 34: Hoare triple {1438#(= |sll_update_at_#in~index| sll_update_at_~index)} assume !~bvsgt32(~index, 0bv32); {1442#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:18:44,153 INFO L273 TraceCheckUtils]: 35: Hoare triple {1442#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {1442#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:18:44,154 INFO L273 TraceCheckUtils]: 36: Hoare triple {1442#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} assume true; {1442#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:18:44,155 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1442#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} {1428#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #127#return; {1333#false} is VALID [2018-11-23 11:18:44,155 INFO L273 TraceCheckUtils]: 38: Hoare triple {1333#false} #t~post12 := ~i~0;~i~0 := ~bvsub32(#t~post12, 1bv32);havoc #t~post12; {1333#false} is VALID [2018-11-23 11:18:44,156 INFO L273 TraceCheckUtils]: 39: Hoare triple {1333#false} assume !~bvsge32(~i~0, 0bv32); {1333#false} is VALID [2018-11-23 11:18:44,156 INFO L273 TraceCheckUtils]: 40: Hoare triple {1333#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {1333#false} is VALID [2018-11-23 11:18:44,156 INFO L273 TraceCheckUtils]: 41: Hoare triple {1333#false} assume !!~bvsge32(~i~0, 0bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {1333#false} is VALID [2018-11-23 11:18:44,157 INFO L256 TraceCheckUtils]: 42: Hoare triple {1333#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1333#false} is VALID [2018-11-23 11:18:44,157 INFO L273 TraceCheckUtils]: 43: Hoare triple {1333#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1333#false} is VALID [2018-11-23 11:18:44,157 INFO L273 TraceCheckUtils]: 44: Hoare triple {1333#false} assume !!~bvsgt32(~index, 0bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);~head.base, ~head.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;#t~post7 := ~index;~index := ~bvsub32(#t~post7, 1bv32);havoc #t~post7; {1333#false} is VALID [2018-11-23 11:18:44,158 INFO L273 TraceCheckUtils]: 45: Hoare triple {1333#false} assume !~bvsgt32(~index, 0bv32); {1333#false} is VALID [2018-11-23 11:18:44,158 INFO L273 TraceCheckUtils]: 46: Hoare triple {1333#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {1333#false} is VALID [2018-11-23 11:18:44,159 INFO L273 TraceCheckUtils]: 47: Hoare triple {1333#false} assume true; {1333#false} is VALID [2018-11-23 11:18:44,159 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {1333#false} {1333#false} #129#return; {1333#false} is VALID [2018-11-23 11:18:44,159 INFO L273 TraceCheckUtils]: 49: Hoare triple {1333#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1333#false} is VALID [2018-11-23 11:18:44,159 INFO L273 TraceCheckUtils]: 50: Hoare triple {1333#false} assume !false; {1333#false} is VALID [2018-11-23 11:18:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:18:44,162 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:18:44,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:18:44,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:18:44,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-11-23 11:18:44,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:18:44,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:18:44,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:18:44,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:18:44,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:18:44,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:18:44,246 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 6 states. [2018-11-23 11:18:45,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:18:45,041 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2018-11-23 11:18:45,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:18:45,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-11-23 11:18:45,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:18:45,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:18:45,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2018-11-23 11:18:45,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:18:45,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2018-11-23 11:18:45,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 85 transitions. [2018-11-23 11:18:45,234 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:18:45,238 INFO L225 Difference]: With dead ends: 89 [2018-11-23 11:18:45,238 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 11:18:45,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:18:45,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 11:18:45,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2018-11-23 11:18:45,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:18:45,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 58 states. [2018-11-23 11:18:45,318 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 58 states. [2018-11-23 11:18:45,318 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 58 states. [2018-11-23 11:18:45,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:18:45,323 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-11-23 11:18:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-11-23 11:18:45,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:18:45,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:18:45,325 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 63 states. [2018-11-23 11:18:45,325 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 63 states. [2018-11-23 11:18:45,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:18:45,329 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-11-23 11:18:45,329 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-11-23 11:18:45,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:18:45,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:18:45,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:18:45,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:18:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:18:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2018-11-23 11:18:45,334 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 51 [2018-11-23 11:18:45,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:18:45,335 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2018-11-23 11:18:45,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:18:45,335 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2018-11-23 11:18:45,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 11:18:45,337 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:18:45,337 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:18:45,338 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:18:45,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:18:45,338 INFO L82 PathProgramCache]: Analyzing trace with hash -44038766, now seen corresponding path program 1 times [2018-11-23 11:18:45,339 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:18:45,339 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:18:45,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:18:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:18:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:18:45,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:18:45,809 INFO L256 TraceCheckUtils]: 0: Hoare triple {1834#true} call ULTIMATE.init(); {1834#true} is VALID [2018-11-23 11:18:45,809 INFO L273 TraceCheckUtils]: 1: Hoare triple {1834#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1834#true} is VALID [2018-11-23 11:18:45,809 INFO L273 TraceCheckUtils]: 2: Hoare triple {1834#true} assume true; {1834#true} is VALID [2018-11-23 11:18:45,810 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1834#true} {1834#true} #135#return; {1834#true} is VALID [2018-11-23 11:18:45,810 INFO L256 TraceCheckUtils]: 4: Hoare triple {1834#true} call #t~ret15 := main(); {1834#true} is VALID [2018-11-23 11:18:45,810 INFO L273 TraceCheckUtils]: 5: Hoare triple {1834#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1854#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:45,811 INFO L256 TraceCheckUtils]: 6: Hoare triple {1854#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1834#true} is VALID [2018-11-23 11:18:45,811 INFO L273 TraceCheckUtils]: 7: Hoare triple {1834#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1834#true} is VALID [2018-11-23 11:18:45,811 INFO L273 TraceCheckUtils]: 8: Hoare triple {1834#true} assume !!~bvsgt32(~len, 0bv32); {1834#true} is VALID [2018-11-23 11:18:45,811 INFO L256 TraceCheckUtils]: 9: Hoare triple {1834#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1834#true} is VALID [2018-11-23 11:18:45,812 INFO L273 TraceCheckUtils]: 10: Hoare triple {1834#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1834#true} is VALID [2018-11-23 11:18:45,812 INFO L273 TraceCheckUtils]: 11: Hoare triple {1834#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1834#true} is VALID [2018-11-23 11:18:45,812 INFO L273 TraceCheckUtils]: 12: Hoare triple {1834#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1834#true} is VALID [2018-11-23 11:18:45,812 INFO L273 TraceCheckUtils]: 13: Hoare triple {1834#true} assume true; {1834#true} is VALID [2018-11-23 11:18:45,813 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1834#true} {1834#true} #133#return; {1834#true} is VALID [2018-11-23 11:18:45,813 INFO L273 TraceCheckUtils]: 15: Hoare triple {1834#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1834#true} is VALID [2018-11-23 11:18:45,813 INFO L273 TraceCheckUtils]: 16: Hoare triple {1834#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1834#true} is VALID [2018-11-23 11:18:45,813 INFO L273 TraceCheckUtils]: 17: Hoare triple {1834#true} assume !!~bvsgt32(~len, 0bv32); {1834#true} is VALID [2018-11-23 11:18:45,814 INFO L256 TraceCheckUtils]: 18: Hoare triple {1834#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1834#true} is VALID [2018-11-23 11:18:45,814 INFO L273 TraceCheckUtils]: 19: Hoare triple {1834#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1834#true} is VALID [2018-11-23 11:18:45,814 INFO L273 TraceCheckUtils]: 20: Hoare triple {1834#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1834#true} is VALID [2018-11-23 11:18:45,815 INFO L273 TraceCheckUtils]: 21: Hoare triple {1834#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1834#true} is VALID [2018-11-23 11:18:45,815 INFO L273 TraceCheckUtils]: 22: Hoare triple {1834#true} assume true; {1834#true} is VALID [2018-11-23 11:18:45,815 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1834#true} {1834#true} #133#return; {1834#true} is VALID [2018-11-23 11:18:45,815 INFO L273 TraceCheckUtils]: 24: Hoare triple {1834#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1834#true} is VALID [2018-11-23 11:18:45,816 INFO L273 TraceCheckUtils]: 25: Hoare triple {1834#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1834#true} is VALID [2018-11-23 11:18:45,816 INFO L273 TraceCheckUtils]: 26: Hoare triple {1834#true} assume !~bvsgt32(~len, 0bv32); {1834#true} is VALID [2018-11-23 11:18:45,816 INFO L273 TraceCheckUtils]: 27: Hoare triple {1834#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1834#true} is VALID [2018-11-23 11:18:45,816 INFO L273 TraceCheckUtils]: 28: Hoare triple {1834#true} assume true; {1834#true} is VALID [2018-11-23 11:18:45,819 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1834#true} {1854#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #125#return; {1854#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:45,821 INFO L273 TraceCheckUtils]: 30: Hoare triple {1854#(= (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 := ~bvsub32(~len~0, 1bv32); {1930#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:45,821 INFO L273 TraceCheckUtils]: 31: Hoare triple {1930#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsge32(~i~0, 0bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1930#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:45,821 INFO L256 TraceCheckUtils]: 32: Hoare triple {1930#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1834#true} is VALID [2018-11-23 11:18:45,822 INFO L273 TraceCheckUtils]: 33: Hoare triple {1834#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1834#true} is VALID [2018-11-23 11:18:45,822 INFO L273 TraceCheckUtils]: 34: Hoare triple {1834#true} 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; {1834#true} is VALID [2018-11-23 11:18:45,823 INFO L273 TraceCheckUtils]: 35: Hoare triple {1834#true} assume !~bvsgt32(~index, 0bv32); {1834#true} is VALID [2018-11-23 11:18:45,823 INFO L273 TraceCheckUtils]: 36: Hoare triple {1834#true} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {1834#true} is VALID [2018-11-23 11:18:45,823 INFO L273 TraceCheckUtils]: 37: Hoare triple {1834#true} assume true; {1834#true} is VALID [2018-11-23 11:18:45,825 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1834#true} {1930#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #127#return; {1930#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:45,825 INFO L273 TraceCheckUtils]: 39: Hoare triple {1930#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post12 := ~i~0;~i~0 := ~bvsub32(#t~post12, 1bv32);havoc #t~post12; {1958#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:18:45,827 INFO L273 TraceCheckUtils]: 40: Hoare triple {1958#(= main_~i~0 (_ bv0 32))} assume !~bvsge32(~i~0, 0bv32); {1835#false} is VALID [2018-11-23 11:18:45,827 INFO L273 TraceCheckUtils]: 41: Hoare triple {1835#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {1835#false} is VALID [2018-11-23 11:18:45,827 INFO L273 TraceCheckUtils]: 42: Hoare triple {1835#false} assume !!~bvsge32(~i~0, 0bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {1835#false} is VALID [2018-11-23 11:18:45,827 INFO L256 TraceCheckUtils]: 43: Hoare triple {1835#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1835#false} is VALID [2018-11-23 11:18:45,827 INFO L273 TraceCheckUtils]: 44: Hoare triple {1835#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1835#false} is VALID [2018-11-23 11:18:45,828 INFO L273 TraceCheckUtils]: 45: Hoare triple {1835#false} assume !!~bvsgt32(~index, 0bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);~head.base, ~head.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;#t~post7 := ~index;~index := ~bvsub32(#t~post7, 1bv32);havoc #t~post7; {1835#false} is VALID [2018-11-23 11:18:45,828 INFO L273 TraceCheckUtils]: 46: Hoare triple {1835#false} assume !~bvsgt32(~index, 0bv32); {1835#false} is VALID [2018-11-23 11:18:45,828 INFO L273 TraceCheckUtils]: 47: Hoare triple {1835#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {1835#false} is VALID [2018-11-23 11:18:45,828 INFO L273 TraceCheckUtils]: 48: Hoare triple {1835#false} assume true; {1835#false} is VALID [2018-11-23 11:18:45,829 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {1835#false} {1835#false} #129#return; {1835#false} is VALID [2018-11-23 11:18:45,829 INFO L273 TraceCheckUtils]: 50: Hoare triple {1835#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1835#false} is VALID [2018-11-23 11:18:45,829 INFO L273 TraceCheckUtils]: 51: Hoare triple {1835#false} assume !false; {1835#false} is VALID [2018-11-23 11:18:45,831 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 11:18:45,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:18:46,109 INFO L273 TraceCheckUtils]: 51: Hoare triple {1835#false} assume !false; {1835#false} is VALID [2018-11-23 11:18:46,109 INFO L273 TraceCheckUtils]: 50: Hoare triple {1835#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1835#false} is VALID [2018-11-23 11:18:46,109 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {1834#true} {1835#false} #129#return; {1835#false} is VALID [2018-11-23 11:18:46,109 INFO L273 TraceCheckUtils]: 48: Hoare triple {1834#true} assume true; {1834#true} is VALID [2018-11-23 11:18:46,109 INFO L273 TraceCheckUtils]: 47: Hoare triple {1834#true} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {1834#true} is VALID [2018-11-23 11:18:46,110 INFO L273 TraceCheckUtils]: 46: Hoare triple {1834#true} assume !~bvsgt32(~index, 0bv32); {1834#true} is VALID [2018-11-23 11:18:46,110 INFO L273 TraceCheckUtils]: 45: Hoare triple {1834#true} assume !!~bvsgt32(~index, 0bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);~head.base, ~head.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;#t~post7 := ~index;~index := ~bvsub32(#t~post7, 1bv32);havoc #t~post7; {1834#true} is VALID [2018-11-23 11:18:46,110 INFO L273 TraceCheckUtils]: 44: Hoare triple {1834#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1834#true} is VALID [2018-11-23 11:18:46,110 INFO L256 TraceCheckUtils]: 43: Hoare triple {1835#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1834#true} is VALID [2018-11-23 11:18:46,110 INFO L273 TraceCheckUtils]: 42: Hoare triple {1835#false} assume !!~bvsge32(~i~0, 0bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {1835#false} is VALID [2018-11-23 11:18:46,110 INFO L273 TraceCheckUtils]: 41: Hoare triple {1835#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {1835#false} is VALID [2018-11-23 11:18:46,111 INFO L273 TraceCheckUtils]: 40: Hoare triple {2028#(bvsge main_~i~0 (_ bv0 32))} assume !~bvsge32(~i~0, 0bv32); {1835#false} is VALID [2018-11-23 11:18:46,112 INFO L273 TraceCheckUtils]: 39: Hoare triple {2032#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post12 := ~i~0;~i~0 := ~bvsub32(#t~post12, 1bv32);havoc #t~post12; {2028#(bvsge main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:18:46,113 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1834#true} {2032#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #127#return; {2032#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:46,113 INFO L273 TraceCheckUtils]: 37: Hoare triple {1834#true} assume true; {1834#true} is VALID [2018-11-23 11:18:46,114 INFO L273 TraceCheckUtils]: 36: Hoare triple {1834#true} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {1834#true} is VALID [2018-11-23 11:18:46,114 INFO L273 TraceCheckUtils]: 35: Hoare triple {1834#true} assume !~bvsgt32(~index, 0bv32); {1834#true} is VALID [2018-11-23 11:18:46,114 INFO L273 TraceCheckUtils]: 34: Hoare triple {1834#true} 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; {1834#true} is VALID [2018-11-23 11:18:46,114 INFO L273 TraceCheckUtils]: 33: Hoare triple {1834#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1834#true} is VALID [2018-11-23 11:18:46,115 INFO L256 TraceCheckUtils]: 32: Hoare triple {2032#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1834#true} is VALID [2018-11-23 11:18:46,117 INFO L273 TraceCheckUtils]: 31: Hoare triple {2032#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsge32(~i~0, 0bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2032#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:46,127 INFO L273 TraceCheckUtils]: 30: Hoare triple {2060#(bvsge (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 := ~bvsub32(~len~0, 1bv32); {2032#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:46,141 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1834#true} {2060#(bvsge (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #125#return; {2060#(bvsge (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:46,141 INFO L273 TraceCheckUtils]: 28: Hoare triple {1834#true} assume true; {1834#true} is VALID [2018-11-23 11:18:46,142 INFO L273 TraceCheckUtils]: 27: Hoare triple {1834#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1834#true} is VALID [2018-11-23 11:18:46,142 INFO L273 TraceCheckUtils]: 26: Hoare triple {1834#true} assume !~bvsgt32(~len, 0bv32); {1834#true} is VALID [2018-11-23 11:18:46,142 INFO L273 TraceCheckUtils]: 25: Hoare triple {1834#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1834#true} is VALID [2018-11-23 11:18:46,142 INFO L273 TraceCheckUtils]: 24: Hoare triple {1834#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1834#true} is VALID [2018-11-23 11:18:46,142 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1834#true} {1834#true} #133#return; {1834#true} is VALID [2018-11-23 11:18:46,143 INFO L273 TraceCheckUtils]: 22: Hoare triple {1834#true} assume true; {1834#true} is VALID [2018-11-23 11:18:46,143 INFO L273 TraceCheckUtils]: 21: Hoare triple {1834#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1834#true} is VALID [2018-11-23 11:18:46,143 INFO L273 TraceCheckUtils]: 20: Hoare triple {1834#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1834#true} is VALID [2018-11-23 11:18:46,143 INFO L273 TraceCheckUtils]: 19: Hoare triple {1834#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1834#true} is VALID [2018-11-23 11:18:46,144 INFO L256 TraceCheckUtils]: 18: Hoare triple {1834#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1834#true} is VALID [2018-11-23 11:18:46,144 INFO L273 TraceCheckUtils]: 17: Hoare triple {1834#true} assume !!~bvsgt32(~len, 0bv32); {1834#true} is VALID [2018-11-23 11:18:46,144 INFO L273 TraceCheckUtils]: 16: Hoare triple {1834#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1834#true} is VALID [2018-11-23 11:18:46,144 INFO L273 TraceCheckUtils]: 15: Hoare triple {1834#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1834#true} is VALID [2018-11-23 11:18:46,144 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1834#true} {1834#true} #133#return; {1834#true} is VALID [2018-11-23 11:18:46,145 INFO L273 TraceCheckUtils]: 13: Hoare triple {1834#true} assume true; {1834#true} is VALID [2018-11-23 11:18:46,145 INFO L273 TraceCheckUtils]: 12: Hoare triple {1834#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1834#true} is VALID [2018-11-23 11:18:46,145 INFO L273 TraceCheckUtils]: 11: Hoare triple {1834#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1834#true} is VALID [2018-11-23 11:18:46,145 INFO L273 TraceCheckUtils]: 10: Hoare triple {1834#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1834#true} is VALID [2018-11-23 11:18:46,146 INFO L256 TraceCheckUtils]: 9: Hoare triple {1834#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1834#true} is VALID [2018-11-23 11:18:46,146 INFO L273 TraceCheckUtils]: 8: Hoare triple {1834#true} assume !!~bvsgt32(~len, 0bv32); {1834#true} is VALID [2018-11-23 11:18:46,146 INFO L273 TraceCheckUtils]: 7: Hoare triple {1834#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1834#true} is VALID [2018-11-23 11:18:46,146 INFO L256 TraceCheckUtils]: 6: Hoare triple {2060#(bvsge (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1834#true} is VALID [2018-11-23 11:18:46,160 INFO L273 TraceCheckUtils]: 5: Hoare triple {1834#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2060#(bvsge (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:46,160 INFO L256 TraceCheckUtils]: 4: Hoare triple {1834#true} call #t~ret15 := main(); {1834#true} is VALID [2018-11-23 11:18:46,161 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1834#true} {1834#true} #135#return; {1834#true} is VALID [2018-11-23 11:18:46,161 INFO L273 TraceCheckUtils]: 2: Hoare triple {1834#true} assume true; {1834#true} is VALID [2018-11-23 11:18:46,161 INFO L273 TraceCheckUtils]: 1: Hoare triple {1834#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1834#true} is VALID [2018-11-23 11:18:46,161 INFO L256 TraceCheckUtils]: 0: Hoare triple {1834#true} call ULTIMATE.init(); {1834#true} is VALID [2018-11-23 11:18:46,163 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 11:18:46,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:18:46,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:18:46,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-11-23 11:18:46,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:18:46,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:18:46,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:18:46,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:18:46,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:18:46,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:18:46,282 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand 8 states. [2018-11-23 11:18:47,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:18:47,301 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2018-11-23 11:18:47,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:18:47,301 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-11-23 11:18:47,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:18:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:18:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 11:18:47,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:18:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 11:18:47,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 81 transitions. [2018-11-23 11:18:47,490 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:18:47,495 INFO L225 Difference]: With dead ends: 90 [2018-11-23 11:18:47,495 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 11:18:47,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:18:47,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 11:18:47,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2018-11-23 11:18:47,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:18:47,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 60 states. [2018-11-23 11:18:47,559 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 60 states. [2018-11-23 11:18:47,559 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 60 states. [2018-11-23 11:18:47,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:18:47,563 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2018-11-23 11:18:47,563 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2018-11-23 11:18:47,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:18:47,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:18:47,564 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 72 states. [2018-11-23 11:18:47,564 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 72 states. [2018-11-23 11:18:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:18:47,568 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2018-11-23 11:18:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2018-11-23 11:18:47,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:18:47,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:18:47,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:18:47,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:18:47,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:18:47,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-11-23 11:18:47,573 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 52 [2018-11-23 11:18:47,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:18:47,573 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-11-23 11:18:47,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:18:47,573 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-11-23 11:18:47,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 11:18:47,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:18:47,574 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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:18:47,575 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:18:47,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:18:47,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1578136644, now seen corresponding path program 2 times [2018-11-23 11:18:47,575 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:18:47,576 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:18:47,603 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:18:47,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:18:47,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:18:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:18:47,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:18:47,919 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:18:47,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:47,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:47,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 11:18:47,930 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:18:47,931 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_51|]. (= (store |v_#valid_51| node_create_~temp~0.base (_ bv1 1)) |#valid|) [2018-11-23 11:18:47,931 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| node_create_~temp~0.base) (_ bv1 1)) [2018-11-23 11:18:48,112 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:48,114 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:48,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 11:18:48,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:48,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:48,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-23 11:18:48,128 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:18:48,128 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_2|]. (and (= (select |v_#valid_BEFORE_CALL_2| |sll_create_#t~ret4.base|) (_ bv0 1)) (= (select |v_#valid_BEFORE_CALL_2| sll_create_~head~0.base) (_ bv1 1)) (= (_ bv0 32) |sll_create_#t~ret4.offset|)) [2018-11-23 11:18:48,128 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= sll_create_~head~0.base |sll_create_#t~ret4.base|)) (= (_ bv0 32) |sll_create_#t~ret4.offset|)) [2018-11-23 11:18:48,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:18:48,180 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:18:48,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:48,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:48,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:18:48,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:18:48,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:48,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:48,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:48,249 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-11-23 11:18:48,272 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:18:48,272 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_55|, v_sll_create_~head~0.base_16, |v_#memory_$Pointer$.offset_55|, v_sll_create_~head~0.offset_16]. (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_55| sll_create_~head~0.base (store (select |v_#memory_$Pointer$.base_55| sll_create_~head~0.base) (_ bv4 32) v_sll_create_~head~0.base_16))) (not (= sll_create_~head~0.base v_sll_create_~head~0.base_16)) (= (store |v_#memory_$Pointer$.offset_55| sll_create_~head~0.base (store (select |v_#memory_$Pointer$.offset_55| sll_create_~head~0.base) (_ bv4 32) v_sll_create_~head~0.offset_16)) |#memory_$Pointer$.offset|) (= (_ bv0 32) sll_create_~head~0.offset)) [2018-11-23 11:18:48,272 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset)) [2018-11-23 11:18:48,922 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 29 treesize of output 20 [2018-11-23 11:18:48,931 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 20 treesize of output 19 [2018-11-23 11:18:48,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:48,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:48,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:48,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2018-11-23 11:18:49,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:49,288 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 115 treesize of output 116 [2018-11-23 11:18:49,295 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 36 treesize of output 1 [2018-11-23 11:18:49,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:49,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:49,354 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:49,371 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 78 treesize of output 82 [2018-11-23 11:18:49,380 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 36 treesize of output 1 [2018-11-23 11:18:49,381 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:49,393 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:49,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:49,415 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:131, output treesize:43 [2018-11-23 11:19:04,183 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 27 [2018-11-23 11:19:04,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-11-23 11:19:04,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:04,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2018-11-23 11:19:04,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:04,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:04,403 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 41 treesize of output 36 [2018-11-23 11:19:04,449 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:04,472 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 36 treesize of output 32 [2018-11-23 11:19:04,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:04,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:04,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-11-23 11:19:04,575 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:19:04,577 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:04,591 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:04,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:04,627 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:85, output treesize:44 [2018-11-23 11:19:05,170 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:05,171 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_BEFORE_CALL_4|, |v_old(#memory_int)_AFTER_CALL_30|, |v_#memory_$Pointer$.offset_BEFORE_CALL_3|, sll_update_at_~data]. (let ((.cse3 (select |v_#memory_$Pointer$.base_BEFORE_CALL_4| main_~s~0.base)) (.cse2 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse0 (select |v_#memory_$Pointer$.offset_BEFORE_CALL_3| main_~s~0.base)) (.cse1 (select .cse3 .cse2))) (and (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_3| main_~s~0.base (store .cse0 main_~s~0.offset (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))) |#memory_$Pointer$.offset|) (= (bvadd (select (select |v_old(#memory_int)_AFTER_CALL_30| .cse1) (select .cse0 .cse2)) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)) (= (store |v_old(#memory_int)_AFTER_CALL_30| main_~s~0.base (store (select |v_old(#memory_int)_AFTER_CALL_30| main_~s~0.base) main_~s~0.offset sll_update_at_~data)) |#memory_int|) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_BEFORE_CALL_4| main_~s~0.base (store .cse3 main_~s~0.offset (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))) (not (= .cse1 main_~s~0.base))))) [2018-11-23 11:19:05,171 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse1))) (and (not (= .cse0 main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse1)) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0))))) [2018-11-23 11:19:06,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 48 [2018-11-23 11:19:06,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2018-11-23 11:19:06,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:06,549 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 33 treesize of output 18 [2018-11-23 11:19:06,551 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:06,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 5 [2018-11-23 11:19:06,603 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:06,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:06,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 11:19:06,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-23 11:19:06,708 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:06,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 11:19:06,741 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:06,747 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:06,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:06,757 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:69, output treesize:9 [2018-11-23 11:19:06,765 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:06,766 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, main_~s~0.base, |#memory_int|, |#memory_$Pointer$.offset|, v_main_~s~0.base_BEFORE_CALL_3]. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)))) (let ((.cse1 (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv4 32)))) (.cse2 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)))) (and (not (= .cse0 main_~s~0.base)) (= |main_#t~ret14| .cse1) (not (= .cse2 v_main_~s~0.base_BEFORE_CALL_3)) (= (_ bv3 32) main_~expected~0) (= (bvadd .cse1 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| .cse2) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32))))) [2018-11-23 11:19:06,766 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvadd |main_#t~ret14| (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv3 32) main_~expected~0)) [2018-11-23 11:19:06,899 INFO L256 TraceCheckUtils]: 0: Hoare triple {2522#true} call ULTIMATE.init(); {2522#true} is VALID [2018-11-23 11:19:06,899 INFO L273 TraceCheckUtils]: 1: Hoare triple {2522#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2522#true} is VALID [2018-11-23 11:19:06,900 INFO L273 TraceCheckUtils]: 2: Hoare triple {2522#true} assume true; {2522#true} is VALID [2018-11-23 11:19:06,900 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2522#true} {2522#true} #135#return; {2522#true} is VALID [2018-11-23 11:19:06,900 INFO L256 TraceCheckUtils]: 4: Hoare triple {2522#true} call #t~ret15 := main(); {2522#true} is VALID [2018-11-23 11:19:06,901 INFO L273 TraceCheckUtils]: 5: Hoare triple {2522#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2542#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:19:06,901 INFO L256 TraceCheckUtils]: 6: Hoare triple {2542#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {2522#true} is VALID [2018-11-23 11:19:06,901 INFO L273 TraceCheckUtils]: 7: Hoare triple {2522#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2522#true} is VALID [2018-11-23 11:19:06,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {2522#true} assume !!~bvsgt32(~len, 0bv32); {2522#true} is VALID [2018-11-23 11:19:06,901 INFO L256 TraceCheckUtils]: 9: Hoare triple {2522#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2522#true} is VALID [2018-11-23 11:19:06,902 INFO L273 TraceCheckUtils]: 10: Hoare triple {2522#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2558#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:19:06,904 INFO L273 TraceCheckUtils]: 11: Hoare triple {2558#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2558#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:19:06,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {2558#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2565#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:19:06,906 INFO L273 TraceCheckUtils]: 13: Hoare triple {2565#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} assume true; {2565#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:19:06,908 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {2565#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} {2522#true} #133#return; {2572#(= (bvadd (select |#valid| |sll_create_#t~ret4.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:19:06,912 INFO L273 TraceCheckUtils]: 15: Hoare triple {2572#(= (bvadd (select |#valid| |sll_create_#t~ret4.base|) (_ bv1 1)) (_ bv0 1))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2576#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} is VALID [2018-11-23 11:19:06,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {2576#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2576#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} is VALID [2018-11-23 11:19:06,914 INFO L273 TraceCheckUtils]: 17: Hoare triple {2576#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} assume !!~bvsgt32(~len, 0bv32); {2576#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} is VALID [2018-11-23 11:19:06,922 INFO L256 TraceCheckUtils]: 18: Hoare triple {2576#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2586#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:19:06,923 INFO L273 TraceCheckUtils]: 19: Hoare triple {2586#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2590#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:19:06,924 INFO L273 TraceCheckUtils]: 20: Hoare triple {2590#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2590#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:19:06,926 INFO L273 TraceCheckUtils]: 21: Hoare triple {2590#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2597#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:19:06,927 INFO L273 TraceCheckUtils]: 22: Hoare triple {2597#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {2597#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:19:06,929 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {2597#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {2576#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} #133#return; {2604#(and (not (= sll_create_~head~0.base |sll_create_#t~ret4.base|)) (= (_ bv0 32) |sll_create_#t~ret4.offset|))} is VALID [2018-11-23 11:19:06,932 INFO L273 TraceCheckUtils]: 24: Hoare triple {2604#(and (not (= sll_create_~head~0.base |sll_create_#t~ret4.base|)) (= (_ bv0 32) |sll_create_#t~ret4.offset|))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2608#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-23 11:19:06,932 INFO L273 TraceCheckUtils]: 25: Hoare triple {2608#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2608#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-23 11:19:06,934 INFO L273 TraceCheckUtils]: 26: Hoare triple {2608#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} assume !~bvsgt32(~len, 0bv32); {2608#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-23 11:19:06,935 INFO L273 TraceCheckUtils]: 27: Hoare triple {2608#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2618#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:19:06,935 INFO L273 TraceCheckUtils]: 28: Hoare triple {2618#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} assume true; {2618#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:19:06,937 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2618#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} {2542#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #125#return; {2625#(and (not (= |main_#t~ret11.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (_ bv4 32)))) (= |main_#t~ret11.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:06,941 INFO L273 TraceCheckUtils]: 30: Hoare triple {2625#(and (not (= |main_#t~ret11.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (_ bv4 32)))) (= |main_#t~ret11.offset| (_ bv0 32)) (= (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 := ~bvsub32(~len~0, 1bv32); {2629#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0))} is VALID [2018-11-23 11:19:06,942 INFO L273 TraceCheckUtils]: 31: Hoare triple {2629#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0))} assume !!~bvsge32(~i~0, 0bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2633#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd (bvneg main_~len~0) main_~new_data~0)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:06,943 INFO L256 TraceCheckUtils]: 32: Hoare triple {2633#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd (bvneg main_~len~0) main_~new_data~0)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2637#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:19:06,943 INFO L273 TraceCheckUtils]: 33: Hoare triple {2637#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2641#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= sll_update_at_~data |sll_update_at_#in~data|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:19:06,947 INFO L273 TraceCheckUtils]: 34: Hoare triple {2641#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= sll_update_at_~data |sll_update_at_#in~data|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.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; {2645#(and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= sll_update_at_~data |sll_update_at_#in~data|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.offset))} is VALID [2018-11-23 11:19:06,949 INFO L273 TraceCheckUtils]: 35: Hoare triple {2645#(and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= sll_update_at_~data |sll_update_at_#in~data|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.offset))} assume !~bvsgt32(~index, 0bv32); {2645#(and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= sll_update_at_~data |sll_update_at_#in~data|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.offset))} is VALID [2018-11-23 11:19:06,951 INFO L273 TraceCheckUtils]: 36: Hoare triple {2645#(and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= sll_update_at_~data |sll_update_at_#in~data|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.offset))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2652#(and (= |sll_update_at_#in~data| (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))))) (= (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))))) |#memory_$Pointer$.offset|))} is VALID [2018-11-23 11:19:06,952 INFO L273 TraceCheckUtils]: 37: Hoare triple {2652#(and (= |sll_update_at_#in~data| (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))))) (= (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))))) |#memory_$Pointer$.offset|))} assume true; {2652#(and (= |sll_update_at_#in~data| (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))))) (= (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))))) |#memory_$Pointer$.offset|))} is VALID [2018-11-23 11:19:06,961 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2652#(and (= |sll_update_at_#in~data| (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))))) (= (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))))) |#memory_$Pointer$.offset|))} {2633#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd (bvneg main_~len~0) main_~new_data~0)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #127#return; {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:19:06,963 INFO L273 TraceCheckUtils]: 39: Hoare triple {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} #t~post12 := ~i~0;~i~0 := ~bvsub32(#t~post12, 1bv32);havoc #t~post12; {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:19:06,963 INFO L273 TraceCheckUtils]: 40: Hoare triple {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} assume !!~bvsge32(~i~0, 0bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:19:06,965 INFO L256 TraceCheckUtils]: 41: Hoare triple {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2669#(and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:19:06,965 INFO L273 TraceCheckUtils]: 42: Hoare triple {2669#(and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2673#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |old(#memory_int)| |#memory_int|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:19:06,966 INFO L273 TraceCheckUtils]: 43: Hoare triple {2673#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |old(#memory_int)| |#memory_int|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !~bvsgt32(~index, 0bv32); {2673#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |old(#memory_int)| |#memory_int|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:19:06,968 INFO L273 TraceCheckUtils]: 44: Hoare triple {2673#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |old(#memory_int)| |#memory_int|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2680#(and (= (store |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|)))) (exists ((sll_update_at_~data (_ BitVec 32))) (= (store |old(#memory_int)| |sll_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| sll_update_at_~data)) |#memory_int|)))} is VALID [2018-11-23 11:19:06,969 INFO L273 TraceCheckUtils]: 45: Hoare triple {2680#(and (= (store |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|)))) (exists ((sll_update_at_~data (_ BitVec 32))) (= (store |old(#memory_int)| |sll_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| sll_update_at_~data)) |#memory_int|)))} assume true; {2680#(and (= (store |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|)))) (exists ((sll_update_at_~data (_ BitVec 32))) (= (store |old(#memory_int)| |sll_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| sll_update_at_~data)) |#memory_int|)))} is VALID [2018-11-23 11:19:06,972 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2680#(and (= (store |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|)))) (exists ((sll_update_at_~data (_ BitVec 32))) (= (store |old(#memory_int)| |sll_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| sll_update_at_~data)) |#memory_int|)))} {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} #127#return; {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:19:06,973 INFO L273 TraceCheckUtils]: 47: Hoare triple {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} #t~post12 := ~i~0;~i~0 := ~bvsub32(#t~post12, 1bv32);havoc #t~post12; {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:19:06,974 INFO L273 TraceCheckUtils]: 48: Hoare triple {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} assume !~bvsge32(~i~0, 0bv32); {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:19:06,975 INFO L273 TraceCheckUtils]: 49: Hoare triple {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} ~i~0 := ~bvsub32(~len~0, 1bv32); {2696#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0))} is VALID [2018-11-23 11:19:06,977 INFO L273 TraceCheckUtils]: 50: Hoare triple {2696#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0))} assume !!~bvsge32(~i~0, 0bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {2700#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (_ bv3 32) main_~expected~0))} is VALID [2018-11-23 11:19:06,980 INFO L256 TraceCheckUtils]: 51: Hoare triple {2700#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (_ bv3 32) main_~expected~0))} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {2704#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 11:19:06,981 INFO L273 TraceCheckUtils]: 52: Hoare triple {2704#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2708#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} is VALID [2018-11-23 11:19:06,984 INFO L273 TraceCheckUtils]: 53: Hoare triple {2708#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} assume !!~bvsgt32(~index, 0bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);~head.base, ~head.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;#t~post7 := ~index;~index := ~bvsub32(#t~post7, 1bv32);havoc #t~post7; {2712#(and (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:19:06,985 INFO L273 TraceCheckUtils]: 54: Hoare triple {2712#(and (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))))} assume !~bvsgt32(~index, 0bv32); {2712#(and (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:19:06,987 INFO L273 TraceCheckUtils]: 55: Hoare triple {2712#(and (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))))} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {2719#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) |sll_get_data_at_#res|))} is VALID [2018-11-23 11:19:06,987 INFO L273 TraceCheckUtils]: 56: Hoare triple {2719#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) |sll_get_data_at_#res|))} assume true; {2719#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) |sll_get_data_at_#res|))} is VALID [2018-11-23 11:19:06,991 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {2719#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) |sll_get_data_at_#res|))} {2700#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (_ bv3 32) main_~expected~0))} #129#return; {2726#(and (= (bvadd |main_#t~ret14| (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv3 32) main_~expected~0))} is VALID [2018-11-23 11:19:06,992 INFO L273 TraceCheckUtils]: 58: Hoare triple {2726#(and (= (bvadd |main_#t~ret14| (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv3 32) main_~expected~0))} assume ~expected~0 != #t~ret14;havoc #t~ret14; {2523#false} is VALID [2018-11-23 11:19:06,992 INFO L273 TraceCheckUtils]: 59: Hoare triple {2523#false} assume !false; {2523#false} is VALID [2018-11-23 11:19:07,015 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:19:07,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:19:11,218 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-23 11:19:11,463 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 11:19:11,644 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 11:19:12,047 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:19:12,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:12,124 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:12,134 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:12,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:12,150 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:37 [2018-11-23 11:19:12,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:19:12,589 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:19:12,600 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:19:12,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:19:12,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:19:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:12,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:12,784 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:19:12,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:12,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:12,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 11:19:12,794 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:12,794 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_53|]. (= |#valid| (store |v_#valid_53| node_create_~temp~0.base (_ bv1 1))) [2018-11-23 11:19:12,794 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| node_create_~temp~0.base) (_ bv1 1)) [2018-11-23 11:19:12,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:12,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:12,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 11:19:12,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:12,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:12,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-23 11:19:12,892 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:12,892 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_4|]. (and (= (select |v_#valid_BEFORE_CALL_4| |sll_create_#t~ret4.base|) (_ bv0 1)) (= (select |v_#valid_BEFORE_CALL_4| sll_create_~head~0.base) (_ bv1 1)) (= (_ bv0 32) |sll_create_#t~ret4.offset|)) [2018-11-23 11:19:12,892 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= sll_create_~head~0.base |sll_create_#t~ret4.base|)) (= (_ bv0 32) |sll_create_#t~ret4.offset|)) [2018-11-23 11:19:12,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:19:12,931 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:19:12,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:12,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:12,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:19:12,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:19:12,978 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:12,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:13,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:13,002 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-11-23 11:19:13,032 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:13,033 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_68|, v_sll_create_~head~0.base_17, |v_#memory_$Pointer$.offset_68|, v_sll_create_~head~0.offset_17]. (and (not (= sll_create_~head~0.base v_sll_create_~head~0.base_17)) (= (store |v_#memory_$Pointer$.base_68| sll_create_~head~0.base (store (select |v_#memory_$Pointer$.base_68| sll_create_~head~0.base) (_ bv4 32) v_sll_create_~head~0.base_17)) |#memory_$Pointer$.base|) (= (store |v_#memory_$Pointer$.offset_68| sll_create_~head~0.base (store (select |v_#memory_$Pointer$.offset_68| sll_create_~head~0.base) (_ bv4 32) v_sll_create_~head~0.offset_17)) |#memory_$Pointer$.offset|) (= (_ bv0 32) sll_create_~head~0.offset)) [2018-11-23 11:19:13,033 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset)) [2018-11-23 11:19:13,374 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 29 treesize of output 20 [2018-11-23 11:19:13,388 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 20 treesize of output 19 [2018-11-23 11:19:13,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:13,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:13,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:13,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2018-11-23 11:19:13,537 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:13,562 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 115 treesize of output 116 [2018-11-23 11:19:13,575 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 36 treesize of output 1 [2018-11-23 11:19:13,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:13,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:13,647 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:13,660 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 78 treesize of output 82 [2018-11-23 11:19:13,673 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 36 treesize of output 1 [2018-11-23 11:19:13,676 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:13,689 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:13,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:13,717 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:131, output treesize:43 [2018-11-23 11:19:15,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-11-23 11:19:15,411 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:19:15,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:15,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:15,555 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 40 treesize of output 35 [2018-11-23 11:19:15,570 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:15,579 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 35 treesize of output 31 [2018-11-23 11:19:15,582 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:15,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:15,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-11-23 11:19:15,680 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:15,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-11-23 11:19:15,693 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:15,708 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:15,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:15,744 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:84, output treesize:43 [2018-11-23 11:19:17,043 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:17,044 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#memory_$Pointer$.base)_AFTER_CALL_36|, |v_#memory_int_BEFORE_CALL_6|, |v_old(#memory_$Pointer$.offset)_AFTER_CALL_36|, sll_update_at_~data]. (let ((.cse3 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_36| main_~s~0.base)) (.cse2 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse0 (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_36| main_~s~0.base)) (.cse1 (select .cse3 .cse2))) (and (= (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_36| main_~s~0.base (store .cse0 main_~s~0.offset (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))) |#memory_$Pointer$.offset|) (= (bvadd (bvneg (bvneg main_~len~0)) main_~len~0 (_ bv4294967295 32)) (select (select |v_#memory_int_BEFORE_CALL_6| .cse1) (select .cse0 .cse2))) (= |#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_36| main_~s~0.base (store .cse3 main_~s~0.offset (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))) (= main_~s~0.offset (_ bv0 32)) (= (store |v_#memory_int_BEFORE_CALL_6| main_~s~0.base (store (select |v_#memory_int_BEFORE_CALL_6| main_~s~0.base) main_~s~0.offset sll_update_at_~data)) |#memory_int|) (not (= .cse1 main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))))) [2018-11-23 11:19:17,044 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse1))) (and (not (= .cse0 main_~s~0.base)) (= (bvadd (bvneg (bvneg main_~len~0)) main_~len~0 (_ bv4294967295 32)) (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse1))) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))))) [2018-11-23 11:19:17,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 48 [2018-11-23 11:19:17,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2018-11-23 11:19:17,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:17,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 5 [2018-11-23 11:19:17,967 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:17,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:18,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 11:19:18,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-23 11:19:18,067 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:18,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 11:19:18,101 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:18,102 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:18,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:18,108 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:69, output treesize:9 [2018-11-23 11:19:18,117 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:18,118 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, main_~s~0.base, |#memory_int|, |#memory_$Pointer$.offset|, v_main_~s~0.base_BEFORE_CALL_3]. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)))) (let ((.cse1 (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv4 32)))) (.cse2 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)))) (and (not (= .cse0 main_~s~0.base)) (= |main_#t~ret14| .cse1) (not (= .cse2 v_main_~s~0.base_BEFORE_CALL_3)) (= (_ bv3 32) main_~expected~0) (= (bvadd .cse1 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| .cse2) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32))))) [2018-11-23 11:19:18,118 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvadd |main_#t~ret14| (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv3 32) main_~expected~0)) [2018-11-23 11:19:18,120 INFO L256 TraceCheckUtils]: 0: Hoare triple {2522#true} call ULTIMATE.init(); {2522#true} is VALID [2018-11-23 11:19:18,120 INFO L273 TraceCheckUtils]: 1: Hoare triple {2522#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2522#true} is VALID [2018-11-23 11:19:18,120 INFO L273 TraceCheckUtils]: 2: Hoare triple {2522#true} assume true; {2522#true} is VALID [2018-11-23 11:19:18,120 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2522#true} {2522#true} #135#return; {2522#true} is VALID [2018-11-23 11:19:18,120 INFO L256 TraceCheckUtils]: 4: Hoare triple {2522#true} call #t~ret15 := main(); {2522#true} is VALID [2018-11-23 11:19:18,121 INFO L273 TraceCheckUtils]: 5: Hoare triple {2522#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2542#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:19:18,121 INFO L256 TraceCheckUtils]: 6: Hoare triple {2542#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {2522#true} is VALID [2018-11-23 11:19:18,121 INFO L273 TraceCheckUtils]: 7: Hoare triple {2522#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2522#true} is VALID [2018-11-23 11:19:18,121 INFO L273 TraceCheckUtils]: 8: Hoare triple {2522#true} assume !!~bvsgt32(~len, 0bv32); {2522#true} is VALID [2018-11-23 11:19:18,121 INFO L256 TraceCheckUtils]: 9: Hoare triple {2522#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2522#true} is VALID [2018-11-23 11:19:18,123 INFO L273 TraceCheckUtils]: 10: Hoare triple {2522#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2558#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:19:18,123 INFO L273 TraceCheckUtils]: 11: Hoare triple {2558#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2558#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:19:18,124 INFO L273 TraceCheckUtils]: 12: Hoare triple {2558#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2565#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:19:18,125 INFO L273 TraceCheckUtils]: 13: Hoare triple {2565#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} assume true; {2565#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:19:18,126 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {2565#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} {2522#true} #133#return; {2572#(= (bvadd (select |#valid| |sll_create_#t~ret4.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:19:18,129 INFO L273 TraceCheckUtils]: 15: Hoare triple {2572#(= (bvadd (select |#valid| |sll_create_#t~ret4.base|) (_ bv1 1)) (_ bv0 1))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2576#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} is VALID [2018-11-23 11:19:18,130 INFO L273 TraceCheckUtils]: 16: Hoare triple {2576#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2576#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} is VALID [2018-11-23 11:19:18,131 INFO L273 TraceCheckUtils]: 17: Hoare triple {2576#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} assume !!~bvsgt32(~len, 0bv32); {2576#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} is VALID [2018-11-23 11:19:18,132 INFO L256 TraceCheckUtils]: 18: Hoare triple {2576#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2586#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:19:18,133 INFO L273 TraceCheckUtils]: 19: Hoare triple {2586#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2590#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:19:18,134 INFO L273 TraceCheckUtils]: 20: Hoare triple {2590#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2590#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:19:18,136 INFO L273 TraceCheckUtils]: 21: Hoare triple {2590#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2597#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:19:18,137 INFO L273 TraceCheckUtils]: 22: Hoare triple {2597#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {2597#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:19:18,139 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {2597#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {2576#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} #133#return; {2604#(and (not (= sll_create_~head~0.base |sll_create_#t~ret4.base|)) (= (_ bv0 32) |sll_create_#t~ret4.offset|))} is VALID [2018-11-23 11:19:18,142 INFO L273 TraceCheckUtils]: 24: Hoare triple {2604#(and (not (= sll_create_~head~0.base |sll_create_#t~ret4.base|)) (= (_ bv0 32) |sll_create_#t~ret4.offset|))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2608#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-23 11:19:18,143 INFO L273 TraceCheckUtils]: 25: Hoare triple {2608#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2608#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-23 11:19:18,143 INFO L273 TraceCheckUtils]: 26: Hoare triple {2608#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} assume !~bvsgt32(~len, 0bv32); {2608#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-23 11:19:18,145 INFO L273 TraceCheckUtils]: 27: Hoare triple {2608#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2618#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:19:18,145 INFO L273 TraceCheckUtils]: 28: Hoare triple {2618#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} assume true; {2618#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:19:18,148 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2618#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} {2542#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #125#return; {2625#(and (not (= |main_#t~ret11.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (_ bv4 32)))) (= |main_#t~ret11.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:18,151 INFO L273 TraceCheckUtils]: 30: Hoare triple {2625#(and (not (= |main_#t~ret11.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (_ bv4 32)))) (= |main_#t~ret11.offset| (_ bv0 32)) (= (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 := ~bvsub32(~len~0, 1bv32); {2629#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0))} is VALID [2018-11-23 11:19:18,172 INFO L273 TraceCheckUtils]: 31: Hoare triple {2629#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0))} assume !!~bvsge32(~i~0, 0bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2633#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd (bvneg main_~len~0) main_~new_data~0)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:18,187 INFO L256 TraceCheckUtils]: 32: Hoare triple {2633#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd (bvneg main_~len~0) main_~new_data~0)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2637#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:19:18,196 INFO L273 TraceCheckUtils]: 33: Hoare triple {2637#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2641#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= sll_update_at_~data |sll_update_at_#in~data|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:19:18,204 INFO L273 TraceCheckUtils]: 34: Hoare triple {2641#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= sll_update_at_~data |sll_update_at_#in~data|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.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; {2645#(and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= sll_update_at_~data |sll_update_at_#in~data|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.offset))} is VALID [2018-11-23 11:19:18,208 INFO L273 TraceCheckUtils]: 35: Hoare triple {2645#(and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= sll_update_at_~data |sll_update_at_#in~data|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.offset))} assume !~bvsgt32(~index, 0bv32); {2645#(and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= sll_update_at_~data |sll_update_at_#in~data|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.offset))} is VALID [2018-11-23 11:19:18,212 INFO L273 TraceCheckUtils]: 36: Hoare triple {2645#(and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= sll_update_at_~data |sll_update_at_#in~data|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.offset))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2652#(and (= |sll_update_at_#in~data| (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))))) (= (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))))) |#memory_$Pointer$.offset|))} is VALID [2018-11-23 11:19:18,220 INFO L273 TraceCheckUtils]: 37: Hoare triple {2652#(and (= |sll_update_at_#in~data| (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))))) (= (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))))) |#memory_$Pointer$.offset|))} assume true; {2652#(and (= |sll_update_at_#in~data| (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))))) (= (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))))) |#memory_$Pointer$.offset|))} is VALID [2018-11-23 11:19:18,223 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2652#(and (= |sll_update_at_#in~data| (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))))) (= (store |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))))) |#memory_$Pointer$.offset|))} {2633#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd (bvneg main_~len~0) main_~new_data~0)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #127#return; {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:19:18,224 INFO L273 TraceCheckUtils]: 39: Hoare triple {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} #t~post12 := ~i~0;~i~0 := ~bvsub32(#t~post12, 1bv32);havoc #t~post12; {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:19:18,225 INFO L273 TraceCheckUtils]: 40: Hoare triple {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} assume !!~bvsge32(~i~0, 0bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:19:18,227 INFO L256 TraceCheckUtils]: 41: Hoare triple {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2669#(and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:19:18,246 INFO L273 TraceCheckUtils]: 42: Hoare triple {2669#(and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2673#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |old(#memory_int)| |#memory_int|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:19:18,250 INFO L273 TraceCheckUtils]: 43: Hoare triple {2673#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |old(#memory_int)| |#memory_int|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !~bvsgt32(~index, 0bv32); {2673#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |old(#memory_int)| |#memory_int|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:19:18,254 INFO L273 TraceCheckUtils]: 44: Hoare triple {2673#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |old(#memory_int)| |#memory_int|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2680#(and (= (store |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|)))) (exists ((sll_update_at_~data (_ BitVec 32))) (= (store |old(#memory_int)| |sll_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| sll_update_at_~data)) |#memory_int|)))} is VALID [2018-11-23 11:19:18,255 INFO L273 TraceCheckUtils]: 45: Hoare triple {2680#(and (= (store |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|)))) (exists ((sll_update_at_~data (_ BitVec 32))) (= (store |old(#memory_int)| |sll_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| sll_update_at_~data)) |#memory_int|)))} assume true; {2680#(and (= (store |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|)))) (exists ((sll_update_at_~data (_ BitVec 32))) (= (store |old(#memory_int)| |sll_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| sll_update_at_~data)) |#memory_int|)))} is VALID [2018-11-23 11:19:18,259 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2680#(and (= (store |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|)))) (exists ((sll_update_at_~data (_ BitVec 32))) (= (store |old(#memory_int)| |sll_update_at_#in~head.base| (store (select |old(#memory_int)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| sll_update_at_~data)) |#memory_int|)))} {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} #127#return; {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:19:18,260 INFO L273 TraceCheckUtils]: 47: Hoare triple {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} #t~post12 := ~i~0;~i~0 := ~bvsub32(#t~post12, 1bv32);havoc #t~post12; {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:19:18,261 INFO L273 TraceCheckUtils]: 48: Hoare triple {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} assume !~bvsge32(~i~0, 0bv32); {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} is VALID [2018-11-23 11:19:18,262 INFO L273 TraceCheckUtils]: 49: Hoare triple {2659#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))} ~i~0 := ~bvsub32(~len~0, 1bv32); {2696#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0))} is VALID [2018-11-23 11:19:18,263 INFO L273 TraceCheckUtils]: 50: Hoare triple {2696#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0))} assume !!~bvsge32(~i~0, 0bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {2700#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (_ bv3 32) main_~expected~0))} is VALID [2018-11-23 11:19:18,266 INFO L256 TraceCheckUtils]: 51: Hoare triple {2700#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (_ bv3 32) main_~expected~0))} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {2704#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 11:19:18,269 INFO L273 TraceCheckUtils]: 52: Hoare triple {2704#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2708#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} is VALID [2018-11-23 11:19:18,272 INFO L273 TraceCheckUtils]: 53: Hoare triple {2708#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} assume !!~bvsgt32(~index, 0bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);~head.base, ~head.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;#t~post7 := ~index;~index := ~bvsub32(#t~post7, 1bv32);havoc #t~post7; {2712#(and (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:19:18,273 INFO L273 TraceCheckUtils]: 54: Hoare triple {2712#(and (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))))} assume !~bvsgt32(~index, 0bv32); {2712#(and (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:19:18,275 INFO L273 TraceCheckUtils]: 55: Hoare triple {2712#(and (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))))} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {2719#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) |sll_get_data_at_#res|))} is VALID [2018-11-23 11:19:18,276 INFO L273 TraceCheckUtils]: 56: Hoare triple {2719#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) |sll_get_data_at_#res|))} assume true; {2719#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) |sll_get_data_at_#res|))} is VALID [2018-11-23 11:19:18,278 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {2719#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_3)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) |sll_get_data_at_#res|))} {2700#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (_ bv3 32) main_~expected~0))} #129#return; {2726#(and (= (bvadd |main_#t~ret14| (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv3 32) main_~expected~0))} is VALID [2018-11-23 11:19:18,278 INFO L273 TraceCheckUtils]: 58: Hoare triple {2726#(and (= (bvadd |main_#t~ret14| (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv3 32) main_~expected~0))} assume ~expected~0 != #t~ret14;havoc #t~ret14; {2523#false} is VALID [2018-11-23 11:19:18,279 INFO L273 TraceCheckUtils]: 59: Hoare triple {2523#false} assume !false; {2523#false} is VALID [2018-11-23 11:19:18,295 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:19:18,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:19:21,460 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-23 11:19:21,564 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-23 11:19:21,813 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 11:19:22,009 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 11:19:22,300 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:19:22,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:22,396 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:22,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:22,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:22,434 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:44 [2018-11-23 11:19:22,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:19:22,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-11-23 11:19:22,892 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-11-23 11:19:22,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:22,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 11:19:23,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:23,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 11:19:23,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 11:19:23,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1585, Unknown=17, NotChecked=0, Total=1722 [2018-11-23 11:19:23,291 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 31 states. [2018-11-23 11:20:59,366 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 30