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_append_unequal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:58:54,364 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:58:54,366 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:58:54,381 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:58:54,381 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:58:54,383 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:58:54,384 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:58:54,386 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:58:54,387 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:58:54,388 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:58:54,389 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:58:54,389 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:58:54,390 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:58:54,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:58:54,392 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:58:54,393 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:58:54,394 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:58:54,396 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:58:54,397 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:58:54,399 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:58:54,400 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:58:54,401 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:58:54,404 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:58:54,404 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:58:54,404 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:58:54,405 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:58:54,406 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:58:54,407 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:58:54,407 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:58:54,408 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:58:54,409 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:58:54,409 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:58:54,410 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:58:54,410 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:58:54,411 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:58:54,411 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:58:54,412 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:58:54,430 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:58:54,430 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:58:54,431 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:58:54,431 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:58:54,431 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:58:54,432 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:58:54,432 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:58:54,433 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:58:54,433 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:58:54,433 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:58:54,433 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:58:54,433 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:58:54,433 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:58:54,434 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:58:54,434 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:58:54,434 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:58:54,434 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:58:54,435 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:58:54,435 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:58:54,435 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:58:54,435 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:58:54,435 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:58:54,436 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:58:54,436 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:58:54,436 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:58:54,436 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:58:54,436 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:58:54,437 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:58:54,438 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:58:54,438 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:58:54,439 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:58:54,487 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:58:54,500 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:58:54,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:58:54,505 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:58:54,506 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:58:54,507 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:58:54,580 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52bcf3dc2/f6c99eed66074ba588d5e3fbd943b72e/FLAGa3a30eaf9 [2018-11-23 12:58:55,082 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:58:55,083 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:58:55,104 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52bcf3dc2/f6c99eed66074ba588d5e3fbd943b72e/FLAGa3a30eaf9 [2018-11-23 12:58:55,370 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52bcf3dc2/f6c99eed66074ba588d5e3fbd943b72e [2018-11-23 12:58:55,381 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:58:55,383 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:58:55,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:58:55,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:58:55,390 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:58:55,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:58:55" (1/1) ... [2018-11-23 12:58:55,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c2bdb90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:55, skipping insertion in model container [2018-11-23 12:58:55,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:58:55" (1/1) ... [2018-11-23 12:58:55,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:58:55,473 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:58:55,916 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:58:55,928 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:58:56,025 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:58:56,180 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:58:56,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:56 WrapperNode [2018-11-23 12:58:56,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:58:56,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:58:56,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:58:56,182 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:58:56,194 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:58:56" (1/1) ... [2018-11-23 12:58:56,215 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:58:56" (1/1) ... [2018-11-23 12:58:56,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:58:56,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:58:56,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:58:56,230 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:58:56,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:56" (1/1) ... [2018-11-23 12:58:56,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:56" (1/1) ... [2018-11-23 12:58:56,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:56" (1/1) ... [2018-11-23 12:58:56,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:56" (1/1) ... [2018-11-23 12:58:56,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:56" (1/1) ... [2018-11-23 12:58:56,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:56" (1/1) ... [2018-11-23 12:58:56,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:56" (1/1) ... [2018-11-23 12:58:56,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:58:56,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:58:56,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:58:56,320 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:58:56,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:56" (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:58:56,399 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 12:58:56,399 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 12:58:56,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:58:56,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:58:56,400 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:58:56,400 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:58:56,400 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 12:58:56,400 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 12:58:56,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:58:56,401 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 12:58:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 12:58:56,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:58:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:58:56,401 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:58:56,402 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:58:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:58:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2018-11-23 12:58:56,402 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2018-11-23 12:58:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:58:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:58:56,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 12:58:56,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:58:56,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:58:57,440 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:58:57,441 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 12:58:57,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:58:57 BoogieIcfgContainer [2018-11-23 12:58:57,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:58:57,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:58:57,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:58:57,446 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:58:57,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:58:55" (1/3) ... [2018-11-23 12:58:57,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70777bdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:58:57, skipping insertion in model container [2018-11-23 12:58:57,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:58:56" (2/3) ... [2018-11-23 12:58:57,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70777bdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:58:57, skipping insertion in model container [2018-11-23 12:58:57,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:58:57" (3/3) ... [2018-11-23 12:58:57,450 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:58:57,460 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:58:57,470 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:58:57,490 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:58:57,524 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:58:57,525 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:58:57,525 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:58:57,526 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:58:57,526 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:58:57,526 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:58:57,526 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:58:57,527 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:58:57,527 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:58:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-23 12:58:57,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:58:57,557 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:58:57,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:58:57,561 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:58:57,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:57,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1030430763, now seen corresponding path program 1 times [2018-11-23 12:58:57,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:57,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:57,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:57,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:57,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:58:57,979 INFO L256 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {57#true} is VALID [2018-11-23 12:58:57,983 INFO L273 TraceCheckUtils]: 1: Hoare triple {57#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {57#true} is VALID [2018-11-23 12:58:57,984 INFO L273 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-23 12:58:57,984 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #132#return; {57#true} is VALID [2018-11-23 12:58:57,985 INFO L256 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret21 := main(); {57#true} is VALID [2018-11-23 12:58:57,987 INFO L273 TraceCheckUtils]: 5: Hoare triple {57#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {59#(<= 2 main_~len~0)} is VALID [2018-11-23 12:58:57,988 INFO L256 TraceCheckUtils]: 6: Hoare triple {59#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {57#true} is VALID [2018-11-23 12:58:58,008 INFO L273 TraceCheckUtils]: 7: Hoare triple {57#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {60#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:58:58,017 INFO L273 TraceCheckUtils]: 8: Hoare triple {60#(<= |sll_create_#in~len| sll_create_~len)} assume !(~len > 0); {61#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 12:58:58,034 INFO L273 TraceCheckUtils]: 9: Hoare triple {61#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {61#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 12:58:58,043 INFO L273 TraceCheckUtils]: 10: Hoare triple {61#(<= |sll_create_#in~len| 0)} assume true; {61#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 12:58:58,050 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {61#(<= |sll_create_#in~len| 0)} {59#(<= 2 main_~len~0)} #122#return; {58#false} is VALID [2018-11-23 12:58:58,050 INFO L273 TraceCheckUtils]: 12: Hoare triple {58#false} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret11.base, #t~ret11.offset;~uneq~0 := 5; {58#false} is VALID [2018-11-23 12:58:58,051 INFO L256 TraceCheckUtils]: 13: Hoare triple {58#false} call sll_append(~#s~0.base, ~#s~0.offset, ~uneq~0); {57#true} is VALID [2018-11-23 12:58:58,051 INFO L273 TraceCheckUtils]: 14: Hoare triple {57#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {57#true} is VALID [2018-11-23 12:58:58,052 INFO L256 TraceCheckUtils]: 15: Hoare triple {57#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {57#true} is VALID [2018-11-23 12:58:58,052 INFO L273 TraceCheckUtils]: 16: Hoare triple {57#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; {57#true} is VALID [2018-11-23 12:58:58,052 INFO L273 TraceCheckUtils]: 17: Hoare triple {57#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {57#true} is VALID [2018-11-23 12:58:58,054 INFO L273 TraceCheckUtils]: 18: Hoare triple {57#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; {57#true} is VALID [2018-11-23 12:58:58,055 INFO L273 TraceCheckUtils]: 19: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-23 12:58:58,055 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {57#true} {57#true} #128#return; {57#true} is VALID [2018-11-23 12:58:58,055 INFO L273 TraceCheckUtils]: 21: Hoare triple {57#true} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4); {57#true} is VALID [2018-11-23 12:58:58,056 INFO L273 TraceCheckUtils]: 22: Hoare triple {57#true} assume 0 == #t~mem7.base && 0 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {57#true} is VALID [2018-11-23 12:58:58,056 INFO L273 TraceCheckUtils]: 23: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-23 12:58:58,057 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {57#true} {58#false} #124#return; {58#false} is VALID [2018-11-23 12:58:58,057 INFO L273 TraceCheckUtils]: 25: Hoare triple {58#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4); {58#false} is VALID [2018-11-23 12:58:58,057 INFO L273 TraceCheckUtils]: 26: Hoare triple {58#false} assume !(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem13.base, #t~mem13.offset; {58#false} is VALID [2018-11-23 12:58:58,058 INFO L273 TraceCheckUtils]: 27: Hoare triple {58#false} assume ~count~0 != 1 + ~len~0; {58#false} is VALID [2018-11-23 12:58:58,059 INFO L273 TraceCheckUtils]: 28: Hoare triple {58#false} assume !false; {58#false} is VALID [2018-11-23 12:58:58,074 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:58:58,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:58:58,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:58:58,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 12:58:58,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:58:58,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:58:58,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:58,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:58:58,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:58:58,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:58:58,255 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 5 states. [2018-11-23 12:58:59,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:59,449 INFO L93 Difference]: Finished difference Result 103 states and 133 transitions. [2018-11-23 12:58:59,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:58:59,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 12:58:59,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:58:59,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:58:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2018-11-23 12:58:59,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:58:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2018-11-23 12:58:59,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 133 transitions. [2018-11-23 12:58:59,820 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:59,834 INFO L225 Difference]: With dead ends: 103 [2018-11-23 12:58:59,834 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:58:59,838 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:58:59,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:58:59,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-23 12:58:59,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:58:59,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 42 states. [2018-11-23 12:58:59,937 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 42 states. [2018-11-23 12:58:59,938 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 42 states. [2018-11-23 12:58:59,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:59,945 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-23 12:58:59,945 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2018-11-23 12:58:59,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:59,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:59,947 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 45 states. [2018-11-23 12:58:59,947 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 45 states. [2018-11-23 12:58:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:58:59,953 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-23 12:58:59,953 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2018-11-23 12:58:59,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:58:59,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:58:59,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:58:59,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:58:59,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:58:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-11-23 12:58:59,961 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 29 [2018-11-23 12:58:59,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:58:59,961 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-23 12:58:59,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:58:59,962 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-23 12:58:59,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:58:59,963 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:58:59,963 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] [2018-11-23 12:58:59,964 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:58:59,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:58:59,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1411828689, now seen corresponding path program 1 times [2018-11-23 12:58:59,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:58:59,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:58:59,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:58:59,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:58:59,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:00,143 INFO L256 TraceCheckUtils]: 0: Hoare triple {353#true} call ULTIMATE.init(); {353#true} is VALID [2018-11-23 12:59:00,143 INFO L273 TraceCheckUtils]: 1: Hoare triple {353#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {353#true} is VALID [2018-11-23 12:59:00,144 INFO L273 TraceCheckUtils]: 2: Hoare triple {353#true} assume true; {353#true} is VALID [2018-11-23 12:59:00,144 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {353#true} {353#true} #132#return; {353#true} is VALID [2018-11-23 12:59:00,145 INFO L256 TraceCheckUtils]: 4: Hoare triple {353#true} call #t~ret21 := main(); {353#true} is VALID [2018-11-23 12:59:00,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {353#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {355#(<= 2 main_~len~0)} is VALID [2018-11-23 12:59:00,146 INFO L256 TraceCheckUtils]: 6: Hoare triple {355#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {353#true} is VALID [2018-11-23 12:59:00,147 INFO L273 TraceCheckUtils]: 7: Hoare triple {353#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {356#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:00,148 INFO L273 TraceCheckUtils]: 8: Hoare triple {356#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {356#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:00,148 INFO L256 TraceCheckUtils]: 9: Hoare triple {356#(<= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {353#true} is VALID [2018-11-23 12:59:00,148 INFO L273 TraceCheckUtils]: 10: Hoare triple {353#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; {353#true} is VALID [2018-11-23 12:59:00,149 INFO L273 TraceCheckUtils]: 11: Hoare triple {353#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {353#true} is VALID [2018-11-23 12:59:00,149 INFO L273 TraceCheckUtils]: 12: Hoare triple {353#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; {353#true} is VALID [2018-11-23 12:59:00,149 INFO L273 TraceCheckUtils]: 13: Hoare triple {353#true} assume true; {353#true} is VALID [2018-11-23 12:59:00,151 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {353#true} {356#(<= |sll_create_#in~len| sll_create_~len)} #130#return; {356#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:00,152 INFO L273 TraceCheckUtils]: 15: Hoare triple {356#(<= |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; {356#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:00,153 INFO L273 TraceCheckUtils]: 16: Hoare triple {356#(<= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {357#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 12:59:00,154 INFO L273 TraceCheckUtils]: 17: Hoare triple {357#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {358#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:00,155 INFO L273 TraceCheckUtils]: 18: Hoare triple {358#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {358#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:00,156 INFO L273 TraceCheckUtils]: 19: Hoare triple {358#(<= |sll_create_#in~len| 1)} assume true; {358#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:00,158 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {358#(<= |sll_create_#in~len| 1)} {355#(<= 2 main_~len~0)} #122#return; {354#false} is VALID [2018-11-23 12:59:00,158 INFO L273 TraceCheckUtils]: 21: Hoare triple {354#false} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret11.base, #t~ret11.offset;~uneq~0 := 5; {354#false} is VALID [2018-11-23 12:59:00,159 INFO L256 TraceCheckUtils]: 22: Hoare triple {354#false} call sll_append(~#s~0.base, ~#s~0.offset, ~uneq~0); {353#true} is VALID [2018-11-23 12:59:00,159 INFO L273 TraceCheckUtils]: 23: Hoare triple {353#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {353#true} is VALID [2018-11-23 12:59:00,160 INFO L256 TraceCheckUtils]: 24: Hoare triple {353#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {353#true} is VALID [2018-11-23 12:59:00,161 INFO L273 TraceCheckUtils]: 25: Hoare triple {353#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; {353#true} is VALID [2018-11-23 12:59:00,161 INFO L273 TraceCheckUtils]: 26: Hoare triple {353#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {353#true} is VALID [2018-11-23 12:59:00,161 INFO L273 TraceCheckUtils]: 27: Hoare triple {353#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; {353#true} is VALID [2018-11-23 12:59:00,162 INFO L273 TraceCheckUtils]: 28: Hoare triple {353#true} assume true; {353#true} is VALID [2018-11-23 12:59:00,162 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {353#true} {353#true} #128#return; {353#true} is VALID [2018-11-23 12:59:00,162 INFO L273 TraceCheckUtils]: 30: Hoare triple {353#true} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4); {353#true} is VALID [2018-11-23 12:59:00,163 INFO L273 TraceCheckUtils]: 31: Hoare triple {353#true} assume 0 == #t~mem7.base && 0 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {353#true} is VALID [2018-11-23 12:59:00,163 INFO L273 TraceCheckUtils]: 32: Hoare triple {353#true} assume true; {353#true} is VALID [2018-11-23 12:59:00,163 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {353#true} {354#false} #124#return; {354#false} is VALID [2018-11-23 12:59:00,164 INFO L273 TraceCheckUtils]: 34: Hoare triple {354#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4); {354#false} is VALID [2018-11-23 12:59:00,164 INFO L273 TraceCheckUtils]: 35: Hoare triple {354#false} assume !(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem13.base, #t~mem13.offset; {354#false} is VALID [2018-11-23 12:59:00,164 INFO L273 TraceCheckUtils]: 36: Hoare triple {354#false} assume ~count~0 != 1 + ~len~0; {354#false} is VALID [2018-11-23 12:59:00,165 INFO L273 TraceCheckUtils]: 37: Hoare triple {354#false} assume !false; {354#false} is VALID [2018-11-23 12:59:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:59:00,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:59:00,169 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:00,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:59:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:00,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:59:00,643 INFO L256 TraceCheckUtils]: 0: Hoare triple {353#true} call ULTIMATE.init(); {353#true} is VALID [2018-11-23 12:59:00,644 INFO L273 TraceCheckUtils]: 1: Hoare triple {353#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {353#true} is VALID [2018-11-23 12:59:00,644 INFO L273 TraceCheckUtils]: 2: Hoare triple {353#true} assume true; {353#true} is VALID [2018-11-23 12:59:00,645 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {353#true} {353#true} #132#return; {353#true} is VALID [2018-11-23 12:59:00,645 INFO L256 TraceCheckUtils]: 4: Hoare triple {353#true} call #t~ret21 := main(); {353#true} is VALID [2018-11-23 12:59:00,647 INFO L273 TraceCheckUtils]: 5: Hoare triple {353#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {355#(<= 2 main_~len~0)} is VALID [2018-11-23 12:59:00,648 INFO L256 TraceCheckUtils]: 6: Hoare triple {355#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {353#true} is VALID [2018-11-23 12:59:00,648 INFO L273 TraceCheckUtils]: 7: Hoare triple {353#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {356#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:00,651 INFO L273 TraceCheckUtils]: 8: Hoare triple {356#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {356#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:00,652 INFO L256 TraceCheckUtils]: 9: Hoare triple {356#(<= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {353#true} is VALID [2018-11-23 12:59:00,652 INFO L273 TraceCheckUtils]: 10: Hoare triple {353#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; {353#true} is VALID [2018-11-23 12:59:00,652 INFO L273 TraceCheckUtils]: 11: Hoare triple {353#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {353#true} is VALID [2018-11-23 12:59:00,653 INFO L273 TraceCheckUtils]: 12: Hoare triple {353#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; {353#true} is VALID [2018-11-23 12:59:00,653 INFO L273 TraceCheckUtils]: 13: Hoare triple {353#true} assume true; {353#true} is VALID [2018-11-23 12:59:00,654 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {353#true} {356#(<= |sll_create_#in~len| sll_create_~len)} #130#return; {356#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:00,656 INFO L273 TraceCheckUtils]: 15: Hoare triple {356#(<= |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; {356#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:00,656 INFO L273 TraceCheckUtils]: 16: Hoare triple {356#(<= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {357#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 12:59:00,658 INFO L273 TraceCheckUtils]: 17: Hoare triple {357#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {358#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:00,658 INFO L273 TraceCheckUtils]: 18: Hoare triple {358#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {358#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:00,661 INFO L273 TraceCheckUtils]: 19: Hoare triple {358#(<= |sll_create_#in~len| 1)} assume true; {358#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:00,663 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {358#(<= |sll_create_#in~len| 1)} {355#(<= 2 main_~len~0)} #122#return; {354#false} is VALID [2018-11-23 12:59:00,663 INFO L273 TraceCheckUtils]: 21: Hoare triple {354#false} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret11.base, #t~ret11.offset;~uneq~0 := 5; {354#false} is VALID [2018-11-23 12:59:00,664 INFO L256 TraceCheckUtils]: 22: Hoare triple {354#false} call sll_append(~#s~0.base, ~#s~0.offset, ~uneq~0); {354#false} is VALID [2018-11-23 12:59:00,664 INFO L273 TraceCheckUtils]: 23: Hoare triple {354#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {354#false} is VALID [2018-11-23 12:59:00,665 INFO L256 TraceCheckUtils]: 24: Hoare triple {354#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {354#false} is VALID [2018-11-23 12:59:00,665 INFO L273 TraceCheckUtils]: 25: Hoare triple {354#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; {354#false} is VALID [2018-11-23 12:59:00,666 INFO L273 TraceCheckUtils]: 26: Hoare triple {354#false} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {354#false} is VALID [2018-11-23 12:59:00,666 INFO L273 TraceCheckUtils]: 27: Hoare triple {354#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; {354#false} is VALID [2018-11-23 12:59:00,666 INFO L273 TraceCheckUtils]: 28: Hoare triple {354#false} assume true; {354#false} is VALID [2018-11-23 12:59:00,667 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {354#false} {354#false} #128#return; {354#false} is VALID [2018-11-23 12:59:00,667 INFO L273 TraceCheckUtils]: 30: Hoare triple {354#false} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4); {354#false} is VALID [2018-11-23 12:59:00,667 INFO L273 TraceCheckUtils]: 31: Hoare triple {354#false} assume 0 == #t~mem7.base && 0 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {354#false} is VALID [2018-11-23 12:59:00,667 INFO L273 TraceCheckUtils]: 32: Hoare triple {354#false} assume true; {354#false} is VALID [2018-11-23 12:59:00,668 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {354#false} {354#false} #124#return; {354#false} is VALID [2018-11-23 12:59:00,668 INFO L273 TraceCheckUtils]: 34: Hoare triple {354#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4); {354#false} is VALID [2018-11-23 12:59:00,668 INFO L273 TraceCheckUtils]: 35: Hoare triple {354#false} assume !(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem13.base, #t~mem13.offset; {354#false} is VALID [2018-11-23 12:59:00,669 INFO L273 TraceCheckUtils]: 36: Hoare triple {354#false} assume ~count~0 != 1 + ~len~0; {354#false} is VALID [2018-11-23 12:59:00,669 INFO L273 TraceCheckUtils]: 37: Hoare triple {354#false} assume !false; {354#false} is VALID [2018-11-23 12:59:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:59:00,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:59:00,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 12:59:00,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-11-23 12:59:00,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:59:00,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:59:00,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:00,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:59:00,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:59:00,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:59:00,837 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 6 states. [2018-11-23 12:59:01,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:01,313 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2018-11-23 12:59:01,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:59:01,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-11-23 12:59:01,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:59:01,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:59:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2018-11-23 12:59:01,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:59:01,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2018-11-23 12:59:01,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 93 transitions. [2018-11-23 12:59:01,465 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:01,469 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:59:01,470 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:59:01,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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:01,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:59:01,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-11-23 12:59:01,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:59:01,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 46 states. [2018-11-23 12:59:01,510 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 46 states. [2018-11-23 12:59:01,511 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 46 states. [2018-11-23 12:59:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:01,516 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 12:59:01,516 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-23 12:59:01,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:01,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:01,517 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 49 states. [2018-11-23 12:59:01,518 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 49 states. [2018-11-23 12:59:01,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:01,522 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 12:59:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-23 12:59:01,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:01,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:01,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:59:01,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:59:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:59:01,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-11-23 12:59:01,527 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 38 [2018-11-23 12:59:01,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:59:01,528 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-11-23 12:59:01,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:59:01,528 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-23 12:59:01,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:59:01,530 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:59:01,530 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] [2018-11-23 12:59:01,530 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:59:01,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:59:01,531 INFO L82 PathProgramCache]: Analyzing trace with hash -656893099, now seen corresponding path program 2 times [2018-11-23 12:59:01,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:59:01,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:59:01,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:01,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:59:01,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:03,274 INFO L256 TraceCheckUtils]: 0: Hoare triple {740#true} call ULTIMATE.init(); {740#true} is VALID [2018-11-23 12:59:03,274 INFO L273 TraceCheckUtils]: 1: Hoare triple {740#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {740#true} is VALID [2018-11-23 12:59:03,275 INFO L273 TraceCheckUtils]: 2: Hoare triple {740#true} assume true; {740#true} is VALID [2018-11-23 12:59:03,275 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {740#true} {740#true} #132#return; {740#true} is VALID [2018-11-23 12:59:03,276 INFO L256 TraceCheckUtils]: 4: Hoare triple {740#true} call #t~ret21 := main(); {740#true} is VALID [2018-11-23 12:59:03,277 INFO L273 TraceCheckUtils]: 5: Hoare triple {740#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {742#(= (select |#valid| |main_~#s~0.base|) 1)} is VALID [2018-11-23 12:59:03,278 INFO L256 TraceCheckUtils]: 6: Hoare triple {742#(= (select |#valid| |main_~#s~0.base|) 1)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {743#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:03,278 INFO L273 TraceCheckUtils]: 7: Hoare triple {743#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {743#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:03,279 INFO L273 TraceCheckUtils]: 8: Hoare triple {743#(= |#valid| |old(#valid)|)} assume !!(~len > 0); {743#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:03,280 INFO L256 TraceCheckUtils]: 9: Hoare triple {743#(= |#valid| |old(#valid)|)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {743#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:03,283 INFO L273 TraceCheckUtils]: 10: Hoare triple {743#(= |#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; {744#(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:03,285 INFO L273 TraceCheckUtils]: 11: Hoare triple {744#(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); {744#(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:03,286 INFO L273 TraceCheckUtils]: 12: Hoare triple {744#(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; {744#(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:03,287 INFO L273 TraceCheckUtils]: 13: Hoare triple {744#(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; {744#(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:03,290 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {744#(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|)))))} {743#(= |#valid| |old(#valid)|)} #130#return; {744#(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:03,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {744#(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; {744#(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:03,309 INFO L273 TraceCheckUtils]: 16: Hoare triple {744#(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; {744#(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:03,311 INFO L273 TraceCheckUtils]: 17: Hoare triple {744#(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); {744#(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:03,312 INFO L256 TraceCheckUtils]: 18: Hoare triple {744#(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); {743#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:03,313 INFO L273 TraceCheckUtils]: 19: Hoare triple {743#(= |#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; {745#(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:03,315 INFO L273 TraceCheckUtils]: 20: Hoare triple {745#(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); {745#(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:03,317 INFO L273 TraceCheckUtils]: 21: Hoare triple {745#(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; {746#(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:03,319 INFO L273 TraceCheckUtils]: 22: Hoare triple {746#(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; {746#(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:03,329 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {746#(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|)))))} {744#(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|)))))} #130#return; {747#(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:03,331 INFO L273 TraceCheckUtils]: 24: Hoare triple {747#(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; {748#(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:03,341 INFO L273 TraceCheckUtils]: 25: Hoare triple {748#(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; {748#(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:03,343 INFO L273 TraceCheckUtils]: 26: Hoare triple {748#(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); {748#(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:03,345 INFO L273 TraceCheckUtils]: 27: Hoare triple {748#(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; {749#(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:03,346 INFO L273 TraceCheckUtils]: 28: Hoare triple {749#(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; {749#(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:03,348 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {749#(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|)))))} {742#(= (select |#valid| |main_~#s~0.base|) 1)} #122#return; {750#(and (not (= 0 |main_#t~ret11.base|)) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:03,350 INFO L273 TraceCheckUtils]: 30: Hoare triple {750#(and (not (= 0 |main_#t~ret11.base|)) (= (select |#valid| |main_~#s~0.base|) 1))} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret11.base, #t~ret11.offset;~uneq~0 := 5; {751#(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:03,351 INFO L256 TraceCheckUtils]: 31: Hoare triple {751#(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_append(~#s~0.base, ~#s~0.offset, ~uneq~0); {752#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:03,356 INFO L273 TraceCheckUtils]: 32: Hoare triple {752#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {753#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|) (= (select |old(#memory_$Pointer$.base)| sll_append_~head.base) (select |#memory_$Pointer$.base| sll_append_~head.base)))} is VALID [2018-11-23 12:59:03,358 INFO L256 TraceCheckUtils]: 33: Hoare triple {753#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|) (= (select |old(#memory_$Pointer$.base)| sll_append_~head.base) (select |#memory_$Pointer$.base| sll_append_~head.base)))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {752#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:03,359 INFO L273 TraceCheckUtils]: 34: Hoare triple {752#(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; {754#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:03,359 INFO L273 TraceCheckUtils]: 35: Hoare triple {754#(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); {754#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:03,361 INFO L273 TraceCheckUtils]: 36: Hoare triple {754#(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; {755#(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:03,362 INFO L273 TraceCheckUtils]: 37: Hoare triple {755#(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; {755#(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:03,365 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {755#(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|)))))} {753#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|) (= (select |old(#memory_$Pointer$.base)| sll_append_~head.base) (select |#memory_$Pointer$.base| sll_append_~head.base)))} #128#return; {756#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (= (select |old(#memory_$Pointer$.base)| sll_append_~head.base) (select |#memory_$Pointer$.base| sll_append_~head.base))) (= sll_append_~head.base |sll_append_#in~head.base|))} is VALID [2018-11-23 12:59:03,366 INFO L273 TraceCheckUtils]: 39: Hoare triple {756#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (= (select |old(#memory_$Pointer$.base)| sll_append_~head.base) (select |#memory_$Pointer$.base| sll_append_~head.base))) (= sll_append_~head.base |sll_append_#in~head.base|))} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4); {757#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset) |sll_append_#t~mem7.base|) (or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (= (select |old(#memory_$Pointer$.base)| sll_append_~head.base) (select |#memory_$Pointer$.base| sll_append_~head.base))) (= sll_append_~head.base |sll_append_#in~head.base|))} is VALID [2018-11-23 12:59:03,368 INFO L273 TraceCheckUtils]: 40: Hoare triple {757#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset) |sll_append_#t~mem7.base|) (or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (= (select |old(#memory_$Pointer$.base)| sll_append_~head.base) (select |#memory_$Pointer$.base| sll_append_~head.base))) (= sll_append_~head.base |sll_append_#in~head.base|))} assume 0 == #t~mem7.base && 0 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {758#(or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (= 0 (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} is VALID [2018-11-23 12:59:03,369 INFO L273 TraceCheckUtils]: 41: Hoare triple {758#(or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (= 0 (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} assume true; {758#(or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (= 0 (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} is VALID [2018-11-23 12:59:03,371 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {758#(or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (= 0 (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} {751#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| |main_~#s~0.base|) 1))} #124#return; {741#false} is VALID [2018-11-23 12:59:03,371 INFO L273 TraceCheckUtils]: 43: Hoare triple {741#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4); {741#false} is VALID [2018-11-23 12:59:03,372 INFO L273 TraceCheckUtils]: 44: Hoare triple {741#false} assume !(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem13.base, #t~mem13.offset; {741#false} is VALID [2018-11-23 12:59:03,372 INFO L273 TraceCheckUtils]: 45: Hoare triple {741#false} assume ~count~0 != 1 + ~len~0; {741#false} is VALID [2018-11-23 12:59:03,372 INFO L273 TraceCheckUtils]: 46: Hoare triple {741#false} assume !false; {741#false} is VALID [2018-11-23 12:59:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:59:03,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:59:03,389 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:03,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:59:03,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:59:03,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:59:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:03,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:59:03,566 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:03,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:03,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:03,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 12:59:03,584 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:03,584 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:03,584 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1)) [2018-11-23 12:59:06,296 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:06,297 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:06,298 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:06,300 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 40 [2018-11-23 12:59:06,320 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 28 treesize of output 34 [2018-11-23 12:59:06,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:06,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:06,394 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:06,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:35 [2018-11-23 12:59:06,398 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:06,398 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 (= (select |v_#valid_BEFORE_CALL_6| |main_~#s~0.base|) 1) (not (= 0 |main_#t~ret11.base|)) (= |#valid| (store .cse0 |main_#t~ret11.base| 1)) (= |main_~#s~0.offset| 0) (= 0 (select |v_#valid_BEFORE_CALL_6| |node_create_#t~malloc2.base|)) (= 0 (select .cse0 |main_#t~ret11.base|)))) [2018-11-23 12:59:06,399 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|node_create_#t~malloc2.base|]. (and (not (= 0 |main_#t~ret11.base|)) (not (= |main_~#s~0.base| |main_#t~ret11.base|)) (= 1 (select |#valid| |main_#t~ret11.base|)) (= |main_~#s~0.offset| 0) (not (= |node_create_#t~malloc2.base| |main_#t~ret11.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:10,786 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 12:59:12,959 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 12:59:15,148 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 12:59:15,278 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:15,362 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:15,477 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:15,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:63 [2018-11-23 12:59:21,812 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:21,813 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 6 variables, input treesize:113, output treesize:1 [2018-11-23 12:59:21,822 INFO L256 TraceCheckUtils]: 0: Hoare triple {740#true} call ULTIMATE.init(); {740#true} is VALID [2018-11-23 12:59:21,823 INFO L273 TraceCheckUtils]: 1: Hoare triple {740#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {740#true} is VALID [2018-11-23 12:59:21,823 INFO L273 TraceCheckUtils]: 2: Hoare triple {740#true} assume true; {740#true} is VALID [2018-11-23 12:59:21,824 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {740#true} {740#true} #132#return; {740#true} is VALID [2018-11-23 12:59:21,824 INFO L256 TraceCheckUtils]: 4: Hoare triple {740#true} call #t~ret21 := main(); {740#true} is VALID [2018-11-23 12:59:21,829 INFO L273 TraceCheckUtils]: 5: Hoare triple {740#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {777#(and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:21,831 INFO L256 TraceCheckUtils]: 6: Hoare triple {777#(and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {743#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:21,831 INFO L273 TraceCheckUtils]: 7: Hoare triple {743#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {743#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:21,832 INFO L273 TraceCheckUtils]: 8: Hoare triple {743#(= |#valid| |old(#valid)|)} assume !!(~len > 0); {743#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:21,832 INFO L256 TraceCheckUtils]: 9: Hoare triple {743#(= |#valid| |old(#valid)|)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {743#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:21,833 INFO L273 TraceCheckUtils]: 10: Hoare triple {743#(= |#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; {793#(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:21,834 INFO L273 TraceCheckUtils]: 11: Hoare triple {793#(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); {793#(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:21,834 INFO L273 TraceCheckUtils]: 12: Hoare triple {793#(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; {793#(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:21,838 INFO L273 TraceCheckUtils]: 13: Hoare triple {793#(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; {793#(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:21,839 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {793#(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)))} {743#(= |#valid| |old(#valid)|)} #130#return; {793#(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:21,839 INFO L273 TraceCheckUtils]: 15: Hoare triple {793#(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; {793#(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:21,840 INFO L273 TraceCheckUtils]: 16: Hoare triple {793#(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; {793#(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:21,840 INFO L273 TraceCheckUtils]: 17: Hoare triple {793#(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); {793#(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:21,841 INFO L256 TraceCheckUtils]: 18: Hoare triple {793#(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); {743#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:21,842 INFO L273 TraceCheckUtils]: 19: Hoare triple {743#(= |#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; {821#(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:21,842 INFO L273 TraceCheckUtils]: 20: Hoare triple {821#(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); {821#(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:21,844 INFO L273 TraceCheckUtils]: 21: Hoare triple {821#(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; {828#(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:21,844 INFO L273 TraceCheckUtils]: 22: Hoare triple {828#(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; {828#(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:21,847 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {828#(and (= |#valid| (store |old(#valid)| |node_create_#res.base| 1)) (= 0 (select |old(#valid)| |node_create_#res.base|)) (not (= 0 |node_create_#res.base|)))} {793#(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)))} #130#return; {835#(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:21,849 INFO L273 TraceCheckUtils]: 24: Hoare triple {835#(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; {839#(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:21,850 INFO L273 TraceCheckUtils]: 25: Hoare triple {839#(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; {839#(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:21,851 INFO L273 TraceCheckUtils]: 26: Hoare triple {839#(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); {839#(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:21,853 INFO L273 TraceCheckUtils]: 27: Hoare triple {839#(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; {849#(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:21,854 INFO L273 TraceCheckUtils]: 28: Hoare triple {849#(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; {849#(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:21,874 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {849#(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|)))} {777#(and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} #122#return; {856#(and (not (= 0 |main_#t~ret11.base|)) (not (= |main_~#s~0.base| |main_#t~ret11.base|)) (= 1 (select |#valid| |main_#t~ret11.base|)) (= |main_~#s~0.offset| 0) (exists ((|node_create_#t~malloc2.base| Int)) (and (not (= |node_create_#t~malloc2.base| |main_#t~ret11.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= 1 (select |#valid| |node_create_#t~malloc2.base|)))) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:21,887 INFO L273 TraceCheckUtils]: 30: Hoare triple {856#(and (not (= 0 |main_#t~ret11.base|)) (not (= |main_~#s~0.base| |main_#t~ret11.base|)) (= 1 (select |#valid| |main_#t~ret11.base|)) (= |main_~#s~0.offset| 0) (exists ((|node_create_#t~malloc2.base| Int)) (and (not (= |node_create_#t~malloc2.base| |main_#t~ret11.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= 1 (select |#valid| |node_create_#t~malloc2.base|)))) (= (select |#valid| |main_~#s~0.base|) 1))} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret11.base, #t~ret11.offset;~uneq~0 := 5; {860#(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:21,888 INFO L256 TraceCheckUtils]: 31: Hoare triple {860#(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_append(~#s~0.base, ~#s~0.offset, ~uneq~0); {752#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:21,891 INFO L273 TraceCheckUtils]: 32: Hoare triple {752#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {867#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= sll_append_~head.base |sll_append_#in~head.base|))} is VALID [2018-11-23 12:59:21,892 INFO L256 TraceCheckUtils]: 33: Hoare triple {867#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= sll_append_~head.base |sll_append_#in~head.base|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {752#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:21,893 INFO L273 TraceCheckUtils]: 34: Hoare triple {752#(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; {754#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:21,893 INFO L273 TraceCheckUtils]: 35: Hoare triple {754#(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); {754#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:21,896 INFO L273 TraceCheckUtils]: 36: Hoare triple {754#(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; {880#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |node_create_#res.base|) node_create_~temp~0.offset))))))} is VALID [2018-11-23 12:59:21,897 INFO L273 TraceCheckUtils]: 37: Hoare triple {880#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |node_create_#res.base|) node_create_~temp~0.offset))))))} assume true; {880#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |node_create_#res.base|) node_create_~temp~0.offset))))))} is VALID [2018-11-23 12:59:21,898 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {880#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |node_create_#res.base|) node_create_~temp~0.offset))))))} {867#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= sll_append_~head.base |sll_append_#in~head.base|))} #128#return; {887#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|) (= (select |old(#valid)| |sll_append_#t~ret6.base|) 0) (exists ((node_create_~temp~0.offset Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_append_#t~ret6.base| (store (store (select |old(#memory_$Pointer$.base)| |sll_append_#t~ret6.base|) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |sll_append_#t~ret6.base|) node_create_~temp~0.offset))))))} is VALID [2018-11-23 12:59:21,899 INFO L273 TraceCheckUtils]: 39: Hoare triple {887#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|) (= (select |old(#valid)| |sll_append_#t~ret6.base|) 0) (exists ((node_create_~temp~0.offset Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_append_#t~ret6.base| (store (store (select |old(#memory_$Pointer$.base)| |sll_append_#t~ret6.base|) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |sll_append_#t~ret6.base|) node_create_~temp~0.offset))))))} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4); {891#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |sll_append_#t~mem7.base| (select (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset)) (= sll_append_~head.base |sll_append_#in~head.base|) (= 0 (select |old(#valid)| sll_append_~new_last~0.base)) (exists ((node_create_~temp~0.offset Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) node_create_~temp~0.offset))))))} is VALID [2018-11-23 12:59:21,902 INFO L273 TraceCheckUtils]: 40: Hoare triple {891#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |sll_append_#t~mem7.base| (select (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset)) (= sll_append_~head.base |sll_append_#in~head.base|) (= 0 (select |old(#valid)| sll_append_~new_last~0.base)) (exists ((node_create_~temp~0.offset Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) node_create_~temp~0.offset))))))} assume 0 == #t~mem7.base && 0 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {895#(exists ((sll_append_~new_last~0.base Int) (node_create_~temp~0.offset Int) (v_DerPreprocessor_2 Int)) (and (= (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base|) |sll_append_#in~head.offset| sll_append_~new_last~0.base))) (= 0 (select |old(#valid)| sll_append_~new_last~0.base))))} is VALID [2018-11-23 12:59:21,903 INFO L273 TraceCheckUtils]: 41: Hoare triple {895#(exists ((sll_append_~new_last~0.base Int) (node_create_~temp~0.offset Int) (v_DerPreprocessor_2 Int)) (and (= (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base|) |sll_append_#in~head.offset| sll_append_~new_last~0.base))) (= 0 (select |old(#valid)| sll_append_~new_last~0.base))))} assume true; {895#(exists ((sll_append_~new_last~0.base Int) (node_create_~temp~0.offset Int) (v_DerPreprocessor_2 Int)) (and (= (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base|) |sll_append_#in~head.offset| sll_append_~new_last~0.base))) (= 0 (select |old(#valid)| sll_append_~new_last~0.base))))} is VALID [2018-11-23 12:59:21,905 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {895#(exists ((sll_append_~new_last~0.base Int) (node_create_~temp~0.offset Int) (v_DerPreprocessor_2 Int)) (and (= (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_2)) |sll_append_#in~head.base|) |sll_append_#in~head.offset| sll_append_~new_last~0.base))) (= 0 (select |old(#valid)| sll_append_~new_last~0.base))))} {860#(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))} #124#return; {741#false} is VALID [2018-11-23 12:59:21,905 INFO L273 TraceCheckUtils]: 43: Hoare triple {741#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4); {741#false} is VALID [2018-11-23 12:59:21,905 INFO L273 TraceCheckUtils]: 44: Hoare triple {741#false} assume !(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem13.base, #t~mem13.offset; {741#false} is VALID [2018-11-23 12:59:21,905 INFO L273 TraceCheckUtils]: 45: Hoare triple {741#false} assume ~count~0 != 1 + ~len~0; {741#false} is VALID [2018-11-23 12:59:21,906 INFO L273 TraceCheckUtils]: 46: Hoare triple {741#false} assume !false; {741#false} is VALID [2018-11-23 12:59:21,918 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 12 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:59:21,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:59:21,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 33 [2018-11-23 12:59:21,948 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-11-23 12:59:21,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:59:21,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 12:59:22,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:22,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 12:59:22,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 12:59:22,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=946, Unknown=6, NotChecked=0, Total=1056 [2018-11-23 12:59:22,220 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 33 states. [2018-11-23 12:59:27,431 WARN L180 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-11-23 12:59:32,245 WARN L180 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 15 [2018-11-23 12:59:46,779 WARN L180 SmtUtils]: Spent 2.67 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 12:59:55,194 WARN L180 SmtUtils]: Spent 2.62 s on a formula simplification that was a NOOP. DAG size: 38 [2018-11-23 12:59:56,927 WARN L180 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-23 12:59:57,728 WARN L180 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-11-23 13:00:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:02,324 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2018-11-23 13:00:02,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 13:00:02,324 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-11-23 13:00:02,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:00:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 97 transitions. [2018-11-23 13:00:02,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:00:02,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 97 transitions. [2018-11-23 13:00:02,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 97 transitions. [2018-11-23 13:00:02,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:02,548 INFO L225 Difference]: With dead ends: 78 [2018-11-23 13:00:02,549 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 13:00:02,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 31.0s TimeCoverageRelationStatistics Valid=180, Invalid=1706, Unknown=6, NotChecked=0, Total=1892 [2018-11-23 13:00:02,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 13:00:02,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-11-23 13:00:02,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:02,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 57 states. [2018-11-23 13:00:02,620 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 57 states. [2018-11-23 13:00:02,620 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 57 states. [2018-11-23 13:00:02,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:02,627 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2018-11-23 13:00:02,627 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2018-11-23 13:00:02,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:02,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:02,629 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 68 states. [2018-11-23 13:00:02,629 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 68 states. [2018-11-23 13:00:02,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:02,634 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2018-11-23 13:00:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2018-11-23 13:00:02,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:02,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:02,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:02,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:02,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 13:00:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-11-23 13:00:02,640 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 47 [2018-11-23 13:00:02,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:02,640 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-11-23 13:00:02,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 13:00:02,640 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2018-11-23 13:00:02,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 13:00:02,642 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:02,643 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:00:02,643 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:02,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:02,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1082231911, now seen corresponding path program 1 times [2018-11-23 13:00:02,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:02,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:02,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:02,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:00:02,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:05,068 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2018-11-23 13:00:05,365 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2018-11-23 13:00:05,691 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2018-11-23 13:00:06,139 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2018-11-23 13:00:06,159 INFO L256 TraceCheckUtils]: 0: Hoare triple {1253#true} call ULTIMATE.init(); {1253#true} is VALID [2018-11-23 13:00:06,160 INFO L273 TraceCheckUtils]: 1: Hoare triple {1253#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1253#true} is VALID [2018-11-23 13:00:06,160 INFO L273 TraceCheckUtils]: 2: Hoare triple {1253#true} assume true; {1253#true} is VALID [2018-11-23 13:00:06,160 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1253#true} {1253#true} #132#return; {1253#true} is VALID [2018-11-23 13:00:06,160 INFO L256 TraceCheckUtils]: 4: Hoare triple {1253#true} call #t~ret21 := main(); {1253#true} is VALID [2018-11-23 13:00:06,161 INFO L273 TraceCheckUtils]: 5: Hoare triple {1253#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1255#(= (select |#valid| |main_~#s~0.base|) 1)} is VALID [2018-11-23 13:00:06,162 INFO L256 TraceCheckUtils]: 6: Hoare triple {1255#(= (select |#valid| |main_~#s~0.base|) 1)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1256#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:00:06,162 INFO L273 TraceCheckUtils]: 7: Hoare triple {1256#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1256#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:00:06,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {1256#(= |#valid| |old(#valid)|)} assume !!(~len > 0); {1256#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:00:06,163 INFO L256 TraceCheckUtils]: 9: Hoare triple {1256#(= |#valid| |old(#valid)|)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1256#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:00:06,165 INFO L273 TraceCheckUtils]: 10: Hoare triple {1256#(= |#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; {1257#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#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 13:00:06,166 INFO L273 TraceCheckUtils]: 11: Hoare triple {1257#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#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); {1257#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#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 13:00:06,168 INFO L273 TraceCheckUtils]: 12: Hoare triple {1257#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#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; {1258#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#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 13:00:06,170 INFO L273 TraceCheckUtils]: 13: Hoare triple {1258#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 |node_create_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {1258#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#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 13:00:06,172 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1258#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 |node_create_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} {1256#(= |#valid| |old(#valid)|)} #130#return; {1259#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 |sll_create_#t~ret4.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:06,174 INFO L273 TraceCheckUtils]: 15: Hoare triple {1259#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 |sll_create_#t~ret4.base|)) (= |#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; {1260#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:06,175 INFO L273 TraceCheckUtils]: 16: Hoare triple {1260#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1260#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:06,177 INFO L273 TraceCheckUtils]: 17: Hoare triple {1260#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !!(~len > 0); {1260#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:06,178 INFO L256 TraceCheckUtils]: 18: Hoare triple {1260#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1256#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:00:06,180 INFO L273 TraceCheckUtils]: 19: Hoare triple {1256#(= |#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; {1261#(and (= (select |#valid| node_create_~temp~0.base) 1) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 node_create_~temp~0.offset) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:06,184 INFO L273 TraceCheckUtils]: 20: Hoare triple {1261#(and (= (select |#valid| node_create_~temp~0.base) 1) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 node_create_~temp~0.offset) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1261#(and (= (select |#valid| node_create_~temp~0.base) 1) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 node_create_~temp~0.offset) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:06,186 INFO L273 TraceCheckUtils]: 21: Hoare triple {1261#(and (= (select |#valid| node_create_~temp~0.base) 1) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 node_create_~temp~0.offset) (= |#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; {1262#(and (= (select |#valid| |node_create_#res.base|) 1) (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 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:00:06,187 INFO L273 TraceCheckUtils]: 22: Hoare triple {1262#(and (= (select |#valid| |node_create_#res.base|) 1) (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 0 |node_create_#res.offset|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {1262#(and (= (select |#valid| |node_create_#res.base|) 1) (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 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:00:06,190 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1262#(and (= (select |#valid| |node_create_#res.base|) 1) (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 0 |node_create_#res.offset|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} {1260#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} #130#return; {1263#(and (= 0 |sll_create_#t~ret4.offset|) (= (select |#valid| |sll_create_#t~ret4.base|) 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|)))) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-23 13:00:06,194 INFO L273 TraceCheckUtils]: 24: Hoare triple {1263#(and (= 0 |sll_create_#t~ret4.offset|) (= (select |#valid| |sll_create_#t~ret4.base|) 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|)))) (not (= 0 sll_create_~head~0.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; {1264#(and (= (select |#valid| sll_create_~head~0.base) 1) (<= 0 sll_create_~head~0.offset) (= |#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|))))) (<= sll_create_~head~0.offset 0) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} is VALID [2018-11-23 13:00:06,195 INFO L273 TraceCheckUtils]: 25: Hoare triple {1264#(and (= (select |#valid| sll_create_~head~0.base) 1) (<= 0 sll_create_~head~0.offset) (= |#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|))))) (<= sll_create_~head~0.offset 0) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1264#(and (= (select |#valid| sll_create_~head~0.base) 1) (<= 0 sll_create_~head~0.offset) (= |#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|))))) (<= sll_create_~head~0.offset 0) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} is VALID [2018-11-23 13:00:06,197 INFO L273 TraceCheckUtils]: 26: Hoare triple {1264#(and (= (select |#valid| sll_create_~head~0.base) 1) (<= 0 sll_create_~head~0.offset) (= |#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|))))) (<= sll_create_~head~0.offset 0) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} assume !(~len > 0); {1264#(and (= (select |#valid| sll_create_~head~0.base) 1) (<= 0 sll_create_~head~0.offset) (= |#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|))))) (<= sll_create_~head~0.offset 0) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} is VALID [2018-11-23 13:00:06,200 INFO L273 TraceCheckUtils]: 27: Hoare triple {1264#(and (= (select |#valid| sll_create_~head~0.base) 1) (<= 0 sll_create_~head~0.offset) (= |#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|))))) (<= sll_create_~head~0.offset 0) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1265#(and (= 0 (select |old(#valid)| |sll_create_#res.base|)) (= (select |#valid| |sll_create_#res.base|) 1) (<= 0 |sll_create_#res.offset|) (<= |sll_create_#res.offset| 0) (= |#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|)))) (not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) 4))))} is VALID [2018-11-23 13:00:06,202 INFO L273 TraceCheckUtils]: 28: Hoare triple {1265#(and (= 0 (select |old(#valid)| |sll_create_#res.base|)) (= (select |#valid| |sll_create_#res.base|) 1) (<= 0 |sll_create_#res.offset|) (<= |sll_create_#res.offset| 0) (= |#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|)))) (not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) 4))))} assume true; {1265#(and (= 0 (select |old(#valid)| |sll_create_#res.base|)) (= (select |#valid| |sll_create_#res.base|) 1) (<= 0 |sll_create_#res.offset|) (<= |sll_create_#res.offset| 0) (= |#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|)))) (not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) 4))))} is VALID [2018-11-23 13:00:06,205 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1265#(and (= 0 (select |old(#valid)| |sll_create_#res.base|)) (= (select |#valid| |sll_create_#res.base|) 1) (<= 0 |sll_create_#res.offset|) (<= |sll_create_#res.offset| 0) (= |#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|)))) (not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) 4))))} {1255#(= (select |#valid| |main_~#s~0.base|) 1)} #122#return; {1266#(and (not (= |main_~#s~0.base| |main_#t~ret11.base|)) (not (= (select |#valid| |main_#t~ret11.base|) 0)) (<= |main_#t~ret11.offset| 0) (not (= (select |#valid| |main_~#s~0.base|) 0)) (<= 0 |main_#t~ret11.offset|) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) 4))))} is VALID [2018-11-23 13:00:06,206 INFO L273 TraceCheckUtils]: 30: Hoare triple {1266#(and (not (= |main_~#s~0.base| |main_#t~ret11.base|)) (not (= (select |#valid| |main_#t~ret11.base|) 0)) (<= |main_#t~ret11.offset| 0) (not (= (select |#valid| |main_~#s~0.base|) 0)) (<= 0 |main_#t~ret11.offset|) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) 4))))} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret11.base, #t~ret11.offset;~uneq~0 := 5; {1267#(and (<= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4))) (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:00:06,208 INFO L256 TraceCheckUtils]: 31: Hoare triple {1267#(and (<= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4))) (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_append(~#s~0.base, ~#s~0.offset, ~uneq~0); {1268#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:00:06,209 INFO L273 TraceCheckUtils]: 32: Hoare triple {1268#(and (= |#valid| |old(#valid)|) (= |#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; {1269#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:00:06,210 INFO L256 TraceCheckUtils]: 33: Hoare triple {1269#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1268#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:00:06,212 INFO L273 TraceCheckUtils]: 34: Hoare triple {1268#(and (= |#valid| |old(#valid)|) (= |#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; {1270#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:00:06,213 INFO L273 TraceCheckUtils]: 35: Hoare triple {1270#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1270#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:00:06,215 INFO L273 TraceCheckUtils]: 36: Hoare triple {1270#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#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; {1271#(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|)))) (or (= 0 (select |old(#valid)| (@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|))} is VALID [2018-11-23 13:00:06,217 INFO L273 TraceCheckUtils]: 37: Hoare triple {1271#(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|)))) (or (= 0 (select |old(#valid)| (@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|))} assume true; {1271#(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|)))) (or (= 0 (select |old(#valid)| (@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|))} is VALID [2018-11-23 13:00:06,220 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1271#(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|)))) (or (= 0 (select |old(#valid)| (@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|))} {1269#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #128#return; {1272#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#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|)))) (or (= 0 (select |old(#valid)| (@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|) (= sll_append_~head.base |sll_append_#in~head.base|))} is VALID [2018-11-23 13:00:06,223 INFO L273 TraceCheckUtils]: 39: Hoare triple {1272#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#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|)))) (or (= 0 (select |old(#valid)| (@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|) (= sll_append_~head.base |sll_append_#in~head.base|))} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4); {1272#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#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|)))) (or (= 0 (select |old(#valid)| (@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|) (= sll_append_~head.base |sll_append_#in~head.base|))} is VALID [2018-11-23 13:00:06,226 INFO L273 TraceCheckUtils]: 40: Hoare triple {1272#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#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|)))) (or (= 0 (select |old(#valid)| (@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|) (= sll_append_~head.base |sll_append_#in~head.base|))} assume !(0 == #t~mem7.base && 0 == #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {1273#(or (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= sll_append_~last~0.base (select (select (store |#memory_$Pointer$.base| sll_append_~last~0.base (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= sll_append_~last~0.offset (select (select (store |#memory_$Pointer$.offset| sll_append_~last~0.base (store (select |#memory_$Pointer$.offset| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.offset)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= |#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|)))) (or (= 0 (select |old(#valid)| (@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_append_#in~head.base| sll_append_~last~0.base))))} is VALID [2018-11-23 13:00:06,229 INFO L273 TraceCheckUtils]: 41: Hoare triple {1273#(or (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= sll_append_~last~0.base (select (select (store |#memory_$Pointer$.base| sll_append_~last~0.base (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= sll_append_~last~0.offset (select (select (store |#memory_$Pointer$.offset| sll_append_~last~0.base (store (select |#memory_$Pointer$.offset| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.offset)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= |#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|)))) (or (= 0 (select |old(#valid)| (@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_append_#in~head.base| sll_append_~last~0.base))))} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~last~0.base, 4 + ~last~0.offset, 4); {1274#(or (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= sll_append_~last~0.base (select (select (store |#memory_$Pointer$.base| sll_append_~last~0.base (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= sll_append_~last~0.offset (select (select (store |#memory_$Pointer$.offset| sll_append_~last~0.base (store (select |#memory_$Pointer$.offset| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.offset)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= |#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|)))) (or (= 0 (select |old(#valid)| (@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_append_#in~head.base| sll_append_~last~0.base)) (or (not (= sll_append_~last~0.offset 0)) (= (select (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4)) |sll_append_#t~mem10.base|))))} is VALID [2018-11-23 13:00:06,233 INFO L273 TraceCheckUtils]: 42: Hoare triple {1274#(or (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= sll_append_~last~0.base (select (select (store |#memory_$Pointer$.base| sll_append_~last~0.base (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= sll_append_~last~0.offset (select (select (store |#memory_$Pointer$.offset| sll_append_~last~0.base (store (select |#memory_$Pointer$.offset| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.offset)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= |#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|)))) (or (= 0 (select |old(#valid)| (@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_append_#in~head.base| sll_append_~last~0.base)) (or (not (= sll_append_~last~0.offset 0)) (= (select (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4)) |sll_append_#t~mem10.base|))))} assume !(#t~mem10.base != 0 || #t~mem10.offset != 0);havoc #t~mem10.base, #t~mem10.offset; {1275#(or (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= sll_append_~last~0.base (select (select (store |#memory_$Pointer$.base| sll_append_~last~0.base (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= sll_append_~last~0.offset (select (select (store |#memory_$Pointer$.offset| sll_append_~last~0.base (store (select |#memory_$Pointer$.offset| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.offset)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (or (= 0 (select (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4))) (not (= sll_append_~last~0.offset 0))) (= |#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|)))) (or (= 0 (select |old(#valid)| (@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_append_#in~head.base| sll_append_~last~0.base))))} is VALID [2018-11-23 13:00:06,242 INFO L273 TraceCheckUtils]: 43: Hoare triple {1275#(or (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= sll_append_~last~0.base (select (select (store |#memory_$Pointer$.base| sll_append_~last~0.base (store (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.base)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= sll_append_~last~0.offset (select (select (store |#memory_$Pointer$.offset| sll_append_~last~0.base (store (select |#memory_$Pointer$.offset| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4) sll_append_~new_last~0.offset)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (or (= 0 (select (select |#memory_$Pointer$.base| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4))) (not (= sll_append_~last~0.offset 0))) (= |#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|)))) (or (= 0 (select |old(#valid)| (@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_append_#in~head.base| sll_append_~last~0.base))))} call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~last~0.base, 4 + ~last~0.offset, 4); {1276#(or (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (and (or (= (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_append_#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 (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$.base| (store (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|))) (@diff (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|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (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|))) |#memory_$Pointer$.base|)))) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= |sll_append_#in~head.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (not (= |sll_append_#in~head.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= 0 (select (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) (not (= (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0))) (or (not (= |sll_append_#in~head.base| (@diff (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|))) |#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 13:00:06,243 INFO L273 TraceCheckUtils]: 44: Hoare triple {1276#(or (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (and (or (= (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_append_#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 (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$.base| (store (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|))) (@diff (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|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (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|))) |#memory_$Pointer$.base|)))) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= |sll_append_#in~head.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (not (= |sll_append_#in~head.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= 0 (select (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) (not (= (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0))) (or (not (= |sll_append_#in~head.base| (@diff (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|))) |#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; {1276#(or (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (and (or (= (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_append_#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 (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$.base| (store (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|))) (@diff (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|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (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|))) |#memory_$Pointer$.base|)))) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= |sll_append_#in~head.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (not (= |sll_append_#in~head.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= 0 (select (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) (not (= (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0))) (or (not (= |sll_append_#in~head.base| (@diff (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|))) |#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 13:00:06,246 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1276#(or (= (select (select |old(#memory_$Pointer$.base)| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (and (or (= (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_append_#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 (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$.base| (store (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|))) (@diff (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|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (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|))) |#memory_$Pointer$.base|)))) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= |sll_append_#in~head.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (not (= |sll_append_#in~head.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= 0 (select (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) (not (= (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0))) (or (not (= |sll_append_#in~head.base| (@diff (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|))) |#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|)))))))} {1267#(and (<= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4))) (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)))} #124#return; {1254#false} is VALID [2018-11-23 13:00:06,246 INFO L273 TraceCheckUtils]: 46: Hoare triple {1254#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4); {1254#false} is VALID [2018-11-23 13:00:06,246 INFO L273 TraceCheckUtils]: 47: Hoare triple {1254#false} assume !(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem13.base, #t~mem13.offset; {1254#false} is VALID [2018-11-23 13:00:06,247 INFO L273 TraceCheckUtils]: 48: Hoare triple {1254#false} assume ~count~0 != 1 + ~len~0; {1254#false} is VALID [2018-11-23 13:00:06,247 INFO L273 TraceCheckUtils]: 49: Hoare triple {1254#false} assume !false; {1254#false} is VALID [2018-11-23 13:00:06,263 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:00:06,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:00:06,264 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:00:06,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:06,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:00:11,494 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 13:00:15,900 WARN L180 SmtUtils]: Spent 2.23 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 13:00:18,078 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 13:00:20,298 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 38 [2018-11-23 13:00:22,489 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 43 [2018-11-23 13:00:24,679 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 42 [2018-11-23 13:00:24,744 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:00:24,799 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:00:24,847 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:00:24,867 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:00:24,902 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:00:24,903 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:112, output treesize:241 [2018-11-23 13:00:26,925 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:00:26,926 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_33|, |v_#memory_$Pointer$.offset_31|, sll_append_~new_last~0.base, sll_append_~new_last~0.offset, node_create_~temp~0.offset]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_33| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (let ((.cse2 (select |v_#memory_$Pointer$.offset_31| .cse0)) (.cse1 (+ (select (select |v_#memory_$Pointer$.offset_31| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 4)) (.cse3 (+ node_create_~temp~0.offset 4))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_33| .cse0 (store (select |v_#memory_$Pointer$.base_33| .cse0) .cse1 sll_append_~new_last~0.base))) (= 0 (select .cse2 .cse1)) (= (store |v_#memory_$Pointer$.offset_31| .cse0 (store .cse2 .cse1 sll_append_~new_last~0.offset)) |#memory_$Pointer$.offset|) (not (= sll_append_~new_last~0.base 0)) (= (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) .cse3 0) node_create_~temp~0.offset (select (select |v_#memory_$Pointer$.base_33| sll_append_~new_last~0.base) node_create_~temp~0.offset))) |v_#memory_$Pointer$.base_33|) (= (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) .cse3 0) node_create_~temp~0.offset (select (select |v_#memory_$Pointer$.offset_31| sll_append_~new_last~0.base) node_create_~temp~0.offset))) |v_#memory_$Pointer$.offset_31|)))) [2018-11-23 13:00:26,926 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [sll_append_~new_last~0.base, node_create_~temp~0.offset, v_DerPreprocessor_4, v_DerPreprocessor_6, sll_append_~new_last~0.offset]. (let ((.cse5 (+ node_create_~temp~0.offset 4))) (let ((.cse4 (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) .cse5 0) node_create_~temp~0.offset v_DerPreprocessor_4)))) (let ((.cse2 (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) .cse5 0) node_create_~temp~0.offset v_DerPreprocessor_6))) (.cse3 (select (select .cse4 |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (let ((.cse0 (select .cse2 .cse3)) (.cse1 (+ (select (select .cse2 |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 4))) (and (not (= sll_append_~new_last~0.base 0)) (= 0 (select .cse0 .cse1)) (= (store .cse2 .cse3 (store .cse0 .cse1 sll_append_~new_last~0.offset)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store .cse4 .cse3 (store (select .cse4 .cse3) .cse1 sll_append_~new_last~0.base)))))))) [2018-11-23 13:00:28,949 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_append_~new_last~0.base Int) (sll_append_~new_last~0.offset Int) (v_DerPreprocessor_6 Int) (node_create_~temp~0.offset Int) (v_DerPreprocessor_4 Int)) (let ((.cse5 (+ node_create_~temp~0.offset 4))) (let ((.cse4 (store |c_old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |c_old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) .cse5 0) node_create_~temp~0.offset v_DerPreprocessor_4)))) (let ((.cse2 (store |c_old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) .cse5 0) node_create_~temp~0.offset v_DerPreprocessor_6))) (.cse3 (select (select .cse4 |c_sll_append_#in~head.base|) |c_sll_append_#in~head.offset|))) (let ((.cse0 (select .cse2 .cse3)) (.cse1 (+ (select (select .cse2 |c_sll_append_#in~head.base|) |c_sll_append_#in~head.offset|) 4))) (and (not (= sll_append_~new_last~0.base 0)) (= 0 (select .cse0 .cse1)) (= (store .cse2 .cse3 (store .cse0 .cse1 sll_append_~new_last~0.offset)) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store .cse4 .cse3 (store (select .cse4 .cse3) .cse1 sll_append_~new_last~0.base))))))))) is different from true [2018-11-23 13:00:31,768 WARN L180 SmtUtils]: Spent 2.74 s on a formula simplification. DAG size of input: 142 DAG size of output: 102 [2018-11-23 13:00:31,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 109 [2018-11-23 13:00:31,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-23 13:00:31,841 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:31,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 13:00:31,846 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:31,857 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:31,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 112 [2018-11-23 13:00:31,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 109 [2018-11-23 13:00:31,958 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:32,081 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:32,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:32,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 150 [2018-11-23 13:00:32,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 98 [2018-11-23 13:00:32,213 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:32,217 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:32,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 107 [2018-11-23 13:00:32,222 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:32,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:32,233 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:32,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:32,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 126 [2018-11-23 13:00:32,249 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:32,297 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:32,338 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 103 treesize of output 93 [2018-11-23 13:00:32,354 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:32,356 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:32,407 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 5 case distinctions, treesize of input 93 treesize of output 173 [2018-11-23 13:00:32,418 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-11-23 13:00:32,546 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 13:00:32,655 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 13:00:32,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 115 [2018-11-23 13:00:32,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2018-11-23 13:00:32,688 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:32,691 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 38 treesize of output 44 [2018-11-23 13:00:32,694 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:32,709 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:32,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 80 [2018-11-23 13:00:32,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:32,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 58 [2018-11-23 13:00:32,934 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 4 xjuncts. [2018-11-23 13:00:33,002 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 13:00:33,080 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 13:00:33,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 144 [2018-11-23 13:00:33,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 97 [2018-11-23 13:00:33,227 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:33,232 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 90 treesize of output 97 [2018-11-23 13:00:33,238 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:33,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:33,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 106 [2018-11-23 13:00:33,280 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:33,341 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:00:33,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 133 [2018-11-23 13:00:33,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-23 13:00:33,425 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:33,452 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:33,480 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:33,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 108 [2018-11-23 13:00:33,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-23 13:00:33,964 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:33,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 13:00:33,969 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:34,044 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:34,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 99 [2018-11-23 13:00:34,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 78 [2018-11-23 13:00:34,212 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:34,409 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:34,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 97 [2018-11-23 13:00:34,419 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:34,490 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:00:34,542 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:34,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 124 [2018-11-23 13:00:34,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:34,680 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 104 [2018-11-23 13:00:34,839 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-23 13:00:34,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:34,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:34,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 122 [2018-11-23 13:00:34,857 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:34,866 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:34,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:34,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:34,871 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:34,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 166 [2018-11-23 13:00:34,884 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:34,968 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:35,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 107 [2018-11-23 13:00:35,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:35,261 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 54 treesize of output 74 [2018-11-23 13:00:35,266 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:35,271 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:35,272 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:35,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 95 [2018-11-23 13:00:35,281 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:35,335 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:35,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 93 [2018-11-23 13:00:35,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:35,553 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:35,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 84 [2018-11-23 13:00:35,586 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 3 xjuncts. [2018-11-23 13:00:35,649 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:00:35,881 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 133 treesize of output 84 [2018-11-23 13:00:35,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:35,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:35,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:35,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:35,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:35,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 138 [2018-11-23 13:00:35,948 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 3 xjuncts. [2018-11-23 13:00:36,059 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:00:36,265 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:00:36,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 94 [2018-11-23 13:00:36,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-11-23 13:00:36,297 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:36,300 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 42 treesize of output 60 [2018-11-23 13:00:36,303 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:36,313 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:36,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 74 [2018-11-23 13:00:36,364 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:36,364 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:00:36,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2018-11-23 13:00:36,373 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:36,392 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:36,415 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:36,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 124 [2018-11-23 13:00:36,480 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:36,482 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 114 [2018-11-23 13:00:36,590 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:36,591 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:36,592 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:36,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 123 [2018-11-23 13:00:36,617 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:36,659 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:36,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 109 [2018-11-23 13:00:37,037 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:37,038 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 42 treesize of output 62 [2018-11-23 13:00:37,041 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:37,076 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:37,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 93 [2018-11-23 13:00:37,300 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:37,301 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:00:37,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 56 [2018-11-23 13:00:37,308 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:37,334 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:37,484 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 129 treesize of output 86 [2018-11-23 13:00:37,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:37,495 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:37,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:37,497 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:37,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:37,499 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:00:37,500 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:00:37,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 148 [2018-11-23 13:00:37,510 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:37,550 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:37,637 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:37,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 109 [2018-11-23 13:00:37,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:37,658 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80 [2018-11-23 13:00:37,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 70 [2018-11-23 13:00:37,771 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:37,776 WARN L288 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:00:37,777 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:37,796 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:37,831 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 46 treesize of output 27 [2018-11-23 13:00:37,837 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:37,838 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:37,838 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:00:37,839 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:00:37,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-11-23 13:00:37,846 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:37,862 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:37,881 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:37,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 126 [2018-11-23 13:00:37,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:37,907 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 89 [2018-11-23 13:00:38,034 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:38,036 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:38,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:38,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:38,041 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 84 treesize of output 163 [2018-11-23 13:00:38,047 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:38,054 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:00:38,055 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:38,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:38,070 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:38,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:38,073 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:38,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 193 [2018-11-23 13:00:38,110 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:38,281 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:38,282 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 79 treesize of output 141 [2018-11-23 13:00:38,306 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:38,643 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 13:00:38,739 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 121 treesize of output 72 [2018-11-23 13:00:38,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:38,754 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:38,755 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:38,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:38,758 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:38,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:38,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:38,764 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:00:38,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 189 [2018-11-23 13:00:38,809 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 3 xjuncts. [2018-11-23 13:00:38,909 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:00:38,917 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 91 treesize of output 60 [2018-11-23 13:00:38,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:38,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:38,937 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:38,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:38,940 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:38,940 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:00:38,942 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:38,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 173 [2018-11-23 13:00:38,956 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:38,990 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:39,068 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 13:00:39,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 131 [2018-11-23 13:00:39,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 86 [2018-11-23 13:00:39,197 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:39,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 76 [2018-11-23 13:00:39,204 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:39,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:39,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 93 [2018-11-23 13:00:39,220 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:39,273 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:00:39,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 62 [2018-11-23 13:00:39,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-11-23 13:00:39,356 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:39,371 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:39,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 78 [2018-11-23 13:00:39,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2018-11-23 13:00:39,411 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:39,435 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:39,491 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:00:39,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 6 xjuncts. [2018-11-23 13:00:39,825 INFO L202 ElimStorePlain]: Needed 78 recursive calls to eliminate 7 variables, input treesize:251, output treesize:428 [2018-11-23 13:00:39,872 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:00:39,872 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#memory_$Pointer$.base)_AFTER_CALL_14|, sll_append_~new_last~0.base, node_create_~temp~0.offset, v_DerPreprocessor_4, |v_#memory_$Pointer$.offset_BEFORE_CALL_4|, v_DerPreprocessor_6, sll_append_~new_last~0.offset]. (let ((.cse5 (+ node_create_~temp~0.offset 4))) (let ((.cse4 (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_14| sll_append_~new_last~0.base (store (store (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_14| sll_append_~new_last~0.base) .cse5 0) node_create_~temp~0.offset v_DerPreprocessor_4)))) (let ((.cse0 (store |v_#memory_$Pointer$.offset_BEFORE_CALL_4| sll_append_~new_last~0.base (store (store (select |v_#memory_$Pointer$.offset_BEFORE_CALL_4| sll_append_~new_last~0.base) .cse5 0) node_create_~temp~0.offset v_DerPreprocessor_6))) (.cse1 (select (select .cse4 |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse2 (select .cse0 .cse1)) (.cse3 (+ (select (select .cse0 |main_~#s~0.base|) |main_~#s~0.offset|) 4))) (and (not (= sll_append_~new_last~0.base 0)) (= |main_~#s~0.offset| 0) (= (store .cse0 .cse1 (store .cse2 .cse3 sll_append_~new_last~0.offset)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store .cse4 .cse1 (store (select .cse4 .cse1) .cse3 sll_append_~new_last~0.base))) (= (select .cse2 .cse3) 0) (= 0 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_4| |main_~#s~0.base|) |main_~#s~0.offset|))))))) [2018-11-23 13:00:39,872 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [node_create_~temp~0.offset, v_prenex_8, v_prenex_9]. (let ((.cse15 (select |#memory_$Pointer$.base| |main_~#s~0.base|)) (.cse13 (select |#memory_$Pointer$.offset| |main_~#s~0.base|))) (let ((.cse7 (select .cse13 |main_~#s~0.offset|)) (.cse20 (select .cse15 |main_~#s~0.offset|))) (let ((.cse6 (select |#memory_$Pointer$.base| .cse20)) (.cse9 (+ .cse7 4))) (let ((.cse10 (select .cse6 .cse9))) (let ((.cse0 (= .cse7 0)) (.cse1 (not (= .cse20 0))) (.cse2 (= .cse20 .cse10)) (.cse3 (= |main_~#s~0.offset| 0)) (.cse12 (= .cse20 |main_~#s~0.base|)) (.cse16 (not (= |main_~#s~0.base| 0))) (.cse4 (select |#memory_$Pointer$.offset| .cse20))) (or (let ((.cse5 (+ .cse7 8))) (and .cse0 .cse1 .cse2 .cse3 (= 0 (select .cse4 .cse5)) (= 0 (select .cse6 .cse5)))) (let ((.cse8 (+ node_create_~temp~0.offset 4))) (and (= (select .cse6 .cse8) 0) .cse0 .cse1 .cse2 (not (= node_create_~temp~0.offset .cse9)) (= 0 (select .cse4 .cse8)) .cse3)) (let ((.cse11 (+ v_prenex_8 4))) (and (not (= 0 .cse10)) .cse0 (not .cse2) .cse3 (= 0 (select (select |#memory_$Pointer$.base| .cse10) .cse11)) (= (select (select |#memory_$Pointer$.offset| .cse10) .cse11) 0))) (let ((.cse14 (+ |main_~#s~0.offset| 4))) (and (= |main_~#s~0.base| .cse10) (not .cse12) (= 0 (select .cse13 .cse14)) .cse3 (= 0 (select .cse15 .cse14)) .cse16)) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse17 (+ v_prenex_9 4))) (let ((.cse19 (select .cse15 .cse17))) (let ((.cse18 (+ (select .cse4 .cse19) 4))) (and (= 0 (select .cse4 .cse17)) .cse3 (not (= |main_~#s~0.offset| .cse18)) .cse12 (= (select .cse15 .cse18) |main_~#s~0.base|) (= |main_~#s~0.offset| .cse19) (= v_prenex_9 .cse19) .cse16)))))))))) [2018-11-23 13:00:40,237 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2018-11-23 13:00:40,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2018-11-23 13:00:40,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 25 [2018-11-23 13:00:40,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:40,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-11-23 13:00:40,368 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:40,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:40,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-11-23 13:00:40,396 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:40,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:40,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 50 [2018-11-23 13:00:40,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2018-11-23 13:00:40,485 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:40,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-23 13:00:40,503 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:40,510 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:40,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-23 13:00:40,574 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:40,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:40,623 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 14 variables, input treesize:308, output treesize:4 [2018-11-23 13:00:40,631 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:00:40,631 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_13, v_prenex_14, v_prenex_15, v_prenex_8, |#memory_$Pointer$.base|, |main_~#s~0.base|, |#memory_$Pointer$.offset|, v_prenex_10, v_prenex_11, v_prenex_12, v_prenex_16, v_prenex_17, v_prenex_18, v_prenex_9]. (or (let ((.cse2 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0)) (.cse1 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) 0))) (let ((.cse0 (select (select |#memory_$Pointer$.base| .cse2) (+ .cse1 4)))) (and (= |main_#t~mem13.base| .cse0) (= .cse1 0) (= .cse2 .cse0) (not (= .cse2 0))))) (let ((.cse5 (select v_prenex_10 v_prenex_11))) (let ((.cse6 (select .cse5 0)) (.cse3 (select v_prenex_12 v_prenex_11))) (let ((.cse4 (select (select v_prenex_10 .cse6) (+ (select .cse3 0) 4)))) (and (= 0 (select .cse3 4)) (not (= v_prenex_11 0)) (= |main_#t~mem13.base| .cse4) (= v_prenex_11 .cse4) (= (select .cse5 4) 0) (not (= v_prenex_11 .cse6)))))) (let ((.cse9 (select (select v_prenex_15 v_prenex_14) 0))) (let ((.cse8 (+ v_prenex_8 4)) (.cse7 (select (select v_prenex_13 (select (select v_prenex_13 v_prenex_14) 0)) (+ .cse9 4)))) (and (= (select (select v_prenex_13 .cse7) .cse8) 0) (= (select (select v_prenex_15 .cse7) .cse8) 0) (not (= .cse7 0)) (= |main_#t~mem13.base| .cse7) (= .cse9 0)))) (let ((.cse12 (select v_prenex_16 v_prenex_17))) (let ((.cse15 (+ v_prenex_9 4)) (.cse11 (select .cse12 0))) (let ((.cse14 (select v_prenex_18 .cse11)) (.cse10 (select .cse12 .cse15))) (let ((.cse13 (+ (select .cse14 .cse10) 4))) (and (= .cse10 0) (= |main_#t~mem13.base| (select (select v_prenex_16 .cse11) (+ (select (select v_prenex_18 v_prenex_17) 0) 4))) (= (select .cse12 .cse13) v_prenex_17) (= (select .cse14 .cse15) 0) (not (= .cse13 0)) (= v_prenex_9 .cse10) (not (= v_prenex_17 0)) (= v_prenex_17 .cse11))))))) [2018-11-23 13:00:40,631 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= |main_#t~mem13.base| 0)) [2018-11-23 13:00:40,694 INFO L256 TraceCheckUtils]: 0: Hoare triple {1253#true} call ULTIMATE.init(); {1253#true} is VALID [2018-11-23 13:00:40,695 INFO L273 TraceCheckUtils]: 1: Hoare triple {1253#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1253#true} is VALID [2018-11-23 13:00:40,695 INFO L273 TraceCheckUtils]: 2: Hoare triple {1253#true} assume true; {1253#true} is VALID [2018-11-23 13:00:40,695 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1253#true} {1253#true} #132#return; {1253#true} is VALID [2018-11-23 13:00:40,696 INFO L256 TraceCheckUtils]: 4: Hoare triple {1253#true} call #t~ret21 := main(); {1253#true} is VALID [2018-11-23 13:00:40,697 INFO L273 TraceCheckUtils]: 5: Hoare triple {1253#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1295#(= |main_~#s~0.offset| 0)} is VALID [2018-11-23 13:00:40,697 INFO L256 TraceCheckUtils]: 6: Hoare triple {1295#(= |main_~#s~0.offset| 0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1253#true} is VALID [2018-11-23 13:00:40,697 INFO L273 TraceCheckUtils]: 7: Hoare triple {1253#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1253#true} is VALID [2018-11-23 13:00:40,698 INFO L273 TraceCheckUtils]: 8: Hoare triple {1253#true} assume !!(~len > 0); {1253#true} is VALID [2018-11-23 13:00:40,698 INFO L256 TraceCheckUtils]: 9: Hoare triple {1253#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1253#true} is VALID [2018-11-23 13:00:40,698 INFO L273 TraceCheckUtils]: 10: Hoare triple {1253#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; {1253#true} is VALID [2018-11-23 13:00:40,698 INFO L273 TraceCheckUtils]: 11: Hoare triple {1253#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1253#true} is VALID [2018-11-23 13:00:40,699 INFO L273 TraceCheckUtils]: 12: Hoare triple {1253#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; {1253#true} is VALID [2018-11-23 13:00:40,699 INFO L273 TraceCheckUtils]: 13: Hoare triple {1253#true} assume true; {1253#true} is VALID [2018-11-23 13:00:40,699 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1253#true} {1253#true} #130#return; {1253#true} is VALID [2018-11-23 13:00:40,699 INFO L273 TraceCheckUtils]: 15: Hoare triple {1253#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; {1253#true} is VALID [2018-11-23 13:00:40,699 INFO L273 TraceCheckUtils]: 16: Hoare triple {1253#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1253#true} is VALID [2018-11-23 13:00:40,700 INFO L273 TraceCheckUtils]: 17: Hoare triple {1253#true} assume !!(~len > 0); {1253#true} is VALID [2018-11-23 13:00:40,700 INFO L256 TraceCheckUtils]: 18: Hoare triple {1253#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1253#true} is VALID [2018-11-23 13:00:40,702 INFO L273 TraceCheckUtils]: 19: Hoare triple {1253#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; {1338#(= node_create_~temp~0.offset 0)} is VALID [2018-11-23 13:00:40,703 INFO L273 TraceCheckUtils]: 20: Hoare triple {1338#(= node_create_~temp~0.offset 0)} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1338#(= node_create_~temp~0.offset 0)} is VALID [2018-11-23 13:00:40,703 INFO L273 TraceCheckUtils]: 21: Hoare triple {1338#(= node_create_~temp~0.offset 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; {1345#(= |node_create_#res.offset| 0)} is VALID [2018-11-23 13:00:40,704 INFO L273 TraceCheckUtils]: 22: Hoare triple {1345#(= |node_create_#res.offset| 0)} assume true; {1345#(= |node_create_#res.offset| 0)} is VALID [2018-11-23 13:00:40,705 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1345#(= |node_create_#res.offset| 0)} {1253#true} #130#return; {1352#(= 0 |sll_create_#t~ret4.offset|)} is VALID [2018-11-23 13:00:40,705 INFO L273 TraceCheckUtils]: 24: Hoare triple {1352#(= 0 |sll_create_#t~ret4.offset|)} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1356#(= 0 sll_create_~head~0.offset)} is VALID [2018-11-23 13:00:40,706 INFO L273 TraceCheckUtils]: 25: Hoare triple {1356#(= 0 sll_create_~head~0.offset)} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1356#(= 0 sll_create_~head~0.offset)} is VALID [2018-11-23 13:00:40,707 INFO L273 TraceCheckUtils]: 26: Hoare triple {1356#(= 0 sll_create_~head~0.offset)} assume !(~len > 0); {1356#(= 0 sll_create_~head~0.offset)} is VALID [2018-11-23 13:00:40,707 INFO L273 TraceCheckUtils]: 27: Hoare triple {1356#(= 0 sll_create_~head~0.offset)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1366#(= |sll_create_#res.offset| 0)} is VALID [2018-11-23 13:00:40,708 INFO L273 TraceCheckUtils]: 28: Hoare triple {1366#(= |sll_create_#res.offset| 0)} assume true; {1366#(= |sll_create_#res.offset| 0)} is VALID [2018-11-23 13:00:40,709 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1366#(= |sll_create_#res.offset| 0)} {1295#(= |main_~#s~0.offset| 0)} #122#return; {1373#(and (= |main_~#s~0.offset| 0) (= |main_#t~ret11.offset| 0))} is VALID [2018-11-23 13:00:40,710 INFO L273 TraceCheckUtils]: 30: Hoare triple {1373#(and (= |main_~#s~0.offset| 0) (= |main_#t~ret11.offset| 0))} call write~init~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret11.base, #t~ret11.offset;~uneq~0 := 5; {1377#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= |main_~#s~0.offset| 0))} is VALID [2018-11-23 13:00:40,711 INFO L256 TraceCheckUtils]: 31: Hoare triple {1377#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= |main_~#s~0.offset| 0))} call sll_append(~#s~0.base, ~#s~0.offset, ~uneq~0); {1381#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:00:40,712 INFO L273 TraceCheckUtils]: 32: Hoare triple {1381#(and (= |#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; {1385#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:00:40,713 INFO L256 TraceCheckUtils]: 33: Hoare triple {1385#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1381#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:00:40,715 INFO L273 TraceCheckUtils]: 34: Hoare triple {1381#(and (= |#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; {1392#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= 0 node_create_~temp~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:00:40,716 INFO L273 TraceCheckUtils]: 35: Hoare triple {1392#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= 0 node_create_~temp~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1392#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= 0 node_create_~temp~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 13:00:40,722 INFO L273 TraceCheckUtils]: 36: Hoare triple {1392#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= 0 node_create_~temp~0.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; {1399#(and (not (= 0 |node_create_#res.base|)) (exists ((node_create_~temp~0.offset Int)) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| |node_create_#res.base|) node_create_~temp~0.offset)))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |node_create_#res.base|) node_create_~temp~0.offset)))))))} is VALID [2018-11-23 13:00:40,723 INFO L273 TraceCheckUtils]: 37: Hoare triple {1399#(and (not (= 0 |node_create_#res.base|)) (exists ((node_create_~temp~0.offset Int)) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| |node_create_#res.base|) node_create_~temp~0.offset)))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |node_create_#res.base|) node_create_~temp~0.offset)))))))} assume true; {1399#(and (not (= 0 |node_create_#res.base|)) (exists ((node_create_~temp~0.offset Int)) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| |node_create_#res.base|) node_create_~temp~0.offset)))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |node_create_#res.base|) node_create_~temp~0.offset)))))))} is VALID [2018-11-23 13:00:40,725 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1399#(and (not (= 0 |node_create_#res.base|)) (exists ((node_create_~temp~0.offset Int)) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| |node_create_#res.base|) node_create_~temp~0.offset)))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |node_create_#res.base|) node_create_~temp~0.offset)))))))} {1385#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #128#return; {1406#(and (not (= 0 |sll_append_#t~ret6.base|)) (= sll_append_~head.offset |sll_append_#in~head.offset|) (exists ((node_create_~temp~0.offset Int)) (and (= (store |old(#memory_$Pointer$.offset)| |sll_append_#t~ret6.base| (store (store (select |old(#memory_$Pointer$.offset)| |sll_append_#t~ret6.base|) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| |sll_append_#t~ret6.base|) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_append_#t~ret6.base| (store (store (select |old(#memory_$Pointer$.base)| |sll_append_#t~ret6.base|) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |sll_append_#t~ret6.base|) node_create_~temp~0.offset)))))) (= sll_append_~head.base |sll_append_#in~head.base|))} is VALID [2018-11-23 13:00:40,726 INFO L273 TraceCheckUtils]: 39: Hoare triple {1406#(and (not (= 0 |sll_append_#t~ret6.base|)) (= sll_append_~head.offset |sll_append_#in~head.offset|) (exists ((node_create_~temp~0.offset Int)) (and (= (store |old(#memory_$Pointer$.offset)| |sll_append_#t~ret6.base| (store (store (select |old(#memory_$Pointer$.offset)| |sll_append_#t~ret6.base|) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| |sll_append_#t~ret6.base|) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_append_#t~ret6.base| (store (store (select |old(#memory_$Pointer$.base)| |sll_append_#t~ret6.base|) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| |sll_append_#t~ret6.base|) node_create_~temp~0.offset)))))) (= sll_append_~head.base |sll_append_#in~head.base|))} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4); {1410#(and (not (= sll_append_~new_last~0.base 0)) (exists ((node_create_~temp~0.offset Int)) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) node_create_~temp~0.offset)))) (= (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| sll_append_~new_last~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|))) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|))} is VALID [2018-11-23 13:00:40,728 INFO L273 TraceCheckUtils]: 40: Hoare triple {1410#(and (not (= sll_append_~new_last~0.base 0)) (exists ((node_create_~temp~0.offset Int)) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) node_create_~temp~0.offset)))) (= (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| sll_append_~new_last~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|))) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|))} assume !(0 == #t~mem7.base && 0 == #t~mem7.offset);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {1414#(and (not (= sll_append_~new_last~0.base 0)) (exists ((node_create_~temp~0.offset Int)) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) node_create_~temp~0.offset)))) (= (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| sll_append_~new_last~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|))) (= sll_append_~last~0.offset (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.base))} is VALID [2018-11-23 13:00:40,729 INFO L273 TraceCheckUtils]: 41: Hoare triple {1414#(and (not (= sll_append_~new_last~0.base 0)) (exists ((node_create_~temp~0.offset Int)) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) node_create_~temp~0.offset)))) (= (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| sll_append_~new_last~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|))) (= sll_append_~last~0.offset (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.base))} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~last~0.base, 4 + ~last~0.offset, 4); {1418#(and (not (= sll_append_~new_last~0.base 0)) (exists ((node_create_~temp~0.offset Int)) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) node_create_~temp~0.offset)))) (= (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| sll_append_~new_last~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|))) (= |sll_append_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4))) (= sll_append_~last~0.offset (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.base))} is VALID [2018-11-23 13:00:40,731 INFO L273 TraceCheckUtils]: 42: Hoare triple {1418#(and (not (= sll_append_~new_last~0.base 0)) (exists ((node_create_~temp~0.offset Int)) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) node_create_~temp~0.offset)))) (= (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| sll_append_~new_last~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|))) (= |sll_append_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4))) (= sll_append_~last~0.offset (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.base))} assume !(#t~mem10.base != 0 || #t~mem10.offset != 0);havoc #t~mem10.base, #t~mem10.offset; {1422#(and (not (= sll_append_~new_last~0.base 0)) (exists ((node_create_~temp~0.offset Int)) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) node_create_~temp~0.offset)))) (= (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| sll_append_~new_last~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4))) (= sll_append_~last~0.offset (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.base))} is VALID [2018-11-23 13:00:42,739 INFO L273 TraceCheckUtils]: 43: Hoare triple {1422#(and (not (= sll_append_~new_last~0.base 0)) (exists ((node_create_~temp~0.offset Int)) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) node_create_~temp~0.offset)))) (= (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |#memory_$Pointer$.offset| sll_append_~new_last~0.base) node_create_~temp~0.offset))) |#memory_$Pointer$.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| sll_append_~last~0.base) (+ sll_append_~last~0.offset 4))) (= sll_append_~last~0.offset (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) sll_append_~last~0.base))} call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~last~0.base, 4 + ~last~0.offset, 4); {1426#(exists ((sll_append_~new_last~0.base Int) (sll_append_~new_last~0.offset Int) (v_DerPreprocessor_6 Int) (node_create_~temp~0.offset Int) (v_DerPreprocessor_4 Int)) (and (not (= sll_append_~new_last~0.base 0)) (= 0 (select (select (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 4))) (= (store (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 4) sll_append_~new_last~0.offset)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 4) sll_append_~new_last~0.base)))))} is UNKNOWN [2018-11-23 13:00:42,740 INFO L273 TraceCheckUtils]: 44: Hoare triple {1426#(exists ((sll_append_~new_last~0.base Int) (sll_append_~new_last~0.offset Int) (v_DerPreprocessor_6 Int) (node_create_~temp~0.offset Int) (v_DerPreprocessor_4 Int)) (and (not (= sll_append_~new_last~0.base 0)) (= 0 (select (select (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 4))) (= (store (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 4) sll_append_~new_last~0.offset)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 4) sll_append_~new_last~0.base)))))} assume true; {1426#(exists ((sll_append_~new_last~0.base Int) (sll_append_~new_last~0.offset Int) (v_DerPreprocessor_6 Int) (node_create_~temp~0.offset Int) (v_DerPreprocessor_4 Int)) (and (not (= sll_append_~new_last~0.base 0)) (= 0 (select (select (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 4))) (= (store (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 4) sll_append_~new_last~0.offset)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 4) sll_append_~new_last~0.base)))))} is VALID [2018-11-23 13:00:42,755 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1426#(exists ((sll_append_~new_last~0.base Int) (sll_append_~new_last~0.offset Int) (v_DerPreprocessor_6 Int) (node_create_~temp~0.offset Int) (v_DerPreprocessor_4 Int)) (and (not (= sll_append_~new_last~0.base 0)) (= 0 (select (select (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 4))) (= (store (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 4) sll_append_~new_last~0.offset)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) (select (select (store |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_4)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (+ (select (select (store |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.offset)| sll_append_~new_last~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_6)) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 4) sll_append_~new_last~0.base)))))} {1377#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (= |main_~#s~0.offset| 0))} #124#return; {1433#(or (and (= |main_~#s~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|) (not (= |main_~#s~0.base| 0)) (exists ((v_prenex_9 Int)) (and (= v_prenex_9 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (+ v_prenex_9 4))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (+ v_prenex_9 4))) 4)) |main_~#s~0.base|) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ v_prenex_9 4))) (= |main_~#s~0.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (+ v_prenex_9 4))) (not (= |main_~#s~0.offset| (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (+ v_prenex_9 4))) 4)))))) (and (not (= 0 (select (select |#memory_$Pointer$.base| (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|) 4)))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (exists ((v_prenex_8 Int)) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (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|) 4))) (+ v_prenex_8 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (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|) 4))) (+ v_prenex_8 4)) 0))) (= |main_~#s~0.offset| 0)) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (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|) 4))) (= |main_~#s~0.offset| 0)) (and (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (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|) 4))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) (+ |main_~#s~0.offset| 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (+ |main_~#s~0.offset| 4))) (not (= |main_~#s~0.base| 0))))} is VALID [2018-11-23 13:00:42,758 INFO L273 TraceCheckUtils]: 46: Hoare triple {1433#(or (and (= |main_~#s~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|) (not (= |main_~#s~0.base| 0)) (exists ((v_prenex_9 Int)) (and (= v_prenex_9 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (+ v_prenex_9 4))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (+ v_prenex_9 4))) 4)) |main_~#s~0.base|) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (+ v_prenex_9 4))) (= |main_~#s~0.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (+ v_prenex_9 4))) (not (= |main_~#s~0.offset| (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (+ v_prenex_9 4))) 4)))))) (and (not (= 0 (select (select |#memory_$Pointer$.base| (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|) 4)))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (exists ((v_prenex_8 Int)) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (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|) 4))) (+ v_prenex_8 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (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|) 4))) (+ v_prenex_8 4)) 0))) (= |main_~#s~0.offset| 0)) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (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|) 4))) (= |main_~#s~0.offset| 0)) (and (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (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|) 4))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) (+ |main_~#s~0.offset| 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (+ |main_~#s~0.offset| 4))) (not (= |main_~#s~0.base| 0))))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4); {1437#(not (= |main_#t~mem13.base| 0))} is VALID [2018-11-23 13:00:42,759 INFO L273 TraceCheckUtils]: 47: Hoare triple {1437#(not (= |main_#t~mem13.base| 0))} assume !(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem13.base, #t~mem13.offset; {1254#false} is VALID [2018-11-23 13:00:42,759 INFO L273 TraceCheckUtils]: 48: Hoare triple {1254#false} assume ~count~0 != 1 + ~len~0; {1254#false} is VALID [2018-11-23 13:00:42,759 INFO L273 TraceCheckUtils]: 49: Hoare triple {1254#false} assume !false; {1254#false} is VALID [2018-11-23 13:00:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:00:42,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:00:42,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 44 [2018-11-23 13:00:42,790 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 50 [2018-11-23 13:00:42,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:42,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 13:00:47,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 89 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:47,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 13:00:47,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 13:00:47,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1691, Unknown=3, NotChecked=82, Total=1892 [2018-11-23 13:00:47,021 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 44 states. [2018-11-23 13:01:16,800 WARN L180 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2018-11-23 13:02:05,208 WARN L180 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2018-11-23 13:02:14,215 WARN L180 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2018-11-23 13:02:29,333 WARN L180 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 82 DAG size of output: 53