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/dll2n_prepend_unequal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:57:48,378 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:57:48,380 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:57:48,394 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:57:48,394 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:57:48,395 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:57:48,396 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:57:48,398 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:57:48,400 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:57:48,401 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:57:48,402 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:57:48,402 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:57:48,403 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:57:48,406 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:57:48,408 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:57:48,408 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:57:48,409 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:57:48,416 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:57:48,422 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:57:48,426 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:57:48,427 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:57:48,430 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:57:48,433 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:57:48,433 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:57:48,433 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:57:48,437 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:57:48,438 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:57:48,439 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:57:48,443 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:57:48,445 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:57:48,445 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:57:48,446 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:57:48,446 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:57:48,446 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:57:48,448 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:57:48,449 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:57:48,449 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:57:48,479 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:57:48,479 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:57:48,480 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:57:48,480 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:57:48,485 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:57:48,486 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:57:48,487 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:57:48,487 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:57:48,487 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:57:48,487 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:57:48,487 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:57:48,488 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:57:48,488 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:57:48,488 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:57:48,488 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:57:48,488 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:57:48,488 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:57:48,490 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:57:48,490 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:57:48,490 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:57:48,490 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:57:48,491 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:57:48,491 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:57:48,491 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:57:48,491 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:57:48,491 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:57:48,493 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:57:48,493 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:57:48,493 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:57:48,493 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:57:48,493 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:57:48,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:57:48,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:57:48,557 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:57:48,559 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:57:48,560 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:57:48,560 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_prepend_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:57:48,624 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/980b4e35b/68cf17ae7aab4ed8910bf4b165321532/FLAGc228f5881 [2018-11-23 12:57:49,159 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:57:49,160 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_prepend_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:57:49,175 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/980b4e35b/68cf17ae7aab4ed8910bf4b165321532/FLAGc228f5881 [2018-11-23 12:57:49,459 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/980b4e35b/68cf17ae7aab4ed8910bf4b165321532 [2018-11-23 12:57:49,468 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:57:49,469 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:57:49,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:57:49,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:57:49,475 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:57:49,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:57:49" (1/1) ... [2018-11-23 12:57:49,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43d2d612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:49, skipping insertion in model container [2018-11-23 12:57:49,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:57:49" (1/1) ... [2018-11-23 12:57:49,492 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:57:49,554 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:57:50,054 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:57:50,069 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:57:50,257 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:57:50,321 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:57:50,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:50 WrapperNode [2018-11-23 12:57:50,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:57:50,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:57:50,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:57:50,323 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:57:50,333 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:57:50" (1/1) ... [2018-11-23 12:57:50,357 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:57:50" (1/1) ... [2018-11-23 12:57:50,367 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:57:50,368 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:57:50,368 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:57:50,368 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:57:50,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:50" (1/1) ... [2018-11-23 12:57:50,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:50" (1/1) ... [2018-11-23 12:57:50,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:50" (1/1) ... [2018-11-23 12:57:50,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:50" (1/1) ... [2018-11-23 12:57:50,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:50" (1/1) ... [2018-11-23 12:57:50,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:50" (1/1) ... [2018-11-23 12:57:50,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:50" (1/1) ... [2018-11-23 12:57:50,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:57:50,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:57:50,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:57:50,418 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:57:50,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:57:50,480 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-11-23 12:57:50,480 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-11-23 12:57:50,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:57:50,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:57:50,481 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:57:50,481 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:57:50,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:57:50,482 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 12:57:50,482 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 12:57:50,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:57:50,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:57:50,482 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:57:50,483 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:57:50,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:57:50,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:57:50,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:57:50,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 12:57:50,483 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-23 12:57:50,484 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-23 12:57:50,484 INFO L130 BoogieDeclarations]: Found specification of procedure dll_prepend [2018-11-23 12:57:50,484 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_prepend [2018-11-23 12:57:50,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:57:50,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:57:51,584 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:57:51,585 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:57:51,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:57:51 BoogieIcfgContainer [2018-11-23 12:57:51,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:57:51,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:57:51,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:57:51,591 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:57:51,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:57:49" (1/3) ... [2018-11-23 12:57:51,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d00fe15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:57:51, skipping insertion in model container [2018-11-23 12:57:51,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:57:50" (2/3) ... [2018-11-23 12:57:51,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d00fe15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:57:51, skipping insertion in model container [2018-11-23 12:57:51,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:57:51" (3/3) ... [2018-11-23 12:57:51,594 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:57:51,605 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:57:51,614 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:57:51,632 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:57:51,663 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:57:51,664 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:57:51,664 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:57:51,664 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:57:51,664 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:57:51,664 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:57:51,664 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:57:51,664 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:57:51,664 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:57:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-23 12:57:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:57:51,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:57:51,691 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:57:51,694 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:57:51,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:57:51,700 INFO L82 PathProgramCache]: Analyzing trace with hash 705287028, now seen corresponding path program 1 times [2018-11-23 12:57:51,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:57:51,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:57:51,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:51,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:57:51,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:57:52,078 INFO L256 TraceCheckUtils]: 0: Hoare triple {54#true} call ULTIMATE.init(); {54#true} is VALID [2018-11-23 12:57:52,081 INFO L273 TraceCheckUtils]: 1: Hoare triple {54#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {54#true} is VALID [2018-11-23 12:57:52,082 INFO L273 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2018-11-23 12:57:52,082 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #123#return; {54#true} is VALID [2018-11-23 12:57:52,083 INFO L256 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret18 := main(); {54#true} is VALID [2018-11-23 12:57:52,084 INFO L273 TraceCheckUtils]: 5: Hoare triple {54#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {56#(<= 2 main_~len~0)} is VALID [2018-11-23 12:57:52,085 INFO L256 TraceCheckUtils]: 6: Hoare triple {56#(<= 2 main_~len~0)} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {54#true} is VALID [2018-11-23 12:57:52,103 INFO L273 TraceCheckUtils]: 7: Hoare triple {54#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {57#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:57:52,112 INFO L273 TraceCheckUtils]: 8: Hoare triple {57#(<= |dll_create_#in~len| dll_create_~len)} assume !(~len > 0); {58#(<= |dll_create_#in~len| 0)} is VALID [2018-11-23 12:57:52,127 INFO L273 TraceCheckUtils]: 9: Hoare triple {58#(<= |dll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {58#(<= |dll_create_#in~len| 0)} is VALID [2018-11-23 12:57:52,130 INFO L273 TraceCheckUtils]: 10: Hoare triple {58#(<= |dll_create_#in~len| 0)} assume true; {58#(<= |dll_create_#in~len| 0)} is VALID [2018-11-23 12:57:52,132 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {58#(<= |dll_create_#in~len| 0)} {56#(<= 2 main_~len~0)} #113#return; {55#false} is VALID [2018-11-23 12:57:52,133 INFO L273 TraceCheckUtils]: 12: Hoare triple {55#false} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5; {55#false} is VALID [2018-11-23 12:57:52,133 INFO L256 TraceCheckUtils]: 13: Hoare triple {55#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {54#true} is VALID [2018-11-23 12:57:52,133 INFO L273 TraceCheckUtils]: 14: Hoare triple {54#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {54#true} is VALID [2018-11-23 12:57:52,134 INFO L256 TraceCheckUtils]: 15: Hoare triple {54#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {54#true} is VALID [2018-11-23 12:57:52,134 INFO L273 TraceCheckUtils]: 16: Hoare triple {54#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {54#true} is VALID [2018-11-23 12:57:52,135 INFO L273 TraceCheckUtils]: 17: Hoare triple {54#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {54#true} is VALID [2018-11-23 12:57:52,135 INFO L273 TraceCheckUtils]: 18: Hoare triple {54#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 8 + ~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; {54#true} is VALID [2018-11-23 12:57:52,136 INFO L273 TraceCheckUtils]: 19: Hoare triple {54#true} assume true; {54#true} is VALID [2018-11-23 12:57:52,136 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {54#true} {54#true} #121#return; {54#true} is VALID [2018-11-23 12:57:52,136 INFO L273 TraceCheckUtils]: 21: Hoare triple {54#true} ~new_head~1.base, ~new_head~1.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);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, 4 + ~new_head~1.offset, 4);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {54#true} is VALID [2018-11-23 12:57:52,137 INFO L273 TraceCheckUtils]: 22: Hoare triple {54#true} assume #t~mem8.base != 0 || #t~mem8.offset != 0;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, 8 + #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset; {54#true} is VALID [2018-11-23 12:57:52,137 INFO L273 TraceCheckUtils]: 23: Hoare triple {54#true} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {54#true} is VALID [2018-11-23 12:57:52,138 INFO L273 TraceCheckUtils]: 24: Hoare triple {54#true} assume true; {54#true} is VALID [2018-11-23 12:57:52,138 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {54#true} {55#false} #115#return; {55#false} is VALID [2018-11-23 12:57:52,138 INFO L273 TraceCheckUtils]: 26: Hoare triple {55#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {55#false} is VALID [2018-11-23 12:57:52,139 INFO L273 TraceCheckUtils]: 27: Hoare triple {55#false} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {55#false} is VALID [2018-11-23 12:57:52,139 INFO L273 TraceCheckUtils]: 28: Hoare triple {55#false} assume !false; {55#false} is VALID [2018-11-23 12:57:52,146 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:57:52,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:57:52,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:57:52,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 12:57:52,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:57:52,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:57:52,376 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:57:52,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:57:52,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:57:52,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:57:52,387 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 5 states. [2018-11-23 12:57:53,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:53,458 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2018-11-23 12:57:53,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:57:53,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 12:57:53,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:57:53,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:57:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2018-11-23 12:57:53,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:57:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2018-11-23 12:57:53,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 122 transitions. [2018-11-23 12:57:53,746 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:57:53,761 INFO L225 Difference]: With dead ends: 97 [2018-11-23 12:57:53,762 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:57:53,766 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:57:53,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:57:53,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-11-23 12:57:53,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:57:53,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 38 states. [2018-11-23 12:57:53,868 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 38 states. [2018-11-23 12:57:53,869 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 38 states. [2018-11-23 12:57:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:53,877 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-23 12:57:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 12:57:53,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:57:53,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:57:53,879 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 42 states. [2018-11-23 12:57:53,879 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 42 states. [2018-11-23 12:57:53,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:53,884 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-23 12:57:53,884 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 12:57:53,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:57:53,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:57:53,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:57:53,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:57:53,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:57:53,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-23 12:57:53,890 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 29 [2018-11-23 12:57:53,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:57:53,891 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 12:57:53,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:57:53,891 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 12:57:53,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:57:53,893 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:57:53,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:57:53,893 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:57:53,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:57:53,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1889696853, now seen corresponding path program 1 times [2018-11-23 12:57:53,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:57:53,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:57:53,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:53,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:57:53,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:57:54,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {330#true} call ULTIMATE.init(); {330#true} is VALID [2018-11-23 12:57:54,107 INFO L273 TraceCheckUtils]: 1: Hoare triple {330#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {330#true} is VALID [2018-11-23 12:57:54,107 INFO L273 TraceCheckUtils]: 2: Hoare triple {330#true} assume true; {330#true} is VALID [2018-11-23 12:57:54,107 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {330#true} {330#true} #123#return; {330#true} is VALID [2018-11-23 12:57:54,108 INFO L256 TraceCheckUtils]: 4: Hoare triple {330#true} call #t~ret18 := main(); {330#true} is VALID [2018-11-23 12:57:54,108 INFO L273 TraceCheckUtils]: 5: Hoare triple {330#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {332#(<= 2 main_~len~0)} is VALID [2018-11-23 12:57:54,109 INFO L256 TraceCheckUtils]: 6: Hoare triple {332#(<= 2 main_~len~0)} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {330#true} is VALID [2018-11-23 12:57:54,109 INFO L273 TraceCheckUtils]: 7: Hoare triple {330#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {333#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:57:54,111 INFO L273 TraceCheckUtils]: 8: Hoare triple {333#(<= |dll_create_#in~len| dll_create_~len)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {333#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:57:54,112 INFO L273 TraceCheckUtils]: 9: Hoare triple {333#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {333#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:57:54,113 INFO L273 TraceCheckUtils]: 10: Hoare triple {333#(<= |dll_create_#in~len| dll_create_~len)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {333#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:57:54,116 INFO L273 TraceCheckUtils]: 11: Hoare triple {333#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {333#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:57:54,117 INFO L273 TraceCheckUtils]: 12: Hoare triple {333#(<= |dll_create_#in~len| dll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {334#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-23 12:57:54,118 INFO L273 TraceCheckUtils]: 13: Hoare triple {334#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {335#(<= |dll_create_#in~len| 1)} is VALID [2018-11-23 12:57:54,124 INFO L273 TraceCheckUtils]: 14: Hoare triple {335#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {335#(<= |dll_create_#in~len| 1)} is VALID [2018-11-23 12:57:54,124 INFO L273 TraceCheckUtils]: 15: Hoare triple {335#(<= |dll_create_#in~len| 1)} assume true; {335#(<= |dll_create_#in~len| 1)} is VALID [2018-11-23 12:57:54,126 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {335#(<= |dll_create_#in~len| 1)} {332#(<= 2 main_~len~0)} #113#return; {331#false} is VALID [2018-11-23 12:57:54,126 INFO L273 TraceCheckUtils]: 17: Hoare triple {331#false} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5; {331#false} is VALID [2018-11-23 12:57:54,126 INFO L256 TraceCheckUtils]: 18: Hoare triple {331#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {330#true} is VALID [2018-11-23 12:57:54,126 INFO L273 TraceCheckUtils]: 19: Hoare triple {330#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {330#true} is VALID [2018-11-23 12:57:54,127 INFO L256 TraceCheckUtils]: 20: Hoare triple {330#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {330#true} is VALID [2018-11-23 12:57:54,127 INFO L273 TraceCheckUtils]: 21: Hoare triple {330#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {330#true} is VALID [2018-11-23 12:57:54,127 INFO L273 TraceCheckUtils]: 22: Hoare triple {330#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {330#true} is VALID [2018-11-23 12:57:54,128 INFO L273 TraceCheckUtils]: 23: Hoare triple {330#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 8 + ~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; {330#true} is VALID [2018-11-23 12:57:54,128 INFO L273 TraceCheckUtils]: 24: Hoare triple {330#true} assume true; {330#true} is VALID [2018-11-23 12:57:54,129 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {330#true} {330#true} #121#return; {330#true} is VALID [2018-11-23 12:57:54,129 INFO L273 TraceCheckUtils]: 26: Hoare triple {330#true} ~new_head~1.base, ~new_head~1.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);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, 4 + ~new_head~1.offset, 4);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {330#true} is VALID [2018-11-23 12:57:54,130 INFO L273 TraceCheckUtils]: 27: Hoare triple {330#true} assume #t~mem8.base != 0 || #t~mem8.offset != 0;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, 8 + #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset; {330#true} is VALID [2018-11-23 12:57:54,130 INFO L273 TraceCheckUtils]: 28: Hoare triple {330#true} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {330#true} is VALID [2018-11-23 12:57:54,130 INFO L273 TraceCheckUtils]: 29: Hoare triple {330#true} assume true; {330#true} is VALID [2018-11-23 12:57:54,131 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {330#true} {331#false} #115#return; {331#false} is VALID [2018-11-23 12:57:54,131 INFO L273 TraceCheckUtils]: 31: Hoare triple {331#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {331#false} is VALID [2018-11-23 12:57:54,131 INFO L273 TraceCheckUtils]: 32: Hoare triple {331#false} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {331#false} is VALID [2018-11-23 12:57:54,132 INFO L273 TraceCheckUtils]: 33: Hoare triple {331#false} assume !false; {331#false} is VALID [2018-11-23 12:57:54,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:57:54,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:57:54,135 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:57:54,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:57:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:57:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:57:54,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:57:54,552 INFO L256 TraceCheckUtils]: 0: Hoare triple {330#true} call ULTIMATE.init(); {330#true} is VALID [2018-11-23 12:57:54,552 INFO L273 TraceCheckUtils]: 1: Hoare triple {330#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {330#true} is VALID [2018-11-23 12:57:54,553 INFO L273 TraceCheckUtils]: 2: Hoare triple {330#true} assume true; {330#true} is VALID [2018-11-23 12:57:54,553 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {330#true} {330#true} #123#return; {330#true} is VALID [2018-11-23 12:57:54,554 INFO L256 TraceCheckUtils]: 4: Hoare triple {330#true} call #t~ret18 := main(); {330#true} is VALID [2018-11-23 12:57:54,555 INFO L273 TraceCheckUtils]: 5: Hoare triple {330#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {332#(<= 2 main_~len~0)} is VALID [2018-11-23 12:57:54,555 INFO L256 TraceCheckUtils]: 6: Hoare triple {332#(<= 2 main_~len~0)} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {330#true} is VALID [2018-11-23 12:57:54,557 INFO L273 TraceCheckUtils]: 7: Hoare triple {330#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {333#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:57:54,558 INFO L273 TraceCheckUtils]: 8: Hoare triple {333#(<= |dll_create_#in~len| dll_create_~len)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {333#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:57:54,560 INFO L273 TraceCheckUtils]: 9: Hoare triple {333#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {333#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:57:54,561 INFO L273 TraceCheckUtils]: 10: Hoare triple {333#(<= |dll_create_#in~len| dll_create_~len)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {333#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:57:54,563 INFO L273 TraceCheckUtils]: 11: Hoare triple {333#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {333#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2018-11-23 12:57:54,565 INFO L273 TraceCheckUtils]: 12: Hoare triple {333#(<= |dll_create_#in~len| dll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {334#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2018-11-23 12:57:54,566 INFO L273 TraceCheckUtils]: 13: Hoare triple {334#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {335#(<= |dll_create_#in~len| 1)} is VALID [2018-11-23 12:57:54,567 INFO L273 TraceCheckUtils]: 14: Hoare triple {335#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {335#(<= |dll_create_#in~len| 1)} is VALID [2018-11-23 12:57:54,567 INFO L273 TraceCheckUtils]: 15: Hoare triple {335#(<= |dll_create_#in~len| 1)} assume true; {335#(<= |dll_create_#in~len| 1)} is VALID [2018-11-23 12:57:54,569 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {335#(<= |dll_create_#in~len| 1)} {332#(<= 2 main_~len~0)} #113#return; {331#false} is VALID [2018-11-23 12:57:54,569 INFO L273 TraceCheckUtils]: 17: Hoare triple {331#false} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5; {331#false} is VALID [2018-11-23 12:57:54,570 INFO L256 TraceCheckUtils]: 18: Hoare triple {331#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {331#false} is VALID [2018-11-23 12:57:54,570 INFO L273 TraceCheckUtils]: 19: Hoare triple {331#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {331#false} is VALID [2018-11-23 12:57:54,570 INFO L256 TraceCheckUtils]: 20: Hoare triple {331#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {331#false} is VALID [2018-11-23 12:57:54,571 INFO L273 TraceCheckUtils]: 21: Hoare triple {331#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {331#false} is VALID [2018-11-23 12:57:54,571 INFO L273 TraceCheckUtils]: 22: Hoare triple {331#false} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {331#false} is VALID [2018-11-23 12:57:54,572 INFO L273 TraceCheckUtils]: 23: Hoare triple {331#false} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 8 + ~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; {331#false} is VALID [2018-11-23 12:57:54,572 INFO L273 TraceCheckUtils]: 24: Hoare triple {331#false} assume true; {331#false} is VALID [2018-11-23 12:57:54,572 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {331#false} {331#false} #121#return; {331#false} is VALID [2018-11-23 12:57:54,572 INFO L273 TraceCheckUtils]: 26: Hoare triple {331#false} ~new_head~1.base, ~new_head~1.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);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, 4 + ~new_head~1.offset, 4);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {331#false} is VALID [2018-11-23 12:57:54,573 INFO L273 TraceCheckUtils]: 27: Hoare triple {331#false} assume #t~mem8.base != 0 || #t~mem8.offset != 0;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, 8 + #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset; {331#false} is VALID [2018-11-23 12:57:54,573 INFO L273 TraceCheckUtils]: 28: Hoare triple {331#false} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {331#false} is VALID [2018-11-23 12:57:54,573 INFO L273 TraceCheckUtils]: 29: Hoare triple {331#false} assume true; {331#false} is VALID [2018-11-23 12:57:54,573 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {331#false} {331#false} #115#return; {331#false} is VALID [2018-11-23 12:57:54,574 INFO L273 TraceCheckUtils]: 31: Hoare triple {331#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {331#false} is VALID [2018-11-23 12:57:54,574 INFO L273 TraceCheckUtils]: 32: Hoare triple {331#false} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {331#false} is VALID [2018-11-23 12:57:54,574 INFO L273 TraceCheckUtils]: 33: Hoare triple {331#false} assume !false; {331#false} is VALID [2018-11-23 12:57:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:57:54,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:57:54,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 12:57:54,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-23 12:57:54,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:57:54,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:57:54,796 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:57:54,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:57:54,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:57:54,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:57:54,798 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 6 states. [2018-11-23 12:57:55,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:55,374 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-11-23 12:57:55,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:57:55,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-23 12:57:55,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:57:55,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:57:55,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2018-11-23 12:57:55,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:57:55,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2018-11-23 12:57:55,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2018-11-23 12:57:55,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:57:55,522 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:57:55,522 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:57:55,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:57:55,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:57:55,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-11-23 12:57:55,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:57:55,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 43 states. [2018-11-23 12:57:55,548 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 43 states. [2018-11-23 12:57:55,548 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 43 states. [2018-11-23 12:57:55,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:55,556 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-11-23 12:57:55,556 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-11-23 12:57:55,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:57:55,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:57:55,558 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 47 states. [2018-11-23 12:57:55,558 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 47 states. [2018-11-23 12:57:55,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:55,561 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-11-23 12:57:55,562 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-11-23 12:57:55,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:57:55,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:57:55,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:57:55,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:57:55,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:57:55,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-23 12:57:55,567 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 34 [2018-11-23 12:57:55,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:57:55,567 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-23 12:57:55,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:57:55,567 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-23 12:57:55,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:57:55,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:57:55,569 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:57:55,569 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:57:55,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:57:55,570 INFO L82 PathProgramCache]: Analyzing trace with hash 951213524, now seen corresponding path program 2 times [2018-11-23 12:57:55,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:57:55,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:57:55,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:55,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:57:55,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:57:55,716 INFO L256 TraceCheckUtils]: 0: Hoare triple {683#true} call ULTIMATE.init(); {683#true} is VALID [2018-11-23 12:57:55,716 INFO L273 TraceCheckUtils]: 1: Hoare triple {683#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {683#true} is VALID [2018-11-23 12:57:55,717 INFO L273 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2018-11-23 12:57:55,717 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #123#return; {683#true} is VALID [2018-11-23 12:57:55,717 INFO L256 TraceCheckUtils]: 4: Hoare triple {683#true} call #t~ret18 := main(); {683#true} is VALID [2018-11-23 12:57:55,717 INFO L273 TraceCheckUtils]: 5: Hoare triple {683#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {683#true} is VALID [2018-11-23 12:57:55,718 INFO L256 TraceCheckUtils]: 6: Hoare triple {683#true} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {683#true} is VALID [2018-11-23 12:57:55,718 INFO L273 TraceCheckUtils]: 7: Hoare triple {683#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {683#true} is VALID [2018-11-23 12:57:55,723 INFO L273 TraceCheckUtils]: 8: Hoare triple {683#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {685#(not (= 0 dll_create_~new_head~0.base))} is VALID [2018-11-23 12:57:55,724 INFO L273 TraceCheckUtils]: 9: Hoare triple {685#(not (= 0 dll_create_~new_head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {685#(not (= 0 dll_create_~new_head~0.base))} is VALID [2018-11-23 12:57:55,724 INFO L273 TraceCheckUtils]: 10: Hoare triple {685#(not (= 0 dll_create_~new_head~0.base))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {685#(not (= 0 dll_create_~new_head~0.base))} is VALID [2018-11-23 12:57:55,726 INFO L273 TraceCheckUtils]: 11: Hoare triple {685#(not (= 0 dll_create_~new_head~0.base))} assume !(~head~0.base != 0 || ~head~0.offset != 0); {685#(not (= 0 dll_create_~new_head~0.base))} is VALID [2018-11-23 12:57:55,726 INFO L273 TraceCheckUtils]: 12: Hoare triple {685#(not (= 0 dll_create_~new_head~0.base))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {686#(not (= 0 dll_create_~head~0.base))} is VALID [2018-11-23 12:57:55,728 INFO L273 TraceCheckUtils]: 13: Hoare triple {686#(not (= 0 dll_create_~head~0.base))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {686#(not (= 0 dll_create_~head~0.base))} is VALID [2018-11-23 12:57:55,728 INFO L273 TraceCheckUtils]: 14: Hoare triple {686#(not (= 0 dll_create_~head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {686#(not (= 0 dll_create_~head~0.base))} is VALID [2018-11-23 12:57:55,730 INFO L273 TraceCheckUtils]: 15: Hoare triple {686#(not (= 0 dll_create_~head~0.base))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {686#(not (= 0 dll_create_~head~0.base))} is VALID [2018-11-23 12:57:55,732 INFO L273 TraceCheckUtils]: 16: Hoare triple {686#(not (= 0 dll_create_~head~0.base))} assume !(~head~0.base != 0 || ~head~0.offset != 0); {684#false} is VALID [2018-11-23 12:57:55,732 INFO L273 TraceCheckUtils]: 17: Hoare triple {684#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {684#false} is VALID [2018-11-23 12:57:55,733 INFO L273 TraceCheckUtils]: 18: Hoare triple {684#false} assume !(~len > 0); {684#false} is VALID [2018-11-23 12:57:55,734 INFO L273 TraceCheckUtils]: 19: Hoare triple {684#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {684#false} is VALID [2018-11-23 12:57:55,734 INFO L273 TraceCheckUtils]: 20: Hoare triple {684#false} assume true; {684#false} is VALID [2018-11-23 12:57:55,734 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {684#false} {683#true} #113#return; {684#false} is VALID [2018-11-23 12:57:55,735 INFO L273 TraceCheckUtils]: 22: Hoare triple {684#false} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5; {684#false} is VALID [2018-11-23 12:57:55,735 INFO L256 TraceCheckUtils]: 23: Hoare triple {684#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {683#true} is VALID [2018-11-23 12:57:55,735 INFO L273 TraceCheckUtils]: 24: Hoare triple {683#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {683#true} is VALID [2018-11-23 12:57:55,735 INFO L256 TraceCheckUtils]: 25: Hoare triple {683#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {683#true} is VALID [2018-11-23 12:57:55,736 INFO L273 TraceCheckUtils]: 26: Hoare triple {683#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {683#true} is VALID [2018-11-23 12:57:55,736 INFO L273 TraceCheckUtils]: 27: Hoare triple {683#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {683#true} is VALID [2018-11-23 12:57:55,736 INFO L273 TraceCheckUtils]: 28: Hoare triple {683#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 8 + ~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; {683#true} is VALID [2018-11-23 12:57:55,737 INFO L273 TraceCheckUtils]: 29: Hoare triple {683#true} assume true; {683#true} is VALID [2018-11-23 12:57:55,737 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {683#true} {683#true} #121#return; {683#true} is VALID [2018-11-23 12:57:55,737 INFO L273 TraceCheckUtils]: 31: Hoare triple {683#true} ~new_head~1.base, ~new_head~1.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);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, 4 + ~new_head~1.offset, 4);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {683#true} is VALID [2018-11-23 12:57:55,738 INFO L273 TraceCheckUtils]: 32: Hoare triple {683#true} assume #t~mem8.base != 0 || #t~mem8.offset != 0;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, 8 + #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset; {683#true} is VALID [2018-11-23 12:57:55,738 INFO L273 TraceCheckUtils]: 33: Hoare triple {683#true} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {683#true} is VALID [2018-11-23 12:57:55,738 INFO L273 TraceCheckUtils]: 34: Hoare triple {683#true} assume true; {683#true} is VALID [2018-11-23 12:57:55,738 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {683#true} {684#false} #115#return; {684#false} is VALID [2018-11-23 12:57:55,739 INFO L273 TraceCheckUtils]: 36: Hoare triple {684#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {684#false} is VALID [2018-11-23 12:57:55,739 INFO L273 TraceCheckUtils]: 37: Hoare triple {684#false} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {684#false} is VALID [2018-11-23 12:57:55,739 INFO L273 TraceCheckUtils]: 38: Hoare triple {684#false} assume !false; {684#false} is VALID [2018-11-23 12:57:55,742 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:57:55,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:57:55,743 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:57:55,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:57:55,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:57:55,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:57:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:57:55,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:57:55,997 INFO L256 TraceCheckUtils]: 0: Hoare triple {683#true} call ULTIMATE.init(); {683#true} is VALID [2018-11-23 12:57:55,998 INFO L273 TraceCheckUtils]: 1: Hoare triple {683#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {683#true} is VALID [2018-11-23 12:57:55,999 INFO L273 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2018-11-23 12:57:55,999 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #123#return; {683#true} is VALID [2018-11-23 12:57:55,999 INFO L256 TraceCheckUtils]: 4: Hoare triple {683#true} call #t~ret18 := main(); {683#true} is VALID [2018-11-23 12:57:55,999 INFO L273 TraceCheckUtils]: 5: Hoare triple {683#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {683#true} is VALID [2018-11-23 12:57:56,000 INFO L256 TraceCheckUtils]: 6: Hoare triple {683#true} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {683#true} is VALID [2018-11-23 12:57:56,000 INFO L273 TraceCheckUtils]: 7: Hoare triple {683#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {683#true} is VALID [2018-11-23 12:57:56,000 INFO L273 TraceCheckUtils]: 8: Hoare triple {683#true} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {683#true} is VALID [2018-11-23 12:57:56,001 INFO L273 TraceCheckUtils]: 9: Hoare triple {683#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {717#(or (not (= dll_create_~new_head~0.base 0)) (not (= 0 dll_create_~new_head~0.offset)))} is VALID [2018-11-23 12:57:56,001 INFO L273 TraceCheckUtils]: 10: Hoare triple {717#(or (not (= dll_create_~new_head~0.base 0)) (not (= 0 dll_create_~new_head~0.offset)))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {717#(or (not (= dll_create_~new_head~0.base 0)) (not (= 0 dll_create_~new_head~0.offset)))} is VALID [2018-11-23 12:57:56,002 INFO L273 TraceCheckUtils]: 11: Hoare triple {717#(or (not (= dll_create_~new_head~0.base 0)) (not (= 0 dll_create_~new_head~0.offset)))} assume !(~head~0.base != 0 || ~head~0.offset != 0); {717#(or (not (= dll_create_~new_head~0.base 0)) (not (= 0 dll_create_~new_head~0.offset)))} is VALID [2018-11-23 12:57:56,002 INFO L273 TraceCheckUtils]: 12: Hoare triple {717#(or (not (= dll_create_~new_head~0.base 0)) (not (= 0 dll_create_~new_head~0.offset)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {727#(or (not (= 0 dll_create_~head~0.base)) (not (= 0 dll_create_~head~0.offset)))} is VALID [2018-11-23 12:57:56,003 INFO L273 TraceCheckUtils]: 13: Hoare triple {727#(or (not (= 0 dll_create_~head~0.base)) (not (= 0 dll_create_~head~0.offset)))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {727#(or (not (= 0 dll_create_~head~0.base)) (not (= 0 dll_create_~head~0.offset)))} is VALID [2018-11-23 12:57:56,004 INFO L273 TraceCheckUtils]: 14: Hoare triple {727#(or (not (= 0 dll_create_~head~0.base)) (not (= 0 dll_create_~head~0.offset)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {727#(or (not (= 0 dll_create_~head~0.base)) (not (= 0 dll_create_~head~0.offset)))} is VALID [2018-11-23 12:57:56,004 INFO L273 TraceCheckUtils]: 15: Hoare triple {727#(or (not (= 0 dll_create_~head~0.base)) (not (= 0 dll_create_~head~0.offset)))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {727#(or (not (= 0 dll_create_~head~0.base)) (not (= 0 dll_create_~head~0.offset)))} is VALID [2018-11-23 12:57:56,005 INFO L273 TraceCheckUtils]: 16: Hoare triple {727#(or (not (= 0 dll_create_~head~0.base)) (not (= 0 dll_create_~head~0.offset)))} assume !(~head~0.base != 0 || ~head~0.offset != 0); {684#false} is VALID [2018-11-23 12:57:56,006 INFO L273 TraceCheckUtils]: 17: Hoare triple {684#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {684#false} is VALID [2018-11-23 12:57:56,006 INFO L273 TraceCheckUtils]: 18: Hoare triple {684#false} assume !(~len > 0); {684#false} is VALID [2018-11-23 12:57:56,006 INFO L273 TraceCheckUtils]: 19: Hoare triple {684#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {684#false} is VALID [2018-11-23 12:57:56,007 INFO L273 TraceCheckUtils]: 20: Hoare triple {684#false} assume true; {684#false} is VALID [2018-11-23 12:57:56,007 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {684#false} {683#true} #113#return; {684#false} is VALID [2018-11-23 12:57:56,008 INFO L273 TraceCheckUtils]: 22: Hoare triple {684#false} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5; {684#false} is VALID [2018-11-23 12:57:56,008 INFO L256 TraceCheckUtils]: 23: Hoare triple {684#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {684#false} is VALID [2018-11-23 12:57:56,008 INFO L273 TraceCheckUtils]: 24: Hoare triple {684#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {684#false} is VALID [2018-11-23 12:57:56,008 INFO L256 TraceCheckUtils]: 25: Hoare triple {684#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {684#false} is VALID [2018-11-23 12:57:56,009 INFO L273 TraceCheckUtils]: 26: Hoare triple {684#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {684#false} is VALID [2018-11-23 12:57:56,009 INFO L273 TraceCheckUtils]: 27: Hoare triple {684#false} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {684#false} is VALID [2018-11-23 12:57:56,009 INFO L273 TraceCheckUtils]: 28: Hoare triple {684#false} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 8 + ~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; {684#false} is VALID [2018-11-23 12:57:56,009 INFO L273 TraceCheckUtils]: 29: Hoare triple {684#false} assume true; {684#false} is VALID [2018-11-23 12:57:56,009 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {684#false} {684#false} #121#return; {684#false} is VALID [2018-11-23 12:57:56,010 INFO L273 TraceCheckUtils]: 31: Hoare triple {684#false} ~new_head~1.base, ~new_head~1.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);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, 4 + ~new_head~1.offset, 4);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {684#false} is VALID [2018-11-23 12:57:56,010 INFO L273 TraceCheckUtils]: 32: Hoare triple {684#false} assume #t~mem8.base != 0 || #t~mem8.offset != 0;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, 8 + #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset; {684#false} is VALID [2018-11-23 12:57:56,010 INFO L273 TraceCheckUtils]: 33: Hoare triple {684#false} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {684#false} is VALID [2018-11-23 12:57:56,010 INFO L273 TraceCheckUtils]: 34: Hoare triple {684#false} assume true; {684#false} is VALID [2018-11-23 12:57:56,011 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {684#false} {684#false} #115#return; {684#false} is VALID [2018-11-23 12:57:56,011 INFO L273 TraceCheckUtils]: 36: Hoare triple {684#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {684#false} is VALID [2018-11-23 12:57:56,011 INFO L273 TraceCheckUtils]: 37: Hoare triple {684#false} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {684#false} is VALID [2018-11-23 12:57:56,011 INFO L273 TraceCheckUtils]: 38: Hoare triple {684#false} assume !false; {684#false} is VALID [2018-11-23 12:57:56,015 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:57:56,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:57:56,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 12:57:56,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-11-23 12:57:56,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:57:56,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:57:56,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:57:56,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:57:56,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:57:56,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:57:56,197 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 6 states. [2018-11-23 12:57:56,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:56,487 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2018-11-23 12:57:56,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:57:56,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-11-23 12:57:56,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:57:56,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:57:56,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2018-11-23 12:57:56,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:57:56,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2018-11-23 12:57:56,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 83 transitions. [2018-11-23 12:57:56,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:57:56,708 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:57:56,709 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:57:56,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:57:56,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:57:56,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-23 12:57:56,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:57:56,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2018-11-23 12:57:56,753 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2018-11-23 12:57:56,754 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2018-11-23 12:57:56,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:56,756 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-23 12:57:56,756 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-23 12:57:56,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:57:56,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:57:56,758 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2018-11-23 12:57:56,758 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2018-11-23 12:57:56,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:57:56,761 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-23 12:57:56,761 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-23 12:57:56,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:57:56,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:57:56,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:57:56,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:57:56,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:57:56,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-23 12:57:56,765 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 39 [2018-11-23 12:57:56,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:57:56,765 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-23 12:57:56,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:57:56,766 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 12:57:56,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:57:56,767 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:57:56,768 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:57:56,768 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:57:56,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:57:56,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1538315438, now seen corresponding path program 1 times [2018-11-23 12:57:56,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:57:56,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:57:56,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:56,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:57:56,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:57:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:57:58,806 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2018-11-23 12:57:59,091 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2018-11-23 12:57:59,261 INFO L256 TraceCheckUtils]: 0: Hoare triple {1051#true} call ULTIMATE.init(); {1051#true} is VALID [2018-11-23 12:57:59,261 INFO L273 TraceCheckUtils]: 1: Hoare triple {1051#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1051#true} is VALID [2018-11-23 12:57:59,262 INFO L273 TraceCheckUtils]: 2: Hoare triple {1051#true} assume true; {1051#true} is VALID [2018-11-23 12:57:59,262 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1051#true} {1051#true} #123#return; {1051#true} is VALID [2018-11-23 12:57:59,262 INFO L256 TraceCheckUtils]: 4: Hoare triple {1051#true} call #t~ret18 := main(); {1051#true} is VALID [2018-11-23 12:57:59,264 INFO L273 TraceCheckUtils]: 5: Hoare triple {1051#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1053#(= (select |#valid| |main_~#s~0.base|) 1)} is VALID [2018-11-23 12:57:59,265 INFO L256 TraceCheckUtils]: 6: Hoare triple {1053#(= (select |#valid| |main_~#s~0.base|) 1)} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {1054#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:57:59,267 INFO L273 TraceCheckUtils]: 7: Hoare triple {1054#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1054#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:57:59,269 INFO L273 TraceCheckUtils]: 8: Hoare triple {1054#(= |#valid| |old(#valid)|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1055#(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:57:59,270 INFO L273 TraceCheckUtils]: 9: Hoare triple {1055#(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 == ~new_head~0.base && 0 == ~new_head~0.offset); {1055#(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:57:59,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {1055#(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~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1055#(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:57:59,274 INFO L273 TraceCheckUtils]: 11: Hoare triple {1055#(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 !(~head~0.base != 0 || ~head~0.offset != 0); {1055#(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:57:59,275 INFO L273 TraceCheckUtils]: 12: Hoare triple {1055#(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|)))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1055#(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:57:59,279 INFO L273 TraceCheckUtils]: 13: Hoare triple {1055#(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);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1056#(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|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (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:57:59,282 INFO L273 TraceCheckUtils]: 14: Hoare triple {1056#(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|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (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|)))))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1056#(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|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (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:57:59,284 INFO L273 TraceCheckUtils]: 15: Hoare triple {1056#(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|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (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|)))))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1056#(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|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (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:57:59,285 INFO L273 TraceCheckUtils]: 16: Hoare triple {1056#(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|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (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|)))))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1056#(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|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (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:57:59,292 INFO L273 TraceCheckUtils]: 17: Hoare triple {1056#(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|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (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|)))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1057#(and (= (select |#valid| dll_create_~head~0.base) 1) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:57:59,293 INFO L273 TraceCheckUtils]: 18: Hoare triple {1057#(and (= (select |#valid| dll_create_~head~0.base) 1) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} assume !(~len > 0); {1057#(and (= (select |#valid| dll_create_~head~0.base) 1) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:57:59,295 INFO L273 TraceCheckUtils]: 19: Hoare triple {1057#(and (= (select |#valid| dll_create_~head~0.base) 1) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1058#(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|)))) (= (select |#valid| |dll_create_#res.base|) 1) (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:57:59,297 INFO L273 TraceCheckUtils]: 20: Hoare triple {1058#(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|)))) (= (select |#valid| |dll_create_#res.base|) 1) (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|)))))} assume true; {1058#(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|)))) (= (select |#valid| |dll_create_#res.base|) 1) (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:57:59,316 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1058#(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|)))) (= (select |#valid| |dll_create_#res.base|) 1) (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|)))))} {1053#(= (select |#valid| |main_~#s~0.base|) 1)} #113#return; {1059#(and (not (= (select |#valid| |main_~#s~0.base|) 0)) (not (= (select |#valid| |main_#t~ret10.base|) 0)))} is VALID [2018-11-23 12:57:59,325 INFO L273 TraceCheckUtils]: 22: Hoare triple {1059#(and (not (= (select |#valid| |main_~#s~0.base|) 0)) (not (= (select |#valid| |main_#t~ret10.base|) 0)))} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5; {1060#(and (not (= (select |#valid| |main_~#s~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0)))} is VALID [2018-11-23 12:57:59,327 INFO L256 TraceCheckUtils]: 23: Hoare triple {1060#(and (not (= (select |#valid| |main_~#s~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0)))} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {1061#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:57:59,327 INFO L273 TraceCheckUtils]: 24: Hoare triple {1061#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1062#(and (= (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) (select |#memory_$Pointer$.base| dll_prepend_~head.base)) (= |#valid| |old(#valid)|) (<= |dll_prepend_#in~data| dll_prepend_~data) (<= dll_prepend_~data |dll_prepend_#in~data|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))} is VALID [2018-11-23 12:57:59,328 INFO L256 TraceCheckUtils]: 25: Hoare triple {1062#(and (= (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) (select |#memory_$Pointer$.base| dll_prepend_~head.base)) (= |#valid| |old(#valid)|) (<= |dll_prepend_#in~data| dll_prepend_~data) (<= dll_prepend_~data |dll_prepend_#in~data|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1061#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:57:59,337 INFO L273 TraceCheckUtils]: 26: Hoare triple {1061#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1063#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (<= node_create_~data |node_create_#in~data|) (= 0 node_create_~temp~0.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |node_create_#in~data| node_create_~data))} is VALID [2018-11-23 12:57:59,338 INFO L273 TraceCheckUtils]: 27: Hoare triple {1063#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (<= node_create_~data |node_create_#in~data|) (= 0 node_create_~temp~0.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |node_create_#in~data| node_create_~data))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1063#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (<= node_create_~data |node_create_#in~data|) (= 0 node_create_~temp~0.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |node_create_#in~data| node_create_~data))} is VALID [2018-11-23 12:57:59,340 INFO L273 TraceCheckUtils]: 28: Hoare triple {1063#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (<= node_create_~data |node_create_#in~data|) (= 0 node_create_~temp~0.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |node_create_#in~data| node_create_~data))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 8 + ~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; {1064#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 0 |node_create_#res.offset|) (= (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|) |node_create_#in~data|) (= |#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 (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |node_create_#res.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))} is VALID [2018-11-23 12:57:59,341 INFO L273 TraceCheckUtils]: 29: Hoare triple {1064#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 0 |node_create_#res.offset|) (= (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|) |node_create_#in~data|) (= |#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 (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |node_create_#res.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))} assume true; {1064#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 0 |node_create_#res.offset|) (= (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|) |node_create_#in~data|) (= |#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 (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |node_create_#res.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))} is VALID [2018-11-23 12:57:59,347 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1064#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 0 |node_create_#res.offset|) (= (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|) |node_create_#in~data|) (= |#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 (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |node_create_#res.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))} {1062#(and (= (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) (select |#memory_$Pointer$.base| dll_prepend_~head.base)) (= |#valid| |old(#valid)|) (<= |dll_prepend_#in~data| dll_prepend_~data) (<= dll_prepend_~data |dll_prepend_#in~data|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))} #121#return; {1065#(and (= 0 |dll_prepend_#t~ret6.offset|) (= (select (select |#memory_int| |dll_prepend_#t~ret6.base|) |dll_prepend_#t~ret6.offset|) |dll_prepend_#in~data|) (= 0 (select |old(#valid)| |dll_prepend_#t~ret6.base|)) (or (= dll_prepend_~head.base |dll_prepend_#t~ret6.base|) (= (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) (select |#memory_$Pointer$.base| dll_prepend_~head.base))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))} is VALID [2018-11-23 12:57:59,349 INFO L273 TraceCheckUtils]: 31: Hoare triple {1065#(and (= 0 |dll_prepend_#t~ret6.offset|) (= (select (select |#memory_int| |dll_prepend_#t~ret6.base|) |dll_prepend_#t~ret6.offset|) |dll_prepend_#in~data|) (= 0 (select |old(#valid)| |dll_prepend_#t~ret6.base|)) (or (= dll_prepend_~head.base |dll_prepend_#t~ret6.base|) (= (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) (select |#memory_$Pointer$.base| dll_prepend_~head.base))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))} ~new_head~1.base, ~new_head~1.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);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, 4 + ~new_head~1.offset, 4);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {1066#(and (or (not (= dll_prepend_~new_head~1.base dll_prepend_~head.base)) (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|))) (or (and (= (select (select |#memory_int| dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|) (not (= (+ dll_prepend_~new_head~1.offset 4) 0)) (or (not (= dll_prepend_~new_head~1.base (select (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset))) (and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) (select |#memory_$Pointer$.base| dll_prepend_~head.base)))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= dll_prepend_~head.base |dll_prepend_#in~head.base|)) (= dll_prepend_~new_head~1.base dll_prepend_~head.base)))} is VALID [2018-11-23 12:57:59,351 INFO L273 TraceCheckUtils]: 32: Hoare triple {1066#(and (or (not (= dll_prepend_~new_head~1.base dll_prepend_~head.base)) (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|))) (or (and (= (select (select |#memory_int| dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|) (not (= (+ dll_prepend_~new_head~1.offset 4) 0)) (or (not (= dll_prepend_~new_head~1.base (select (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset))) (and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) (select |#memory_$Pointer$.base| dll_prepend_~head.base)))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= dll_prepend_~head.base |dll_prepend_#in~head.base|)) (= dll_prepend_~new_head~1.base dll_prepend_~head.base)))} assume #t~mem8.base != 0 || #t~mem8.offset != 0;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, 8 + #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset; {1067#(and (or (= dll_prepend_~new_head~1.base dll_prepend_~head.base) (and (or (and (= (select (select |#memory_int| dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= dll_prepend_~head.base |dll_prepend_#in~head.base|)) (and (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) dll_prepend_~head.offset))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))) (not (= (+ dll_prepend_~new_head~1.offset 4) 0)))) (or (not (= dll_prepend_~new_head~1.base dll_prepend_~head.base)) (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|))))} is VALID [2018-11-23 12:57:59,352 INFO L273 TraceCheckUtils]: 33: Hoare triple {1067#(and (or (= dll_prepend_~new_head~1.base dll_prepend_~head.base) (and (or (and (= (select (select |#memory_int| dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= dll_prepend_~head.base |dll_prepend_#in~head.base|)) (and (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) dll_prepend_~head.offset))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))) (not (= (+ dll_prepend_~new_head~1.offset 4) 0)))) (or (not (= dll_prepend_~new_head~1.base dll_prepend_~head.base)) (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|))))} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {1068#(or (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) |dll_prepend_#in~data|))} is VALID [2018-11-23 12:57:59,353 INFO L273 TraceCheckUtils]: 34: Hoare triple {1068#(or (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) |dll_prepend_#in~data|))} assume true; {1068#(or (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) |dll_prepend_#in~data|))} is VALID [2018-11-23 12:57:59,356 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1068#(or (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) |dll_prepend_#in~data|))} {1060#(and (not (= (select |#valid| |main_~#s~0.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0)))} #115#return; {1069#(= main_~uneq~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 12:57:59,357 INFO L273 TraceCheckUtils]: 36: Hoare triple {1069#(= main_~uneq~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {1070#(= main_~uneq~0 |main_#t~mem12|)} is VALID [2018-11-23 12:57:59,357 INFO L273 TraceCheckUtils]: 37: Hoare triple {1070#(= main_~uneq~0 |main_#t~mem12|)} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {1052#false} is VALID [2018-11-23 12:57:59,358 INFO L273 TraceCheckUtils]: 38: Hoare triple {1052#false} assume !false; {1052#false} is VALID [2018-11-23 12:57:59,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:57:59,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:57:59,405 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 12:57:59,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:57:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:57:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:57:59,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:57:59,562 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:57:59,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:57:59,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:57:59,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 12:57:59,579 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:57:59,580 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:57:59,580 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1)) [2018-11-23 12:58:03,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:03,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:03,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:03,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 42 [2018-11-23 12:58:03,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-11-23 12:58:03,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:03,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:58:03,940 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:58:03,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:31 [2018-11-23 12:58:05,946 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:58:05,946 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#valid)_AFTER_CALL_10|, v_subst_1]. (let ((.cse0 (store |v_old(#valid)_AFTER_CALL_10| v_subst_1 1))) (and (= (select |v_old(#valid)_AFTER_CALL_10| v_subst_1) 0) (= |#valid| (store .cse0 |main_#t~ret10.base| 1)) (= (select .cse0 |main_#t~ret10.base|) 0) (= |main_~#s~0.offset| 0) (= 1 (select |v_old(#valid)_AFTER_CALL_10| |main_~#s~0.base|)))) [2018-11-23 12:58:05,946 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_1]. (and (= 1 (select |#valid| v_subst_1)) (not (= |main_~#s~0.base| v_subst_1)) (not (= |main_~#s~0.base| |main_#t~ret10.base|)) (= |main_~#s~0.offset| 0) (= 1 (select |#valid| |main_#t~ret10.base|)) (not (= |main_#t~ret10.base| v_subst_1)) (= (select |#valid| |main_~#s~0.base|) 1)) [2018-11-23 12:58:06,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 12:58:06,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 12:58:06,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:06,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:58:06,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:58:06,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-11-23 12:58:06,817 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:58:06,824 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:58:06,893 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 27 treesize of output 22 [2018-11-23 12:58:06,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:06,903 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 22 treesize of output 14 [2018-11-23 12:58:06,905 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:06,912 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:58:06,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:58:06,931 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:67 [2018-11-23 12:58:07,980 WARN L180 SmtUtils]: Spent 953.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-23 12:58:08,016 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 174 treesize of output 170 [2018-11-23 12:58:08,021 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 166 [2018-11-23 12:58:08,025 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:58:08,029 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:58:08,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 235 [2018-11-23 12:58:08,098 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 175 treesize of output 61 [2018-11-23 12:58:08,100 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:08,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 115 [2018-11-23 12:58:08,153 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-23 12:58:08,170 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:58:08,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 12:58:08,200 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:193, output treesize:84 [2018-11-23 12:58:10,637 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:58:10,638 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_DerPreprocessor_2, |v_#memory_$Pointer$.offset_32|, |v_#memory_int_32|]. (and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= |#memory_int| (let ((.cse0 (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (let ((.cse3 (+ dll_prepend_~new_head~1.offset 4))) (let ((.cse2 (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) .cse3 0) (+ dll_prepend_~new_head~1.offset 8) 0) dll_prepend_~new_head~1.offset v_DerPreprocessor_2))) (store .cse2 .cse3 (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base .cse2) dll_prepend_~head.base) dll_prepend_~head.offset))))) dll_prepend_~head.base) dll_prepend_~head.offset))) (store |v_#memory_int_32| .cse0 (let ((.cse1 (+ (select (select |v_#memory_$Pointer$.offset_32| dll_prepend_~head.base) dll_prepend_~head.offset) 8))) (store (select |v_#memory_int_32| .cse0) .cse1 (select (select |#memory_int| .cse0) .cse1)))))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= (select (select |v_#memory_int_32| dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|)) [2018-11-23 12:58:10,638 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_DerPreprocessor_2]. (let ((.cse0 (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base))) (.cse1 (= |dll_prepend_#in~head.base| dll_prepend_~head.base)) (.cse2 (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))) (or (and .cse0 .cse1 (= (select (select |#memory_int| dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|) .cse2) (and .cse0 .cse1 .cse2 (= dll_prepend_~new_head~1.base (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (let ((.cse4 (+ dll_prepend_~new_head~1.offset 4))) (let ((.cse3 (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) .cse4 0) (+ dll_prepend_~new_head~1.offset 8) 0) dll_prepend_~new_head~1.offset v_DerPreprocessor_2))) (store .cse3 .cse4 (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base .cse3) dll_prepend_~head.base) dll_prepend_~head.offset))))) dll_prepend_~head.base) dll_prepend_~head.offset))))) [2018-11-23 12:58:10,953 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 95 treesize of output 92 [2018-11-23 12:58:10,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 12:58:10,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:10,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:58:11,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2018-11-23 12:58:11,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 12:58:11,015 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:11,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:58:11,123 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 88 [2018-11-23 12:58:11,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 12:58:11,137 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:11,163 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:58:11,168 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 43 [2018-11-23 12:58:11,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 12:58:11,181 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:11,199 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:58:11,274 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 87 treesize of output 84 [2018-11-23 12:58:11,282 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 12 treesize of output 1 [2018-11-23 12:58:11,284 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:11,305 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:58:11,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 66 [2018-11-23 12:58:11,393 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 51 treesize of output 39 [2018-11-23 12:58:11,427 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:11,494 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 2 case distinctions, treesize of input 44 treesize of output 46 [2018-11-23 12:58:11,499 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-23 12:58:11,532 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:58:11,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-23 12:58:11,594 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:146, output treesize:160 [2018-11-23 12:58:11,605 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:58:11,606 WARN L384 uantifierElimination]: Input elimination task: ∃ [dll_prepend_~new_head~1.base, dll_prepend_~new_head~1.offset, v_DerPreprocessor_2, |v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_33|, |v_#memory_int_33|, v_prenex_1]. (let ((.cse0 (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base))) (.cse1 (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_35| |dll_prepend_#in~head.base| (store (select |v_#memory_$Pointer$.base_35| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| dll_prepend_~new_head~1.base)))) (.cse2 (= (store |v_#memory_$Pointer$.offset_33| |dll_prepend_#in~head.base| (store (select |v_#memory_$Pointer$.offset_33| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| dll_prepend_~new_head~1.offset)) |#memory_$Pointer$.offset|)) (.cse3 (select (select |#memory_int| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (or (and .cse0 .cse1 .cse2 (= (store |v_#memory_int_33| |dll_prepend_#in~head.base| (store (select |v_#memory_int_33| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| .cse3)) |#memory_int|) (= (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (let ((.cse5 (+ dll_prepend_~new_head~1.offset 4))) (let ((.cse4 (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) .cse5 0) (+ dll_prepend_~new_head~1.offset 8) 0) dll_prepend_~new_head~1.offset v_DerPreprocessor_2))) (store .cse4 .cse5 (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base .cse4) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) dll_prepend_~new_head~1.base)) (and .cse0 .cse1 .cse2 (= (select (select v_prenex_1 dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|) (= (store v_prenex_1 |dll_prepend_#in~head.base| (store (select v_prenex_1 |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| .cse3)) |#memory_int|)))) [2018-11-23 12:58:11,606 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_DerPreprocessor_2]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (.cse2 (= (select |old(#valid)| .cse0) 0))) (or (and (= |dll_prepend_#in~head.base| .cse0) (= .cse1 |dll_prepend_#in~head.offset|) .cse2) (and (= .cse0 (select (select (store |old(#memory_$Pointer$.base)| .cse0 (let ((.cse4 (+ .cse1 4))) (let ((.cse3 (store (store (store (select |old(#memory_$Pointer$.base)| .cse0) .cse4 0) (+ .cse1 8) 0) .cse1 v_DerPreprocessor_2))) (store .cse3 .cse4 (select (select (store |old(#memory_$Pointer$.base)| .cse0 .cse3) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) .cse2) (and (= (select (select |#memory_int| .cse0) .cse1) |dll_prepend_#in~data|) .cse2)))) [2018-11-23 12:58:11,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:11,944 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:11,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:11,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:58:11,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-11-23 12:58:11,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:11,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-11-23 12:58:11,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-11-23 12:58:11,995 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:11,997 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:58:12,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:58:12,014 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:226, output treesize:30 [2018-11-23 12:58:12,019 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:58:12,019 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_subst_1, |v_#memory_$Pointer$.base_BEFORE_CALL_4|, |v_old(#valid)_AFTER_CALL_12|, v_prenex_3, v_DerPreprocessor_2, v_prenex_5, v_prenex_4]. (let ((.cse1 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse3 (= |main_~#s~0.offset| 0)) (.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse4 (= main_~uneq~0 5))) (or (let ((.cse2 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_4| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (not (= |main_~#s~0.base| v_subst_1)) (= (select (select |#memory_int| .cse0) .cse1) main_~uneq~0) (not (= .cse2 v_subst_1)) .cse3 (not (= |main_~#s~0.base| .cse2)) (= 1 (select |v_old(#valid)_AFTER_CALL_12| |main_~#s~0.base|)) (= 1 (select |v_old(#valid)_AFTER_CALL_12| v_subst_1)) .cse4 (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 0))) (let ((.cse7 (select (select v_prenex_3 |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= 1 (select v_prenex_5 v_prenex_4)) (= .cse0 (select (select (store v_prenex_3 .cse0 (let ((.cse6 (+ .cse1 4))) (let ((.cse5 (store (store (store (select v_prenex_3 .cse0) .cse6 0) (+ .cse1 8) 0) .cse1 v_DerPreprocessor_2))) (store .cse5 .cse6 (select (select (store v_prenex_3 .cse0 .cse5) |main_~#s~0.base|) |main_~#s~0.offset|))))) |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= |main_~#s~0.base| v_prenex_4)) (not (= |main_~#s~0.base| .cse7)) (= 1 (select v_prenex_5 |main_~#s~0.base|)) .cse3 (not (= .cse7 v_prenex_4)) (= (select v_prenex_5 .cse0) 0) .cse4 (= (select v_prenex_5 .cse7) 1))))) [2018-11-23 12:58:12,019 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) main_~uneq~0) (not (= .cse0 |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (= main_~uneq~0 5))) [2018-11-23 12:58:12,108 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 39 treesize of output 33 [2018-11-23 12:58:12,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-23 12:58:12,119 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:58:12,129 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:58:12,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-23 12:58:12,146 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 12:58:12,148 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 12:58:12,153 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 12:58:12,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 12:58:12,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 12:58:12,178 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 12:58:12,180 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:58:12,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:58:12,188 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:42, output treesize:7 [2018-11-23 12:58:12,194 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:58:12,194 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, |main_~#s~0.base|, |#memory_int|, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0))) (let ((.cse1 (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) 0)))) (and (not (= |main_~#s~0.base| .cse0)) (= main_~uneq~0 5) (= main_~uneq~0 .cse1) (= |main_#t~mem12| .cse1)))) [2018-11-23 12:58:12,194 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~mem12| main_~uneq~0) (= main_~uneq~0 5)) [2018-11-23 12:58:12,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {1051#true} call ULTIMATE.init(); {1051#true} is VALID [2018-11-23 12:58:12,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {1051#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1051#true} is VALID [2018-11-23 12:58:12,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {1051#true} assume true; {1051#true} is VALID [2018-11-23 12:58:12,246 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1051#true} {1051#true} #123#return; {1051#true} is VALID [2018-11-23 12:58:12,246 INFO L256 TraceCheckUtils]: 4: Hoare triple {1051#true} call #t~ret18 := main(); {1051#true} is VALID [2018-11-23 12:58:12,248 INFO L273 TraceCheckUtils]: 5: Hoare triple {1051#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1089#(and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:58:12,249 INFO L256 TraceCheckUtils]: 6: Hoare triple {1089#(and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {1054#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:58:12,249 INFO L273 TraceCheckUtils]: 7: Hoare triple {1054#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1054#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:58:12,250 INFO L273 TraceCheckUtils]: 8: Hoare triple {1054#(= |#valid| |old(#valid)|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1099#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base 1)))} is VALID [2018-11-23 12:58:12,251 INFO L273 TraceCheckUtils]: 9: Hoare triple {1099#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base 1)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1099#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base 1)))} is VALID [2018-11-23 12:58:12,252 INFO L273 TraceCheckUtils]: 10: Hoare triple {1099#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base 1)))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1099#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base 1)))} is VALID [2018-11-23 12:58:12,253 INFO L273 TraceCheckUtils]: 11: Hoare triple {1099#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base 1)))} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1099#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base 1)))} is VALID [2018-11-23 12:58:12,255 INFO L273 TraceCheckUtils]: 12: Hoare triple {1099#(and (= 0 (select |old(#valid)| dll_create_~new_head~0.base)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base 1)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1112#(exists ((dll_create_~head~0.base Int)) (and (= |#valid| (store |old(#valid)| dll_create_~head~0.base 1)) (= (select |old(#valid)| dll_create_~head~0.base) 0)))} is VALID [2018-11-23 12:58:12,256 INFO L273 TraceCheckUtils]: 13: Hoare triple {1112#(exists ((dll_create_~head~0.base Int)) (and (= |#valid| (store |old(#valid)| dll_create_~head~0.base 1)) (= (select |old(#valid)| dll_create_~head~0.base) 0)))} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1116#(exists ((dll_create_~head~0.base Int)) (and (= (store (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base 1) |#valid|) (= (select (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base) 0) (= (select |old(#valid)| dll_create_~head~0.base) 0)))} is VALID [2018-11-23 12:58:12,257 INFO L273 TraceCheckUtils]: 14: Hoare triple {1116#(exists ((dll_create_~head~0.base Int)) (and (= (store (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base 1) |#valid|) (= (select (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base) 0) (= (select |old(#valid)| dll_create_~head~0.base) 0)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1116#(exists ((dll_create_~head~0.base Int)) (and (= (store (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base 1) |#valid|) (= (select (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base) 0) (= (select |old(#valid)| dll_create_~head~0.base) 0)))} is VALID [2018-11-23 12:58:12,258 INFO L273 TraceCheckUtils]: 15: Hoare triple {1116#(exists ((dll_create_~head~0.base Int)) (and (= (store (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base 1) |#valid|) (= (select (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base) 0) (= (select |old(#valid)| dll_create_~head~0.base) 0)))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1116#(exists ((dll_create_~head~0.base Int)) (and (= (store (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base 1) |#valid|) (= (select (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base) 0) (= (select |old(#valid)| dll_create_~head~0.base) 0)))} is VALID [2018-11-23 12:58:12,259 INFO L273 TraceCheckUtils]: 16: Hoare triple {1116#(exists ((dll_create_~head~0.base Int)) (and (= (store (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base 1) |#valid|) (= (select (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base) 0) (= (select |old(#valid)| dll_create_~head~0.base) 0)))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1116#(exists ((dll_create_~head~0.base Int)) (and (= (store (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base 1) |#valid|) (= (select (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base) 0) (= (select |old(#valid)| dll_create_~head~0.base) 0)))} is VALID [2018-11-23 12:58:12,260 INFO L273 TraceCheckUtils]: 17: Hoare triple {1116#(exists ((dll_create_~head~0.base Int)) (and (= (store (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base 1) |#valid|) (= (select (store |old(#valid)| dll_create_~head~0.base 1) dll_create_~new_head~0.base) 0) (= (select |old(#valid)| dll_create_~head~0.base) 0)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1129#(exists ((v_subst_1 Int)) (and (= |#valid| (store (store |old(#valid)| v_subst_1 1) dll_create_~head~0.base 1)) (= (select |old(#valid)| v_subst_1) 0) (= (select (store |old(#valid)| v_subst_1 1) dll_create_~head~0.base) 0)))} is VALID [2018-11-23 12:58:12,261 INFO L273 TraceCheckUtils]: 18: Hoare triple {1129#(exists ((v_subst_1 Int)) (and (= |#valid| (store (store |old(#valid)| v_subst_1 1) dll_create_~head~0.base 1)) (= (select |old(#valid)| v_subst_1) 0) (= (select (store |old(#valid)| v_subst_1 1) dll_create_~head~0.base) 0)))} assume !(~len > 0); {1129#(exists ((v_subst_1 Int)) (and (= |#valid| (store (store |old(#valid)| v_subst_1 1) dll_create_~head~0.base 1)) (= (select |old(#valid)| v_subst_1) 0) (= (select (store |old(#valid)| v_subst_1 1) dll_create_~head~0.base) 0)))} is VALID [2018-11-23 12:58:12,263 INFO L273 TraceCheckUtils]: 19: Hoare triple {1129#(exists ((v_subst_1 Int)) (and (= |#valid| (store (store |old(#valid)| v_subst_1 1) dll_create_~head~0.base 1)) (= (select |old(#valid)| v_subst_1) 0) (= (select (store |old(#valid)| v_subst_1 1) dll_create_~head~0.base) 0)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1136#(exists ((v_subst_1 Int)) (and (= 0 (select (store |old(#valid)| v_subst_1 1) |dll_create_#res.base|)) (= |#valid| (store (store |old(#valid)| v_subst_1 1) |dll_create_#res.base| 1)) (= (select |old(#valid)| v_subst_1) 0)))} is VALID [2018-11-23 12:58:12,264 INFO L273 TraceCheckUtils]: 20: Hoare triple {1136#(exists ((v_subst_1 Int)) (and (= 0 (select (store |old(#valid)| v_subst_1 1) |dll_create_#res.base|)) (= |#valid| (store (store |old(#valid)| v_subst_1 1) |dll_create_#res.base| 1)) (= (select |old(#valid)| v_subst_1) 0)))} assume true; {1136#(exists ((v_subst_1 Int)) (and (= 0 (select (store |old(#valid)| v_subst_1 1) |dll_create_#res.base|)) (= |#valid| (store (store |old(#valid)| v_subst_1 1) |dll_create_#res.base| 1)) (= (select |old(#valid)| v_subst_1) 0)))} is VALID [2018-11-23 12:58:12,267 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1136#(exists ((v_subst_1 Int)) (and (= 0 (select (store |old(#valid)| v_subst_1 1) |dll_create_#res.base|)) (= |#valid| (store (store |old(#valid)| v_subst_1 1) |dll_create_#res.base| 1)) (= (select |old(#valid)| v_subst_1) 0)))} {1089#(and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} #113#return; {1143#(and (not (= |main_~#s~0.base| |main_#t~ret10.base|)) (= |main_~#s~0.offset| 0) (= 1 (select |#valid| |main_#t~ret10.base|)) (exists ((v_subst_1 Int)) (and (= 1 (select |#valid| v_subst_1)) (not (= |main_~#s~0.base| v_subst_1)) (not (= |main_#t~ret10.base| v_subst_1)))) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:58:12,268 INFO L273 TraceCheckUtils]: 22: Hoare triple {1143#(and (not (= |main_~#s~0.base| |main_#t~ret10.base|)) (= |main_~#s~0.offset| 0) (= 1 (select |#valid| |main_#t~ret10.base|)) (exists ((v_subst_1 Int)) (and (= 1 (select |#valid| v_subst_1)) (not (= |main_~#s~0.base| v_subst_1)) (not (= |main_#t~ret10.base| v_subst_1)))) (= (select |#valid| |main_~#s~0.base|) 1))} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5; {1147#(and (= 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|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (exists ((v_subst_1 Int)) (and (= 1 (select |#valid| v_subst_1)) (not (= |main_~#s~0.base| v_subst_1)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) v_subst_1)))) (= main_~uneq~0 5) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:58:12,270 INFO L256 TraceCheckUtils]: 23: Hoare triple {1147#(and (= 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|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (exists ((v_subst_1 Int)) (and (= 1 (select |#valid| v_subst_1)) (not (= |main_~#s~0.base| v_subst_1)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) v_subst_1)))) (= main_~uneq~0 5) (= (select |#valid| |main_~#s~0.base|) 1))} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {1061#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:58:12,271 INFO L273 TraceCheckUtils]: 24: Hoare triple {1061#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1154#(and (= dll_prepend_~data |dll_prepend_#in~data|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} is VALID [2018-11-23 12:58:12,272 INFO L256 TraceCheckUtils]: 25: Hoare triple {1154#(and (= dll_prepend_~data |dll_prepend_#in~data|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1061#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:58:12,274 INFO L273 TraceCheckUtils]: 26: Hoare triple {1061#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1161#(and (= node_create_~data |node_create_#in~data|) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:58:12,275 INFO L273 TraceCheckUtils]: 27: Hoare triple {1161#(and (= node_create_~data |node_create_#in~data|) (= 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); {1161#(and (= node_create_~data |node_create_#in~data|) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:58:12,277 INFO L273 TraceCheckUtils]: 28: Hoare triple {1161#(and (= node_create_~data |node_create_#in~data|) (= 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~$Pointer$(0, 0, ~temp~0.base, 8 + ~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; {1168#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (+ |node_create_#res.offset| 4) 0) (+ |node_create_#res.offset| 8) 0) |node_create_#res.offset| (select (select |#memory_$Pointer$.base| |node_create_#res.base|) |node_create_#res.offset|)))))} is VALID [2018-11-23 12:58:12,278 INFO L273 TraceCheckUtils]: 29: Hoare triple {1168#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (+ |node_create_#res.offset| 4) 0) (+ |node_create_#res.offset| 8) 0) |node_create_#res.offset| (select (select |#memory_$Pointer$.base| |node_create_#res.base|) |node_create_#res.offset|)))))} assume true; {1168#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (+ |node_create_#res.offset| 4) 0) (+ |node_create_#res.offset| 8) 0) |node_create_#res.offset| (select (select |#memory_$Pointer$.base| |node_create_#res.base|) |node_create_#res.offset|)))))} is VALID [2018-11-23 12:58:12,280 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1168#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (+ |node_create_#res.offset| 4) 0) (+ |node_create_#res.offset| 8) 0) |node_create_#res.offset| (select (select |#memory_$Pointer$.base| |node_create_#res.base|) |node_create_#res.offset|)))))} {1154#(and (= dll_prepend_~data |dll_prepend_#in~data|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} #121#return; {1175#(and (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base| (store (store (store (select |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base|) (+ |dll_prepend_#t~ret6.offset| 4) 0) (+ |dll_prepend_#t~ret6.offset| 8) 0) |dll_prepend_#t~ret6.offset| (select (select |#memory_$Pointer$.base| |dll_prepend_#t~ret6.base|) |dll_prepend_#t~ret6.offset|)))) (= (select (select |#memory_int| |dll_prepend_#t~ret6.base|) |dll_prepend_#t~ret6.offset|) |dll_prepend_#in~data|) (= 0 (select |old(#valid)| |dll_prepend_#t~ret6.base|)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} is VALID [2018-11-23 12:58:12,284 INFO L273 TraceCheckUtils]: 31: Hoare triple {1175#(and (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base| (store (store (store (select |old(#memory_$Pointer$.base)| |dll_prepend_#t~ret6.base|) (+ |dll_prepend_#t~ret6.offset| 4) 0) (+ |dll_prepend_#t~ret6.offset| 8) 0) |dll_prepend_#t~ret6.offset| (select (select |#memory_$Pointer$.base| |dll_prepend_#t~ret6.base|) |dll_prepend_#t~ret6.offset|)))) (= (select (select |#memory_int| |dll_prepend_#t~ret6.base|) |dll_prepend_#t~ret6.offset|) |dll_prepend_#in~data|) (= 0 (select |old(#valid)| |dll_prepend_#t~ret6.base|)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} ~new_head~1.base, ~new_head~1.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);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, 4 + ~new_head~1.offset, 4);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {1179#(and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= (select (select |#memory_int| dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (exists ((v_DerPreprocessor_2 Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ dll_prepend_~new_head~1.offset 4) 0) (+ dll_prepend_~new_head~1.offset 8) 0) dll_prepend_~new_head~1.offset v_DerPreprocessor_2) (+ dll_prepend_~new_head~1.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ dll_prepend_~new_head~1.offset 4) 0) (+ dll_prepend_~new_head~1.offset 8) 0) dll_prepend_~new_head~1.offset v_DerPreprocessor_2)) dll_prepend_~head.base) dll_prepend_~head.offset))))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} is VALID [2018-11-23 12:58:12,287 INFO L273 TraceCheckUtils]: 32: Hoare triple {1179#(and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= (select (select |#memory_int| dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (exists ((v_DerPreprocessor_2 Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ dll_prepend_~new_head~1.offset 4) 0) (+ dll_prepend_~new_head~1.offset 8) 0) dll_prepend_~new_head~1.offset v_DerPreprocessor_2) (+ dll_prepend_~new_head~1.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ dll_prepend_~new_head~1.offset 4) 0) (+ dll_prepend_~new_head~1.offset 8) 0) dll_prepend_~new_head~1.offset v_DerPreprocessor_2)) dll_prepend_~head.base) dll_prepend_~head.offset))))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))} assume #t~mem8.base != 0 || #t~mem8.offset != 0;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, 8 + #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset; {1183#(or (and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= (select (select |#memory_int| dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|)) (and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (exists ((v_DerPreprocessor_2 Int)) (= dll_prepend_~new_head~1.base (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ dll_prepend_~new_head~1.offset 4) 0) (+ dll_prepend_~new_head~1.offset 8) 0) dll_prepend_~new_head~1.offset v_DerPreprocessor_2) (+ dll_prepend_~new_head~1.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ dll_prepend_~new_head~1.offset 4) 0) (+ dll_prepend_~new_head~1.offset 8) 0) dll_prepend_~new_head~1.offset v_DerPreprocessor_2)) dll_prepend_~head.base) dll_prepend_~head.offset))) dll_prepend_~head.base) dll_prepend_~head.offset))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|)))} is VALID [2018-11-23 12:58:12,295 INFO L273 TraceCheckUtils]: 33: Hoare triple {1183#(or (and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= (select (select |#memory_int| dll_prepend_~new_head~1.base) dll_prepend_~new_head~1.offset) |dll_prepend_#in~data|) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|)) (and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (exists ((v_DerPreprocessor_2 Int)) (= dll_prepend_~new_head~1.base (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ dll_prepend_~new_head~1.offset 4) 0) (+ dll_prepend_~new_head~1.offset 8) 0) dll_prepend_~new_head~1.offset v_DerPreprocessor_2) (+ dll_prepend_~new_head~1.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ dll_prepend_~new_head~1.offset 4) 0) (+ dll_prepend_~new_head~1.offset 8) 0) dll_prepend_~new_head~1.offset v_DerPreprocessor_2)) dll_prepend_~head.base) dll_prepend_~head.offset))) dll_prepend_~head.base) dll_prepend_~head.offset))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|)))} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {1187#(or (and (exists ((v_DerPreprocessor_2 Int)) (= (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 8) 0) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) v_DerPreprocessor_2) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 8) 0) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) v_DerPreprocessor_2)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) 0)) (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) |dll_prepend_#in~data|) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) 0)))} is VALID [2018-11-23 12:58:12,296 INFO L273 TraceCheckUtils]: 34: Hoare triple {1187#(or (and (exists ((v_DerPreprocessor_2 Int)) (= (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 8) 0) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) v_DerPreprocessor_2) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 8) 0) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) v_DerPreprocessor_2)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) 0)) (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) |dll_prepend_#in~data|) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) 0)))} assume true; {1187#(or (and (exists ((v_DerPreprocessor_2 Int)) (= (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 8) 0) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) v_DerPreprocessor_2) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 8) 0) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) v_DerPreprocessor_2)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) 0)) (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) |dll_prepend_#in~data|) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) 0)))} is VALID [2018-11-23 12:58:12,298 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1187#(or (and (exists ((v_DerPreprocessor_2 Int)) (= (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 8) 0) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) v_DerPreprocessor_2) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (store (store (store (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) 0) (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 8) 0) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) v_DerPreprocessor_2)) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) 0)) (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) |dll_prepend_#in~data|) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) 0)))} {1147#(and (= 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|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (exists ((v_subst_1 Int)) (and (= 1 (select |#valid| v_subst_1)) (not (= |main_~#s~0.base| v_subst_1)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) v_subst_1)))) (= main_~uneq~0 5) (= (select |#valid| |main_~#s~0.base|) 1))} #115#return; {1194#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) main_~uneq~0) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (= main_~uneq~0 5))} is VALID [2018-11-23 12:58:12,299 INFO L273 TraceCheckUtils]: 36: Hoare triple {1194#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) main_~uneq~0) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (= main_~uneq~0 5))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {1198#(and (= |main_#t~mem12| main_~uneq~0) (= main_~uneq~0 5))} is VALID [2018-11-23 12:58:12,300 INFO L273 TraceCheckUtils]: 37: Hoare triple {1198#(and (= |main_#t~mem12| main_~uneq~0) (= main_~uneq~0 5))} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {1052#false} is VALID [2018-11-23 12:58:12,300 INFO L273 TraceCheckUtils]: 38: Hoare triple {1052#false} assume !false; {1052#false} is VALID [2018-11-23 12:58:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:58:12,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:58:12,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 37 [2018-11-23 12:58:12,340 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 39 [2018-11-23 12:58:12,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:58:12,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 12:58:12,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:58:12,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 12:58:12,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 12:58:12,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1227, Unknown=5, NotChecked=0, Total=1332 [2018-11-23 12:58:12,525 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 37 states. [2018-11-23 12:58:36,953 WARN L180 SmtUtils]: Spent 521.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 12:58:39,126 WARN L180 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-11-23 12:58:42,014 WARN L180 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2018-11-23 12:58:48,994 WARN L180 SmtUtils]: Spent 4.71 s on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2018-11-23 12:58:55,024 WARN L180 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2018-11-23 12:58:58,761 WARN L180 SmtUtils]: Spent 3.40 s on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2018-11-23 12:59:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:00,326 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-23 12:59:00,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:59:00,326 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 39 [2018-11-23 12:59:00,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:59:00,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:59:00,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 71 transitions. [2018-11-23 12:59:00,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:59:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 71 transitions. [2018-11-23 12:59:00,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 71 transitions. [2018-11-23 12:59:00,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:00,465 INFO L225 Difference]: With dead ends: 63 [2018-11-23 12:59:00,465 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:59:00,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=192, Invalid=2253, Unknown=5, NotChecked=0, Total=2450 [2018-11-23 12:59:00,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:59:00,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2018-11-23 12:59:00,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:59:00,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 55 states. [2018-11-23 12:59:00,509 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 55 states. [2018-11-23 12:59:00,509 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 55 states. [2018-11-23 12:59:00,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:00,513 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-23 12:59:00,513 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2018-11-23 12:59:00,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:00,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:00,514 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 61 states. [2018-11-23 12:59:00,515 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 61 states. [2018-11-23 12:59:00,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:00,518 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-23 12:59:00,518 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2018-11-23 12:59:00,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:00,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:00,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:59:00,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:59:00,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:59:00,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-11-23 12:59:00,522 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 39 [2018-11-23 12:59:00,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:59:00,523 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-11-23 12:59:00,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 12:59:00,523 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-23 12:59:00,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:59:00,524 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:59:00,524 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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:59:00,525 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:59:00,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:59:00,525 INFO L82 PathProgramCache]: Analyzing trace with hash 340210699, now seen corresponding path program 2 times [2018-11-23 12:59:00,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:59:00,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:59:00,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:00,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:59:00,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:00,659 INFO L256 TraceCheckUtils]: 0: Hoare triple {1507#true} call ULTIMATE.init(); {1507#true} is VALID [2018-11-23 12:59:00,659 INFO L273 TraceCheckUtils]: 1: Hoare triple {1507#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1507#true} is VALID [2018-11-23 12:59:00,660 INFO L273 TraceCheckUtils]: 2: Hoare triple {1507#true} assume true; {1507#true} is VALID [2018-11-23 12:59:00,660 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1507#true} {1507#true} #123#return; {1507#true} is VALID [2018-11-23 12:59:00,661 INFO L256 TraceCheckUtils]: 4: Hoare triple {1507#true} call #t~ret18 := main(); {1507#true} is VALID [2018-11-23 12:59:00,663 INFO L273 TraceCheckUtils]: 5: Hoare triple {1507#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1509#(<= main_~len~0 2)} is VALID [2018-11-23 12:59:00,663 INFO L256 TraceCheckUtils]: 6: Hoare triple {1509#(<= main_~len~0 2)} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {1507#true} is VALID [2018-11-23 12:59:00,664 INFO L273 TraceCheckUtils]: 7: Hoare triple {1507#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1510#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,664 INFO L273 TraceCheckUtils]: 8: Hoare triple {1510#(<= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1510#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,665 INFO L273 TraceCheckUtils]: 9: Hoare triple {1510#(<= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1510#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,665 INFO L273 TraceCheckUtils]: 10: Hoare triple {1510#(<= dll_create_~len |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1510#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,666 INFO L273 TraceCheckUtils]: 11: Hoare triple {1510#(<= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1510#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,666 INFO L273 TraceCheckUtils]: 12: Hoare triple {1510#(<= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1511#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,667 INFO L273 TraceCheckUtils]: 13: Hoare triple {1511#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1511#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,667 INFO L273 TraceCheckUtils]: 14: Hoare triple {1511#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1511#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,667 INFO L273 TraceCheckUtils]: 15: Hoare triple {1511#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1511#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,668 INFO L273 TraceCheckUtils]: 16: Hoare triple {1511#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1511#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,669 INFO L273 TraceCheckUtils]: 17: Hoare triple {1511#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1512#(<= (+ dll_create_~len 2) |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,670 INFO L273 TraceCheckUtils]: 18: Hoare triple {1512#(<= (+ dll_create_~len 2) |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1513#(<= 3 |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,671 INFO L273 TraceCheckUtils]: 19: Hoare triple {1513#(<= 3 |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1513#(<= 3 |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,671 INFO L273 TraceCheckUtils]: 20: Hoare triple {1513#(<= 3 |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1513#(<= 3 |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,672 INFO L273 TraceCheckUtils]: 21: Hoare triple {1513#(<= 3 |dll_create_#in~len|)} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1513#(<= 3 |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,673 INFO L273 TraceCheckUtils]: 22: Hoare triple {1513#(<= 3 |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1513#(<= 3 |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,673 INFO L273 TraceCheckUtils]: 23: Hoare triple {1513#(<= 3 |dll_create_#in~len|)} assume !(~len > 0); {1513#(<= 3 |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,674 INFO L273 TraceCheckUtils]: 24: Hoare triple {1513#(<= 3 |dll_create_#in~len|)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1513#(<= 3 |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,674 INFO L273 TraceCheckUtils]: 25: Hoare triple {1513#(<= 3 |dll_create_#in~len|)} assume true; {1513#(<= 3 |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,676 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1513#(<= 3 |dll_create_#in~len|)} {1509#(<= main_~len~0 2)} #113#return; {1508#false} is VALID [2018-11-23 12:59:00,676 INFO L273 TraceCheckUtils]: 27: Hoare triple {1508#false} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5; {1508#false} is VALID [2018-11-23 12:59:00,676 INFO L256 TraceCheckUtils]: 28: Hoare triple {1508#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {1507#true} is VALID [2018-11-23 12:59:00,677 INFO L273 TraceCheckUtils]: 29: Hoare triple {1507#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1507#true} is VALID [2018-11-23 12:59:00,677 INFO L256 TraceCheckUtils]: 30: Hoare triple {1507#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1507#true} is VALID [2018-11-23 12:59:00,677 INFO L273 TraceCheckUtils]: 31: Hoare triple {1507#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1507#true} is VALID [2018-11-23 12:59:00,677 INFO L273 TraceCheckUtils]: 32: Hoare triple {1507#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1507#true} is VALID [2018-11-23 12:59:00,678 INFO L273 TraceCheckUtils]: 33: Hoare triple {1507#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 8 + ~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; {1507#true} is VALID [2018-11-23 12:59:00,678 INFO L273 TraceCheckUtils]: 34: Hoare triple {1507#true} assume true; {1507#true} is VALID [2018-11-23 12:59:00,678 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1507#true} {1507#true} #121#return; {1507#true} is VALID [2018-11-23 12:59:00,678 INFO L273 TraceCheckUtils]: 36: Hoare triple {1507#true} ~new_head~1.base, ~new_head~1.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);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, 4 + ~new_head~1.offset, 4);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {1507#true} is VALID [2018-11-23 12:59:00,679 INFO L273 TraceCheckUtils]: 37: Hoare triple {1507#true} assume #t~mem8.base != 0 || #t~mem8.offset != 0;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, 8 + #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset; {1507#true} is VALID [2018-11-23 12:59:00,679 INFO L273 TraceCheckUtils]: 38: Hoare triple {1507#true} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {1507#true} is VALID [2018-11-23 12:59:00,679 INFO L273 TraceCheckUtils]: 39: Hoare triple {1507#true} assume true; {1507#true} is VALID [2018-11-23 12:59:00,679 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1507#true} {1508#false} #115#return; {1508#false} is VALID [2018-11-23 12:59:00,680 INFO L273 TraceCheckUtils]: 41: Hoare triple {1508#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {1508#false} is VALID [2018-11-23 12:59:00,680 INFO L273 TraceCheckUtils]: 42: Hoare triple {1508#false} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {1508#false} is VALID [2018-11-23 12:59:00,680 INFO L273 TraceCheckUtils]: 43: Hoare triple {1508#false} assume !false; {1508#false} is VALID [2018-11-23 12:59:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:59:00,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:59:00,682 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:59:00,691 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:59:00,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:59:00,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:59:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:00,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:59:00,887 INFO L256 TraceCheckUtils]: 0: Hoare triple {1507#true} call ULTIMATE.init(); {1507#true} is VALID [2018-11-23 12:59:00,888 INFO L273 TraceCheckUtils]: 1: Hoare triple {1507#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1507#true} is VALID [2018-11-23 12:59:00,888 INFO L273 TraceCheckUtils]: 2: Hoare triple {1507#true} assume true; {1507#true} is VALID [2018-11-23 12:59:00,888 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1507#true} {1507#true} #123#return; {1507#true} is VALID [2018-11-23 12:59:00,888 INFO L256 TraceCheckUtils]: 4: Hoare triple {1507#true} call #t~ret18 := main(); {1507#true} is VALID [2018-11-23 12:59:00,889 INFO L273 TraceCheckUtils]: 5: Hoare triple {1507#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1509#(<= main_~len~0 2)} is VALID [2018-11-23 12:59:00,890 INFO L256 TraceCheckUtils]: 6: Hoare triple {1509#(<= main_~len~0 2)} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {1507#true} is VALID [2018-11-23 12:59:00,891 INFO L273 TraceCheckUtils]: 7: Hoare triple {1507#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1510#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,891 INFO L273 TraceCheckUtils]: 8: Hoare triple {1510#(<= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1510#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,891 INFO L273 TraceCheckUtils]: 9: Hoare triple {1510#(<= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1510#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,892 INFO L273 TraceCheckUtils]: 10: Hoare triple {1510#(<= dll_create_~len |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1510#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,894 INFO L273 TraceCheckUtils]: 11: Hoare triple {1510#(<= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1510#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,895 INFO L273 TraceCheckUtils]: 12: Hoare triple {1510#(<= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1511#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,895 INFO L273 TraceCheckUtils]: 13: Hoare triple {1511#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1511#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,895 INFO L273 TraceCheckUtils]: 14: Hoare triple {1511#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1511#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,896 INFO L273 TraceCheckUtils]: 15: Hoare triple {1511#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1511#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,896 INFO L273 TraceCheckUtils]: 16: Hoare triple {1511#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1511#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,897 INFO L273 TraceCheckUtils]: 17: Hoare triple {1511#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1512#(<= (+ dll_create_~len 2) |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,898 INFO L273 TraceCheckUtils]: 18: Hoare triple {1512#(<= (+ dll_create_~len 2) |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1513#(<= 3 |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,903 INFO L273 TraceCheckUtils]: 19: Hoare triple {1513#(<= 3 |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1513#(<= 3 |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,903 INFO L273 TraceCheckUtils]: 20: Hoare triple {1513#(<= 3 |dll_create_#in~len|)} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1513#(<= 3 |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,903 INFO L273 TraceCheckUtils]: 21: Hoare triple {1513#(<= 3 |dll_create_#in~len|)} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1513#(<= 3 |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,904 INFO L273 TraceCheckUtils]: 22: Hoare triple {1513#(<= 3 |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1513#(<= 3 |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,904 INFO L273 TraceCheckUtils]: 23: Hoare triple {1513#(<= 3 |dll_create_#in~len|)} assume !(~len > 0); {1513#(<= 3 |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,912 INFO L273 TraceCheckUtils]: 24: Hoare triple {1513#(<= 3 |dll_create_#in~len|)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1513#(<= 3 |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,912 INFO L273 TraceCheckUtils]: 25: Hoare triple {1513#(<= 3 |dll_create_#in~len|)} assume true; {1513#(<= 3 |dll_create_#in~len|)} is VALID [2018-11-23 12:59:00,913 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1513#(<= 3 |dll_create_#in~len|)} {1509#(<= main_~len~0 2)} #113#return; {1508#false} is VALID [2018-11-23 12:59:00,913 INFO L273 TraceCheckUtils]: 27: Hoare triple {1508#false} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5; {1508#false} is VALID [2018-11-23 12:59:00,913 INFO L256 TraceCheckUtils]: 28: Hoare triple {1508#false} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {1508#false} is VALID [2018-11-23 12:59:00,914 INFO L273 TraceCheckUtils]: 29: Hoare triple {1508#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1508#false} is VALID [2018-11-23 12:59:00,914 INFO L256 TraceCheckUtils]: 30: Hoare triple {1508#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1508#false} is VALID [2018-11-23 12:59:00,914 INFO L273 TraceCheckUtils]: 31: Hoare triple {1508#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1508#false} is VALID [2018-11-23 12:59:00,914 INFO L273 TraceCheckUtils]: 32: Hoare triple {1508#false} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1508#false} is VALID [2018-11-23 12:59:00,914 INFO L273 TraceCheckUtils]: 33: Hoare triple {1508#false} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 8 + ~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; {1508#false} is VALID [2018-11-23 12:59:00,914 INFO L273 TraceCheckUtils]: 34: Hoare triple {1508#false} assume true; {1508#false} is VALID [2018-11-23 12:59:00,914 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1508#false} {1508#false} #121#return; {1508#false} is VALID [2018-11-23 12:59:00,915 INFO L273 TraceCheckUtils]: 36: Hoare triple {1508#false} ~new_head~1.base, ~new_head~1.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);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, 4 + ~new_head~1.offset, 4);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {1508#false} is VALID [2018-11-23 12:59:00,915 INFO L273 TraceCheckUtils]: 37: Hoare triple {1508#false} assume #t~mem8.base != 0 || #t~mem8.offset != 0;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, 8 + #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset; {1508#false} is VALID [2018-11-23 12:59:00,915 INFO L273 TraceCheckUtils]: 38: Hoare triple {1508#false} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {1508#false} is VALID [2018-11-23 12:59:00,915 INFO L273 TraceCheckUtils]: 39: Hoare triple {1508#false} assume true; {1508#false} is VALID [2018-11-23 12:59:00,915 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1508#false} {1508#false} #115#return; {1508#false} is VALID [2018-11-23 12:59:00,915 INFO L273 TraceCheckUtils]: 41: Hoare triple {1508#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {1508#false} is VALID [2018-11-23 12:59:00,916 INFO L273 TraceCheckUtils]: 42: Hoare triple {1508#false} assume ~uneq~0 != #t~mem12;havoc #t~mem12; {1508#false} is VALID [2018-11-23 12:59:00,916 INFO L273 TraceCheckUtils]: 43: Hoare triple {1508#false} assume !false; {1508#false} is VALID [2018-11-23 12:59:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:59:00,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:59:00,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 12:59:00,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-11-23 12:59:00,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:59:00,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:59:01,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:01,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:59:01,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:59:01,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:59:01,005 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 7 states. [2018-11-23 12:59:01,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:01,396 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2018-11-23 12:59:01,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:59:01,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-11-23 12:59:01,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:59:01,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:59:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2018-11-23 12:59:01,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:59:01,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2018-11-23 12:59:01,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2018-11-23 12:59:01,537 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:01,540 INFO L225 Difference]: With dead ends: 72 [2018-11-23 12:59:01,540 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:59:01,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:59:01,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:59:01,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 12:59:01,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:59:01,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-23 12:59:01,636 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 12:59:01,637 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 12:59:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:01,639 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-11-23 12:59:01,639 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-23 12:59:01,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:01,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:01,640 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 12:59:01,640 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 12:59:01,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:01,642 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-11-23 12:59:01,642 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-23 12:59:01,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:01,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:01,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:59:01,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:59:01,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:59:01,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-11-23 12:59:01,644 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 44 [2018-11-23 12:59:01,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:59:01,645 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-11-23 12:59:01,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:59:01,645 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-23 12:59:01,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 12:59:01,646 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:59:01,646 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:59:01,646 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:59:01,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:59:01,647 INFO L82 PathProgramCache]: Analyzing trace with hash -852342877, now seen corresponding path program 1 times [2018-11-23 12:59:01,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:59:01,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:59:01,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:01,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:59:01,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:02,771 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2018-11-23 12:59:03,117 INFO L256 TraceCheckUtils]: 0: Hoare triple {1885#true} call ULTIMATE.init(); {1885#true} is VALID [2018-11-23 12:59:03,118 INFO L273 TraceCheckUtils]: 1: Hoare triple {1885#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1885#true} is VALID [2018-11-23 12:59:03,118 INFO L273 TraceCheckUtils]: 2: Hoare triple {1885#true} assume true; {1885#true} is VALID [2018-11-23 12:59:03,118 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1885#true} {1885#true} #123#return; {1885#true} is VALID [2018-11-23 12:59:03,119 INFO L256 TraceCheckUtils]: 4: Hoare triple {1885#true} call #t~ret18 := main(); {1885#true} is VALID [2018-11-23 12:59:03,120 INFO L273 TraceCheckUtils]: 5: Hoare triple {1885#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1887#(= (select |#valid| |main_~#s~0.base|) 1)} is VALID [2018-11-23 12:59:03,125 INFO L256 TraceCheckUtils]: 6: Hoare triple {1887#(= (select |#valid| |main_~#s~0.base|) 1)} call #t~ret10.base, #t~ret10.offset := dll_create(~len~0, ~data~0); {1888#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:03,126 INFO L273 TraceCheckUtils]: 7: Hoare triple {1888#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1888#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:03,127 INFO L273 TraceCheckUtils]: 8: Hoare triple {1888#(= |#valid| |old(#valid)|)} assume !!(~len > 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1889#(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,128 INFO L273 TraceCheckUtils]: 9: Hoare triple {1889#(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 == ~new_head~0.base && 0 == ~new_head~0.offset); {1889#(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,130 INFO L273 TraceCheckUtils]: 10: Hoare triple {1889#(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~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1889#(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,131 INFO L273 TraceCheckUtils]: 11: Hoare triple {1889#(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 !(~head~0.base != 0 || ~head~0.offset != 0); {1889#(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,132 INFO L273 TraceCheckUtils]: 12: Hoare triple {1889#(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|)))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1889#(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,136 INFO L273 TraceCheckUtils]: 13: Hoare triple {1889#(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);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1890#(and (not (= 0 dll_create_~new_head~0.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|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (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,139 INFO L273 TraceCheckUtils]: 14: Hoare triple {1890#(and (not (= 0 dll_create_~new_head~0.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|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (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|)))))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1890#(and (not (= 0 dll_create_~new_head~0.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|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (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,142 INFO L273 TraceCheckUtils]: 15: Hoare triple {1890#(and (not (= 0 dll_create_~new_head~0.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|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (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|)))))} call write~int(~data, ~new_head~0.base, ~new_head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); {1890#(and (not (= 0 dll_create_~new_head~0.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|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (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,144 INFO L273 TraceCheckUtils]: 16: Hoare triple {1890#(and (not (= 0 dll_create_~new_head~0.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|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (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|)))))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4); {1890#(and (not (= 0 dll_create_~new_head~0.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|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (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,147 INFO L273 TraceCheckUtils]: 17: Hoare triple {1890#(and (not (= 0 dll_create_~new_head~0.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|)))) (= (select |#valid| dll_create_~new_head~0.base) 1) (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|)))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := #t~post4 - 1;havoc #t~post4; {1891#(and (= (select |#valid| dll_create_~head~0.base) 1) (not (= 0 dll_create_~head~0.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) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:03,149 INFO L273 TraceCheckUtils]: 18: Hoare triple {1891#(and (= (select |#valid| dll_create_~head~0.base) 1) (not (= 0 dll_create_~head~0.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) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} assume !(~len > 0); {1891#(and (= (select |#valid| dll_create_~head~0.base) 1) (not (= 0 dll_create_~head~0.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) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:03,152 INFO L273 TraceCheckUtils]: 19: Hoare triple {1891#(and (= (select |#valid| dll_create_~head~0.base) 1) (not (= 0 dll_create_~head~0.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) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1892#(and (not (= 0 |dll_create_#res.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|)))) (= (select |#valid| |dll_create_#res.base|) 1) (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,154 INFO L273 TraceCheckUtils]: 20: Hoare triple {1892#(and (not (= 0 |dll_create_#res.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|)))) (= (select |#valid| |dll_create_#res.base|) 1) (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|)))))} assume true; {1892#(and (not (= 0 |dll_create_#res.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|)))) (= (select |#valid| |dll_create_#res.base|) 1) (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,157 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1892#(and (not (= 0 |dll_create_#res.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|)))) (= (select |#valid| |dll_create_#res.base|) 1) (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|)))))} {1887#(= (select |#valid| |main_~#s~0.base|) 1)} #113#return; {1893#(and (not (= 0 |main_#t~ret10.base|)) (= (select |#valid| |main_#t~ret10.base|) 1) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:03,158 INFO L273 TraceCheckUtils]: 22: Hoare triple {1893#(and (not (= 0 |main_#t~ret10.base|)) (= (select |#valid| |main_#t~ret10.base|) 1) (= (select |#valid| |main_~#s~0.base|) 1))} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset;~uneq~0 := 5; {1894#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 1) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:03,160 INFO L256 TraceCheckUtils]: 23: Hoare triple {1894#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 1) (= (select |#valid| |main_~#s~0.base|) 1))} call dll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {1895#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:03,161 INFO L273 TraceCheckUtils]: 24: Hoare triple {1895#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1896#(and (= (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) (select |#memory_$Pointer$.base| dll_prepend_~head.base)) (= |#valid| |old(#valid)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))} is VALID [2018-11-23 12:59:03,162 INFO L256 TraceCheckUtils]: 25: Hoare triple {1896#(and (= (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) (select |#memory_$Pointer$.base| dll_prepend_~head.base)) (= |#valid| |old(#valid)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1895#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:03,163 INFO L273 TraceCheckUtils]: 26: Hoare triple {1895#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1897#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 node_create_~temp~0.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:03,164 INFO L273 TraceCheckUtils]: 27: Hoare triple {1897#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 node_create_~temp~0.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1897#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 node_create_~temp~0.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:03,166 INFO L273 TraceCheckUtils]: 28: Hoare triple {1897#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 node_create_~temp~0.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~$Pointer$(0, 0, ~temp~0.base, 8 + ~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; {1898#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 0 |node_create_#res.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 (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |node_create_#res.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))} is VALID [2018-11-23 12:59:03,168 INFO L273 TraceCheckUtils]: 29: Hoare triple {1898#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 0 |node_create_#res.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 (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |node_create_#res.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))} assume true; {1898#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 0 |node_create_#res.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 (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |node_create_#res.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))} is VALID [2018-11-23 12:59:03,171 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1898#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 0 |node_create_#res.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 (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |node_create_#res.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))} {1896#(and (= (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) (select |#memory_$Pointer$.base| dll_prepend_~head.base)) (= |#valid| |old(#valid)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))} #121#return; {1899#(and (= 0 |dll_prepend_#t~ret6.offset|) (= 0 (select |old(#valid)| |dll_prepend_#t~ret6.base|)) (or (= dll_prepend_~head.base |dll_prepend_#t~ret6.base|) (= (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) (select |#memory_$Pointer$.base| dll_prepend_~head.base))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))} is VALID [2018-11-23 12:59:03,173 INFO L273 TraceCheckUtils]: 31: Hoare triple {1899#(and (= 0 |dll_prepend_#t~ret6.offset|) (= 0 (select |old(#valid)| |dll_prepend_#t~ret6.base|)) (or (= dll_prepend_~head.base |dll_prepend_#t~ret6.base|) (= (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) (select |#memory_$Pointer$.base| dll_prepend_~head.base))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))} ~new_head~1.base, ~new_head~1.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);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, 4 + ~new_head~1.offset, 4);havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {1900#(and (or (not (= dll_prepend_~new_head~1.base dll_prepend_~head.base)) (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|))) (or (= dll_prepend_~new_head~1.base dll_prepend_~head.base) (and (or (and (= 0 dll_prepend_~new_head~1.offset) (= (select (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) dll_prepend_~head.offset) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset) (store (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_prepend_~head.base) dll_prepend_~head.offset) 8) dll_prepend_~new_head~1.base)) dll_prepend_~new_head~1.base) (+ dll_prepend_~new_head~1.offset 4))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|)) (= dll_prepend_~new_head~1.base (select (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset))) (or (not (= dll_prepend_~new_head~1.base (select (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset))) (and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset) (store (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_prepend_~head.base) dll_prepend_~head.offset) 8) dll_prepend_~new_head~1.base)) dll_prepend_~head.base)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))))} is VALID [2018-11-23 12:59:03,174 INFO L273 TraceCheckUtils]: 32: Hoare triple {1900#(and (or (not (= dll_prepend_~new_head~1.base dll_prepend_~head.base)) (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|))) (or (= dll_prepend_~new_head~1.base dll_prepend_~head.base) (and (or (and (= 0 dll_prepend_~new_head~1.offset) (= (select (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) dll_prepend_~head.offset) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset) (store (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_prepend_~head.base) dll_prepend_~head.offset) 8) dll_prepend_~new_head~1.base)) dll_prepend_~new_head~1.base) (+ dll_prepend_~new_head~1.offset 4))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|)) (= dll_prepend_~new_head~1.base (select (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset))) (or (not (= dll_prepend_~new_head~1.base (select (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset))) (and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset) (store (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset)) (+ (select (select |#memory_$Pointer$.offset| dll_prepend_~head.base) dll_prepend_~head.offset) 8) dll_prepend_~new_head~1.base)) dll_prepend_~head.base)) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))))} assume #t~mem8.base != 0 || #t~mem8.offset != 0;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, #t~mem9.base, 8 + #t~mem9.offset, 4);havoc #t~mem9.base, #t~mem9.offset; {1901#(and (or (= dll_prepend_~new_head~1.base dll_prepend_~head.base) (and (or (and (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) dll_prepend_~head.offset))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) dll_prepend_~head.offset) (select (select (store |#memory_$Pointer$.base| dll_prepend_~head.base (store (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset dll_prepend_~new_head~1.base)) dll_prepend_~new_head~1.base) (+ dll_prepend_~new_head~1.offset 4))) (= 0 dll_prepend_~new_head~1.offset) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))) (or (not (= dll_prepend_~new_head~1.base dll_prepend_~head.base)) (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|))))} is VALID [2018-11-23 12:59:03,176 INFO L273 TraceCheckUtils]: 33: Hoare triple {1901#(and (or (= dll_prepend_~new_head~1.base dll_prepend_~head.base) (and (or (and (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) dll_prepend_~head.offset))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| dll_prepend_~head.base) dll_prepend_~head.offset) (select (select (store |#memory_$Pointer$.base| dll_prepend_~head.base (store (select |#memory_$Pointer$.base| dll_prepend_~head.base) dll_prepend_~head.offset dll_prepend_~new_head~1.base)) dll_prepend_~new_head~1.base) (+ dll_prepend_~new_head~1.offset 4))) (= 0 dll_prepend_~new_head~1.offset) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))) (= dll_prepend_~head.base |dll_prepend_#in~head.base|))) (or (not (= dll_prepend_~new_head~1.base dll_prepend_~head.base)) (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|))))} call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {1902#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) 4))) (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))))} is VALID [2018-11-23 12:59:03,177 INFO L273 TraceCheckUtils]: 34: Hoare triple {1902#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) 4))) (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))))} assume true; {1902#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) 4))) (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))))} is VALID [2018-11-23 12:59:03,179 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1902#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)) 4))) (= 0 (select |old(#valid)| |dll_prepend_#in~head.base|)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))))} {1894#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 1) (= (select |#valid| |main_~#s~0.base|) 1))} #115#return; {1903#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 12:59:03,180 INFO L273 TraceCheckUtils]: 36: Hoare triple {1903#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {1904#(and (= main_~ptr~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))))} is VALID [2018-11-23 12:59:03,182 INFO L273 TraceCheckUtils]: 37: Hoare triple {1904#(and (= main_~ptr~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))))} assume !(~uneq~0 != #t~mem12);havoc #t~mem12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset;~count~0 := 1; {1905#(not (= 0 main_~ptr~0.base))} is VALID [2018-11-23 12:59:03,182 INFO L273 TraceCheckUtils]: 38: Hoare triple {1905#(not (= 0 main_~ptr~0.base))} assume !(~ptr~0.base != 0 || ~ptr~0.offset != 0); {1886#false} is VALID [2018-11-23 12:59:03,183 INFO L273 TraceCheckUtils]: 39: Hoare triple {1886#false} assume ~count~0 != 1 + ~len~0; {1886#false} is VALID [2018-11-23 12:59:03,183 INFO L273 TraceCheckUtils]: 40: Hoare triple {1886#false} assume !false; {1886#false} is VALID [2018-11-23 12:59:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:59:03,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:59:03,195 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:59:03,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:59:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:03,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:59:03,312 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,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:03,320 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,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 12:59:03,323 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:03,323 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_31|]. (and (= |#valid| (store |v_#valid_31| |main_~#s~0.base| 1)) (= |main_~#s~0.offset| 0)) [2018-11-23 12:59:03,323 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1)) [2018-11-23 12:59:07,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:07,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:07,740 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:07,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 42 [2018-11-23 12:59:07,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-11-23 12:59:07,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:07,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:07,798 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:07,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:35 [2018-11-23 12:59:09,805 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:09,805 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_8|, v_subst_2]. (let ((.cse0 (store |v_#valid_BEFORE_CALL_8| v_subst_2 1))) (and (not (= 0 |main_#t~ret10.base|)) (= 1 (select |v_#valid_BEFORE_CALL_8| |main_~#s~0.base|)) (= 0 (select |v_#valid_BEFORE_CALL_8| v_subst_2)) (= (store .cse0 |main_#t~ret10.base| 1) |#valid|) (= |main_~#s~0.offset| 0) (= (select .cse0 |main_#t~ret10.base|) 0))) [2018-11-23 12:59:09,805 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_2]. (and (not (= 0 |main_#t~ret10.base|)) (not (= |main_~#s~0.base| |main_#t~ret10.base|)) (not (= |main_~#s~0.base| v_subst_2)) (= 1 (select |#valid| v_subst_2)) (= |main_~#s~0.offset| 0) (= 1 (select |#valid| |main_#t~ret10.base|)) (= (select |#valid| |main_~#s~0.base|) 1) (not (= |main_#t~ret10.base| v_subst_2))) [2018-11-23 12:59:15,710 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2018-11-23 12:59:19,712 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 12:59:19,738 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:19,743 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:19,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 12:59:19,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:60 [2018-11-23 12:59:21,848 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:21,848 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_37|, node_create_~temp~0.offset]. (let ((.cse0 (select |v_#memory_$Pointer$.base_37| dll_prepend_~new_head~1.base))) (and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= |v_#memory_$Pointer$.base_37| (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset (select .cse0 node_create_~temp~0.offset)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_37| dll_prepend_~new_head~1.base (store .cse0 (+ dll_prepend_~new_head~1.offset 4) (select (select |v_#memory_$Pointer$.base_37| dll_prepend_~head.base) dll_prepend_~head.offset)))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|))) [2018-11-23 12:59:21,849 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [node_create_~temp~0.offset, v_DerPreprocessor_4]. (and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (let ((.cse0 (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4))) (store .cse0 (+ dll_prepend_~new_head~1.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base .cse0) dll_prepend_~head.base) dll_prepend_~head.offset))))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|)) [2018-11-23 12:59:23,970 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-23 12:59:23,997 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 205 treesize of output 203 [2018-11-23 12:59:24,005 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 201 [2018-11-23 12:59:24,007 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:24,014 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:24,034 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:24,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:217, output treesize:213 [2018-11-23 12:59:26,038 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:26,039 WARN L384 uantifierElimination]: Input elimination task: ∃ [node_create_~temp~0.offset, v_DerPreprocessor_4, |v_#memory_$Pointer$.offset_34|]. (and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= |#memory_$Pointer$.base| (let ((.cse0 (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (let ((.cse2 (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4))) (store .cse2 (+ dll_prepend_~new_head~1.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base .cse2) dll_prepend_~head.base) dll_prepend_~head.offset)))))) (let ((.cse1 (select (select .cse0 dll_prepend_~head.base) dll_prepend_~head.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select |v_#memory_$Pointer$.offset_34| dll_prepend_~head.base) dll_prepend_~head.offset) 8) dll_prepend_~new_head~1.base))))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|)) [2018-11-23 12:59:26,039 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [node_create_~temp~0.offset, v_DerPreprocessor_4, v_arrayElimCell_22]. (and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |dll_prepend_#in~head.base| dll_prepend_~head.base) (= |#memory_$Pointer$.base| (let ((.cse0 (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (let ((.cse2 (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4))) (store .cse2 (+ dll_prepend_~new_head~1.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base .cse2) dll_prepend_~head.base) dll_prepend_~head.offset)))))) (let ((.cse1 (select (select .cse0 dll_prepend_~head.base) dll_prepend_~head.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_arrayElimCell_22 8) dll_prepend_~new_head~1.base))))) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|)) [2018-11-23 12:59:32,225 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 12:59:32,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 12:59:32,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 12:59:32,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:32,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:32,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 12:59:32,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:424, output treesize:445 [2018-11-23 12:59:33,970 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:33,971 WARN L384 uantifierElimination]: Input elimination task: ∃ [dll_prepend_~new_head~1.base, node_create_~temp~0.offset, v_DerPreprocessor_4, dll_prepend_~new_head~1.offset, v_arrayElimCell_22, |v_#memory_$Pointer$.offset_35|]. (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_35| |dll_prepend_#in~head.base| (store (select |v_#memory_$Pointer$.offset_35| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| dll_prepend_~new_head~1.offset))) (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |#memory_$Pointer$.base| (let ((.cse0 (let ((.cse1 (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (let ((.cse3 (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4))) (store .cse3 (+ dll_prepend_~new_head~1.offset 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base .cse3) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))))) (let ((.cse2 (select (select .cse1 |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ v_arrayElimCell_22 8) dll_prepend_~new_head~1.base)))))) (store .cse0 |dll_prepend_#in~head.base| (store (select .cse0 |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| dll_prepend_~new_head~1.base))))) [2018-11-23 12:59:33,971 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [dll_prepend_~new_head~1.base, node_create_~temp~0.offset, v_DerPreprocessor_4, v_arrayElimCell_22]. (and (= 0 (select |old(#valid)| dll_prepend_~new_head~1.base)) (= |#memory_$Pointer$.base| (let ((.cse0 (let ((.cse1 (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base (let ((.cse3 (store (store (store (select |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) (+ node_create_~temp~0.offset 8) 0) node_create_~temp~0.offset v_DerPreprocessor_4))) (store .cse3 (+ (select (select |#memory_$Pointer$.offset| |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|) 4) (select (select (store |old(#memory_$Pointer$.base)| dll_prepend_~new_head~1.base .cse3) |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|)))))) (let ((.cse2 (select (select .cse1 |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ v_arrayElimCell_22 8) dll_prepend_~new_head~1.base)))))) (store .cse0 |dll_prepend_#in~head.base| (store (select .cse0 |dll_prepend_#in~head.base|) |dll_prepend_#in~head.offset| dll_prepend_~new_head~1.base))))) [2018-11-23 13:00:05,265 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 61 [2018-11-23 13:00:05,281 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:05,284 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:05,286 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:05,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:05,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2018-11-23 13:00:05,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:05,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:05,441 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:05,493 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:00:05,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 179 [2018-11-23 13:00:05,624 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 81 treesize of output 73 [2018-11-23 13:00:05,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:05,631 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 73 treesize of output 73 [2018-11-23 13:00:05,639 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:05,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:05,642 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:05,649 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 65 treesize of output 86 [2018-11-23 13:00:05,652 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:05,674 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:05,692 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:05,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 117 [2018-11-23 13:00:05,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 64 [2018-11-23 13:00:05,764 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:05,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-23 13:00:06,011 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:00:06,012 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_8 input size 12 context size 12 output size 12 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 13:00:06,017 INFO L168 Benchmark]: Toolchain (without parser) took 136548.72 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -926.7 MB). Peak memory consumption was 153.9 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:06,018 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:00:06,019 INFO L168 Benchmark]: CACSL2BoogieTranslator took 851.91 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 723.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.7 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:06,019 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.45 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:00:06,019 INFO L168 Benchmark]: Boogie Preprocessor took 49.53 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:06,020 INFO L168 Benchmark]: RCFGBuilder took 1168.77 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:06,020 INFO L168 Benchmark]: TraceAbstraction took 134428.79 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 357.6 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -208.9 MB). Peak memory consumption was 148.7 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:06,023 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 851.91 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 723.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.7 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.45 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.53 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1168.77 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 134428.79 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 357.6 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -208.9 MB). Peak memory consumption was 148.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_8 input size 12 context size 12 output size 12 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_8 input size 12 context size 12 output size 12: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...