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_remove_all_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:17:48,826 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:17:48,829 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:17:48,848 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:17:48,848 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:17:48,849 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:17:48,851 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:17:48,854 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:17:48,857 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:17:48,864 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:17:48,865 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:17:48,865 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:17:48,869 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:17:48,870 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:17:48,875 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:17:48,876 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:17:48,876 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:17:48,881 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:17:48,883 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:17:48,885 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:17:48,890 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:17:48,891 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:17:48,897 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:17:48,898 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:17:48,898 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:17:48,899 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:17:48,900 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:17:48,901 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:17:48,906 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:17:48,908 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:17:48,908 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:17:48,909 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:17:48,909 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:17:48,909 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:17:48,911 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:17:48,912 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:17:48,913 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:17:48,941 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:17:48,941 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:17:48,943 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:17:48,943 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:17:48,944 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:17:48,944 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:17:48,944 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:17:48,945 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:17:48,945 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:17:48,945 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:17:48,945 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:17:48,945 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:17:48,946 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:17:48,947 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:17:48,947 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:17:48,947 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:17:48,947 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:17:48,947 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:17:48,948 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:17:48,948 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:17:48,948 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:17:48,948 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:17:48,948 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:17:48,949 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:17:48,950 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:17:48,950 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:17:48,950 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:17:48,951 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:17:48,951 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:17:48,951 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:17:48,951 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:17:48,951 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:17:48,951 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:17:49,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:17:49,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:17:49,038 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:17:49,040 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:17:49,040 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:17:49,041 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:17:49,098 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7b4fb62/84f85dc56d594a529cf4ecd3716047a9/FLAG47dfbe05b [2018-11-23 11:17:49,634 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:17:49,635 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:17:49,649 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7b4fb62/84f85dc56d594a529cf4ecd3716047a9/FLAG47dfbe05b [2018-11-23 11:17:49,902 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7b4fb62/84f85dc56d594a529cf4ecd3716047a9 [2018-11-23 11:17:49,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:17:49,912 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:17:49,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:17:49,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:17:49,917 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:17:49,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:17:49" (1/1) ... [2018-11-23 11:17:49,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@724b713c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:49, skipping insertion in model container [2018-11-23 11:17:49,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:17:49" (1/1) ... [2018-11-23 11:17:49,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:17:49,994 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:17:50,381 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:17:50,400 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:17:50,464 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:17:50,605 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:17:50,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:50 WrapperNode [2018-11-23 11:17:50,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:17:50,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:17:50,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:17:50,607 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:17:50,617 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:17:50" (1/1) ... [2018-11-23 11:17:50,638 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:17:50" (1/1) ... [2018-11-23 11:17:50,647 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:17:50,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:17:50,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:17:50,648 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:17:50,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:50" (1/1) ... [2018-11-23 11:17:50,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:50" (1/1) ... [2018-11-23 11:17:50,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:50" (1/1) ... [2018-11-23 11:17:50,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:50" (1/1) ... [2018-11-23 11:17:50,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:50" (1/1) ... [2018-11-23 11:17:50,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:50" (1/1) ... [2018-11-23 11:17:50,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:50" (1/1) ... [2018-11-23 11:17:50,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:17:50,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:17:50,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:17:50,694 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:17:50,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:50" (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:17:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:17:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:17:50,754 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:17:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 11:17:50,754 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 11:17:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 11:17:50,754 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 11:17:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:17:50,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:17:50,755 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:17:50,755 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:17:50,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:17:50,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:17:50,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:17:50,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:17:50,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 11:17:50,756 INFO L130 BoogieDeclarations]: Found specification of procedure sll_remove_first [2018-11-23 11:17:50,756 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_remove_first [2018-11-23 11:17:50,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:17:50,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:17:51,672 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:17:51,675 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:17:51,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:17:51 BoogieIcfgContainer [2018-11-23 11:17:51,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:17:51,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:17:51,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:17:51,680 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:17:51,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:17:49" (1/3) ... [2018-11-23 11:17:51,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5135a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:17:51, skipping insertion in model container [2018-11-23 11:17:51,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:50" (2/3) ... [2018-11-23 11:17:51,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5135a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:17:51, skipping insertion in model container [2018-11-23 11:17:51,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:17:51" (3/3) ... [2018-11-23 11:17:51,686 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:17:51,710 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:17:51,725 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:17:51,745 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:17:51,796 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:17:51,797 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:17:51,797 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:17:51,797 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:17:51,797 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:17:51,797 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:17:51,798 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:17:51,798 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:17:51,798 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:17:51,823 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-23 11:17:51,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:17:51,830 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:17:51,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:17:51,834 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:17:51,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:17:51,843 INFO L82 PathProgramCache]: Analyzing trace with hash 2062441309, now seen corresponding path program 1 times [2018-11-23 11:17:51,848 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:17:51,849 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:17:51,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:17:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:17:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:17:51,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:17:52,135 INFO L256 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2018-11-23 11:17:52,139 INFO L273 TraceCheckUtils]: 1: Hoare triple {41#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {41#true} is VALID [2018-11-23 11:17:52,140 INFO L273 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2018-11-23 11:17:52,140 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #73#return; {41#true} is VALID [2018-11-23 11:17:52,141 INFO L256 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret11 := main(); {41#true} is VALID [2018-11-23 11:17:52,142 INFO L273 TraceCheckUtils]: 5: Hoare triple {41#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {61#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:17:52,142 INFO L256 TraceCheckUtils]: 6: Hoare triple {61#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {41#true} is VALID [2018-11-23 11:17:52,144 INFO L273 TraceCheckUtils]: 7: Hoare triple {41#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {68#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:17:52,145 INFO L273 TraceCheckUtils]: 8: Hoare triple {68#(= |sll_create_#in~len| sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {72#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:17:52,147 INFO L273 TraceCheckUtils]: 9: Hoare triple {72#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {72#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:17:52,165 INFO L273 TraceCheckUtils]: 10: Hoare triple {72#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {72#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:17:52,168 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {72#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {61#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #67#return; {42#false} is VALID [2018-11-23 11:17:52,168 INFO L273 TraceCheckUtils]: 12: Hoare triple {42#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {42#false} is VALID [2018-11-23 11:17:52,169 INFO L273 TraceCheckUtils]: 13: Hoare triple {42#false} assume !~bvsge32(~i~0, 0bv32); {42#false} is VALID [2018-11-23 11:17:52,169 INFO L273 TraceCheckUtils]: 14: Hoare triple {42#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {42#false} is VALID [2018-11-23 11:17:52,169 INFO L273 TraceCheckUtils]: 15: Hoare triple {42#false} assume 0bv32 != #t~mem10.base || 0bv32 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {42#false} is VALID [2018-11-23 11:17:52,170 INFO L273 TraceCheckUtils]: 16: Hoare triple {42#false} assume !false; {42#false} is VALID [2018-11-23 11:17:52,174 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:17:52,174 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:17:52,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:17:52,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:17:52,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:17:52,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:17:52,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:17:52,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:17:52,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:17:52,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:17:52,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:17:52,271 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2018-11-23 11:17:53,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:53,609 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2018-11-23 11:17:53,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:17:53,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:17:53,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:17:53,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:17:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2018-11-23 11:17:53,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:17:53,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2018-11-23 11:17:53,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2018-11-23 11:17:53,917 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:17:53,931 INFO L225 Difference]: With dead ends: 63 [2018-11-23 11:17:53,932 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:17:53,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:17:53,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:17:54,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-11-23 11:17:54,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:17:54,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 32 states. [2018-11-23 11:17:54,003 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 32 states. [2018-11-23 11:17:54,003 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 32 states. [2018-11-23 11:17:54,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:54,010 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 11:17:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 11:17:54,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:17:54,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:17:54,012 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states. [2018-11-23 11:17:54,012 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states. [2018-11-23 11:17:54,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:54,017 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 11:17:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 11:17:54,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:17:54,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:17:54,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:17:54,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:17:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:17:54,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-23 11:17:54,024 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 17 [2018-11-23 11:17:54,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:17:54,025 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-23 11:17:54,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:17:54,025 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 11:17:54,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:17:54,028 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:17:54,028 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] [2018-11-23 11:17:54,028 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:17:54,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:17:54,029 INFO L82 PathProgramCache]: Analyzing trace with hash -2028601020, now seen corresponding path program 1 times [2018-11-23 11:17:54,031 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:17:54,031 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:17:54,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:17:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:17:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:17:54,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:17:54,325 INFO L256 TraceCheckUtils]: 0: Hoare triple {299#true} call ULTIMATE.init(); {299#true} is VALID [2018-11-23 11:17:54,325 INFO L273 TraceCheckUtils]: 1: Hoare triple {299#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {299#true} is VALID [2018-11-23 11:17:54,326 INFO L273 TraceCheckUtils]: 2: Hoare triple {299#true} assume true; {299#true} is VALID [2018-11-23 11:17:54,326 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {299#true} {299#true} #73#return; {299#true} is VALID [2018-11-23 11:17:54,326 INFO L256 TraceCheckUtils]: 4: Hoare triple {299#true} call #t~ret11 := main(); {299#true} is VALID [2018-11-23 11:17:54,327 INFO L273 TraceCheckUtils]: 5: Hoare triple {299#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {319#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:17:54,327 INFO L256 TraceCheckUtils]: 6: Hoare triple {319#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {299#true} is VALID [2018-11-23 11:17:54,330 INFO L273 TraceCheckUtils]: 7: Hoare triple {299#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {326#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:17:54,331 INFO L273 TraceCheckUtils]: 8: Hoare triple {326#(= |sll_create_#in~len| sll_create_~len)} assume !!~bvsgt32(~len, 0bv32); {326#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:17:54,331 INFO L256 TraceCheckUtils]: 9: Hoare triple {326#(= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {299#true} is VALID [2018-11-23 11:17:54,331 INFO L273 TraceCheckUtils]: 10: Hoare triple {299#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; {299#true} is VALID [2018-11-23 11:17:54,332 INFO L273 TraceCheckUtils]: 11: Hoare triple {299#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {299#true} is VALID [2018-11-23 11:17:54,332 INFO L273 TraceCheckUtils]: 12: Hoare triple {299#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; {299#true} is VALID [2018-11-23 11:17:54,332 INFO L273 TraceCheckUtils]: 13: Hoare triple {299#true} assume true; {299#true} is VALID [2018-11-23 11:17:54,335 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {299#true} {326#(= |sll_create_#in~len| sll_create_~len)} #71#return; {326#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:17:54,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {326#(= |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; {326#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:17:54,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {326#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {354#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:17:54,341 INFO L273 TraceCheckUtils]: 17: Hoare triple {354#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {358#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:54,342 INFO L273 TraceCheckUtils]: 18: Hoare triple {358#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {358#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:54,344 INFO L273 TraceCheckUtils]: 19: Hoare triple {358#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {358#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:54,345 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {358#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {319#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #67#return; {300#false} is VALID [2018-11-23 11:17:54,346 INFO L273 TraceCheckUtils]: 21: Hoare triple {300#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {300#false} is VALID [2018-11-23 11:17:54,346 INFO L273 TraceCheckUtils]: 22: Hoare triple {300#false} assume !~bvsge32(~i~0, 0bv32); {300#false} is VALID [2018-11-23 11:17:54,346 INFO L273 TraceCheckUtils]: 23: Hoare triple {300#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {300#false} is VALID [2018-11-23 11:17:54,347 INFO L273 TraceCheckUtils]: 24: Hoare triple {300#false} assume 0bv32 != #t~mem10.base || 0bv32 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {300#false} is VALID [2018-11-23 11:17:54,347 INFO L273 TraceCheckUtils]: 25: Hoare triple {300#false} assume !false; {300#false} is VALID [2018-11-23 11:17:54,350 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:17:54,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:17:54,765 INFO L273 TraceCheckUtils]: 25: Hoare triple {300#false} assume !false; {300#false} is VALID [2018-11-23 11:17:54,766 INFO L273 TraceCheckUtils]: 24: Hoare triple {300#false} assume 0bv32 != #t~mem10.base || 0bv32 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {300#false} is VALID [2018-11-23 11:17:54,766 INFO L273 TraceCheckUtils]: 23: Hoare triple {300#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {300#false} is VALID [2018-11-23 11:17:54,766 INFO L273 TraceCheckUtils]: 22: Hoare triple {300#false} assume !~bvsge32(~i~0, 0bv32); {300#false} is VALID [2018-11-23 11:17:54,767 INFO L273 TraceCheckUtils]: 21: Hoare triple {300#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {300#false} is VALID [2018-11-23 11:17:54,788 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {358#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {398#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} #67#return; {300#false} is VALID [2018-11-23 11:17:54,803 INFO L273 TraceCheckUtils]: 19: Hoare triple {358#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {358#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:54,811 INFO L273 TraceCheckUtils]: 18: Hoare triple {358#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {358#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:54,812 INFO L273 TraceCheckUtils]: 17: Hoare triple {411#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {358#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:54,815 INFO L273 TraceCheckUtils]: 16: Hoare triple {415#(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; {411#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:17:54,816 INFO L273 TraceCheckUtils]: 15: Hoare triple {415#(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; {415#(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:17:54,817 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {299#true} {415#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #71#return; {415#(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:17:54,817 INFO L273 TraceCheckUtils]: 13: Hoare triple {299#true} assume true; {299#true} is VALID [2018-11-23 11:17:54,818 INFO L273 TraceCheckUtils]: 12: Hoare triple {299#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; {299#true} is VALID [2018-11-23 11:17:54,818 INFO L273 TraceCheckUtils]: 11: Hoare triple {299#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {299#true} is VALID [2018-11-23 11:17:54,818 INFO L273 TraceCheckUtils]: 10: Hoare triple {299#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; {299#true} is VALID [2018-11-23 11:17:54,818 INFO L256 TraceCheckUtils]: 9: Hoare triple {415#(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); {299#true} is VALID [2018-11-23 11:17:54,819 INFO L273 TraceCheckUtils]: 8: Hoare triple {415#(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); {415#(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:17:54,820 INFO L273 TraceCheckUtils]: 7: Hoare triple {299#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {415#(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:17:54,820 INFO L256 TraceCheckUtils]: 6: Hoare triple {398#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {299#true} is VALID [2018-11-23 11:17:54,823 INFO L273 TraceCheckUtils]: 5: Hoare triple {299#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {398#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:17:54,824 INFO L256 TraceCheckUtils]: 4: Hoare triple {299#true} call #t~ret11 := main(); {299#true} is VALID [2018-11-23 11:17:54,824 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {299#true} {299#true} #73#return; {299#true} is VALID [2018-11-23 11:17:54,825 INFO L273 TraceCheckUtils]: 2: Hoare triple {299#true} assume true; {299#true} is VALID [2018-11-23 11:17:54,825 INFO L273 TraceCheckUtils]: 1: Hoare triple {299#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {299#true} is VALID [2018-11-23 11:17:54,825 INFO L256 TraceCheckUtils]: 0: Hoare triple {299#true} call ULTIMATE.init(); {299#true} is VALID [2018-11-23 11:17:54,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:17:54,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:17:54,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 11:17:54,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-23 11:17:54,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:17:54,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:17:54,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:17:54,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:17:54,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:17:54,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:17:54,913 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 9 states. [2018-11-23 11:17:56,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:56,162 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-23 11:17:56,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:17:56,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-23 11:17:56,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:17:56,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:17:56,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2018-11-23 11:17:56,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:17:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2018-11-23 11:17:56,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 57 transitions. [2018-11-23 11:17:56,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:17:56,329 INFO L225 Difference]: With dead ends: 53 [2018-11-23 11:17:56,329 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 11:17:56,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 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:17:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 11:17:56,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 11:17:56,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:17:56,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 36 states. [2018-11-23 11:17:56,363 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 36 states. [2018-11-23 11:17:56,363 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 36 states. [2018-11-23 11:17:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:56,368 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 11:17:56,368 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-23 11:17:56,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:17:56,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:17:56,369 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 39 states. [2018-11-23 11:17:56,369 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 39 states. [2018-11-23 11:17:56,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:56,373 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 11:17:56,374 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-23 11:17:56,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:17:56,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:17:56,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:17:56,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:17:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:17:56,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-23 11:17:56,378 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2018-11-23 11:17:56,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:17:56,378 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-23 11:17:56,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:17:56,379 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-23 11:17:56,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:17:56,380 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:17:56,380 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] [2018-11-23 11:17:56,381 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:17:56,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:17:56,381 INFO L82 PathProgramCache]: Analyzing trace with hash -84078787, now seen corresponding path program 2 times [2018-11-23 11:17:56,382 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:17:56,382 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:17:56,402 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:17:56,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:17:56,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:17:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:17:56,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:17:56,583 INFO L256 TraceCheckUtils]: 0: Hoare triple {671#true} call ULTIMATE.init(); {671#true} is VALID [2018-11-23 11:17:56,583 INFO L273 TraceCheckUtils]: 1: Hoare triple {671#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {671#true} is VALID [2018-11-23 11:17:56,584 INFO L273 TraceCheckUtils]: 2: Hoare triple {671#true} assume true; {671#true} is VALID [2018-11-23 11:17:56,584 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {671#true} {671#true} #73#return; {671#true} is VALID [2018-11-23 11:17:56,584 INFO L256 TraceCheckUtils]: 4: Hoare triple {671#true} call #t~ret11 := main(); {671#true} is VALID [2018-11-23 11:17:56,585 INFO L273 TraceCheckUtils]: 5: Hoare triple {671#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {691#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:17:56,585 INFO L256 TraceCheckUtils]: 6: Hoare triple {691#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {671#true} is VALID [2018-11-23 11:17:56,585 INFO L273 TraceCheckUtils]: 7: Hoare triple {671#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {671#true} is VALID [2018-11-23 11:17:56,586 INFO L273 TraceCheckUtils]: 8: Hoare triple {671#true} assume !!~bvsgt32(~len, 0bv32); {671#true} is VALID [2018-11-23 11:17:56,586 INFO L256 TraceCheckUtils]: 9: Hoare triple {671#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {671#true} is VALID [2018-11-23 11:17:56,586 INFO L273 TraceCheckUtils]: 10: Hoare triple {671#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; {671#true} is VALID [2018-11-23 11:17:56,587 INFO L273 TraceCheckUtils]: 11: Hoare triple {671#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {671#true} is VALID [2018-11-23 11:17:56,587 INFO L273 TraceCheckUtils]: 12: Hoare triple {671#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; {671#true} is VALID [2018-11-23 11:17:56,587 INFO L273 TraceCheckUtils]: 13: Hoare triple {671#true} assume true; {671#true} is VALID [2018-11-23 11:17:56,587 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {671#true} {671#true} #71#return; {671#true} is VALID [2018-11-23 11:17:56,588 INFO L273 TraceCheckUtils]: 15: Hoare triple {671#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; {671#true} is VALID [2018-11-23 11:17:56,588 INFO L273 TraceCheckUtils]: 16: Hoare triple {671#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {671#true} is VALID [2018-11-23 11:17:56,588 INFO L273 TraceCheckUtils]: 17: Hoare triple {671#true} assume !!~bvsgt32(~len, 0bv32); {671#true} is VALID [2018-11-23 11:17:56,589 INFO L256 TraceCheckUtils]: 18: Hoare triple {671#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {671#true} is VALID [2018-11-23 11:17:56,589 INFO L273 TraceCheckUtils]: 19: Hoare triple {671#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; {671#true} is VALID [2018-11-23 11:17:56,590 INFO L273 TraceCheckUtils]: 20: Hoare triple {671#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {671#true} is VALID [2018-11-23 11:17:56,590 INFO L273 TraceCheckUtils]: 21: Hoare triple {671#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; {671#true} is VALID [2018-11-23 11:17:56,590 INFO L273 TraceCheckUtils]: 22: Hoare triple {671#true} assume true; {671#true} is VALID [2018-11-23 11:17:56,591 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {671#true} {671#true} #71#return; {671#true} is VALID [2018-11-23 11:17:56,591 INFO L273 TraceCheckUtils]: 24: Hoare triple {671#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; {671#true} is VALID [2018-11-23 11:17:56,591 INFO L273 TraceCheckUtils]: 25: Hoare triple {671#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {671#true} is VALID [2018-11-23 11:17:56,592 INFO L273 TraceCheckUtils]: 26: Hoare triple {671#true} assume !~bvsgt32(~len, 0bv32); {671#true} is VALID [2018-11-23 11:17:56,592 INFO L273 TraceCheckUtils]: 27: Hoare triple {671#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {671#true} is VALID [2018-11-23 11:17:56,592 INFO L273 TraceCheckUtils]: 28: Hoare triple {671#true} assume true; {671#true} is VALID [2018-11-23 11:17:56,598 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {671#true} {691#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #67#return; {691#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:17:56,599 INFO L273 TraceCheckUtils]: 30: Hoare triple {691#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {767#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:17:56,604 INFO L273 TraceCheckUtils]: 31: Hoare triple {767#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsge32(~i~0, 0bv32); {672#false} is VALID [2018-11-23 11:17:56,604 INFO L273 TraceCheckUtils]: 32: Hoare triple {672#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {672#false} is VALID [2018-11-23 11:17:56,604 INFO L273 TraceCheckUtils]: 33: Hoare triple {672#false} assume 0bv32 != #t~mem10.base || 0bv32 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {672#false} is VALID [2018-11-23 11:17:56,605 INFO L273 TraceCheckUtils]: 34: Hoare triple {672#false} assume !false; {672#false} is VALID [2018-11-23 11:17:56,607 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:17:56,607 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:17:56,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:17:56,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:17:56,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-23 11:17:56,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:17:56,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:17:56,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:17:56,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:17:56,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:17:56,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:17:56,667 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 4 states. [2018-11-23 11:17:56,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:56,960 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-11-23 11:17:56,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:17:56,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-23 11:17:56,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:17:56,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:17:56,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2018-11-23 11:17:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:17:56,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2018-11-23 11:17:56,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2018-11-23 11:17:57,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:17:57,091 INFO L225 Difference]: With dead ends: 43 [2018-11-23 11:17:57,091 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 11:17:57,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:17:57,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 11:17:57,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 11:17:57,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:17:57,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 11:17:57,136 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 11:17:57,136 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 11:17:57,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:57,141 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 11:17:57,141 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-23 11:17:57,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:17:57,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:17:57,143 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 11:17:57,143 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 11:17:57,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:57,146 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 11:17:57,146 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-23 11:17:57,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:17:57,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:17:57,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:17:57,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:17:57,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:17:57,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-11-23 11:17:57,150 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 35 [2018-11-23 11:17:57,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:17:57,151 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-23 11:17:57,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:17:57,151 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-11-23 11:17:57,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:17:57,153 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:17:57,153 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] [2018-11-23 11:17:57,153 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:17:57,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:17:57,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1928316000, now seen corresponding path program 1 times [2018-11-23 11:17:57,154 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:17:57,154 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:17:57,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:17:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:17:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:17:57,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:17:57,406 INFO L256 TraceCheckUtils]: 0: Hoare triple {975#true} call ULTIMATE.init(); {975#true} is VALID [2018-11-23 11:17:57,406 INFO L273 TraceCheckUtils]: 1: Hoare triple {975#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {975#true} is VALID [2018-11-23 11:17:57,407 INFO L273 TraceCheckUtils]: 2: Hoare triple {975#true} assume true; {975#true} is VALID [2018-11-23 11:17:57,407 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {975#true} {975#true} #73#return; {975#true} is VALID [2018-11-23 11:17:57,408 INFO L256 TraceCheckUtils]: 4: Hoare triple {975#true} call #t~ret11 := main(); {975#true} is VALID [2018-11-23 11:17:57,413 INFO L273 TraceCheckUtils]: 5: Hoare triple {975#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {995#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:17:57,413 INFO L256 TraceCheckUtils]: 6: Hoare triple {995#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {975#true} is VALID [2018-11-23 11:17:57,414 INFO L273 TraceCheckUtils]: 7: Hoare triple {975#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {975#true} is VALID [2018-11-23 11:17:57,414 INFO L273 TraceCheckUtils]: 8: Hoare triple {975#true} assume !!~bvsgt32(~len, 0bv32); {975#true} is VALID [2018-11-23 11:17:57,414 INFO L256 TraceCheckUtils]: 9: Hoare triple {975#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {975#true} is VALID [2018-11-23 11:17:57,415 INFO L273 TraceCheckUtils]: 10: Hoare triple {975#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; {975#true} is VALID [2018-11-23 11:17:57,415 INFO L273 TraceCheckUtils]: 11: Hoare triple {975#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {975#true} is VALID [2018-11-23 11:17:57,415 INFO L273 TraceCheckUtils]: 12: Hoare triple {975#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; {975#true} is VALID [2018-11-23 11:17:57,415 INFO L273 TraceCheckUtils]: 13: Hoare triple {975#true} assume true; {975#true} is VALID [2018-11-23 11:17:57,416 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {975#true} {975#true} #71#return; {975#true} is VALID [2018-11-23 11:17:57,416 INFO L273 TraceCheckUtils]: 15: Hoare triple {975#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; {975#true} is VALID [2018-11-23 11:17:57,416 INFO L273 TraceCheckUtils]: 16: Hoare triple {975#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {975#true} is VALID [2018-11-23 11:17:57,416 INFO L273 TraceCheckUtils]: 17: Hoare triple {975#true} assume !!~bvsgt32(~len, 0bv32); {975#true} is VALID [2018-11-23 11:17:57,416 INFO L256 TraceCheckUtils]: 18: Hoare triple {975#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {975#true} is VALID [2018-11-23 11:17:57,417 INFO L273 TraceCheckUtils]: 19: Hoare triple {975#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; {975#true} is VALID [2018-11-23 11:17:57,417 INFO L273 TraceCheckUtils]: 20: Hoare triple {975#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {975#true} is VALID [2018-11-23 11:17:57,417 INFO L273 TraceCheckUtils]: 21: Hoare triple {975#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; {975#true} is VALID [2018-11-23 11:17:57,418 INFO L273 TraceCheckUtils]: 22: Hoare triple {975#true} assume true; {975#true} is VALID [2018-11-23 11:17:57,418 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {975#true} {975#true} #71#return; {975#true} is VALID [2018-11-23 11:17:57,418 INFO L273 TraceCheckUtils]: 24: Hoare triple {975#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; {975#true} is VALID [2018-11-23 11:17:57,419 INFO L273 TraceCheckUtils]: 25: Hoare triple {975#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {975#true} is VALID [2018-11-23 11:17:57,419 INFO L273 TraceCheckUtils]: 26: Hoare triple {975#true} assume !~bvsgt32(~len, 0bv32); {975#true} is VALID [2018-11-23 11:17:57,419 INFO L273 TraceCheckUtils]: 27: Hoare triple {975#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {975#true} is VALID [2018-11-23 11:17:57,420 INFO L273 TraceCheckUtils]: 28: Hoare triple {975#true} assume true; {975#true} is VALID [2018-11-23 11:17:57,433 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {975#true} {995#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #67#return; {995#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:17:57,435 INFO L273 TraceCheckUtils]: 30: Hoare triple {995#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {1071#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:17:57,436 INFO L273 TraceCheckUtils]: 31: Hoare triple {1071#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsge32(~i~0, 0bv32); {1071#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:17:57,436 INFO L256 TraceCheckUtils]: 32: Hoare triple {1071#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call sll_remove_first(~#s~0.base, ~#s~0.offset); {975#true} is VALID [2018-11-23 11:17:57,436 INFO L273 TraceCheckUtils]: 33: Hoare triple {975#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, ~bvadd32(4bv32, #t~mem5.offset), 4bv32);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4bv32); {975#true} is VALID [2018-11-23 11:17:57,437 INFO L273 TraceCheckUtils]: 34: Hoare triple {975#true} assume true; {975#true} is VALID [2018-11-23 11:17:57,437 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {975#true} {1071#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #69#return; {1071#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:17:57,440 INFO L273 TraceCheckUtils]: 36: Hoare triple {1071#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post9 := ~i~0;~i~0 := ~bvsub32(#t~post9, 1bv32);havoc #t~post9; {1090#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:17:57,441 INFO L273 TraceCheckUtils]: 37: Hoare triple {1090#(= main_~i~0 (_ bv0 32))} assume !~bvsge32(~i~0, 0bv32); {976#false} is VALID [2018-11-23 11:17:57,441 INFO L273 TraceCheckUtils]: 38: Hoare triple {976#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {976#false} is VALID [2018-11-23 11:17:57,442 INFO L273 TraceCheckUtils]: 39: Hoare triple {976#false} assume 0bv32 != #t~mem10.base || 0bv32 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {976#false} is VALID [2018-11-23 11:17:57,442 INFO L273 TraceCheckUtils]: 40: Hoare triple {976#false} assume !false; {976#false} is VALID [2018-11-23 11:17:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 11:17:57,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:17:57,610 INFO L273 TraceCheckUtils]: 40: Hoare triple {976#false} assume !false; {976#false} is VALID [2018-11-23 11:17:57,610 INFO L273 TraceCheckUtils]: 39: Hoare triple {976#false} assume 0bv32 != #t~mem10.base || 0bv32 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {976#false} is VALID [2018-11-23 11:17:57,610 INFO L273 TraceCheckUtils]: 38: Hoare triple {976#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {976#false} is VALID [2018-11-23 11:17:57,611 INFO L273 TraceCheckUtils]: 37: Hoare triple {1112#(bvsge main_~i~0 (_ bv0 32))} assume !~bvsge32(~i~0, 0bv32); {976#false} is VALID [2018-11-23 11:17:57,612 INFO L273 TraceCheckUtils]: 36: Hoare triple {1116#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post9 := ~i~0;~i~0 := ~bvsub32(#t~post9, 1bv32);havoc #t~post9; {1112#(bvsge main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:17:57,619 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {975#true} {1116#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #69#return; {1116#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:17:57,620 INFO L273 TraceCheckUtils]: 34: Hoare triple {975#true} assume true; {975#true} is VALID [2018-11-23 11:17:57,620 INFO L273 TraceCheckUtils]: 33: Hoare triple {975#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, ~bvadd32(4bv32, #t~mem5.offset), 4bv32);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4bv32); {975#true} is VALID [2018-11-23 11:17:57,620 INFO L256 TraceCheckUtils]: 32: Hoare triple {1116#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call sll_remove_first(~#s~0.base, ~#s~0.offset); {975#true} is VALID [2018-11-23 11:17:57,621 INFO L273 TraceCheckUtils]: 31: Hoare triple {1116#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsge32(~i~0, 0bv32); {1116#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:17:57,624 INFO L273 TraceCheckUtils]: 30: Hoare triple {1135#(bvsge (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {1116#(bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:17:57,625 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {975#true} {1135#(bvsge (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #67#return; {1135#(bvsge (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:17:57,626 INFO L273 TraceCheckUtils]: 28: Hoare triple {975#true} assume true; {975#true} is VALID [2018-11-23 11:17:57,626 INFO L273 TraceCheckUtils]: 27: Hoare triple {975#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {975#true} is VALID [2018-11-23 11:17:57,626 INFO L273 TraceCheckUtils]: 26: Hoare triple {975#true} assume !~bvsgt32(~len, 0bv32); {975#true} is VALID [2018-11-23 11:17:57,626 INFO L273 TraceCheckUtils]: 25: Hoare triple {975#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {975#true} is VALID [2018-11-23 11:17:57,627 INFO L273 TraceCheckUtils]: 24: Hoare triple {975#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; {975#true} is VALID [2018-11-23 11:17:57,627 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {975#true} {975#true} #71#return; {975#true} is VALID [2018-11-23 11:17:57,627 INFO L273 TraceCheckUtils]: 22: Hoare triple {975#true} assume true; {975#true} is VALID [2018-11-23 11:17:57,627 INFO L273 TraceCheckUtils]: 21: Hoare triple {975#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; {975#true} is VALID [2018-11-23 11:17:57,627 INFO L273 TraceCheckUtils]: 20: Hoare triple {975#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {975#true} is VALID [2018-11-23 11:17:57,628 INFO L273 TraceCheckUtils]: 19: Hoare triple {975#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; {975#true} is VALID [2018-11-23 11:17:57,628 INFO L256 TraceCheckUtils]: 18: Hoare triple {975#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {975#true} is VALID [2018-11-23 11:17:57,628 INFO L273 TraceCheckUtils]: 17: Hoare triple {975#true} assume !!~bvsgt32(~len, 0bv32); {975#true} is VALID [2018-11-23 11:17:57,628 INFO L273 TraceCheckUtils]: 16: Hoare triple {975#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {975#true} is VALID [2018-11-23 11:17:57,629 INFO L273 TraceCheckUtils]: 15: Hoare triple {975#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; {975#true} is VALID [2018-11-23 11:17:57,629 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {975#true} {975#true} #71#return; {975#true} is VALID [2018-11-23 11:17:57,630 INFO L273 TraceCheckUtils]: 13: Hoare triple {975#true} assume true; {975#true} is VALID [2018-11-23 11:17:57,630 INFO L273 TraceCheckUtils]: 12: Hoare triple {975#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; {975#true} is VALID [2018-11-23 11:17:57,631 INFO L273 TraceCheckUtils]: 11: Hoare triple {975#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {975#true} is VALID [2018-11-23 11:17:57,631 INFO L273 TraceCheckUtils]: 10: Hoare triple {975#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; {975#true} is VALID [2018-11-23 11:17:57,631 INFO L256 TraceCheckUtils]: 9: Hoare triple {975#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {975#true} is VALID [2018-11-23 11:17:57,631 INFO L273 TraceCheckUtils]: 8: Hoare triple {975#true} assume !!~bvsgt32(~len, 0bv32); {975#true} is VALID [2018-11-23 11:17:57,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {975#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {975#true} is VALID [2018-11-23 11:17:57,632 INFO L256 TraceCheckUtils]: 6: Hoare triple {1135#(bvsge (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {975#true} is VALID [2018-11-23 11:17:57,633 INFO L273 TraceCheckUtils]: 5: Hoare triple {975#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1135#(bvsge (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:17:57,633 INFO L256 TraceCheckUtils]: 4: Hoare triple {975#true} call #t~ret11 := main(); {975#true} is VALID [2018-11-23 11:17:57,633 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {975#true} {975#true} #73#return; {975#true} is VALID [2018-11-23 11:17:57,633 INFO L273 TraceCheckUtils]: 2: Hoare triple {975#true} assume true; {975#true} is VALID [2018-11-23 11:17:57,634 INFO L273 TraceCheckUtils]: 1: Hoare triple {975#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {975#true} is VALID [2018-11-23 11:17:57,634 INFO L256 TraceCheckUtils]: 0: Hoare triple {975#true} call ULTIMATE.init(); {975#true} is VALID [2018-11-23 11:17:57,636 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 11:17:57,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:17:57,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:17:57,644 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-23 11:17:57,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:17:57,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:17:57,751 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:17:57,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:17:57,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:17:57,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:17:57,752 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 8 states. [2018-11-23 11:17:58,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:58,440 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 11:17:58,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:17:58,440 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-23 11:17:58,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:17:58,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:17:58,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2018-11-23 11:17:58,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:17:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2018-11-23 11:17:58,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2018-11-23 11:17:58,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:17:58,529 INFO L225 Difference]: With dead ends: 46 [2018-11-23 11:17:58,530 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:17:58,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 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:17:58,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:17:58,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-23 11:17:58,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:17:58,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2018-11-23 11:17:58,584 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2018-11-23 11:17:58,584 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2018-11-23 11:17:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:58,589 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-23 11:17:58,589 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-23 11:17:58,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:17:58,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:17:58,591 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2018-11-23 11:17:58,591 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2018-11-23 11:17:58,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:58,594 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-23 11:17:58,594 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-23 11:17:58,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:17:58,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:17:58,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:17:58,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:17:58,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:17:58,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-11-23 11:17:58,599 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 41 [2018-11-23 11:17:58,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:17:58,599 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-11-23 11:17:58,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:17:58,599 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-11-23 11:17:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:17:58,601 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:17:58,601 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:17:58,601 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:17:58,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:17:58,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1329540285, now seen corresponding path program 2 times [2018-11-23 11:17:58,602 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:17:58,603 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:17:58,621 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:17:58,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:17:58,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:17:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:17:58,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:17:58,920 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:17:58,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:58,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:58,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:17:58,969 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:17:58,970 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_63|]. (and (= |main_~#s~0.offset| (_ bv0 32)) (= (store |v_#valid_63| |main_~#s~0.base| (_ bv1 1)) |#valid|)) [2018-11-23 11:17:58,970 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (= |main_~#s~0.offset| (_ bv0 32))) [2018-11-23 11:17:59,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:17:59,233 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:17:59,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:59,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:59,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:17:59,278 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:17:59,279 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:59,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:59,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:59,301 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-11-23 11:17:59,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:17:59,748 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 26 treesize of output 27 [2018-11-23 11:17:59,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 11:17:59,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 11:17:59,791 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:59,797 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:59,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:59,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:17:59,883 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 26 treesize of output 27 [2018-11-23 11:17:59,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 11:17:59,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 11:17:59,922 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:59,927 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:59,937 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:59,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:59,984 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:70, output treesize:48 [2018-11-23 11:18:02,134 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:18:02,135 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_BEFORE_CALL_2|, |v_#memory_$Pointer$.offset_BEFORE_CALL_2|]. (and (= (select (store |old(#valid)| sll_create_~head~0.base (_ bv1 1)) |sll_create_#t~ret4.base|) (_ bv0 1)) (= (store |v_#memory_$Pointer$.base_BEFORE_CALL_2| |sll_create_#t~ret4.base| (store (store (select |v_#memory_$Pointer$.base_BEFORE_CALL_2| |sll_create_#t~ret4.base|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.base| |sll_create_#t~ret4.base|) (_ bv0 32)))) |#memory_$Pointer$.base|) (= (_ bv0 32) sll_create_~head~0.offset) (= (_ bv0 32) (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_2| sll_create_~head~0.base) (_ bv4 32))) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_2| |sll_create_#t~ret4.base| (store (store (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| |sll_create_#t~ret4.base|) (_ bv4 32) (_ bv0 32)) (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_create_#t~ret4.base|) (_ bv0 32)))) |#memory_$Pointer$.offset|) (= (select |old(#valid)| sll_create_~head~0.base) (_ bv0 1)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| sll_create_~head~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) |sll_create_#t~ret4.offset|)) [2018-11-23 11:18:02,135 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select (store |old(#valid)| sll_create_~head~0.base (_ bv1 1)) |sll_create_#t~ret4.base|) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |sll_create_#t~ret4.base|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_create_#t~ret4.base|) (_ bv4 32))) (= (_ bv0 32) sll_create_~head~0.offset) (= (select |old(#valid)| sll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) |sll_create_#t~ret4.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv4 32)))) [2018-11-23 11:18:02,313 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:02,324 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:18:02,325 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 26 treesize of output 25 [2018-11-23 11:18:02,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-23 11:18:02,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:02,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:02,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:02,405 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 26 treesize of output 25 [2018-11-23 11:18:02,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-23 11:18:02,420 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:02,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:02,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:02,466 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:54 [2018-11-23 11:18:02,597 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:18:02,598 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_56|, v_sll_create_~head~0.base_17, |v_#memory_$Pointer$.offset_56|]. (let ((.cse0 (select |v_#memory_$Pointer$.offset_56| sll_create_~head~0.base)) (.cse1 (select |v_#memory_$Pointer$.base_56| sll_create_~head~0.base))) (and (= (_ bv0 32) (select .cse0 (_ bv4 32))) (= (_ bv0 32) (select (select |v_#memory_$Pointer$.offset_56| v_sll_create_~head~0.base_17) (_ bv4 32))) (= (store |v_#memory_$Pointer$.offset_56| sll_create_~head~0.base (store .cse0 (_ bv4 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= (_ bv0 1) (select |old(#valid)| v_sll_create_~head~0.base_17)) (= (_ bv0 32) (select (select |v_#memory_$Pointer$.base_56| v_sll_create_~head~0.base_17) (_ bv4 32))) (= (_ bv0 32) sll_create_~head~0.offset) (= (_ bv0 1) (select (store |old(#valid)| v_sll_create_~head~0.base_17 (_ bv1 1)) sll_create_~head~0.base)) (= (select .cse1 (_ bv4 32)) (_ bv0 32)) (= (store |v_#memory_$Pointer$.base_56| sll_create_~head~0.base (store .cse1 (_ bv4 32) v_sll_create_~head~0.base_17)) |#memory_$Pointer$.base|))) [2018-11-23 11:18:02,598 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)))) (and (= (select (select |#memory_$Pointer$.offset| .cse0) (_ bv4 32)) (_ bv0 32)) (= (select |old(#valid)| .cse0) (_ bv0 1)) (= (select (store |old(#valid)| .cse0 (_ bv1 1)) sll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) sll_create_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| .cse0) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv4 32))))) [2018-11-23 11:18:03,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:03,190 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:03,192 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:03,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-23 11:18:03,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:03,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:03,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:56 [2018-11-23 11:18:04,072 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:18:04,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 128 [2018-11-23 11:18:04,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 55 [2018-11-23 11:18:04,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:04,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:04,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:04,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 105 [2018-11-23 11:18:04,299 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 86 [2018-11-23 11:18:04,303 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:18:04,346 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:18:04,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:04,395 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:138, output treesize:79 [2018-11-23 11:18:06,410 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:18:06,411 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#memory_$Pointer$.base)_AFTER_CALL_25|, |v_#memory_$Pointer$.offset_BEFORE_CALL_4|]. (let ((.cse1 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_25| |main_~#s~0.base|))) (let ((.cse4 (select |v_#memory_$Pointer$.offset_BEFORE_CALL_4| |main_~#s~0.base|)) (.cse7 (select .cse1 |main_~#s~0.offset|))) (let ((.cse2 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_25| .cse7)) (.cse6 (select .cse4 |main_~#s~0.offset|))) (let ((.cse3 (bvadd .cse6 (_ bv4 32))) (.cse5 (select |v_#memory_$Pointer$.offset_BEFORE_CALL_4| .cse7)) (.cse0 (select .cse2 (_ bv4 32)))) (and (= (_ bv0 32) (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_4| .cse0) (_ bv4 32))) (not (= .cse0 |main_~#s~0.base|)) (= |#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_25| |main_~#s~0.base| (store .cse1 |main_~#s~0.offset| (select .cse2 .cse3)))) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_4| |main_~#s~0.base| (store .cse4 |main_~#s~0.offset| (select .cse5 .cse3))) |#memory_$Pointer$.offset|) (= (_ bv0 32) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_25| .cse0) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select .cse5 (_ bv4 32))) (= (_ bv0 32) .cse6) (not (= .cse0 .cse7)) (not (= |main_~#s~0.base| .cse7))))))) [2018-11-23 11:18:06,411 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_9]. (let ((.cse2 (select |#memory_$Pointer$.base| v_arrayElimCell_9))) (let ((.cse1 (select |#memory_$Pointer$.offset| v_arrayElimCell_9)) (.cse3 (bvadd |main_~#s~0.offset| (_ bv4 32))) (.cse0 (select .cse2 (_ bv4 32)))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| .cse0) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse0) (_ bv4 32))) (= (_ bv0 32) (select .cse1 (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select .cse2 .cse3)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select .cse1 .cse3)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= |main_~#s~0.base| v_arrayElimCell_9)) (not (= |main_~#s~0.base| .cse0)) (not (= .cse0 v_arrayElimCell_9))))) [2018-11-23 11:18:06,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:06,928 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:18:07,065 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:18:07,076 INFO L303 Elim1Store]: Index analysis took 201 ms [2018-11-23 11:18:07,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 135 [2018-11-23 11:18:07,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 80 [2018-11-23 11:18:07,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:07,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:07,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:07,256 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:18:07,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 135 [2018-11-23 11:18:07,357 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 53 treesize of output 49 [2018-11-23 11:18:07,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:07,390 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:07,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:07,444 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:129, output treesize:121 [2018-11-23 11:18:09,465 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:18:09,465 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#memory_$Pointer$.base)_AFTER_CALL_26|, |v_old(#memory_$Pointer$.offset)_AFTER_CALL_26|, v_arrayElimCell_9]. (let ((.cse8 (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_26| |main_~#s~0.base|))) (let ((.cse1 (select .cse8 |main_~#s~0.offset|)) (.cse4 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_26| |main_~#s~0.base|)) (.cse7 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_26| v_arrayElimCell_9))) (let ((.cse3 (bvadd |main_~#s~0.offset| (_ bv4 32))) (.cse2 (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_26| v_arrayElimCell_9)) (.cse0 (select .cse7 (_ bv4 32))) (.cse5 (select .cse4 |main_~#s~0.offset|)) (.cse6 (bvadd .cse1 (_ bv4 32)))) (and (not (= .cse0 |main_~#s~0.base|)) (= .cse1 (select .cse2 .cse3)) (not (= .cse0 v_arrayElimCell_9)) (= |#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_26| |main_~#s~0.base| (store .cse4 |main_~#s~0.offset| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_26| .cse5) .cse6)))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= |main_~#s~0.base| v_arrayElimCell_9)) (= (select .cse7 .cse3) .cse5) (= (_ bv0 32) (select .cse2 (_ bv4 32))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_26| .cse0) (_ bv4 32)) (_ bv0 32)) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_26| .cse0) (_ bv4 32)) (_ bv0 32)) (= (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_26| |main_~#s~0.base| (store .cse8 |main_~#s~0.offset| (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_26| .cse5) .cse6))) |#memory_$Pointer$.offset|))))) [2018-11-23 11:18:09,465 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_9]. (let ((.cse0 (select |#memory_$Pointer$.offset| v_arrayElimCell_9)) (.cse8 (bvadd |main_~#s~0.offset| (_ bv4 32)))) (let ((.cse3 (select .cse0 .cse8)) (.cse7 (select |#memory_$Pointer$.base| v_arrayElimCell_9))) (let ((.cse6 (select .cse7 .cse8)) (.cse5 (bvadd .cse3 (_ bv4 32)))) (let ((.cse4 (select (select |#memory_$Pointer$.offset| .cse6) .cse5)) (.cse2 (select .cse7 (_ bv4 32))) (.cse1 (select |#memory_$Pointer$.base| .cse6))) (and (= (_ bv0 32) (select .cse0 (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= |main_~#s~0.base| v_arrayElimCell_9)) (= (select .cse1 (_ bv4 32)) (_ bv0 32)) (not (= |main_~#s~0.base| .cse2)) (= .cse3 .cse4) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) .cse4) (not (= .cse2 v_arrayElimCell_9)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select .cse1 .cse5))))))) [2018-11-23 11:18:09,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2018-11-23 11:18:09,803 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 47 treesize of output 28 [2018-11-23 11:18:09,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:09,829 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 13 treesize of output 5 [2018-11-23 11:18:09,830 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:09,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:18:09,851 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:09,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:09,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2018-11-23 11:18:09,914 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 13 treesize of output 5 [2018-11-23 11:18:09,915 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:09,935 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:18:09,937 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:09,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:18:09,950 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:09,953 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:09,962 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:09,963 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:116, output treesize:7 [2018-11-23 11:18:09,990 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:18:09,991 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_arrayElimCell_9, |#memory_$Pointer$.offset|, |main_~#s~0.base|]. (let ((.cse3 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (_ bv4 32)))) (let ((.cse4 (bvadd .cse3 (_ bv4 32))) (.cse6 (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)))) (let ((.cse0 (select |#memory_$Pointer$.base| .cse6)) (.cse5 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (.cse1 (select (select |#memory_$Pointer$.offset| .cse6) .cse4)) (.cse2 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) (_ bv0 32)))) (and (= (_ bv0 32) (select .cse0 (_ bv4 32))) (= .cse1 .cse2) (= (_ bv0 32) .cse3) (not (= |main_~#s~0.base| v_arrayElimCell_9)) (= (select .cse0 .cse4) .cse5) (not (= |main_~#s~0.base| .cse6)) (= |main_#t~mem10.base| .cse5) (= .cse1 .cse3) (not (= .cse6 v_arrayElimCell_9)) (= |main_#t~mem10.offset| .cse2))))) [2018-11-23 11:18:09,991 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~mem10.offset| (_ bv0 32)) (= |main_#t~mem10.base| (_ bv0 32))) [2018-11-23 11:18:10,108 INFO L256 TraceCheckUtils]: 0: Hoare triple {1444#true} call ULTIMATE.init(); {1444#true} is VALID [2018-11-23 11:18:10,108 INFO L273 TraceCheckUtils]: 1: Hoare triple {1444#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1444#true} is VALID [2018-11-23 11:18:10,109 INFO L273 TraceCheckUtils]: 2: Hoare triple {1444#true} assume true; {1444#true} is VALID [2018-11-23 11:18:10,109 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1444#true} {1444#true} #73#return; {1444#true} is VALID [2018-11-23 11:18:10,110 INFO L256 TraceCheckUtils]: 4: Hoare triple {1444#true} call #t~ret11 := main(); {1444#true} is VALID [2018-11-23 11:18:10,111 INFO L273 TraceCheckUtils]: 5: Hoare triple {1444#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1464#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:18:10,115 INFO L256 TraceCheckUtils]: 6: Hoare triple {1464#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {1468#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:18:10,116 INFO L273 TraceCheckUtils]: 7: Hoare triple {1468#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1472#(and (= |#valid| |old(#valid)|) (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:18:10,117 INFO L273 TraceCheckUtils]: 8: Hoare triple {1472#(and (= |#valid| |old(#valid)|) (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} assume !!~bvsgt32(~len, 0bv32); {1472#(and (= |#valid| |old(#valid)|) (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:18:10,117 INFO L256 TraceCheckUtils]: 9: Hoare triple {1472#(and (= |#valid| |old(#valid)|) (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1468#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:18:10,119 INFO L273 TraceCheckUtils]: 10: Hoare triple {1468#(= |#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; {1482#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-23 11:18:10,119 INFO L273 TraceCheckUtils]: 11: Hoare triple {1482#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1482#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-23 11:18:10,120 INFO L273 TraceCheckUtils]: 12: Hoare triple {1482#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} 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; {1489#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:18:10,121 INFO L273 TraceCheckUtils]: 13: Hoare triple {1489#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {1489#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:18:10,124 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1489#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {1472#(and (= |#valid| |old(#valid)|) (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} #71#return; {1496#(and (= |#valid| (store |old(#valid)| |sll_create_#t~ret4.base| (_ bv1 1))) (= (select |old(#valid)| |sll_create_#t~ret4.base|) (_ bv0 1)) (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)) (= (_ bv0 32) |sll_create_#t~ret4.offset|))} is VALID [2018-11-23 11:18:10,132 INFO L273 TraceCheckUtils]: 15: Hoare triple {1496#(and (= |#valid| (store |old(#valid)| |sll_create_#t~ret4.base| (_ bv1 1))) (= (select |old(#valid)| |sll_create_#t~ret4.base|) (_ bv0 1)) (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)) (= (_ 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; {1500#(and (= (store |old(#valid)| sll_create_~head~0.base (_ bv1 1)) |#valid|) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (= (select |old(#valid)| sll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:18:10,133 INFO L273 TraceCheckUtils]: 16: Hoare triple {1500#(and (= (store |old(#valid)| sll_create_~head~0.base (_ bv1 1)) |#valid|) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (= (select |old(#valid)| sll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv4 32))))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1500#(and (= (store |old(#valid)| sll_create_~head~0.base (_ bv1 1)) |#valid|) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (= (select |old(#valid)| sll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:18:10,133 INFO L273 TraceCheckUtils]: 17: Hoare triple {1500#(and (= (store |old(#valid)| sll_create_~head~0.base (_ bv1 1)) |#valid|) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (= (select |old(#valid)| sll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv4 32))))} assume !!~bvsgt32(~len, 0bv32); {1500#(and (= (store |old(#valid)| sll_create_~head~0.base (_ bv1 1)) |#valid|) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (= (select |old(#valid)| sll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:18:10,134 INFO L256 TraceCheckUtils]: 18: Hoare triple {1500#(and (= (store |old(#valid)| sll_create_~head~0.base (_ bv1 1)) |#valid|) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (= (select |old(#valid)| sll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv4 32))))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1510#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:18:10,135 INFO L273 TraceCheckUtils]: 19: Hoare triple {1510#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~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; {1514#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:18:10,136 INFO L273 TraceCheckUtils]: 20: Hoare triple {1514#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1514#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:18:10,137 INFO L273 TraceCheckUtils]: 21: Hoare triple {1514#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ 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; {1521#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) |node_create_#res.offset| (select (select |#memory_$Pointer$.base| |node_create_#res.base|) |node_create_#res.offset|)))) (= (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) |node_create_#res.offset| (select (select |#memory_$Pointer$.offset| |node_create_#res.base|) |node_create_#res.offset|))) |#memory_$Pointer$.offset|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:18:10,138 INFO L273 TraceCheckUtils]: 22: Hoare triple {1521#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) |node_create_#res.offset| (select (select |#memory_$Pointer$.base| |node_create_#res.base|) |node_create_#res.offset|)))) (= (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) |node_create_#res.offset| (select (select |#memory_$Pointer$.offset| |node_create_#res.base|) |node_create_#res.offset|))) |#memory_$Pointer$.offset|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {1521#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) |node_create_#res.offset| (select (select |#memory_$Pointer$.base| |node_create_#res.base|) |node_create_#res.offset|)))) (= (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) |node_create_#res.offset| (select (select |#memory_$Pointer$.offset| |node_create_#res.base|) |node_create_#res.offset|))) |#memory_$Pointer$.offset|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:18:10,145 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1521#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) |node_create_#res.offset| (select (select |#memory_$Pointer$.base| |node_create_#res.base|) |node_create_#res.offset|)))) (= (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)) |node_create_#res.offset| (select (select |#memory_$Pointer$.offset| |node_create_#res.base|) |node_create_#res.offset|))) |#memory_$Pointer$.offset|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {1500#(and (= (store |old(#valid)| sll_create_~head~0.base (_ bv1 1)) |#valid|) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (= (select |old(#valid)| sll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv4 32))))} #71#return; {1528#(and (= (select (store |old(#valid)| sll_create_~head~0.base (_ bv1 1)) |sll_create_#t~ret4.base|) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |sll_create_#t~ret4.base|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_create_#t~ret4.base|) (_ bv4 32))) (= (_ bv0 32) sll_create_~head~0.offset) (= (select |old(#valid)| sll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) |sll_create_#t~ret4.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:18:10,148 INFO L273 TraceCheckUtils]: 24: Hoare triple {1528#(and (= (select (store |old(#valid)| sll_create_~head~0.base (_ bv1 1)) |sll_create_#t~ret4.base|) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |sll_create_#t~ret4.base|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_create_#t~ret4.base|) (_ bv4 32))) (= (_ bv0 32) sll_create_~head~0.offset) (= (select |old(#valid)| sll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) |sll_create_#t~ret4.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv4 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; {1532#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32))) (_ bv0 1)) (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) (_ bv1 1)) sll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) sll_create_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:18:10,150 INFO L273 TraceCheckUtils]: 25: Hoare triple {1532#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32))) (_ bv0 1)) (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) (_ bv1 1)) sll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) sll_create_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv4 32))))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1532#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32))) (_ bv0 1)) (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) (_ bv1 1)) sll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) sll_create_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:18:10,151 INFO L273 TraceCheckUtils]: 26: Hoare triple {1532#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32))) (_ bv0 1)) (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) (_ bv1 1)) sll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) sll_create_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv4 32))))} assume !~bvsgt32(~len, 0bv32); {1532#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32))) (_ bv0 1)) (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) (_ bv1 1)) sll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) sll_create_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:18:10,153 INFO L273 TraceCheckUtils]: 27: Hoare triple {1532#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32))) (_ bv0 1)) (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) (_ bv1 1)) sll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) sll_create_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv4 32))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1542#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) (_ bv1 1)) |sll_create_#res.base|)) (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv4 32)) (_ bv0 32)) (= |sll_create_#res.offset| (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)))))} is VALID [2018-11-23 11:18:10,154 INFO L273 TraceCheckUtils]: 28: Hoare triple {1542#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) (_ bv1 1)) |sll_create_#res.base|)) (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv4 32)) (_ bv0 32)) (= |sll_create_#res.offset| (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)))))} assume true; {1542#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) (_ bv1 1)) |sll_create_#res.base|)) (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv4 32)) (_ bv0 32)) (= |sll_create_#res.offset| (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)))))} is VALID [2018-11-23 11:18:10,158 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1542#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) (_ bv1 1)) |sll_create_#res.base|)) (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv4 32)) (_ bv0 32)) (= |sll_create_#res.offset| (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)))))} {1464#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} #67#return; {1549#(and (not (= |main_~#s~0.base| |main_#t~ret8.base|)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) |main_#t~ret8.offset|) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_#t~ret8.base|) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (_ bv4 32)) |main_#t~ret8.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-23 11:18:10,162 INFO L273 TraceCheckUtils]: 30: Hoare triple {1549#(and (not (= |main_~#s~0.base| |main_#t~ret8.base|)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) |main_#t~ret8.offset|) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_#t~ret8.base|) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (_ bv4 32)) |main_#t~ret8.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret8.base|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)))} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {1553#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))))} is VALID [2018-11-23 11:18:10,163 INFO L273 TraceCheckUtils]: 31: Hoare triple {1553#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))))} assume !!~bvsge32(~i~0, 0bv32); {1553#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))))} is VALID [2018-11-23 11:18:10,164 INFO L256 TraceCheckUtils]: 32: Hoare triple {1553#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))))} call sll_remove_first(~#s~0.base, ~#s~0.offset); {1560#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:18:12,174 INFO L273 TraceCheckUtils]: 33: Hoare triple {1560#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, ~bvadd32(4bv32, #t~mem5.offset), 4bv32);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4bv32); {1564#(and (= (store |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.offset|))} is UNKNOWN [2018-11-23 11:18:12,175 INFO L273 TraceCheckUtils]: 34: Hoare triple {1564#(and (= (store |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.offset|))} assume true; {1564#(and (= (store |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.offset|))} is VALID [2018-11-23 11:18:12,191 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1564#(and (= (store |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.offset|))} {1553#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv4 32))))} #69#return; {1571#(and (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_9 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (not (= |main_~#s~0.base| v_arrayElimCell_9)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)) v_arrayElimCell_9)))))} is VALID [2018-11-23 11:18:12,192 INFO L273 TraceCheckUtils]: 36: Hoare triple {1571#(and (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_9 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (not (= |main_~#s~0.base| v_arrayElimCell_9)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)) v_arrayElimCell_9)))))} #t~post9 := ~i~0;~i~0 := ~bvsub32(#t~post9, 1bv32);havoc #t~post9; {1571#(and (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_9 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (not (= |main_~#s~0.base| v_arrayElimCell_9)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)) v_arrayElimCell_9)))))} is VALID [2018-11-23 11:18:12,193 INFO L273 TraceCheckUtils]: 37: Hoare triple {1571#(and (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_9 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (not (= |main_~#s~0.base| v_arrayElimCell_9)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)) v_arrayElimCell_9)))))} assume !!~bvsge32(~i~0, 0bv32); {1571#(and (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_9 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (not (= |main_~#s~0.base| v_arrayElimCell_9)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)) v_arrayElimCell_9)))))} is VALID [2018-11-23 11:18:12,196 INFO L256 TraceCheckUtils]: 38: Hoare triple {1571#(and (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_9 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (not (= |main_~#s~0.base| v_arrayElimCell_9)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)) v_arrayElimCell_9)))))} call sll_remove_first(~#s~0.base, ~#s~0.offset); {1560#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:18:14,206 INFO L273 TraceCheckUtils]: 39: Hoare triple {1560#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, ~bvadd32(4bv32, #t~mem5.offset), 4bv32);~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4bv32); {1564#(and (= (store |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.offset|))} is UNKNOWN [2018-11-23 11:18:14,207 INFO L273 TraceCheckUtils]: 40: Hoare triple {1564#(and (= (store |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.offset|))} assume true; {1564#(and (= (store |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.offset|))} is VALID [2018-11-23 11:18:14,246 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {1564#(and (= (store |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.base|) (= (store |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base| (store (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset| (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|)) (bvadd (select (select |old(#memory_$Pointer$.offset)| |sll_remove_first_#in~head.base|) |sll_remove_first_#in~head.offset|) (_ bv4 32))))) |#memory_$Pointer$.offset|))} {1571#(and (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_arrayElimCell_9 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (not (= |main_~#s~0.base| v_arrayElimCell_9)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)) v_arrayElimCell_9)))))} #69#return; {1590#(and (exists ((v_arrayElimCell_9 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (_ bv4 32))) (not (= |main_~#s~0.base| v_arrayElimCell_9)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv4 32)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)) v_arrayElimCell_9)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv4 32)))))) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:18:14,247 INFO L273 TraceCheckUtils]: 42: Hoare triple {1590#(and (exists ((v_arrayElimCell_9 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (_ bv4 32))) (not (= |main_~#s~0.base| v_arrayElimCell_9)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv4 32)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)) v_arrayElimCell_9)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv4 32)))))) (= |main_~#s~0.offset| (_ bv0 32)))} #t~post9 := ~i~0;~i~0 := ~bvsub32(#t~post9, 1bv32);havoc #t~post9; {1590#(and (exists ((v_arrayElimCell_9 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (_ bv4 32))) (not (= |main_~#s~0.base| v_arrayElimCell_9)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv4 32)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)) v_arrayElimCell_9)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv4 32)))))) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:18:14,250 INFO L273 TraceCheckUtils]: 43: Hoare triple {1590#(and (exists ((v_arrayElimCell_9 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (_ bv4 32))) (not (= |main_~#s~0.base| v_arrayElimCell_9)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv4 32)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)) v_arrayElimCell_9)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv4 32)))))) (= |main_~#s~0.offset| (_ bv0 32)))} assume !~bvsge32(~i~0, 0bv32); {1590#(and (exists ((v_arrayElimCell_9 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (_ bv4 32))) (not (= |main_~#s~0.base| v_arrayElimCell_9)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv4 32)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)) v_arrayElimCell_9)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv4 32)))))) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:18:14,253 INFO L273 TraceCheckUtils]: 44: Hoare triple {1590#(and (exists ((v_arrayElimCell_9 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (_ bv4 32))) (not (= |main_~#s~0.base| v_arrayElimCell_9)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv4 32)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (_ bv4 32)) v_arrayElimCell_9)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| v_arrayElimCell_9) (bvadd |main_~#s~0.offset| (_ bv4 32))) (_ bv4 32)))))) (= |main_~#s~0.offset| (_ bv0 32)))} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {1600#(and (= |main_#t~mem10.offset| (_ bv0 32)) (= |main_#t~mem10.base| (_ bv0 32)))} is VALID [2018-11-23 11:18:14,253 INFO L273 TraceCheckUtils]: 45: Hoare triple {1600#(and (= |main_#t~mem10.offset| (_ bv0 32)) (= |main_#t~mem10.base| (_ bv0 32)))} assume 0bv32 != #t~mem10.base || 0bv32 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1445#false} is VALID [2018-11-23 11:18:14,254 INFO L273 TraceCheckUtils]: 46: Hoare triple {1445#false} assume !false; {1445#false} is VALID [2018-11-23 11:18:14,269 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:18:14,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:18:14,701 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-23 11:18:14,839 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-23 11:18:18,543 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-23 11:18:18,664 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-23 11:18:22,896 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-23 11:18:23,183 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-23 11:18:23,346 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-23 11:18:27,771 WARN L180 SmtUtils]: Spent 4.40 s on a formula simplification that was a NOOP. DAG size: 116 [2018-11-23 11:18:28,722 WARN L180 SmtUtils]: Spent 936.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-23 11:18:30,163 WARN L180 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 64 [2018-11-23 11:18:31,405 WARN L180 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 62 [2018-11-23 11:18:41,463 WARN L180 SmtUtils]: Spent 7.38 s on a formula simplification. DAG size of input: 199 DAG size of output: 55 [2018-11-23 11:18:41,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:41,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:41,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-11-23 11:18:41,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-23 11:18:41,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:41,751 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:18:41,774 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 28 treesize of output 32 [2018-11-23 11:18:41,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-11-23 11:18:41,844 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 24 treesize of output 29 [2018-11-23 11:18:41,847 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:41,859 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:41,877 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:41,894 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:41,937 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:18:41,938 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:18:41,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:41,948 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:18:41,952 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:18:41,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 70 [2018-11-23 11:18:42,075 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 21 treesize of output 12 [2018-11-23 11:18:42,093 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:42,117 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:18:42,118 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:18:42,121 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 0 case distinctions, treesize of input 25 treesize of output 25 [2018-11-23 11:18:42,142 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 14 [2018-11-23 11:18:42,149 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:42,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 11:18:42,166 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:42,172 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:42,183 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:42,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:42,202 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:531, output treesize:22 [2018-11-23 11:18:44,640 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:18:44,640 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_$Pointer$.base_96|, v_sll_create_~head~0.base_22, v_sll_create_~new_head~0.base_14, |v_#memory_$Pointer$.offset_96|, |v_#memory_$Pointer$.offset_95|, |v_#memory_$Pointer$.base_95|, v_prenex_4, v_prenex_6, v_prenex_5, v_prenex_2, v_prenex_1, v_prenex_3]. (and (let ((.cse2 (select |v_#memory_$Pointer$.offset_96| v_sll_create_~head~0.base_22))) (let ((.cse5 (select |v_#memory_$Pointer$.base_96| v_sll_create_~head~0.base_22)) (.cse6 (store |v_#memory_$Pointer$.offset_96| v_sll_create_~head~0.base_22 (store .cse2 (_ bv4 32) (_ bv0 32))))) (let ((.cse7 (select .cse6 |main_~#s~0.base|)) (.cse9 (store |v_#memory_$Pointer$.base_96| v_sll_create_~head~0.base_22 (store .cse5 (_ bv4 32) v_sll_create_~new_head~0.base_14)))) (let ((.cse0 (select (select .cse9 |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse3 (select .cse7 |main_~#s~0.offset|))) (or (not (= .cse0 v_sll_create_~head~0.base_22)) (not (= (_ bv0 1) (select |#valid| v_sll_create_~new_head~0.base_14))) (not (= |v_#memory_$Pointer$.offset_96| (let ((.cse1 (store |v_#memory_$Pointer$.offset_95| v_sll_create_~new_head~0.base_14 (store (select |v_#memory_$Pointer$.offset_95| v_sll_create_~new_head~0.base_14) (_ bv4 32) (_ bv0 32))))) (store .cse1 v_sll_create_~head~0.base_22 (store (store (select .cse1 v_sll_create_~head~0.base_22) (_ bv4 32) (_ bv0 32)) (_ bv0 32) (select .cse2 (_ bv0 32))))))) (not (= .cse3 (_ bv0 32))) (not (= (_ bv0 1) (select (store |#valid| v_sll_create_~new_head~0.base_14 (_ bv1 1)) v_sll_create_~head~0.base_22))) (not (= |v_#memory_$Pointer$.base_96| (let ((.cse4 (store |v_#memory_$Pointer$.base_95| v_sll_create_~new_head~0.base_14 (store (select |v_#memory_$Pointer$.base_95| v_sll_create_~new_head~0.base_14) (_ bv4 32) (_ bv0 32))))) (store .cse4 v_sll_create_~head~0.base_22 (store (store (select .cse4 v_sll_create_~head~0.base_22) (_ bv4 32) (_ bv0 32)) (_ bv0 32) (select .cse5 (_ bv0 32))))))) (= (let ((.cse10 (bvadd .cse3 (_ bv4 32)))) (let ((.cse8 (select (select .cse6 .cse0) .cse10))) (select (select (store .cse6 |main_~#s~0.base| (store .cse7 |main_~#s~0.offset| .cse8)) (select (select .cse9 .cse0) .cse10)) (bvadd .cse8 (_ bv4 32))))) (_ bv0 32))))))) (let ((.cse13 (select v_prenex_4 v_prenex_6))) (let ((.cse17 (store v_prenex_4 v_prenex_6 (store .cse13 (_ bv4 32) v_prenex_5))) (.cse15 (select v_prenex_2 v_prenex_6))) (let ((.cse21 (store v_prenex_2 v_prenex_6 (store .cse15 (_ bv4 32) (_ bv0 32)))) (.cse18 (select .cse17 |main_~#s~0.base|))) (let ((.cse11 (select .cse18 |main_~#s~0.offset|)) (.cse16 (select (select .cse21 |main_~#s~0.base|) |main_~#s~0.offset|))) (or (not (= .cse11 v_prenex_6)) (not (= v_prenex_4 (let ((.cse12 (store v_prenex_1 v_prenex_5 (store (select v_prenex_1 v_prenex_5) (_ bv4 32) (_ bv0 32))))) (store .cse12 v_prenex_6 (store (store (select .cse12 v_prenex_6) (_ bv4 32) (_ bv0 32)) (_ bv0 32) (select .cse13 (_ bv0 32))))))) (not (= v_prenex_2 (let ((.cse14 (store v_prenex_3 v_prenex_5 (store (select v_prenex_3 v_prenex_5) (_ bv4 32) (_ bv0 32))))) (store .cse14 v_prenex_6 (store (store (select .cse14 v_prenex_6) (_ bv4 32) (_ bv0 32)) (_ bv0 32) (select .cse15 (_ bv0 32))))))) (not (= .cse16 (_ bv0 32))) (not (= (_ bv0 1) (select (store |#valid| v_prenex_5 (_ bv1 1)) v_prenex_6))) (not (= (_ bv0 1) (select |#valid| v_prenex_5))) (= (_ bv0 32) (let ((.cse20 (bvadd .cse16 (_ bv4 32)))) (select (let ((.cse19 (select (select .cse17 .cse11) .cse20))) (select (store .cse17 |main_~#s~0.base| (store .cse18 |main_~#s~0.offset| .cse19)) .cse19)) (bvadd (select (select .cse21 .cse11) .cse20) (_ bv4 32))))))))))) [2018-11-23 11:18:44,641 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (or (not (= (_ bv0 1) (select (store |#valid| |main_~#s~0.base| (_ bv1 1)) (_ bv0 32)))) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= (bvadd |main_~#s~0.offset| (_ bv4294967292 32)) (_ bv0 32)))) [2018-11-23 11:18:48,650 WARN L180 SmtUtils]: Spent 2.28 s on a formula simplification that was a NOOP. DAG size: 163 [2018-11-23 11:18:51,293 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2018-11-23 11:18:59,139 WARN L180 SmtUtils]: Spent 2.19 s on a formula simplification that was a NOOP. DAG size: 172 [2018-11-23 11:18:59,265 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-23 11:18:59,559 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-23 11:18:59,716 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 47