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_Default.epf -i ../../../trunk/examples/svcomp/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:59:03,942 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:59:03,944 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:59:03,961 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:59:03,961 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:59:03,963 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:59:03,964 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:59:03,967 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:59:03,969 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:59:03,971 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:59:03,973 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:59:03,974 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:59:03,975 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:59:03,976 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:59:03,977 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:59:03,986 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:59:03,987 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:59:03,989 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:59:03,993 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:59:03,995 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:59:03,996 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:59:03,997 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:59:03,999 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:59:03,999 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:59:03,999 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:59:04,000 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:59:04,001 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:59:04,002 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:59:04,003 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:59:04,004 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:59:04,004 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:59:04,004 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:59:04,005 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:59:04,005 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:59:04,006 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:59:04,006 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:59:04,007 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:59:04,025 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:59:04,026 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:59:04,027 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:59:04,027 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:59:04,027 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:59:04,028 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:59:04,028 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:59:04,028 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:59:04,028 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:59:04,029 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:59:04,029 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:59:04,029 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:59:04,029 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:59:04,029 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:59:04,029 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:59:04,031 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:59:04,031 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:59:04,031 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:59:04,031 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:59:04,031 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:59:04,033 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:59:04,033 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:59:04,033 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:59:04,034 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:59:04,034 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:59:04,034 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:59:04,034 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:59:04,034 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:59:04,035 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:59:04,035 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:59:04,035 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:59:04,092 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:59:04,106 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:59:04,111 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:59:04,112 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:59:04,113 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:59:04,114 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:59:04,195 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8b81fdf0/a4005843073345e8903ef448cb07a0f6/FLAG278ec4a37 [2018-11-23 12:59:04,697 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:59:04,697 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:59:04,715 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8b81fdf0/a4005843073345e8903ef448cb07a0f6/FLAG278ec4a37 [2018-11-23 12:59:05,002 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8b81fdf0/a4005843073345e8903ef448cb07a0f6 [2018-11-23 12:59:05,013 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:59:05,014 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:59:05,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:59:05,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:59:05,019 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:59:05,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:59:05" (1/1) ... [2018-11-23 12:59:05,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9548ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:05, skipping insertion in model container [2018-11-23 12:59:05,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:59:05" (1/1) ... [2018-11-23 12:59:05,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:59:05,108 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:59:05,535 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:59:05,547 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:59:05,622 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:59:05,796 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:59:05,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:05 WrapperNode [2018-11-23 12:59:05,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:59:05,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:59:05,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:59:05,798 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:59:05,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:05" (1/1) ... [2018-11-23 12:59:05,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:05" (1/1) ... [2018-11-23 12:59:05,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:59:05,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:59:05,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:59:05,850 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:59:05,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:05" (1/1) ... [2018-11-23 12:59:05,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:05" (1/1) ... [2018-11-23 12:59:05,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:05" (1/1) ... [2018-11-23 12:59:05,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:05" (1/1) ... [2018-11-23 12:59:05,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:05" (1/1) ... [2018-11-23 12:59:05,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:05" (1/1) ... [2018-11-23 12:59:05,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:05" (1/1) ... [2018-11-23 12:59:05,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:59:05,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:59:05,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:59:05,920 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:59:05,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:05" (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 12:59:05,986 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 12:59:05,986 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 12:59:05,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:59:05,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:59:05,987 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:59:05,987 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:59:05,987 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 12:59:05,987 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 12:59:05,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:59:05,988 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 12:59:05,988 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 12:59:05,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:59:05,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:59:05,989 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:59:05,989 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:59:05,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:59:05,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:59:05,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:59:05,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 12:59:05,990 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-11-23 12:59:05,990 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-11-23 12:59:05,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:59:05,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:59:07,089 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:59:07,089 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 12:59:07,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:59:07 BoogieIcfgContainer [2018-11-23 12:59:07,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:59:07,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:59:07,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:59:07,094 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:59:07,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:59:05" (1/3) ... [2018-11-23 12:59:07,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51dc29a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:59:07, skipping insertion in model container [2018-11-23 12:59:07,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:05" (2/3) ... [2018-11-23 12:59:07,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51dc29a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:59:07, skipping insertion in model container [2018-11-23 12:59:07,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:59:07" (3/3) ... [2018-11-23 12:59:07,098 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:59:07,109 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:59:07,120 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:59:07,138 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:59:07,170 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:59:07,171 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:59:07,171 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:59:07,171 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:59:07,171 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:59:07,171 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:59:07,172 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:59:07,172 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:59:07,172 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:59:07,191 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-11-23 12:59:07,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:59:07,198 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:59:07,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:59:07,202 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:59:07,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:59:07,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1369807344, now seen corresponding path program 1 times [2018-11-23 12:59:07,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:59:07,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:59:07,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:07,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:59:07,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:07,661 INFO L256 TraceCheckUtils]: 0: Hoare triple {56#true} call ULTIMATE.init(); {56#true} is VALID [2018-11-23 12:59:07,665 INFO L273 TraceCheckUtils]: 1: Hoare triple {56#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {56#true} is VALID [2018-11-23 12:59:07,666 INFO L273 TraceCheckUtils]: 2: Hoare triple {56#true} assume true; {56#true} is VALID [2018-11-23 12:59:07,666 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {56#true} {56#true} #141#return; {56#true} is VALID [2018-11-23 12:59:07,667 INFO L256 TraceCheckUtils]: 4: Hoare triple {56#true} call #t~ret22 := main(); {56#true} is VALID [2018-11-23 12:59:07,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {56#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {58#(<= 2 main_~len~0)} is VALID [2018-11-23 12:59:07,677 INFO L256 TraceCheckUtils]: 6: Hoare triple {58#(<= 2 main_~len~0)} call #t~ret10.base, #t~ret10.offset := sll_create(~len~0, ~data~0); {56#true} is VALID [2018-11-23 12:59:07,679 INFO L273 TraceCheckUtils]: 7: Hoare triple {56#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {59#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:07,685 INFO L273 TraceCheckUtils]: 8: Hoare triple {59#(<= |sll_create_#in~len| sll_create_~len)} assume !(~len > 0); {60#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 12:59:07,688 INFO L273 TraceCheckUtils]: 9: Hoare triple {60#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {60#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 12:59:07,689 INFO L273 TraceCheckUtils]: 10: Hoare triple {60#(<= |sll_create_#in~len| 0)} assume true; {60#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 12:59:07,693 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {60#(<= |sll_create_#in~len| 0)} {58#(<= 2 main_~len~0)} #131#return; {57#false} is VALID [2018-11-23 12:59:07,694 INFO L273 TraceCheckUtils]: 12: Hoare triple {57#false} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5;~mid_index~0 := (if ~len~0 < 0 && 0 != ~len~0 % 2 then 1 + ~len~0 / 2 else ~len~0 / 2); {57#false} is VALID [2018-11-23 12:59:07,695 INFO L256 TraceCheckUtils]: 13: Hoare triple {57#false} call sll_insert(~#s~0.base, ~#s~0.offset, ~uneq~0, ~mid_index~0); {56#true} is VALID [2018-11-23 12:59:07,695 INFO L273 TraceCheckUtils]: 14: Hoare triple {56#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {56#true} is VALID [2018-11-23 12:59:07,696 INFO L256 TraceCheckUtils]: 15: Hoare triple {56#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {56#true} is VALID [2018-11-23 12:59:07,696 INFO L273 TraceCheckUtils]: 16: Hoare triple {56#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {56#true} is VALID [2018-11-23 12:59:07,696 INFO L273 TraceCheckUtils]: 17: Hoare triple {56#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {56#true} is VALID [2018-11-23 12:59:07,697 INFO L273 TraceCheckUtils]: 18: Hoare triple {56#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {56#true} is VALID [2018-11-23 12:59:07,697 INFO L273 TraceCheckUtils]: 19: Hoare triple {56#true} assume true; {56#true} is VALID [2018-11-23 12:59:07,697 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {56#true} {56#true} #139#return; {56#true} is VALID [2018-11-23 12:59:07,698 INFO L273 TraceCheckUtils]: 21: Hoare triple {56#true} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {56#true} is VALID [2018-11-23 12:59:07,698 INFO L273 TraceCheckUtils]: 22: Hoare triple {56#true} assume !(~index > 0); {56#true} is VALID [2018-11-23 12:59:07,698 INFO L273 TraceCheckUtils]: 23: Hoare triple {56#true} assume !(~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~head.base, ~head.offset, 4); {56#true} is VALID [2018-11-23 12:59:07,698 INFO L273 TraceCheckUtils]: 24: Hoare triple {56#true} call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4); {56#true} is VALID [2018-11-23 12:59:07,699 INFO L273 TraceCheckUtils]: 25: Hoare triple {56#true} assume true; {56#true} is VALID [2018-11-23 12:59:07,699 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {56#true} {57#false} #133#return; {57#false} is VALID [2018-11-23 12:59:07,699 INFO L273 TraceCheckUtils]: 27: Hoare triple {57#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0; {57#false} is VALID [2018-11-23 12:59:07,700 INFO L273 TraceCheckUtils]: 28: Hoare triple {57#false} assume !!((~ptr~0.base != 0 || ~ptr~0.offset != 0) && ~count~0 != ~mid_index~0);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4);~temp~2.base, ~temp~2.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;call #t~mem13 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {57#false} is VALID [2018-11-23 12:59:07,700 INFO L273 TraceCheckUtils]: 29: Hoare triple {57#false} assume ~data~0 != #t~mem13;havoc #t~mem13; {57#false} is VALID [2018-11-23 12:59:07,701 INFO L273 TraceCheckUtils]: 30: Hoare triple {57#false} assume !false; {57#false} is VALID [2018-11-23 12:59:07,714 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 12:59:07,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:59:07,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:59:07,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 12:59:07,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:59:07,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:59:07,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:07,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:59:07,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:59:07,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:59:07,984 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 5 states. [2018-11-23 12:59:08,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:08,948 INFO L93 Difference]: Finished difference Result 101 states and 135 transitions. [2018-11-23 12:59:08,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:59:08,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 12:59:08,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:59:08,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:59:08,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2018-11-23 12:59:08,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:59:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2018-11-23 12:59:08,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 135 transitions. [2018-11-23 12:59:09,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:09,318 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:59:09,318 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:59:09,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:59:09,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:59:09,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-23 12:59:09,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:59:09,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 41 states. [2018-11-23 12:59:09,573 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 41 states. [2018-11-23 12:59:09,573 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 41 states. [2018-11-23 12:59:09,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:09,580 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-23 12:59:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 12:59:09,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:09,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:09,582 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 44 states. [2018-11-23 12:59:09,582 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 44 states. [2018-11-23 12:59:09,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:09,588 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-23 12:59:09,588 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 12:59:09,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:09,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:09,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:59:09,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:59:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:59:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-23 12:59:09,599 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 31 [2018-11-23 12:59:09,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:59:09,600 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 12:59:09,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:59:09,600 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 12:59:09,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:59:09,602 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:59:09,602 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:59:09,604 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:59:09,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:59:09,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1275872634, now seen corresponding path program 1 times [2018-11-23 12:59:09,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:59:09,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:59:09,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:09,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:59:09,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:09,831 INFO L256 TraceCheckUtils]: 0: Hoare triple {350#true} call ULTIMATE.init(); {350#true} is VALID [2018-11-23 12:59:09,832 INFO L273 TraceCheckUtils]: 1: Hoare triple {350#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {350#true} is VALID [2018-11-23 12:59:09,832 INFO L273 TraceCheckUtils]: 2: Hoare triple {350#true} assume true; {350#true} is VALID [2018-11-23 12:59:09,833 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {350#true} {350#true} #141#return; {350#true} is VALID [2018-11-23 12:59:09,833 INFO L256 TraceCheckUtils]: 4: Hoare triple {350#true} call #t~ret22 := main(); {350#true} is VALID [2018-11-23 12:59:09,834 INFO L273 TraceCheckUtils]: 5: Hoare triple {350#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {352#(<= 2 main_~len~0)} is VALID [2018-11-23 12:59:09,834 INFO L256 TraceCheckUtils]: 6: Hoare triple {352#(<= 2 main_~len~0)} call #t~ret10.base, #t~ret10.offset := sll_create(~len~0, ~data~0); {350#true} is VALID [2018-11-23 12:59:09,835 INFO L273 TraceCheckUtils]: 7: Hoare triple {350#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {350#true} is VALID [2018-11-23 12:59:09,835 INFO L273 TraceCheckUtils]: 8: Hoare triple {350#true} assume !!(~len > 0); {350#true} is VALID [2018-11-23 12:59:09,835 INFO L256 TraceCheckUtils]: 9: Hoare triple {350#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {350#true} is VALID [2018-11-23 12:59:09,836 INFO L273 TraceCheckUtils]: 10: Hoare triple {350#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {350#true} is VALID [2018-11-23 12:59:09,836 INFO L273 TraceCheckUtils]: 11: Hoare triple {350#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {350#true} is VALID [2018-11-23 12:59:09,837 INFO L273 TraceCheckUtils]: 12: Hoare triple {350#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {350#true} is VALID [2018-11-23 12:59:09,837 INFO L273 TraceCheckUtils]: 13: Hoare triple {350#true} assume true; {350#true} is VALID [2018-11-23 12:59:09,838 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {350#true} {350#true} #137#return; {350#true} is VALID [2018-11-23 12:59:09,838 INFO L273 TraceCheckUtils]: 15: Hoare triple {350#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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {350#true} is VALID [2018-11-23 12:59:09,839 INFO L273 TraceCheckUtils]: 16: Hoare triple {350#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {350#true} is VALID [2018-11-23 12:59:09,839 INFO L273 TraceCheckUtils]: 17: Hoare triple {350#true} assume !(~len > 0); {350#true} is VALID [2018-11-23 12:59:09,839 INFO L273 TraceCheckUtils]: 18: Hoare triple {350#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {350#true} is VALID [2018-11-23 12:59:09,839 INFO L273 TraceCheckUtils]: 19: Hoare triple {350#true} assume true; {350#true} is VALID [2018-11-23 12:59:09,844 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {350#true} {352#(<= 2 main_~len~0)} #131#return; {352#(<= 2 main_~len~0)} is VALID [2018-11-23 12:59:09,848 INFO L273 TraceCheckUtils]: 21: Hoare triple {352#(<= 2 main_~len~0)} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5;~mid_index~0 := (if ~len~0 < 0 && 0 != ~len~0 % 2 then 1 + ~len~0 / 2 else ~len~0 / 2); {353#(<= 1 main_~mid_index~0)} is VALID [2018-11-23 12:59:09,848 INFO L256 TraceCheckUtils]: 22: Hoare triple {353#(<= 1 main_~mid_index~0)} call sll_insert(~#s~0.base, ~#s~0.offset, ~uneq~0, ~mid_index~0); {350#true} is VALID [2018-11-23 12:59:09,867 INFO L273 TraceCheckUtils]: 23: Hoare triple {350#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {354#(= sll_insert_~index |sll_insert_#in~index|)} is VALID [2018-11-23 12:59:09,867 INFO L256 TraceCheckUtils]: 24: Hoare triple {354#(= sll_insert_~index |sll_insert_#in~index|)} call #t~ret6.base, #t~ret6.offset := node_create(~data); {350#true} is VALID [2018-11-23 12:59:09,868 INFO L273 TraceCheckUtils]: 25: Hoare triple {350#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {350#true} is VALID [2018-11-23 12:59:09,868 INFO L273 TraceCheckUtils]: 26: Hoare triple {350#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {350#true} is VALID [2018-11-23 12:59:09,868 INFO L273 TraceCheckUtils]: 27: Hoare triple {350#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {350#true} is VALID [2018-11-23 12:59:09,869 INFO L273 TraceCheckUtils]: 28: Hoare triple {350#true} assume true; {350#true} is VALID [2018-11-23 12:59:09,878 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {350#true} {354#(= sll_insert_~index |sll_insert_#in~index|)} #139#return; {354#(= sll_insert_~index |sll_insert_#in~index|)} is VALID [2018-11-23 12:59:09,883 INFO L273 TraceCheckUtils]: 30: Hoare triple {354#(= sll_insert_~index |sll_insert_#in~index|)} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {354#(= sll_insert_~index |sll_insert_#in~index|)} is VALID [2018-11-23 12:59:09,885 INFO L273 TraceCheckUtils]: 31: Hoare triple {354#(= sll_insert_~index |sll_insert_#in~index|)} assume !(~index > 0); {355#(<= |sll_insert_#in~index| 0)} is VALID [2018-11-23 12:59:09,888 INFO L273 TraceCheckUtils]: 32: Hoare triple {355#(<= |sll_insert_#in~index| 0)} assume !(~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~head.base, ~head.offset, 4); {355#(<= |sll_insert_#in~index| 0)} is VALID [2018-11-23 12:59:09,888 INFO L273 TraceCheckUtils]: 33: Hoare triple {355#(<= |sll_insert_#in~index| 0)} call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4); {355#(<= |sll_insert_#in~index| 0)} is VALID [2018-11-23 12:59:09,891 INFO L273 TraceCheckUtils]: 34: Hoare triple {355#(<= |sll_insert_#in~index| 0)} assume true; {355#(<= |sll_insert_#in~index| 0)} is VALID [2018-11-23 12:59:09,892 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {355#(<= |sll_insert_#in~index| 0)} {353#(<= 1 main_~mid_index~0)} #133#return; {351#false} is VALID [2018-11-23 12:59:09,892 INFO L273 TraceCheckUtils]: 36: Hoare triple {351#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0; {351#false} is VALID [2018-11-23 12:59:09,893 INFO L273 TraceCheckUtils]: 37: Hoare triple {351#false} assume !!((~ptr~0.base != 0 || ~ptr~0.offset != 0) && ~count~0 != ~mid_index~0);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4);~temp~2.base, ~temp~2.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;call #t~mem13 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {351#false} is VALID [2018-11-23 12:59:09,893 INFO L273 TraceCheckUtils]: 38: Hoare triple {351#false} assume ~data~0 != #t~mem13;havoc #t~mem13; {351#false} is VALID [2018-11-23 12:59:09,893 INFO L273 TraceCheckUtils]: 39: Hoare triple {351#false} assume !false; {351#false} is VALID [2018-11-23 12:59:09,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:59:09,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:59:09,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:59:09,899 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-23 12:59:09,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:59:09,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:59:09,960 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 12:59:09,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:59:09,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:59:09,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:59:09,962 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 6 states. [2018-11-23 12:59:10,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:10,395 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2018-11-23 12:59:10,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:59:10,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-23 12:59:10,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:59:10,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:59:10,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2018-11-23 12:59:10,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:59:10,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2018-11-23 12:59:10,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2018-11-23 12:59:10,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:10,577 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:59:10,578 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:59:10,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:59:10,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:59:10,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 12:59:10,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:59:10,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-23 12:59:10,618 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 12:59:10,619 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 12:59:10,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:10,623 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-23 12:59:10,623 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-23 12:59:10,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:10,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:10,624 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 12:59:10,625 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 12:59:10,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:10,629 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-23 12:59:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-23 12:59:10,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:10,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:10,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:59:10,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:59:10,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:59:10,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-11-23 12:59:10,633 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 40 [2018-11-23 12:59:10,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:59:10,634 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-11-23 12:59:10,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:59:10,634 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-23 12:59:10,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 12:59:10,636 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:59:10,636 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:59:10,636 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:59:10,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:59:10,637 INFO L82 PathProgramCache]: Analyzing trace with hash 953003947, now seen corresponding path program 1 times [2018-11-23 12:59:10,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:59:10,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:59:10,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:10,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:59:10,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:10,801 INFO L256 TraceCheckUtils]: 0: Hoare triple {583#true} call ULTIMATE.init(); {583#true} is VALID [2018-11-23 12:59:10,802 INFO L273 TraceCheckUtils]: 1: Hoare triple {583#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {583#true} is VALID [2018-11-23 12:59:10,803 INFO L273 TraceCheckUtils]: 2: Hoare triple {583#true} assume true; {583#true} is VALID [2018-11-23 12:59:10,803 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {583#true} {583#true} #141#return; {583#true} is VALID [2018-11-23 12:59:10,803 INFO L256 TraceCheckUtils]: 4: Hoare triple {583#true} call #t~ret22 := main(); {583#true} is VALID [2018-11-23 12:59:10,810 INFO L273 TraceCheckUtils]: 5: Hoare triple {583#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {585#(<= 2 main_~len~0)} is VALID [2018-11-23 12:59:10,811 INFO L256 TraceCheckUtils]: 6: Hoare triple {585#(<= 2 main_~len~0)} call #t~ret10.base, #t~ret10.offset := sll_create(~len~0, ~data~0); {583#true} is VALID [2018-11-23 12:59:10,811 INFO L273 TraceCheckUtils]: 7: Hoare triple {583#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {586#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:10,812 INFO L273 TraceCheckUtils]: 8: Hoare triple {586#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {586#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:10,812 INFO L256 TraceCheckUtils]: 9: Hoare triple {586#(<= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {583#true} is VALID [2018-11-23 12:59:10,813 INFO L273 TraceCheckUtils]: 10: Hoare triple {583#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {583#true} is VALID [2018-11-23 12:59:10,813 INFO L273 TraceCheckUtils]: 11: Hoare triple {583#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {583#true} is VALID [2018-11-23 12:59:10,814 INFO L273 TraceCheckUtils]: 12: Hoare triple {583#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {583#true} is VALID [2018-11-23 12:59:10,814 INFO L273 TraceCheckUtils]: 13: Hoare triple {583#true} assume true; {583#true} is VALID [2018-11-23 12:59:10,822 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {583#true} {586#(<= |sll_create_#in~len| sll_create_~len)} #137#return; {586#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:10,823 INFO L273 TraceCheckUtils]: 15: Hoare triple {586#(<= |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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {586#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:10,826 INFO L273 TraceCheckUtils]: 16: Hoare triple {586#(<= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {587#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 12:59:10,827 INFO L273 TraceCheckUtils]: 17: Hoare triple {587#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {588#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:10,828 INFO L273 TraceCheckUtils]: 18: Hoare triple {588#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {588#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:10,828 INFO L273 TraceCheckUtils]: 19: Hoare triple {588#(<= |sll_create_#in~len| 1)} assume true; {588#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:10,829 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {588#(<= |sll_create_#in~len| 1)} {585#(<= 2 main_~len~0)} #131#return; {584#false} is VALID [2018-11-23 12:59:10,830 INFO L273 TraceCheckUtils]: 21: Hoare triple {584#false} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5;~mid_index~0 := (if ~len~0 < 0 && 0 != ~len~0 % 2 then 1 + ~len~0 / 2 else ~len~0 / 2); {584#false} is VALID [2018-11-23 12:59:10,830 INFO L256 TraceCheckUtils]: 22: Hoare triple {584#false} call sll_insert(~#s~0.base, ~#s~0.offset, ~uneq~0, ~mid_index~0); {583#true} is VALID [2018-11-23 12:59:10,830 INFO L273 TraceCheckUtils]: 23: Hoare triple {583#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {583#true} is VALID [2018-11-23 12:59:10,830 INFO L256 TraceCheckUtils]: 24: Hoare triple {583#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {583#true} is VALID [2018-11-23 12:59:10,831 INFO L273 TraceCheckUtils]: 25: Hoare triple {583#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {583#true} is VALID [2018-11-23 12:59:10,831 INFO L273 TraceCheckUtils]: 26: Hoare triple {583#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {583#true} is VALID [2018-11-23 12:59:10,831 INFO L273 TraceCheckUtils]: 27: Hoare triple {583#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {583#true} is VALID [2018-11-23 12:59:10,831 INFO L273 TraceCheckUtils]: 28: Hoare triple {583#true} assume true; {583#true} is VALID [2018-11-23 12:59:10,832 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {583#true} {583#true} #139#return; {583#true} is VALID [2018-11-23 12:59:10,832 INFO L273 TraceCheckUtils]: 30: Hoare triple {583#true} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {583#true} is VALID [2018-11-23 12:59:10,832 INFO L273 TraceCheckUtils]: 31: Hoare triple {583#true} assume !!(~index > 0);~snd_to_last~0.base, ~snd_to_last~0.offset := ~last~0.base, ~last~0.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~last~0.base, 4 + ~last~0.offset, 4);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;#t~post9 := ~index;~index := #t~post9 - 1;havoc #t~post9; {583#true} is VALID [2018-11-23 12:59:10,832 INFO L273 TraceCheckUtils]: 32: Hoare triple {583#true} assume !(~index > 0); {583#true} is VALID [2018-11-23 12:59:10,833 INFO L273 TraceCheckUtils]: 33: Hoare triple {583#true} assume !(~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~head.base, ~head.offset, 4); {583#true} is VALID [2018-11-23 12:59:10,833 INFO L273 TraceCheckUtils]: 34: Hoare triple {583#true} call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4); {583#true} is VALID [2018-11-23 12:59:10,833 INFO L273 TraceCheckUtils]: 35: Hoare triple {583#true} assume true; {583#true} is VALID [2018-11-23 12:59:10,834 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {583#true} {584#false} #133#return; {584#false} is VALID [2018-11-23 12:59:10,834 INFO L273 TraceCheckUtils]: 37: Hoare triple {584#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0; {584#false} is VALID [2018-11-23 12:59:10,834 INFO L273 TraceCheckUtils]: 38: Hoare triple {584#false} assume !!((~ptr~0.base != 0 || ~ptr~0.offset != 0) && ~count~0 != ~mid_index~0);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4);~temp~2.base, ~temp~2.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;call #t~mem13 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {584#false} is VALID [2018-11-23 12:59:10,835 INFO L273 TraceCheckUtils]: 39: Hoare triple {584#false} assume ~data~0 != #t~mem13;havoc #t~mem13; {584#false} is VALID [2018-11-23 12:59:10,835 INFO L273 TraceCheckUtils]: 40: Hoare triple {584#false} assume !false; {584#false} is VALID [2018-11-23 12:59:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:59:10,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:59:10,839 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:59:10,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:59:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:10,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:59:11,235 INFO L256 TraceCheckUtils]: 0: Hoare triple {583#true} call ULTIMATE.init(); {583#true} is VALID [2018-11-23 12:59:11,236 INFO L273 TraceCheckUtils]: 1: Hoare triple {583#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {583#true} is VALID [2018-11-23 12:59:11,236 INFO L273 TraceCheckUtils]: 2: Hoare triple {583#true} assume true; {583#true} is VALID [2018-11-23 12:59:11,236 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {583#true} {583#true} #141#return; {583#true} is VALID [2018-11-23 12:59:11,237 INFO L256 TraceCheckUtils]: 4: Hoare triple {583#true} call #t~ret22 := main(); {583#true} is VALID [2018-11-23 12:59:11,240 INFO L273 TraceCheckUtils]: 5: Hoare triple {583#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {585#(<= 2 main_~len~0)} is VALID [2018-11-23 12:59:11,240 INFO L256 TraceCheckUtils]: 6: Hoare triple {585#(<= 2 main_~len~0)} call #t~ret10.base, #t~ret10.offset := sll_create(~len~0, ~data~0); {583#true} is VALID [2018-11-23 12:59:11,241 INFO L273 TraceCheckUtils]: 7: Hoare triple {583#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {586#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:11,241 INFO L273 TraceCheckUtils]: 8: Hoare triple {586#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {586#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:11,241 INFO L256 TraceCheckUtils]: 9: Hoare triple {586#(<= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {583#true} is VALID [2018-11-23 12:59:11,242 INFO L273 TraceCheckUtils]: 10: Hoare triple {583#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {583#true} is VALID [2018-11-23 12:59:11,242 INFO L273 TraceCheckUtils]: 11: Hoare triple {583#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {583#true} is VALID [2018-11-23 12:59:11,242 INFO L273 TraceCheckUtils]: 12: Hoare triple {583#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {583#true} is VALID [2018-11-23 12:59:11,243 INFO L273 TraceCheckUtils]: 13: Hoare triple {583#true} assume true; {583#true} is VALID [2018-11-23 12:59:11,257 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {583#true} {586#(<= |sll_create_#in~len| sll_create_~len)} #137#return; {586#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:11,263 INFO L273 TraceCheckUtils]: 15: Hoare triple {586#(<= |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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {586#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:11,266 INFO L273 TraceCheckUtils]: 16: Hoare triple {586#(<= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {587#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 12:59:11,267 INFO L273 TraceCheckUtils]: 17: Hoare triple {587#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {588#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:11,268 INFO L273 TraceCheckUtils]: 18: Hoare triple {588#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {588#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:11,268 INFO L273 TraceCheckUtils]: 19: Hoare triple {588#(<= |sll_create_#in~len| 1)} assume true; {588#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:11,269 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {588#(<= |sll_create_#in~len| 1)} {585#(<= 2 main_~len~0)} #131#return; {584#false} is VALID [2018-11-23 12:59:11,270 INFO L273 TraceCheckUtils]: 21: Hoare triple {584#false} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5;~mid_index~0 := (if ~len~0 < 0 && 0 != ~len~0 % 2 then 1 + ~len~0 / 2 else ~len~0 / 2); {584#false} is VALID [2018-11-23 12:59:11,270 INFO L256 TraceCheckUtils]: 22: Hoare triple {584#false} call sll_insert(~#s~0.base, ~#s~0.offset, ~uneq~0, ~mid_index~0); {584#false} is VALID [2018-11-23 12:59:11,270 INFO L273 TraceCheckUtils]: 23: Hoare triple {584#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {584#false} is VALID [2018-11-23 12:59:11,270 INFO L256 TraceCheckUtils]: 24: Hoare triple {584#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {584#false} is VALID [2018-11-23 12:59:11,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {584#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {584#false} is VALID [2018-11-23 12:59:11,271 INFO L273 TraceCheckUtils]: 26: Hoare triple {584#false} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {584#false} is VALID [2018-11-23 12:59:11,271 INFO L273 TraceCheckUtils]: 27: Hoare triple {584#false} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {584#false} is VALID [2018-11-23 12:59:11,271 INFO L273 TraceCheckUtils]: 28: Hoare triple {584#false} assume true; {584#false} is VALID [2018-11-23 12:59:11,271 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {584#false} {584#false} #139#return; {584#false} is VALID [2018-11-23 12:59:11,272 INFO L273 TraceCheckUtils]: 30: Hoare triple {584#false} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {584#false} is VALID [2018-11-23 12:59:11,272 INFO L273 TraceCheckUtils]: 31: Hoare triple {584#false} assume !!(~index > 0);~snd_to_last~0.base, ~snd_to_last~0.offset := ~last~0.base, ~last~0.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~last~0.base, 4 + ~last~0.offset, 4);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;#t~post9 := ~index;~index := #t~post9 - 1;havoc #t~post9; {584#false} is VALID [2018-11-23 12:59:11,272 INFO L273 TraceCheckUtils]: 32: Hoare triple {584#false} assume !(~index > 0); {584#false} is VALID [2018-11-23 12:59:11,273 INFO L273 TraceCheckUtils]: 33: Hoare triple {584#false} assume !(~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~head.base, ~head.offset, 4); {584#false} is VALID [2018-11-23 12:59:11,273 INFO L273 TraceCheckUtils]: 34: Hoare triple {584#false} call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4); {584#false} is VALID [2018-11-23 12:59:11,273 INFO L273 TraceCheckUtils]: 35: Hoare triple {584#false} assume true; {584#false} is VALID [2018-11-23 12:59:11,274 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {584#false} {584#false} #133#return; {584#false} is VALID [2018-11-23 12:59:11,274 INFO L273 TraceCheckUtils]: 37: Hoare triple {584#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0; {584#false} is VALID [2018-11-23 12:59:11,274 INFO L273 TraceCheckUtils]: 38: Hoare triple {584#false} assume !!((~ptr~0.base != 0 || ~ptr~0.offset != 0) && ~count~0 != ~mid_index~0);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4);~temp~2.base, ~temp~2.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;call #t~mem13 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {584#false} is VALID [2018-11-23 12:59:11,274 INFO L273 TraceCheckUtils]: 39: Hoare triple {584#false} assume ~data~0 != #t~mem13;havoc #t~mem13; {584#false} is VALID [2018-11-23 12:59:11,275 INFO L273 TraceCheckUtils]: 40: Hoare triple {584#false} assume !false; {584#false} is VALID [2018-11-23 12:59:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:59:11,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:59:11,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 12:59:11,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-11-23 12:59:11,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:59:11,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:59:11,446 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:11,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:59:11,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:59:11,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:59:11,448 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 6 states. [2018-11-23 12:59:12,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:12,156 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2018-11-23 12:59:12,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:59:12,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-11-23 12:59:12,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:59:12,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:59:12,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2018-11-23 12:59:12,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:59:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2018-11-23 12:59:12,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 93 transitions. [2018-11-23 12:59:12,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:12,357 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:59:12,357 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:59:12,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:59:12,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:59:12,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-11-23 12:59:12,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:59:12,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 46 states. [2018-11-23 12:59:12,420 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 46 states. [2018-11-23 12:59:12,421 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 46 states. [2018-11-23 12:59:12,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:12,424 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2018-11-23 12:59:12,424 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2018-11-23 12:59:12,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:12,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:12,425 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 49 states. [2018-11-23 12:59:12,426 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 49 states. [2018-11-23 12:59:12,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:12,429 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2018-11-23 12:59:12,429 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2018-11-23 12:59:12,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:12,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:12,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:59:12,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:59:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:59:12,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2018-11-23 12:59:12,434 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 41 [2018-11-23 12:59:12,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:59:12,434 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2018-11-23 12:59:12,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:59:12,435 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2018-11-23 12:59:12,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 12:59:12,436 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:59:12,437 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:59:12,437 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:59:12,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:59:12,438 INFO L82 PathProgramCache]: Analyzing trace with hash 195482261, now seen corresponding path program 2 times [2018-11-23 12:59:12,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:59:12,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:59:12,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:12,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:59:12,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:14,164 INFO L256 TraceCheckUtils]: 0: Hoare triple {985#true} call ULTIMATE.init(); {985#true} is VALID [2018-11-23 12:59:14,164 INFO L273 TraceCheckUtils]: 1: Hoare triple {985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {985#true} is VALID [2018-11-23 12:59:14,165 INFO L273 TraceCheckUtils]: 2: Hoare triple {985#true} assume true; {985#true} is VALID [2018-11-23 12:59:14,165 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {985#true} {985#true} #141#return; {985#true} is VALID [2018-11-23 12:59:14,166 INFO L256 TraceCheckUtils]: 4: Hoare triple {985#true} call #t~ret22 := main(); {985#true} is VALID [2018-11-23 12:59:14,167 INFO L273 TraceCheckUtils]: 5: Hoare triple {985#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {987#(= (select |#valid| |main_~#s~0.base|) 1)} is VALID [2018-11-23 12:59:14,168 INFO L256 TraceCheckUtils]: 6: Hoare triple {987#(= (select |#valid| |main_~#s~0.base|) 1)} call #t~ret10.base, #t~ret10.offset := sll_create(~len~0, ~data~0); {988#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:14,169 INFO L273 TraceCheckUtils]: 7: Hoare triple {988#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {988#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:14,169 INFO L273 TraceCheckUtils]: 8: Hoare triple {988#(= |#valid| |old(#valid)|)} assume !!(~len > 0); {988#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:14,170 INFO L256 TraceCheckUtils]: 9: Hoare triple {988#(= |#valid| |old(#valid)|)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {988#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:14,172 INFO L273 TraceCheckUtils]: 10: Hoare triple {988#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {989#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:14,174 INFO L273 TraceCheckUtils]: 11: Hoare triple {989#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {989#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:14,176 INFO L273 TraceCheckUtils]: 12: Hoare triple {989#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {989#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:14,177 INFO L273 TraceCheckUtils]: 13: Hoare triple {989#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {989#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:14,180 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {989#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} {988#(= |#valid| |old(#valid)|)} #137#return; {989#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:14,182 INFO L273 TraceCheckUtils]: 15: Hoare triple {989#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} ~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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {989#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:14,184 INFO L273 TraceCheckUtils]: 16: Hoare triple {989#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {989#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:14,185 INFO L273 TraceCheckUtils]: 17: Hoare triple {989#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !!(~len > 0); {989#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:14,187 INFO L256 TraceCheckUtils]: 18: Hoare triple {989#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {988#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:14,189 INFO L273 TraceCheckUtils]: 19: Hoare triple {988#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {990#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:14,190 INFO L273 TraceCheckUtils]: 20: Hoare triple {990#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {990#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:14,192 INFO L273 TraceCheckUtils]: 21: Hoare triple {990#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {991#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 |node_create_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:14,194 INFO L273 TraceCheckUtils]: 22: Hoare triple {991#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 |node_create_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {991#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 |node_create_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:14,199 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {991#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 |node_create_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} {989#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} #137#return; {992#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (not (= 0 |sll_create_#t~ret4.base|)) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:14,202 INFO L273 TraceCheckUtils]: 24: Hoare triple {992#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (not (= 0 |sll_create_#t~ret4.base|)) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} ~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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {993#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-23 12:59:14,204 INFO L273 TraceCheckUtils]: 25: Hoare triple {993#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {993#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-23 12:59:14,206 INFO L273 TraceCheckUtils]: 26: Hoare triple {993#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)))} assume !(~len > 0); {993#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-23 12:59:14,208 INFO L273 TraceCheckUtils]: 27: Hoare triple {993#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {994#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 |sll_create_#res.base|)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:14,210 INFO L273 TraceCheckUtils]: 28: Hoare triple {994#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 |sll_create_#res.base|)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} assume true; {994#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 |sll_create_#res.base|)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:14,214 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {994#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 |sll_create_#res.base|)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} {987#(= (select |#valid| |main_~#s~0.base|) 1)} #131#return; {995#(and (not (= 0 |main_#t~ret10.base|)) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:14,215 INFO L273 TraceCheckUtils]: 30: Hoare triple {995#(and (not (= 0 |main_#t~ret10.base|)) (= (select |#valid| |main_~#s~0.base|) 1))} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5;~mid_index~0 := (if ~len~0 < 0 && 0 != ~len~0 % 2 then 1 + ~len~0 / 2 else ~len~0 / 2); {996#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:14,218 INFO L256 TraceCheckUtils]: 31: Hoare triple {996#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| |main_~#s~0.base|) 1))} call sll_insert(~#s~0.base, ~#s~0.offset, ~uneq~0, ~mid_index~0); {997#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:14,219 INFO L273 TraceCheckUtils]: 32: Hoare triple {997#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {998#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= |#valid| |old(#valid)|) (= (select |#memory_$Pointer$.base| sll_insert_~head.base) (select |old(#memory_$Pointer$.base)| sll_insert_~head.base)))} is VALID [2018-11-23 12:59:14,221 INFO L256 TraceCheckUtils]: 33: Hoare triple {998#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= |#valid| |old(#valid)|) (= (select |#memory_$Pointer$.base| sll_insert_~head.base) (select |old(#memory_$Pointer$.base)| sll_insert_~head.base)))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {997#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:14,222 INFO L273 TraceCheckUtils]: 34: Hoare triple {997#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {999#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:14,223 INFO L273 TraceCheckUtils]: 35: Hoare triple {999#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {999#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:14,227 INFO L273 TraceCheckUtils]: 36: Hoare triple {999#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1000#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2018-11-23 12:59:14,228 INFO L273 TraceCheckUtils]: 37: Hoare triple {1000#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} assume true; {1000#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2018-11-23 12:59:14,231 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1000#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} {998#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= |#valid| |old(#valid)|) (= (select |#memory_$Pointer$.base| sll_insert_~head.base) (select |old(#memory_$Pointer$.base)| sll_insert_~head.base)))} #139#return; {1001#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (or (= 0 (select |old(#valid)| sll_insert_~head.base)) (= (select |#memory_$Pointer$.base| sll_insert_~head.base) (select |old(#memory_$Pointer$.base)| sll_insert_~head.base))))} is VALID [2018-11-23 12:59:14,234 INFO L273 TraceCheckUtils]: 39: Hoare triple {1001#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (or (= 0 (select |old(#valid)| sll_insert_~head.base)) (= (select |#memory_$Pointer$.base| sll_insert_~head.base) (select |old(#memory_$Pointer$.base)| sll_insert_~head.base))))} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {1002#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (or (= 0 (select |old(#valid)| sll_insert_~head.base)) (= (select |#memory_$Pointer$.base| sll_insert_~head.base) (select |old(#memory_$Pointer$.base)| sll_insert_~head.base))) (= (select (select |#memory_$Pointer$.base| sll_insert_~head.base) sll_insert_~head.offset) sll_insert_~last~0.base))} is VALID [2018-11-23 12:59:14,236 INFO L273 TraceCheckUtils]: 40: Hoare triple {1002#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (or (= 0 (select |old(#valid)| sll_insert_~head.base)) (= (select |#memory_$Pointer$.base| sll_insert_~head.base) (select |old(#memory_$Pointer$.base)| sll_insert_~head.base))) (= (select (select |#memory_$Pointer$.base| sll_insert_~head.base) sll_insert_~head.offset) sll_insert_~last~0.base))} assume !!(~index > 0);~snd_to_last~0.base, ~snd_to_last~0.offset := ~last~0.base, ~last~0.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~last~0.base, 4 + ~last~0.offset, 4);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;#t~post9 := ~index;~index := #t~post9 - 1;havoc #t~post9; {1003#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= (select (select |#memory_$Pointer$.base| sll_insert_~head.base) sll_insert_~head.offset) sll_insert_~snd_to_last~0.base) (or (= 0 (select |old(#valid)| sll_insert_~head.base)) (= (select |#memory_$Pointer$.base| sll_insert_~head.base) (select |old(#memory_$Pointer$.base)| sll_insert_~head.base))))} is VALID [2018-11-23 12:59:14,237 INFO L273 TraceCheckUtils]: 41: Hoare triple {1003#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= (select (select |#memory_$Pointer$.base| sll_insert_~head.base) sll_insert_~head.offset) sll_insert_~snd_to_last~0.base) (or (= 0 (select |old(#valid)| sll_insert_~head.base)) (= (select |#memory_$Pointer$.base| sll_insert_~head.base) (select |old(#memory_$Pointer$.base)| sll_insert_~head.base))))} assume !(~index > 0); {1003#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= (select (select |#memory_$Pointer$.base| sll_insert_~head.base) sll_insert_~head.offset) sll_insert_~snd_to_last~0.base) (or (= 0 (select |old(#valid)| sll_insert_~head.base)) (= (select |#memory_$Pointer$.base| sll_insert_~head.base) (select |old(#memory_$Pointer$.base)| sll_insert_~head.base))))} is VALID [2018-11-23 12:59:14,239 INFO L273 TraceCheckUtils]: 42: Hoare triple {1003#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= (select (select |#memory_$Pointer$.base| sll_insert_~head.base) sll_insert_~head.offset) sll_insert_~snd_to_last~0.base) (or (= 0 (select |old(#valid)| sll_insert_~head.base)) (= (select |#memory_$Pointer$.base| sll_insert_~head.base) (select |old(#memory_$Pointer$.base)| sll_insert_~head.base))))} assume !(~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~head.base, ~head.offset, 4); {1004#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (= 0 (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)))} is VALID [2018-11-23 12:59:14,244 INFO L273 TraceCheckUtils]: 43: Hoare triple {1004#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (= 0 (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)))} call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4); {1004#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (= 0 (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)))} is VALID [2018-11-23 12:59:14,245 INFO L273 TraceCheckUtils]: 44: Hoare triple {1004#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (= 0 (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)))} assume true; {1004#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (= 0 (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)))} is VALID [2018-11-23 12:59:14,247 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1004#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (= 0 (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)))} {996#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| |main_~#s~0.base|) 1))} #133#return; {986#false} is VALID [2018-11-23 12:59:14,247 INFO L273 TraceCheckUtils]: 46: Hoare triple {986#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0; {986#false} is VALID [2018-11-23 12:59:14,247 INFO L273 TraceCheckUtils]: 47: Hoare triple {986#false} assume !!((~ptr~0.base != 0 || ~ptr~0.offset != 0) && ~count~0 != ~mid_index~0);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4);~temp~2.base, ~temp~2.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;call #t~mem13 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {986#false} is VALID [2018-11-23 12:59:14,247 INFO L273 TraceCheckUtils]: 48: Hoare triple {986#false} assume ~data~0 != #t~mem13;havoc #t~mem13; {986#false} is VALID [2018-11-23 12:59:14,248 INFO L273 TraceCheckUtils]: 49: Hoare triple {986#false} assume !false; {986#false} is VALID [2018-11-23 12:59:14,268 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:59:14,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:59:14,268 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:59:14,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:59:14,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:59:14,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:59:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:14,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:59:14,678 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 12:59:14,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:14,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:14,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 12:59:14,759 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:14,759 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_27|]. (and (= |#valid| (store |v_#valid_27| |main_~#s~0.base| 1)) (= |main_~#s~0.offset| 0)) [2018-11-23 12:59:14,760 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1)) [2018-11-23 12:59:18,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:18,702 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:18,703 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:18,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 42 [2018-11-23 12:59:18,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-11-23 12:59:18,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:18,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:18,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:59:18,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:35 [2018-11-23 12:59:18,876 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:18,876 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_6|, |node_create_#t~malloc2.base|]. (let ((.cse0 (store |v_#valid_BEFORE_CALL_6| |node_create_#t~malloc2.base| 1))) (and (not (= 0 |main_#t~ret10.base|)) (= |#valid| (store .cse0 |main_#t~ret10.base| 1)) (= (select |v_#valid_BEFORE_CALL_6| |main_~#s~0.base|) 1) (= |main_~#s~0.offset| 0) (= 0 (select |v_#valid_BEFORE_CALL_6| |node_create_#t~malloc2.base|)) (= 0 (select .cse0 |main_#t~ret10.base|)))) [2018-11-23 12:59:18,876 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|node_create_#t~malloc2.base|]. (and (not (= 0 |main_#t~ret10.base|)) (not (= |main_~#s~0.base| |main_#t~ret10.base|)) (= |main_~#s~0.offset| 0) (not (= |node_create_#t~malloc2.base| |main_#t~ret10.base|)) (= 1 (select |#valid| |main_#t~ret10.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= (select |#valid| |main_~#s~0.base|) 1) (= 1 (select |#valid| |node_create_#t~malloc2.base|))) [2018-11-23 12:59:45,562 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:59:45,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:59:45,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 12:59:45,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-11-23 12:59:47,592 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:47,593 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, node_create_~temp~0.base, node_create_~temp~0.offset]. (and (= (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) sll_insert_~last~0.base) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset))))) [2018-11-23 12:59:47,593 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [node_create_~temp~0.base, node_create_~temp~0.offset, v_DerPreprocessor_2]. (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) sll_insert_~last~0.base)) [2018-11-23 12:59:47,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {985#true} call ULTIMATE.init(); {985#true} is VALID [2018-11-23 12:59:47,889 INFO L273 TraceCheckUtils]: 1: Hoare triple {985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {985#true} is VALID [2018-11-23 12:59:47,889 INFO L273 TraceCheckUtils]: 2: Hoare triple {985#true} assume true; {985#true} is VALID [2018-11-23 12:59:47,890 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {985#true} {985#true} #141#return; {985#true} is VALID [2018-11-23 12:59:47,890 INFO L256 TraceCheckUtils]: 4: Hoare triple {985#true} call #t~ret22 := main(); {985#true} is VALID [2018-11-23 12:59:47,895 INFO L273 TraceCheckUtils]: 5: Hoare triple {985#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1023#(and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:47,897 INFO L256 TraceCheckUtils]: 6: Hoare triple {1023#(and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} call #t~ret10.base, #t~ret10.offset := sll_create(~len~0, ~data~0); {988#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:47,905 INFO L273 TraceCheckUtils]: 7: Hoare triple {988#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {988#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:47,908 INFO L273 TraceCheckUtils]: 8: Hoare triple {988#(= |#valid| |old(#valid)|)} assume !!(~len > 0); {988#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:47,917 INFO L256 TraceCheckUtils]: 9: Hoare triple {988#(= |#valid| |old(#valid)|)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {988#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:47,918 INFO L273 TraceCheckUtils]: 10: Hoare triple {988#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1039#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:47,919 INFO L273 TraceCheckUtils]: 11: Hoare triple {1039#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1039#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:47,920 INFO L273 TraceCheckUtils]: 12: Hoare triple {1039#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1039#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:47,921 INFO L273 TraceCheckUtils]: 13: Hoare triple {1039#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} assume true; {1039#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:47,922 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1039#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} {988#(= |#valid| |old(#valid)|)} #137#return; {1039#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:47,922 INFO L273 TraceCheckUtils]: 15: Hoare triple {1039#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} ~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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1039#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:47,922 INFO L273 TraceCheckUtils]: 16: Hoare triple {1039#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1039#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:47,923 INFO L273 TraceCheckUtils]: 17: Hoare triple {1039#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} assume !!(~len > 0); {1039#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:47,925 INFO L256 TraceCheckUtils]: 18: Hoare triple {1039#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {988#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:47,928 INFO L273 TraceCheckUtils]: 19: Hoare triple {988#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1067#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| node_create_~temp~0.base 1)) (not (= 0 node_create_~temp~0.base)))} is VALID [2018-11-23 12:59:47,929 INFO L273 TraceCheckUtils]: 20: Hoare triple {1067#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| node_create_~temp~0.base 1)) (not (= 0 node_create_~temp~0.base)))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1067#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| node_create_~temp~0.base 1)) (not (= 0 node_create_~temp~0.base)))} is VALID [2018-11-23 12:59:47,930 INFO L273 TraceCheckUtils]: 21: Hoare triple {1067#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| node_create_~temp~0.base 1)) (not (= 0 node_create_~temp~0.base)))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1074#(and (= |#valid| (store |old(#valid)| |node_create_#res.base| 1)) (= 0 (select |old(#valid)| |node_create_#res.base|)) (not (= 0 |node_create_#res.base|)))} is VALID [2018-11-23 12:59:47,931 INFO L273 TraceCheckUtils]: 22: Hoare triple {1074#(and (= |#valid| (store |old(#valid)| |node_create_#res.base| 1)) (= 0 (select |old(#valid)| |node_create_#res.base|)) (not (= 0 |node_create_#res.base|)))} assume true; {1074#(and (= |#valid| (store |old(#valid)| |node_create_#res.base| 1)) (= 0 (select |old(#valid)| |node_create_#res.base|)) (not (= 0 |node_create_#res.base|)))} is VALID [2018-11-23 12:59:47,932 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1074#(and (= |#valid| (store |old(#valid)| |node_create_#res.base| 1)) (= 0 (select |old(#valid)| |node_create_#res.base|)) (not (= 0 |node_create_#res.base|)))} {1039#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} #137#return; {1081#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (= (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) |sll_create_#t~ret4.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) |sll_create_#t~ret4.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0))) (not (= 0 |sll_create_#t~ret4.base|)))} is VALID [2018-11-23 12:59:47,935 INFO L273 TraceCheckUtils]: 24: Hoare triple {1081#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (= (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) |sll_create_#t~ret4.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) |sll_create_#t~ret4.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0))) (not (= 0 |sll_create_#t~ret4.base|)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1085#(and (not (= sll_create_~head~0.base 0)) (exists ((|node_create_#t~malloc2.base| Int)) (and (= (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) sll_create_~head~0.base) 0) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) sll_create_~head~0.base 1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0))))} is VALID [2018-11-23 12:59:47,936 INFO L273 TraceCheckUtils]: 25: Hoare triple {1085#(and (not (= sll_create_~head~0.base 0)) (exists ((|node_create_#t~malloc2.base| Int)) (and (= (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) sll_create_~head~0.base) 0) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) sll_create_~head~0.base 1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0))))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1085#(and (not (= sll_create_~head~0.base 0)) (exists ((|node_create_#t~malloc2.base| Int)) (and (= (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) sll_create_~head~0.base) 0) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) sll_create_~head~0.base 1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0))))} is VALID [2018-11-23 12:59:47,936 INFO L273 TraceCheckUtils]: 26: Hoare triple {1085#(and (not (= sll_create_~head~0.base 0)) (exists ((|node_create_#t~malloc2.base| Int)) (and (= (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) sll_create_~head~0.base) 0) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) sll_create_~head~0.base 1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0))))} assume !(~len > 0); {1085#(and (not (= sll_create_~head~0.base 0)) (exists ((|node_create_#t~malloc2.base| Int)) (and (= (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) sll_create_~head~0.base) 0) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) sll_create_~head~0.base 1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0))))} is VALID [2018-11-23 12:59:47,937 INFO L273 TraceCheckUtils]: 27: Hoare triple {1085#(and (not (= sll_create_~head~0.base 0)) (exists ((|node_create_#t~malloc2.base| Int)) (and (= (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) sll_create_~head~0.base) 0) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) sll_create_~head~0.base 1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1095#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) |sll_create_#res.base|)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) |sll_create_#res.base| 1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0))) (not (= 0 |sll_create_#res.base|)))} is VALID [2018-11-23 12:59:47,941 INFO L273 TraceCheckUtils]: 28: Hoare triple {1095#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) |sll_create_#res.base|)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) |sll_create_#res.base| 1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0))) (not (= 0 |sll_create_#res.base|)))} assume true; {1095#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) |sll_create_#res.base|)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) |sll_create_#res.base| 1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0))) (not (= 0 |sll_create_#res.base|)))} is VALID [2018-11-23 12:59:47,944 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1095#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) |sll_create_#res.base|)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) |sll_create_#res.base| 1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0))) (not (= 0 |sll_create_#res.base|)))} {1023#(and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} #131#return; {1102#(and (not (= 0 |main_#t~ret10.base|)) (exists ((|node_create_#t~malloc2.base| Int)) (and (not (= |node_create_#t~malloc2.base| |main_#t~ret10.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= 1 (select |#valid| |node_create_#t~malloc2.base|)))) (not (= |main_~#s~0.base| |main_#t~ret10.base|)) (= |main_~#s~0.offset| 0) (= 1 (select |#valid| |main_#t~ret10.base|)) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:47,945 INFO L273 TraceCheckUtils]: 30: Hoare triple {1102#(and (not (= 0 |main_#t~ret10.base|)) (exists ((|node_create_#t~malloc2.base| Int)) (and (not (= |node_create_#t~malloc2.base| |main_#t~ret10.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= 1 (select |#valid| |node_create_#t~malloc2.base|)))) (not (= |main_~#s~0.base| |main_#t~ret10.base|)) (= |main_~#s~0.offset| 0) (= 1 (select |#valid| |main_#t~ret10.base|)) (= (select |#valid| |main_~#s~0.base|) 1))} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5;~mid_index~0 := (if ~len~0 < 0 && 0 != ~len~0 % 2 then 1 + ~len~0 / 2 else ~len~0 / 2); {1106#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (not (= |node_create_#t~malloc2.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= 1 (select |#valid| |node_create_#t~malloc2.base|)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:47,963 INFO L256 TraceCheckUtils]: 31: Hoare triple {1106#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (not (= |node_create_#t~malloc2.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= 1 (select |#valid| |node_create_#t~malloc2.base|)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} call sll_insert(~#s~0.base, ~#s~0.offset, ~uneq~0, ~mid_index~0); {997#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:47,976 INFO L273 TraceCheckUtils]: 32: Hoare triple {997#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1113#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:47,981 INFO L256 TraceCheckUtils]: 33: Hoare triple {1113#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {997#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:47,982 INFO L273 TraceCheckUtils]: 34: Hoare triple {997#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {999#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:47,982 INFO L273 TraceCheckUtils]: 35: Hoare triple {999#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {999#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:47,984 INFO L273 TraceCheckUtils]: 36: Hoare triple {999#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1126#(exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset))))))} is VALID [2018-11-23 12:59:47,984 INFO L273 TraceCheckUtils]: 37: Hoare triple {1126#(exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset))))))} assume true; {1126#(exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset))))))} is VALID [2018-11-23 12:59:47,987 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1126#(exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset))))))} {1113#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} #139#return; {1133#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))))))} is VALID [2018-11-23 12:59:47,989 INFO L273 TraceCheckUtils]: 39: Hoare triple {1133#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))))))} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {1137#(exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) sll_insert_~last~0.base)))} is VALID [2018-11-23 12:59:47,991 INFO L273 TraceCheckUtils]: 40: Hoare triple {1137#(exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) sll_insert_~last~0.base)))} assume !!(~index > 0);~snd_to_last~0.base, ~snd_to_last~0.offset := ~last~0.base, ~last~0.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~last~0.base, 4 + ~last~0.offset, 4);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;#t~post9 := ~index;~index := #t~post9 - 1;havoc #t~post9; {1141#(exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= sll_insert_~snd_to_last~0.base (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))))} is VALID [2018-11-23 12:59:47,991 INFO L273 TraceCheckUtils]: 41: Hoare triple {1141#(exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= sll_insert_~snd_to_last~0.base (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))))} assume !(~index > 0); {1141#(exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= sll_insert_~snd_to_last~0.base (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))))} is VALID [2018-11-23 12:59:47,993 INFO L273 TraceCheckUtils]: 42: Hoare triple {1141#(exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= sll_insert_~snd_to_last~0.base (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))))} assume !(~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~head.base, ~head.offset, 4); {1148#(exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))))} is VALID [2018-11-23 12:59:47,994 INFO L273 TraceCheckUtils]: 43: Hoare triple {1148#(exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))))} call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4); {1148#(exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))))} is VALID [2018-11-23 12:59:47,995 INFO L273 TraceCheckUtils]: 44: Hoare triple {1148#(exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))))} assume true; {1148#(exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))))} is VALID [2018-11-23 12:59:47,997 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1148#(exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int) (v_DerPreprocessor_2 Int)) (and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))))} {1106#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (not (= |node_create_#t~malloc2.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= 1 (select |#valid| |node_create_#t~malloc2.base|)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} #133#return; {986#false} is VALID [2018-11-23 12:59:47,998 INFO L273 TraceCheckUtils]: 46: Hoare triple {986#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0; {986#false} is VALID [2018-11-23 12:59:47,998 INFO L273 TraceCheckUtils]: 47: Hoare triple {986#false} assume !!((~ptr~0.base != 0 || ~ptr~0.offset != 0) && ~count~0 != ~mid_index~0);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4);~temp~2.base, ~temp~2.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;call #t~mem13 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {986#false} is VALID [2018-11-23 12:59:47,998 INFO L273 TraceCheckUtils]: 48: Hoare triple {986#false} assume ~data~0 != #t~mem13;havoc #t~mem13; {986#false} is VALID [2018-11-23 12:59:47,999 INFO L273 TraceCheckUtils]: 49: Hoare triple {986#false} assume !false; {986#false} is VALID [2018-11-23 12:59:48,010 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 13 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:59:48,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:59:48,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 35 [2018-11-23 12:59:48,033 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 50 [2018-11-23 12:59:48,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:59:48,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:59:48,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:48,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:59:48,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:59:48,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1065, Unknown=18, NotChecked=0, Total=1190 [2018-11-23 12:59:48,273 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 35 states. [2018-11-23 13:00:11,828 WARN L180 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2018-11-23 13:00:20,481 WARN L180 SmtUtils]: Spent 6.70 s on a formula simplification. DAG size of input: 49 DAG size of output: 32 [2018-11-23 13:00:25,353 WARN L180 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 15 [2018-11-23 13:01:17,095 WARN L180 SmtUtils]: Spent 2.77 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-23 13:01:29,176 WARN L180 SmtUtils]: Spent 5.41 s on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2018-11-23 13:01:34,861 WARN L180 SmtUtils]: Spent 5.52 s on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2018-11-23 13:01:41,154 WARN L180 SmtUtils]: Spent 1.57 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-23 13:01:46,102 WARN L180 SmtUtils]: Spent 711.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 13:01:55,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:55,712 INFO L93 Difference]: Finished difference Result 84 states and 109 transitions. [2018-11-23 13:01:55,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:01:55,713 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 50 [2018-11-23 13:01:55,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:55,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:01:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 109 transitions. [2018-11-23 13:01:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:01:55,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 109 transitions. [2018-11-23 13:01:55,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 109 transitions. [2018-11-23 13:01:55,975 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:55,979 INFO L225 Difference]: With dead ends: 84 [2018-11-23 13:01:55,980 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 13:01:55,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 65.0s TimeCoverageRelationStatistics Valid=199, Invalid=1942, Unknown=21, NotChecked=0, Total=2162 [2018-11-23 13:01:55,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 13:01:56,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2018-11-23 13:01:56,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:56,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 60 states. [2018-11-23 13:01:56,043 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 60 states. [2018-11-23 13:01:56,043 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 60 states. [2018-11-23 13:01:56,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:56,048 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2018-11-23 13:01:56,048 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2018-11-23 13:01:56,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:56,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:56,050 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 74 states. [2018-11-23 13:01:56,050 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 74 states. [2018-11-23 13:01:56,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:56,054 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2018-11-23 13:01:56,055 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2018-11-23 13:01:56,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:56,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:56,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:56,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 13:01:56,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2018-11-23 13:01:56,059 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 50 [2018-11-23 13:01:56,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:56,060 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2018-11-23 13:01:56,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 13:01:56,060 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2018-11-23 13:01:56,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 13:01:56,062 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:56,062 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:56,062 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:56,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:56,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1004828887, now seen corresponding path program 1 times [2018-11-23 13:01:56,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:56,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:56,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:56,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:01:56,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:56,797 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-11-23 13:01:58,263 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2018-11-23 13:01:58,761 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2018-11-23 13:01:59,007 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2018-11-23 13:01:59,786 INFO L256 TraceCheckUtils]: 0: Hoare triple {1540#true} call ULTIMATE.init(); {1540#true} is VALID [2018-11-23 13:01:59,786 INFO L273 TraceCheckUtils]: 1: Hoare triple {1540#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1540#true} is VALID [2018-11-23 13:01:59,787 INFO L273 TraceCheckUtils]: 2: Hoare triple {1540#true} assume true; {1540#true} is VALID [2018-11-23 13:01:59,787 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1540#true} {1540#true} #141#return; {1540#true} is VALID [2018-11-23 13:01:59,787 INFO L256 TraceCheckUtils]: 4: Hoare triple {1540#true} call #t~ret22 := main(); {1540#true} is VALID [2018-11-23 13:01:59,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {1540#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1542#(and (<= main_~data~0 1) (<= 1 main_~data~0) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 13:01:59,796 INFO L256 TraceCheckUtils]: 6: Hoare triple {1542#(and (<= main_~data~0 1) (<= 1 main_~data~0) (= (select |#valid| |main_~#s~0.base|) 1))} call #t~ret10.base, #t~ret10.offset := sll_create(~len~0, ~data~0); {1543#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:01:59,797 INFO L273 TraceCheckUtils]: 7: Hoare triple {1543#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1544#(and (<= sll_create_~data |sll_create_#in~data|) (= |#valid| |old(#valid)|) (<= |sll_create_#in~data| sll_create_~data))} is VALID [2018-11-23 13:01:59,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {1544#(and (<= sll_create_~data |sll_create_#in~data|) (= |#valid| |old(#valid)|) (<= |sll_create_#in~data| sll_create_~data))} assume !!(~len > 0); {1544#(and (<= sll_create_~data |sll_create_#in~data|) (= |#valid| |old(#valid)|) (<= |sll_create_#in~data| sll_create_~data))} is VALID [2018-11-23 13:01:59,798 INFO L256 TraceCheckUtils]: 9: Hoare triple {1544#(and (<= sll_create_~data |sll_create_#in~data|) (= |#valid| |old(#valid)|) (<= |sll_create_#in~data| sll_create_~data))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1543#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:01:59,799 INFO L273 TraceCheckUtils]: 10: Hoare triple {1543#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1545#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:01:59,800 INFO L273 TraceCheckUtils]: 11: Hoare triple {1545#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1545#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:01:59,802 INFO L273 TraceCheckUtils]: 12: Hoare triple {1545#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1545#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:01:59,803 INFO L273 TraceCheckUtils]: 13: Hoare triple {1545#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {1545#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:01:59,805 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1545#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} {1544#(and (<= sll_create_~data |sll_create_#in~data|) (= |#valid| |old(#valid)|) (<= |sll_create_#in~data| sll_create_~data))} #137#return; {1546#(and (<= sll_create_~data |sll_create_#in~data|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (<= |sll_create_#in~data| sll_create_~data) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:01:59,807 INFO L273 TraceCheckUtils]: 15: Hoare triple {1546#(and (<= sll_create_~data |sll_create_#in~data|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (<= |sll_create_#in~data| sll_create_~data) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} ~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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1546#(and (<= sll_create_~data |sll_create_#in~data|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (<= |sll_create_#in~data| sll_create_~data) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:01:59,808 INFO L273 TraceCheckUtils]: 16: Hoare triple {1546#(and (<= sll_create_~data |sll_create_#in~data|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (<= |sll_create_#in~data| sll_create_~data) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1546#(and (<= sll_create_~data |sll_create_#in~data|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (<= |sll_create_#in~data| sll_create_~data) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:01:59,810 INFO L273 TraceCheckUtils]: 17: Hoare triple {1546#(and (<= sll_create_~data |sll_create_#in~data|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (<= |sll_create_#in~data| sll_create_~data) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !!(~len > 0); {1546#(and (<= sll_create_~data |sll_create_#in~data|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (<= |sll_create_#in~data| sll_create_~data) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:01:59,811 INFO L256 TraceCheckUtils]: 18: Hoare triple {1546#(and (<= sll_create_~data |sll_create_#in~data|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (<= |sll_create_#in~data| sll_create_~data) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1543#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:01:59,814 INFO L273 TraceCheckUtils]: 19: Hoare triple {1543#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1547#(and (= (select |#valid| node_create_~temp~0.base) 1) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= node_create_~temp~0.offset 0) (or (= 1 node_create_~data) (and (or (<= node_create_~data 1) (<= node_create_~data |node_create_#in~data|)) (or (<= |node_create_#in~data| node_create_~data) (< 1 node_create_~data)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:01:59,816 INFO L273 TraceCheckUtils]: 20: Hoare triple {1547#(and (= (select |#valid| node_create_~temp~0.base) 1) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= node_create_~temp~0.offset 0) (or (= 1 node_create_~data) (and (or (<= node_create_~data 1) (<= node_create_~data |node_create_#in~data|)) (or (<= |node_create_#in~data| node_create_~data) (< 1 node_create_~data)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1547#(and (= (select |#valid| node_create_~temp~0.base) 1) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= node_create_~temp~0.offset 0) (or (= 1 node_create_~data) (and (or (<= node_create_~data 1) (<= node_create_~data |node_create_#in~data|)) (or (<= |node_create_#in~data| node_create_~data) (< 1 node_create_~data)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:01:59,818 INFO L273 TraceCheckUtils]: 21: Hoare triple {1547#(and (= (select |#valid| node_create_~temp~0.base) 1) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= node_create_~temp~0.offset 0) (or (= 1 node_create_~data) (and (or (<= node_create_~data 1) (<= node_create_~data |node_create_#in~data|)) (or (<= |node_create_#in~data| node_create_~data) (< 1 node_create_~data)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1548#(and (= (select |#valid| |node_create_#res.base|) 1) (= 0 (select |old(#valid)| |node_create_#res.base|)) (or (= (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|) 1) (<= 2 |node_create_#in~data|) (<= |node_create_#in~data| 0)) (= 0 |node_create_#res.offset|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:01:59,819 INFO L273 TraceCheckUtils]: 22: Hoare triple {1548#(and (= (select |#valid| |node_create_#res.base|) 1) (= 0 (select |old(#valid)| |node_create_#res.base|)) (or (= (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|) 1) (<= 2 |node_create_#in~data|) (<= |node_create_#in~data| 0)) (= 0 |node_create_#res.offset|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {1548#(and (= (select |#valid| |node_create_#res.base|) 1) (= 0 (select |old(#valid)| |node_create_#res.base|)) (or (= (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|) 1) (<= 2 |node_create_#in~data|) (<= |node_create_#in~data| 0)) (= 0 |node_create_#res.offset|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:01:59,827 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1548#(and (= (select |#valid| |node_create_#res.base|) 1) (= 0 (select |old(#valid)| |node_create_#res.base|)) (or (= (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|) 1) (<= 2 |node_create_#in~data|) (<= |node_create_#in~data| 0)) (= 0 |node_create_#res.offset|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} {1546#(and (<= sll_create_~data |sll_create_#in~data|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (<= |sll_create_#in~data| sll_create_~data) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} #137#return; {1549#(and (= 0 |sll_create_#t~ret4.offset|) (= (select |#valid| |sll_create_#t~ret4.base|) 1) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (= (select (select |#memory_int| |sll_create_#t~ret4.base|) |sll_create_#t~ret4.offset|) 1)) (= 0 (select |old(#valid)| |sll_create_#t~ret4.base|)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:01:59,829 INFO L273 TraceCheckUtils]: 24: Hoare triple {1549#(and (= 0 |sll_create_#t~ret4.offset|) (= (select |#valid| |sll_create_#t~ret4.base|) 1) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (= (select (select |#memory_int| |sll_create_#t~ret4.base|) |sll_create_#t~ret4.offset|) 1)) (= 0 (select |old(#valid)| |sll_create_#t~ret4.base|)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} ~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, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1550#(and (= (select |#valid| sll_create_~head~0.base) 1) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (= (select (select |#memory_int| sll_create_~head~0.base) sll_create_~head~0.offset) 1)) (= 0 sll_create_~head~0.offset) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} is VALID [2018-11-23 13:01:59,831 INFO L273 TraceCheckUtils]: 25: Hoare triple {1550#(and (= (select |#valid| sll_create_~head~0.base) 1) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (= (select (select |#memory_int| sll_create_~head~0.base) sll_create_~head~0.offset) 1)) (= 0 sll_create_~head~0.offset) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1550#(and (= (select |#valid| sll_create_~head~0.base) 1) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (= (select (select |#memory_int| sll_create_~head~0.base) sll_create_~head~0.offset) 1)) (= 0 sll_create_~head~0.offset) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} is VALID [2018-11-23 13:01:59,833 INFO L273 TraceCheckUtils]: 26: Hoare triple {1550#(and (= (select |#valid| sll_create_~head~0.base) 1) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (= (select (select |#memory_int| sll_create_~head~0.base) sll_create_~head~0.offset) 1)) (= 0 sll_create_~head~0.offset) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} assume !(~len > 0); {1550#(and (= (select |#valid| sll_create_~head~0.base) 1) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (= (select (select |#memory_int| sll_create_~head~0.base) sll_create_~head~0.offset) 1)) (= 0 sll_create_~head~0.offset) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} is VALID [2018-11-23 13:01:59,835 INFO L273 TraceCheckUtils]: 27: Hoare triple {1550#(and (= (select |#valid| sll_create_~head~0.base) 1) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (= (select (select |#memory_int| sll_create_~head~0.base) sll_create_~head~0.offset) 1)) (= 0 sll_create_~head~0.offset) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1551#(and (= 0 (select |old(#valid)| |sll_create_#res.base|)) (= 0 |sll_create_#res.offset|) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (= (select (select |#memory_int| |sll_create_#res.base|) |sll_create_#res.offset|) 1)) (= (select |#valid| |sll_create_#res.base|) 1) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:01:59,839 INFO L273 TraceCheckUtils]: 28: Hoare triple {1551#(and (= 0 (select |old(#valid)| |sll_create_#res.base|)) (= 0 |sll_create_#res.offset|) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (= (select (select |#memory_int| |sll_create_#res.base|) |sll_create_#res.offset|) 1)) (= (select |#valid| |sll_create_#res.base|) 1) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} assume true; {1551#(and (= 0 (select |old(#valid)| |sll_create_#res.base|)) (= 0 |sll_create_#res.offset|) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (= (select (select |#memory_int| |sll_create_#res.base|) |sll_create_#res.offset|) 1)) (= (select |#valid| |sll_create_#res.base|) 1) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:01:59,841 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1551#(and (= 0 (select |old(#valid)| |sll_create_#res.base|)) (= 0 |sll_create_#res.offset|) (or (<= |sll_create_#in~data| 0) (<= 2 |sll_create_#in~data|) (= (select (select |#memory_int| |sll_create_#res.base|) |sll_create_#res.offset|) 1)) (= (select |#valid| |sll_create_#res.base|) 1) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} {1542#(and (<= main_~data~0 1) (<= 1 main_~data~0) (= (select |#valid| |main_~#s~0.base|) 1))} #131#return; {1552#(and (= 1 main_~data~0) (= 0 |main_#t~ret10.offset|) (not (= |main_~#s~0.base| |main_#t~ret10.base|)) (not (= (select |#valid| |main_~#s~0.base|) 0)) (not (= (select |#valid| |main_#t~ret10.base|) 0)) (= main_~data~0 (select (select |#memory_int| |main_#t~ret10.base|) |main_#t~ret10.offset|)))} is VALID [2018-11-23 13:01:59,843 INFO L273 TraceCheckUtils]: 30: Hoare triple {1552#(and (= 1 main_~data~0) (= 0 |main_#t~ret10.offset|) (not (= |main_~#s~0.base| |main_#t~ret10.base|)) (not (= (select |#valid| |main_~#s~0.base|) 0)) (not (= (select |#valid| |main_#t~ret10.base|) 0)) (= main_~data~0 (select (select |#memory_int| |main_#t~ret10.base|) |main_#t~ret10.offset|)))} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5;~mid_index~0 := (if ~len~0 < 0 && 0 != ~len~0 % 2 then 1 + ~len~0 / 2 else ~len~0 / 2); {1553#(and (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (= 1 main_~data~0) (not (= (select |#valid| |main_~#s~0.base|) 0)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0)))} is VALID [2018-11-23 13:01:59,845 INFO L256 TraceCheckUtils]: 31: Hoare triple {1553#(and (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (= 1 main_~data~0) (not (= (select |#valid| |main_~#s~0.base|) 0)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0)))} call sll_insert(~#s~0.base, ~#s~0.offset, ~uneq~0, ~mid_index~0); {1554#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:01:59,846 INFO L273 TraceCheckUtils]: 32: Hoare triple {1554#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1555#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= |#valid| |old(#valid)|) (= (select |#memory_$Pointer$.base| sll_insert_~head.base) (select |old(#memory_$Pointer$.base)| sll_insert_~head.base)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:01:59,847 INFO L256 TraceCheckUtils]: 33: Hoare triple {1555#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= |#valid| |old(#valid)|) (= (select |#memory_$Pointer$.base| sll_insert_~head.base) (select |old(#memory_$Pointer$.base)| sll_insert_~head.base)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1554#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:01:59,852 INFO L273 TraceCheckUtils]: 34: Hoare triple {1554#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1556#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:01:59,853 INFO L273 TraceCheckUtils]: 35: Hoare triple {1556#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1556#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:01:59,855 INFO L273 TraceCheckUtils]: 36: Hoare triple {1556#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1557#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= |node_create_#res.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= |node_create_#res.base| (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= |node_create_#res.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))} is VALID [2018-11-23 13:01:59,857 INFO L273 TraceCheckUtils]: 37: Hoare triple {1557#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= |node_create_#res.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= |node_create_#res.base| (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= |node_create_#res.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))} assume true; {1557#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= |node_create_#res.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= |node_create_#res.base| (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= |node_create_#res.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))} is VALID [2018-11-23 13:01:59,859 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1557#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (or (= |node_create_#res.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= |node_create_#res.base| (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= |node_create_#res.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))} {1555#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= |#valid| |old(#valid)|) (= (select |#memory_$Pointer$.base| sll_insert_~head.base) (select |old(#memory_$Pointer$.base)| sll_insert_~head.base)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #139#return; {1558#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (or (= |sll_insert_#t~ret6.base| (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= |sll_insert_#t~ret6.base| sll_insert_~head.base) (= (select |#memory_$Pointer$.base| sll_insert_~head.base) (select |old(#memory_$Pointer$.base)| sll_insert_~head.base))) (= 0 (select |old(#valid)| |sll_insert_#t~ret6.base|)) (or (= |sll_insert_#t~ret6.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))} is VALID [2018-11-23 13:01:59,861 INFO L273 TraceCheckUtils]: 39: Hoare triple {1558#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (or (= |sll_insert_#t~ret6.base| (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= |sll_insert_#t~ret6.base| sll_insert_~head.base) (= (select |#memory_$Pointer$.base| sll_insert_~head.base) (select |old(#memory_$Pointer$.base)| sll_insert_~head.base))) (= 0 (select |old(#valid)| |sll_insert_#t~ret6.base|)) (or (= |sll_insert_#t~ret6.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {1559#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (and (or (not (= |sll_insert_#in~head.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) sll_insert_~last~0.base) (or (= sll_insert_~new_node~0.base (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) sll_insert_~last~0.base) (= 0 (select |old(#valid)| sll_insert_~new_node~0.base)) (or (= sll_insert_~last~0.offset 0) (= (select (select |#memory_$Pointer$.offset| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) sll_insert_~last~0.offset))))} is VALID [2018-11-23 13:01:59,865 INFO L273 TraceCheckUtils]: 40: Hoare triple {1559#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (and (or (not (= |sll_insert_#in~head.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) sll_insert_~last~0.base) (or (= sll_insert_~new_node~0.base (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) sll_insert_~last~0.base) (= 0 (select |old(#valid)| sll_insert_~new_node~0.base)) (or (= sll_insert_~last~0.offset 0) (= (select (select |#memory_$Pointer$.offset| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) sll_insert_~last~0.offset))))} assume !!(~index > 0);~snd_to_last~0.base, ~snd_to_last~0.offset := ~last~0.base, ~last~0.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~last~0.base, 4 + ~last~0.offset, 4);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;#t~post9 := ~index;~index := #t~post9 - 1;havoc #t~post9; {1560#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (and (or (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (not (= sll_insert_~snd_to_last~0.base sll_insert_~new_node~0.base))) (or (not (= |sll_insert_#in~head.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (not (= |sll_insert_#in~head.base| sll_insert_~snd_to_last~0.base)) (or (and (not (= sll_insert_~new_node~0.base |sll_insert_#in~head.base|)) (= sll_insert_~snd_to_last~0.base (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (= sll_insert_~snd_to_last~0.base (select (select (store |#memory_$Pointer$.base| sll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| sll_insert_~snd_to_last~0.base) (+ sll_insert_~snd_to_last~0.offset 4) sll_insert_~new_node~0.base)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (= (select |#memory_int| sll_insert_~snd_to_last~0.base) (select |old(#memory_int)| sll_insert_~snd_to_last~0.base)) (or (<= 0 sll_insert_~snd_to_last~0.offset) (not (= (select (select (store |#memory_$Pointer$.offset| sll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.offset| sll_insert_~snd_to_last~0.base) (+ sll_insert_~snd_to_last~0.offset 4) sll_insert_~new_node~0.offset)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) 0)))) (= sll_insert_~snd_to_last~0.base sll_insert_~new_node~0.base))) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) |sll_insert_#in~head.base|))} is VALID [2018-11-23 13:01:59,866 INFO L273 TraceCheckUtils]: 41: Hoare triple {1560#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (and (or (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (not (= sll_insert_~snd_to_last~0.base sll_insert_~new_node~0.base))) (or (not (= |sll_insert_#in~head.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (not (= |sll_insert_#in~head.base| sll_insert_~snd_to_last~0.base)) (or (and (not (= sll_insert_~new_node~0.base |sll_insert_#in~head.base|)) (= sll_insert_~snd_to_last~0.base (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (= sll_insert_~snd_to_last~0.base (select (select (store |#memory_$Pointer$.base| sll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| sll_insert_~snd_to_last~0.base) (+ sll_insert_~snd_to_last~0.offset 4) sll_insert_~new_node~0.base)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (= (select |#memory_int| sll_insert_~snd_to_last~0.base) (select |old(#memory_int)| sll_insert_~snd_to_last~0.base)) (or (<= 0 sll_insert_~snd_to_last~0.offset) (not (= (select (select (store |#memory_$Pointer$.offset| sll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.offset| sll_insert_~snd_to_last~0.base) (+ sll_insert_~snd_to_last~0.offset 4) sll_insert_~new_node~0.offset)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) 0)))) (= sll_insert_~snd_to_last~0.base sll_insert_~new_node~0.base))) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) |sll_insert_#in~head.base|))} assume !(~index > 0); {1560#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (and (or (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (not (= sll_insert_~snd_to_last~0.base sll_insert_~new_node~0.base))) (or (not (= |sll_insert_#in~head.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (not (= |sll_insert_#in~head.base| sll_insert_~snd_to_last~0.base)) (or (and (not (= sll_insert_~new_node~0.base |sll_insert_#in~head.base|)) (= sll_insert_~snd_to_last~0.base (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (= sll_insert_~snd_to_last~0.base (select (select (store |#memory_$Pointer$.base| sll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| sll_insert_~snd_to_last~0.base) (+ sll_insert_~snd_to_last~0.offset 4) sll_insert_~new_node~0.base)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (= (select |#memory_int| sll_insert_~snd_to_last~0.base) (select |old(#memory_int)| sll_insert_~snd_to_last~0.base)) (or (<= 0 sll_insert_~snd_to_last~0.offset) (not (= (select (select (store |#memory_$Pointer$.offset| sll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.offset| sll_insert_~snd_to_last~0.base) (+ sll_insert_~snd_to_last~0.offset 4) sll_insert_~new_node~0.offset)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) 0)))) (= sll_insert_~snd_to_last~0.base sll_insert_~new_node~0.base))) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) |sll_insert_#in~head.base|))} is VALID [2018-11-23 13:01:59,872 INFO L273 TraceCheckUtils]: 42: Hoare triple {1560#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (and (or (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (not (= sll_insert_~snd_to_last~0.base sll_insert_~new_node~0.base))) (or (not (= |sll_insert_#in~head.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (not (= |sll_insert_#in~head.base| sll_insert_~snd_to_last~0.base)) (or (and (not (= sll_insert_~new_node~0.base |sll_insert_#in~head.base|)) (= sll_insert_~snd_to_last~0.base (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (= sll_insert_~snd_to_last~0.base (select (select (store |#memory_$Pointer$.base| sll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| sll_insert_~snd_to_last~0.base) (+ sll_insert_~snd_to_last~0.offset 4) sll_insert_~new_node~0.base)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (= (select |#memory_int| sll_insert_~snd_to_last~0.base) (select |old(#memory_int)| sll_insert_~snd_to_last~0.base)) (or (<= 0 sll_insert_~snd_to_last~0.offset) (not (= (select (select (store |#memory_$Pointer$.offset| sll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.offset| sll_insert_~snd_to_last~0.base) (+ sll_insert_~snd_to_last~0.offset 4) sll_insert_~new_node~0.offset)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) 0)))) (= sll_insert_~snd_to_last~0.base sll_insert_~new_node~0.base))) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) |sll_insert_#in~head.base|))} assume ~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, 4 + ~snd_to_last~0.offset, 4); {1561#(or (and (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (not (= |sll_insert_#in~head.base| sll_insert_~new_node~0.base)) (or (not (= |sll_insert_#in~head.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (not (= |sll_insert_#in~head.base| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (or (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (and (= (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (@diff (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select (store |#memory_$Pointer$.base| sll_insert_~new_node~0.base (store (select |#memory_$Pointer$.base| sll_insert_~new_node~0.base) (+ sll_insert_~new_node~0.offset 4) sll_insert_~last~0.base)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| sll_insert_~new_node~0.base (store (select |#memory_$Pointer$.base| sll_insert_~new_node~0.base) (+ sll_insert_~new_node~0.offset 4) sll_insert_~last~0.base)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (@diff (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select (store |#memory_$Pointer$.base| sll_insert_~new_node~0.base (store (select |#memory_$Pointer$.base| sll_insert_~new_node~0.base) (+ sll_insert_~new_node~0.offset 4) sll_insert_~last~0.base)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))))) (select |#memory_int| (select (select (store |#memory_$Pointer$.base| sll_insert_~new_node~0.base (store (select |#memory_$Pointer$.base| sll_insert_~new_node~0.base) (+ sll_insert_~new_node~0.offset 4) sll_insert_~last~0.base)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (not (= sll_insert_~new_node~0.base (select (select (store |#memory_$Pointer$.base| sll_insert_~new_node~0.base (store (select |#memory_$Pointer$.base| sll_insert_~new_node~0.base) (+ sll_insert_~new_node~0.offset 4) sll_insert_~last~0.base)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (or (not (= (select (select (store |#memory_$Pointer$.offset| sll_insert_~new_node~0.base (store (select |#memory_$Pointer$.offset| sll_insert_~new_node~0.base) (+ sll_insert_~new_node~0.offset 4) sll_insert_~last~0.offset)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) 0)) (<= 4 (@diff (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select (store |#memory_$Pointer$.base| sll_insert_~new_node~0.base (store (select |#memory_$Pointer$.base| sll_insert_~new_node~0.base) (+ sll_insert_~new_node~0.offset 4) sll_insert_~last~0.base)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)))) (= (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select (store |#memory_$Pointer$.base| sll_insert_~new_node~0.base (store (select |#memory_$Pointer$.base| sll_insert_~new_node~0.base) (+ sll_insert_~new_node~0.offset 4) sll_insert_~last~0.base)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))))))) (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) |sll_insert_#in~head.base|))} is VALID [2018-11-23 13:01:59,879 INFO L273 TraceCheckUtils]: 43: Hoare triple {1561#(or (and (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (not (= |sll_insert_#in~head.base| sll_insert_~new_node~0.base)) (or (not (= |sll_insert_#in~head.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (not (= |sll_insert_#in~head.base| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (or (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (and (= (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (@diff (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select (store |#memory_$Pointer$.base| sll_insert_~new_node~0.base (store (select |#memory_$Pointer$.base| sll_insert_~new_node~0.base) (+ sll_insert_~new_node~0.offset 4) sll_insert_~last~0.base)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| sll_insert_~new_node~0.base (store (select |#memory_$Pointer$.base| sll_insert_~new_node~0.base) (+ sll_insert_~new_node~0.offset 4) sll_insert_~last~0.base)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (@diff (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select (store |#memory_$Pointer$.base| sll_insert_~new_node~0.base (store (select |#memory_$Pointer$.base| sll_insert_~new_node~0.base) (+ sll_insert_~new_node~0.offset 4) sll_insert_~last~0.base)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))))) (select |#memory_int| (select (select (store |#memory_$Pointer$.base| sll_insert_~new_node~0.base (store (select |#memory_$Pointer$.base| sll_insert_~new_node~0.base) (+ sll_insert_~new_node~0.offset 4) sll_insert_~last~0.base)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (not (= sll_insert_~new_node~0.base (select (select (store |#memory_$Pointer$.base| sll_insert_~new_node~0.base (store (select |#memory_$Pointer$.base| sll_insert_~new_node~0.base) (+ sll_insert_~new_node~0.offset 4) sll_insert_~last~0.base)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (or (not (= (select (select (store |#memory_$Pointer$.offset| sll_insert_~new_node~0.base (store (select |#memory_$Pointer$.offset| sll_insert_~new_node~0.base) (+ sll_insert_~new_node~0.offset 4) sll_insert_~last~0.offset)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) 0)) (<= 4 (@diff (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select (store |#memory_$Pointer$.base| sll_insert_~new_node~0.base (store (select |#memory_$Pointer$.base| sll_insert_~new_node~0.base) (+ sll_insert_~new_node~0.offset 4) sll_insert_~last~0.base)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)))) (= (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select (store |#memory_$Pointer$.base| sll_insert_~new_node~0.base (store (select |#memory_$Pointer$.base| sll_insert_~new_node~0.base) (+ sll_insert_~new_node~0.offset 4) sll_insert_~last~0.base)) |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))))))) (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) |sll_insert_#in~head.base|))} call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4); {1562#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (and (or (not (= |sll_insert_#in~head.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (not (= |sll_insert_#in~head.base| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)))) (or (not (= |sll_insert_#in~head.base| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (or (and (or (<= 4 (@diff (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)))) (= (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) 0))) (= (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (@diff (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (@diff (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))))) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)))) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)))) (= (store (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) |sll_insert_#in~head.base|))} is VALID [2018-11-23 13:01:59,889 INFO L273 TraceCheckUtils]: 44: Hoare triple {1562#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (and (or (not (= |sll_insert_#in~head.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (not (= |sll_insert_#in~head.base| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)))) (or (not (= |sll_insert_#in~head.base| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (or (and (or (<= 4 (@diff (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)))) (= (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) 0))) (= (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (@diff (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (@diff (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))))) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)))) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)))) (= (store (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) |sll_insert_#in~head.base|))} assume true; {1562#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (and (or (not (= |sll_insert_#in~head.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (not (= |sll_insert_#in~head.base| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)))) (or (not (= |sll_insert_#in~head.base| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (or (and (or (<= 4 (@diff (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)))) (= (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) 0))) (= (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (@diff (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (@diff (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))))) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)))) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)))) (= (store (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) |sll_insert_#in~head.base|))} is VALID [2018-11-23 13:01:59,893 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1562#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (and (or (not (= |sll_insert_#in~head.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (not (= |sll_insert_#in~head.base| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)))) (or (not (= |sll_insert_#in~head.base| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (or (and (or (<= 4 (@diff (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)))) (= (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) 0))) (= (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (@diff (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (@diff (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))))) (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)))) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)))) (= (store (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) |sll_insert_#in~head.base|))} {1553#(and (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (= 1 main_~data~0) (not (= (select |#valid| |main_~#s~0.base|) 0)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0)))} #133#return; {1563#(and (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (= 1 main_~data~0))} is VALID [2018-11-23 13:01:59,895 INFO L273 TraceCheckUtils]: 46: Hoare triple {1563#(and (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (= 1 main_~data~0))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0; {1564#(and (= 1 main_~data~0) (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) main_~ptr~0.offset)))} is VALID [2018-11-23 13:01:59,896 INFO L273 TraceCheckUtils]: 47: Hoare triple {1564#(and (= 1 main_~data~0) (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) main_~ptr~0.offset)))} assume !!((~ptr~0.base != 0 || ~ptr~0.offset != 0) && ~count~0 != ~mid_index~0);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4);~temp~2.base, ~temp~2.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;call #t~mem13 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {1565#(and (= 1 main_~data~0) (= main_~data~0 |main_#t~mem13|))} is VALID [2018-11-23 13:01:59,896 INFO L273 TraceCheckUtils]: 48: Hoare triple {1565#(and (= 1 main_~data~0) (= main_~data~0 |main_#t~mem13|))} assume ~data~0 != #t~mem13;havoc #t~mem13; {1541#false} is VALID [2018-11-23 13:01:59,897 INFO L273 TraceCheckUtils]: 49: Hoare triple {1541#false} assume !false; {1541#false} is VALID [2018-11-23 13:01:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:01:59,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:59,923 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:01:59,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:00,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:00,076 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 13:02:00,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:00,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:00,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 13:02:00,104 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:02:00,104 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_31|]. (and (= |#valid| (store |v_#valid_31| |main_~#s~0.base| 1)) (= |main_~#s~0.offset| 0) (= main_~data~0 1)) [2018-11-23 13:02:00,104 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_~#s~0.offset| 0) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1)) [2018-11-23 13:02:00,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 13:02:00,709 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 13:02:00,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:00,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:00,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:00,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-23 13:02:01,031 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 30 treesize of output 23 [2018-11-23 13:02:01,039 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 23 treesize of output 15 [2018-11-23 13:02:01,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:01,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:01,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:02:01,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2018-11-23 13:02:01,441 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:02:01,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:02:01,445 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:02:01,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 42 [2018-11-23 13:02:01,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 30 treesize of output 34 [2018-11-23 13:02:01,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:02:01,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:02:01,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:02:01,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:51 [2018-11-23 13:02:03,540 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:02:03,541 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_16|, v_subst_1]. (let ((.cse1 (select (select |#memory_int| |main_#t~ret10.base|) 0)) (.cse0 (store |v_#valid_BEFORE_CALL_16| v_subst_1 1))) (and (= (select |v_#valid_BEFORE_CALL_16| v_subst_1) 0) (= (select |v_#valid_BEFORE_CALL_16| |main_~#s~0.base|) 1) (= |#valid| (store .cse0 |main_#t~ret10.base| 1)) (<= main_~data~0 .cse1) (= |main_#t~ret10.offset| 0) (= |main_~#s~0.offset| 0) (<= .cse1 main_~data~0) (= main_~data~0 1) (= (select .cse0 |main_#t~ret10.base|) 0))) [2018-11-23 13:02:03,541 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_1]. (let ((.cse0 (select (select |#memory_int| |main_#t~ret10.base|) 0))) (and (= 1 (select |#valid| v_subst_1)) (not (= |main_~#s~0.base| v_subst_1)) (<= main_~data~0 .cse0) (= |main_#t~ret10.offset| 0) (not (= |main_~#s~0.base| |main_#t~ret10.base|)) (= |main_~#s~0.offset| 0) (<= .cse0 main_~data~0) (= 1 (select |#valid| |main_#t~ret10.base|)) (not (= |main_#t~ret10.base| v_subst_1)) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1))) [2018-11-23 13:02:03,962 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:02:03,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:02:03,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 13:02:03,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:62 [2018-11-23 13:02:14,117 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 38 [2018-11-23 13:02:18,285 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 44 [2018-11-23 13:02:20,547 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 13:02:22,711 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 13:02:22,792 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:02:22,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:02:22,881 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 13:02:22,913 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 13:02:22,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-23 13:02:22,956 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:161, output treesize:316 [2018-11-23 13:02:27,261 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:02:27,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:02:27,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2018-11-23 13:02:27,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:529, output treesize:573 [2018-11-23 13:02:28,095 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:02:28,096 WARN L384 uantifierElimination]: Input elimination task: ∃ [sll_insert_~new_node~0.base, node_create_~temp~0.offset, v_DerPreprocessor_8, v_DerPreprocessor_4, node_create_~data, v_DerPreprocessor_6, |v_#memory_int_31|, sll_insert_~new_node~0.offset, sll_insert_~last~0.offset, sll_insert_~last~0.base]. (let ((.cse8 (+ node_create_~temp~0.offset 4))) (let ((.cse2 (store |old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base) .cse8 0) node_create_~temp~0.offset v_DerPreprocessor_6))) (.cse6 (store |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) .cse8 0) node_create_~temp~0.offset v_DerPreprocessor_8)))) (let ((.cse0 (+ sll_insert_~new_node~0.offset 4)) (.cse3 (select (select .cse6 |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (.cse4 (+ (select (select .cse2 |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) 4))) (and (= |#memory_int| (store |v_#memory_int_31| sll_insert_~new_node~0.base (store (select |v_#memory_int_31| sll_insert_~new_node~0.base) .cse0 (select (select |#memory_int| sll_insert_~new_node~0.base) .cse0)))) (= (select |old(#valid)| sll_insert_~new_node~0.base) 0) (= |#memory_$Pointer$.offset| (let ((.cse1 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 sll_insert_~new_node~0.offset)))) (store .cse1 sll_insert_~new_node~0.base (store (select .cse1 sll_insert_~new_node~0.base) .cse0 sll_insert_~last~0.offset)))) (= |#memory_$Pointer$.base| (let ((.cse5 (store .cse6 .cse3 (store (select .cse6 .cse3) .cse4 sll_insert_~new_node~0.base)))) (store .cse5 sll_insert_~new_node~0.base (store (select .cse5 sll_insert_~new_node~0.base) .cse0 sll_insert_~last~0.base)))) (= |v_#memory_int_31| (let ((.cse7 (store |old(#memory_int)| sll_insert_~new_node~0.base (store (store (select |old(#memory_int)| sll_insert_~new_node~0.base) .cse8 v_DerPreprocessor_4) node_create_~temp~0.offset node_create_~data)))) (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 (select (select |v_#memory_int_31| .cse3) .cse4))))))))) [2018-11-23 13:02:28,096 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [sll_insert_~new_node~0.base, node_create_~temp~0.offset, v_DerPreprocessor_8, v_DerPreprocessor_4, node_create_~data, v_DerPreprocessor_6, v_DerPreprocessor_10, sll_insert_~new_node~0.offset, sll_insert_~last~0.offset, sll_insert_~last~0.base]. (let ((.cse7 (+ node_create_~temp~0.offset 4))) (let ((.cse2 (store |old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base) .cse7 0) node_create_~temp~0.offset v_DerPreprocessor_6))) (.cse9 (store |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) .cse7 0) node_create_~temp~0.offset v_DerPreprocessor_8)))) (let ((.cse1 (+ sll_insert_~new_node~0.offset 4)) (.cse3 (select (select .cse9 |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (.cse4 (+ (select (select .cse2 |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) 4))) (and (= (select |old(#valid)| sll_insert_~new_node~0.base) 0) (= |#memory_$Pointer$.offset| (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 sll_insert_~new_node~0.offset)))) (store .cse0 sll_insert_~new_node~0.base (store (select .cse0 sll_insert_~new_node~0.base) .cse1 sll_insert_~last~0.offset)))) (= (let ((.cse5 (let ((.cse6 (store |old(#memory_int)| sll_insert_~new_node~0.base (store (store (select |old(#memory_int)| sll_insert_~new_node~0.base) .cse7 v_DerPreprocessor_4) node_create_~temp~0.offset node_create_~data)))) (store .cse6 .cse3 (store (select .cse6 .cse3) .cse4 v_DerPreprocessor_10))))) (store .cse5 sll_insert_~new_node~0.base (store (select .cse5 sll_insert_~new_node~0.base) .cse1 (select (select |#memory_int| sll_insert_~new_node~0.base) .cse1)))) |#memory_int|) (= |#memory_$Pointer$.base| (let ((.cse8 (store .cse9 .cse3 (store (select .cse9 .cse3) .cse4 sll_insert_~new_node~0.base)))) (store .cse8 sll_insert_~new_node~0.base (store (select .cse8 sll_insert_~new_node~0.base) .cse1 sll_insert_~last~0.base))))))))