java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/sll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:59:30,544 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:59:30,546 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:59:30,558 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:59:30,559 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:59:30,560 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:59:30,561 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:59:30,563 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:59:30,565 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:59:30,565 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:59:30,566 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:59:30,567 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:59:30,568 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:59:30,569 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:59:30,570 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:59:30,571 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:59:30,572 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:59:30,574 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:59:30,576 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:59:30,577 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:59:30,579 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:59:30,580 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:59:30,582 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:59:30,583 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:59:30,583 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:59:30,584 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:59:30,585 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:59:30,586 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:59:30,587 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:59:30,588 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:59:30,588 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:59:30,589 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:59:30,589 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:59:30,590 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:59:30,591 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:59:30,591 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:59:30,592 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:59:30,619 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:59:30,619 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:59:30,622 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:59:30,622 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:59:30,626 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:59:30,626 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:59:30,626 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:59:30,626 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:59:30,627 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:59:30,627 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:59:30,627 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:59:30,627 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:59:30,627 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:59:30,628 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:59:30,628 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:59:30,628 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:59:30,628 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:59:30,628 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:59:30,629 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:59:30,629 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:59:30,629 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:59:30,629 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:59:30,629 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:59:30,629 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:59:30,631 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:59:30,631 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:59:30,631 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:59:30,631 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:59:30,632 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:59:30,632 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:59:30,632 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:59:30,684 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:59:30,704 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:59:30,708 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:59:30,710 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:59:30,711 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:59:30,711 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:59:30,781 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a97ffa39/435a3b4cb5ba46cfb07743f8531321b1/FLAGdcc7a7f6c [2018-11-23 12:59:31,365 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:59:31,366 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:59:31,379 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a97ffa39/435a3b4cb5ba46cfb07743f8531321b1/FLAGdcc7a7f6c [2018-11-23 12:59:31,605 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a97ffa39/435a3b4cb5ba46cfb07743f8531321b1 [2018-11-23 12:59:31,614 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:59:31,616 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:59:31,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:59:31,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:59:31,621 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:59:31,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:59:31" (1/1) ... [2018-11-23 12:59:31,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e4c7f0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:31, skipping insertion in model container [2018-11-23 12:59:31,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:59:31" (1/1) ... [2018-11-23 12:59:31,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:59:31,686 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:59:32,121 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:59:32,134 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:59:32,219 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:59:32,306 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:59:32,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:32 WrapperNode [2018-11-23 12:59:32,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:59:32,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:59:32,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:59:32,308 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:59:32,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:32" (1/1) ... [2018-11-23 12:59:32,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:32" (1/1) ... [2018-11-23 12:59:32,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:59:32,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:59:32,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:59:32,463 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:59:32,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:32" (1/1) ... [2018-11-23 12:59:32,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:32" (1/1) ... [2018-11-23 12:59:32,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:32" (1/1) ... [2018-11-23 12:59:32,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:32" (1/1) ... [2018-11-23 12:59:32,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:32" (1/1) ... [2018-11-23 12:59:32,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:32" (1/1) ... [2018-11-23 12:59:32,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:32" (1/1) ... [2018-11-23 12:59:32,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:59:32,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:59:32,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:59:32,552 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:59:32,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:59:32,619 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 12:59:32,619 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 12:59:32,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:59:32,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:59:32,620 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:59:32,621 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:59:32,621 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 12:59:32,621 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 12:59:32,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:59:32,622 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 12:59:32,622 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 12:59:32,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:59:32,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:59:32,622 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:59:32,623 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:59:32,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:59:32,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:59:32,623 INFO L130 BoogieDeclarations]: Found specification of procedure sll_prepend [2018-11-23 12:59:32,624 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_prepend [2018-11-23 12:59:32,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:59:32,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 12:59:32,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:59:32,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:59:33,594 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:59:33,594 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:59:33,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:59:33 BoogieIcfgContainer [2018-11-23 12:59:33,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:59:33,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:59:33,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:59:33,600 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:59:33,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:59:31" (1/3) ... [2018-11-23 12:59:33,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3919d6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:59:33, skipping insertion in model container [2018-11-23 12:59:33,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:32" (2/3) ... [2018-11-23 12:59:33,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3919d6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:59:33, skipping insertion in model container [2018-11-23 12:59:33,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:59:33" (3/3) ... [2018-11-23 12:59:33,606 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:59:33,617 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:59:33,628 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:59:33,647 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:59:33,680 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:59:33,680 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:59:33,680 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:59:33,680 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:59:33,681 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:59:33,681 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:59:33,681 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:59:33,681 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:59:33,681 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:59:33,699 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-11-23 12:59:33,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:59:33,707 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:59:33,708 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] [2018-11-23 12:59:33,710 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:59:33,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:59:33,716 INFO L82 PathProgramCache]: Analyzing trace with hash -703504676, now seen corresponding path program 1 times [2018-11-23 12:59:33,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:59:33,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:59:33,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:33,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:59:33,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:33,934 INFO L256 TraceCheckUtils]: 0: Hoare triple {49#true} call ULTIMATE.init(); {49#true} is VALID [2018-11-23 12:59:33,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {49#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {49#true} is VALID [2018-11-23 12:59:33,938 INFO L273 TraceCheckUtils]: 2: Hoare triple {49#true} assume true; {49#true} is VALID [2018-11-23 12:59:33,939 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {49#true} {49#true} #99#return; {49#true} is VALID [2018-11-23 12:59:33,939 INFO L256 TraceCheckUtils]: 4: Hoare triple {49#true} call #t~ret14 := main(); {49#true} is VALID [2018-11-23 12:59:33,939 INFO L273 TraceCheckUtils]: 5: Hoare triple {49#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {49#true} is VALID [2018-11-23 12:59:33,940 INFO L256 TraceCheckUtils]: 6: Hoare triple {49#true} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {49#true} is VALID [2018-11-23 12:59:33,940 INFO L273 TraceCheckUtils]: 7: Hoare triple {49#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {49#true} is VALID [2018-11-23 12:59:33,953 INFO L273 TraceCheckUtils]: 8: Hoare triple {49#true} assume !true; {50#false} is VALID [2018-11-23 12:59:33,954 INFO L273 TraceCheckUtils]: 9: Hoare triple {50#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {50#false} is VALID [2018-11-23 12:59:33,954 INFO L273 TraceCheckUtils]: 10: Hoare triple {50#false} assume true; {50#false} is VALID [2018-11-23 12:59:33,955 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {50#false} {49#true} #89#return; {50#false} is VALID [2018-11-23 12:59:33,955 INFO L273 TraceCheckUtils]: 12: Hoare triple {50#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset; {50#false} is VALID [2018-11-23 12:59:33,955 INFO L256 TraceCheckUtils]: 13: Hoare triple {50#false} call sll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {49#true} is VALID [2018-11-23 12:59:33,956 INFO L273 TraceCheckUtils]: 14: Hoare triple {49#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {49#true} is VALID [2018-11-23 12:59:33,956 INFO L256 TraceCheckUtils]: 15: Hoare triple {49#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {49#true} is VALID [2018-11-23 12:59:33,956 INFO L273 TraceCheckUtils]: 16: Hoare triple {49#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {49#true} is VALID [2018-11-23 12:59:33,957 INFO L273 TraceCheckUtils]: 17: Hoare triple {49#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {49#true} is VALID [2018-11-23 12:59:33,957 INFO L273 TraceCheckUtils]: 18: Hoare triple {49#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {49#true} is VALID [2018-11-23 12:59:33,957 INFO L273 TraceCheckUtils]: 19: Hoare triple {49#true} assume true; {49#true} is VALID [2018-11-23 12:59:33,958 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {49#true} {49#true} #95#return; {49#true} is VALID [2018-11-23 12:59:33,958 INFO L273 TraceCheckUtils]: 21: Hoare triple {49#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 write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {49#true} is VALID [2018-11-23 12:59:33,959 INFO L273 TraceCheckUtils]: 22: Hoare triple {49#true} assume true; {49#true} is VALID [2018-11-23 12:59:33,959 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {49#true} {50#false} #91#return; {50#false} is VALID [2018-11-23 12:59:33,959 INFO L273 TraceCheckUtils]: 24: Hoare triple {50#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;~count~0 := 0; {50#false} is VALID [2018-11-23 12:59:33,960 INFO L273 TraceCheckUtils]: 25: Hoare triple {50#false} assume !true; {50#false} is VALID [2018-11-23 12:59:33,960 INFO L273 TraceCheckUtils]: 26: Hoare triple {50#false} assume ~count~0 != 1 + ~len~0; {50#false} is VALID [2018-11-23 12:59:33,960 INFO L273 TraceCheckUtils]: 27: Hoare triple {50#false} assume !false; {50#false} is VALID [2018-11-23 12:59:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:59:33,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:59:33,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:59:33,975 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2018-11-23 12:59:33,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:59:33,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:59:34,087 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:34,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:59:34,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:59:34,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:59:34,098 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 2 states. [2018-11-23 12:59:34,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:34,403 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2018-11-23 12:59:34,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:59:34,403 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2018-11-23 12:59:34,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:59:34,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:59:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 96 transitions. [2018-11-23 12:59:34,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:59:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 96 transitions. [2018-11-23 12:59:34,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 96 transitions. [2018-11-23 12:59:35,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:35,111 INFO L225 Difference]: With dead ends: 80 [2018-11-23 12:59:35,111 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 12:59:35,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:59:35,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 12:59:35,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 12:59:35,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:59:35,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 12:59:35,184 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 12:59:35,184 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 12:59:35,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:35,190 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-23 12:59:35,190 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-23 12:59:35,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:35,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:35,192 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 12:59:35,192 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 12:59:35,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:35,197 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-23 12:59:35,197 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-23 12:59:35,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:35,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:35,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:59:35,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:59:35,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:59:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-23 12:59:35,204 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 28 [2018-11-23 12:59:35,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:59:35,205 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-23 12:59:35,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:59:35,205 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-23 12:59:35,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:59:35,207 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:59:35,207 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] [2018-11-23 12:59:35,207 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:59:35,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:59:35,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1727886821, now seen corresponding path program 1 times [2018-11-23 12:59:35,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:59:35,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:59:35,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:35,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:59:35,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:35,648 INFO L256 TraceCheckUtils]: 0: Hoare triple {278#true} call ULTIMATE.init(); {278#true} is VALID [2018-11-23 12:59:35,649 INFO L273 TraceCheckUtils]: 1: Hoare triple {278#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {278#true} is VALID [2018-11-23 12:59:35,649 INFO L273 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2018-11-23 12:59:35,650 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} #99#return; {278#true} is VALID [2018-11-23 12:59:35,650 INFO L256 TraceCheckUtils]: 4: Hoare triple {278#true} call #t~ret14 := main(); {278#true} is VALID [2018-11-23 12:59:35,651 INFO L273 TraceCheckUtils]: 5: Hoare triple {278#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {278#true} is VALID [2018-11-23 12:59:35,651 INFO L256 TraceCheckUtils]: 6: Hoare triple {278#true} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {278#true} is VALID [2018-11-23 12:59:35,651 INFO L273 TraceCheckUtils]: 7: Hoare triple {278#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {278#true} is VALID [2018-11-23 12:59:35,651 INFO L273 TraceCheckUtils]: 8: Hoare triple {278#true} assume !(~len > 0); {278#true} is VALID [2018-11-23 12:59:35,652 INFO L273 TraceCheckUtils]: 9: Hoare triple {278#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {278#true} is VALID [2018-11-23 12:59:35,652 INFO L273 TraceCheckUtils]: 10: Hoare triple {278#true} assume true; {278#true} is VALID [2018-11-23 12:59:35,653 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {278#true} {278#true} #89#return; {278#true} is VALID [2018-11-23 12:59:35,653 INFO L273 TraceCheckUtils]: 12: Hoare triple {278#true} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset; {278#true} is VALID [2018-11-23 12:59:35,653 INFO L256 TraceCheckUtils]: 13: Hoare triple {278#true} call sll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {278#true} is VALID [2018-11-23 12:59:35,662 INFO L273 TraceCheckUtils]: 14: Hoare triple {278#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {280#(and (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|))} is VALID [2018-11-23 12:59:35,663 INFO L256 TraceCheckUtils]: 15: Hoare triple {280#(and (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {278#true} is VALID [2018-11-23 12:59:35,664 INFO L273 TraceCheckUtils]: 16: Hoare triple {278#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {281#(not (= 0 node_create_~temp~0.base))} is VALID [2018-11-23 12:59:35,664 INFO L273 TraceCheckUtils]: 17: Hoare triple {281#(not (= 0 node_create_~temp~0.base))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {281#(not (= 0 node_create_~temp~0.base))} is VALID [2018-11-23 12:59:35,667 INFO L273 TraceCheckUtils]: 18: Hoare triple {281#(not (= 0 node_create_~temp~0.base))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {282#(not (= 0 |node_create_#res.base|))} is VALID [2018-11-23 12:59:35,669 INFO L273 TraceCheckUtils]: 19: Hoare triple {282#(not (= 0 |node_create_#res.base|))} assume true; {282#(not (= 0 |node_create_#res.base|))} is VALID [2018-11-23 12:59:35,671 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {282#(not (= 0 |node_create_#res.base|))} {280#(and (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|))} #95#return; {283#(and (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (not (= 0 |sll_prepend_#t~ret6.base|)))} is VALID [2018-11-23 12:59:35,673 INFO L273 TraceCheckUtils]: 21: Hoare triple {283#(and (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (not (= 0 |sll_prepend_#t~ret6.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 write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {284#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)))} is VALID [2018-11-23 12:59:35,677 INFO L273 TraceCheckUtils]: 22: Hoare triple {284#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)))} assume true; {284#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)))} is VALID [2018-11-23 12:59:35,684 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {284#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)))} {278#true} #91#return; {285#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 12:59:35,701 INFO L273 TraceCheckUtils]: 24: Hoare triple {285#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;~count~0 := 0; {286#(not (= 0 main_~ptr~0.base))} is VALID [2018-11-23 12:59:35,702 INFO L273 TraceCheckUtils]: 25: Hoare triple {286#(not (= 0 main_~ptr~0.base))} assume !(~ptr~0.base != 0 || ~ptr~0.offset != 0); {279#false} is VALID [2018-11-23 12:59:35,702 INFO L273 TraceCheckUtils]: 26: Hoare triple {279#false} assume ~count~0 != 1 + ~len~0; {279#false} is VALID [2018-11-23 12:59:35,702 INFO L273 TraceCheckUtils]: 27: Hoare triple {279#false} assume !false; {279#false} is VALID [2018-11-23 12:59:35,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:59:35,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:59:35,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 12:59:35,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 12:59:35,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:59:35,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:59:35,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:35,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:59:35,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:59:35,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:59:35,750 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 9 states. [2018-11-23 12:59:36,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:36,405 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-11-23 12:59:36,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:59:36,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 12:59:36,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:59:36,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:59:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2018-11-23 12:59:36,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:59:36,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2018-11-23 12:59:36,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 43 transitions. [2018-11-23 12:59:36,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:36,481 INFO L225 Difference]: With dead ends: 40 [2018-11-23 12:59:36,482 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:59:36,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:59:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:59:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-11-23 12:59:36,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:59:36,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 34 states. [2018-11-23 12:59:36,509 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 34 states. [2018-11-23 12:59:36,509 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 34 states. [2018-11-23 12:59:36,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:36,513 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-23 12:59:36,514 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-23 12:59:36,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:36,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:36,515 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 37 states. [2018-11-23 12:59:36,515 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 37 states. [2018-11-23 12:59:36,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:36,519 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-23 12:59:36,519 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-23 12:59:36,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:36,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:36,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:59:36,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:59:36,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:59:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-23 12:59:36,524 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 28 [2018-11-23 12:59:36,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:59:36,524 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-23 12:59:36,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:59:36,525 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 12:59:36,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:59:36,526 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:59:36,526 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] [2018-11-23 12:59:36,526 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:59:36,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:59:36,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1727885147, now seen corresponding path program 1 times [2018-11-23 12:59:36,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:59:36,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:59:36,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:36,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:59:36,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:36,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {475#true} call ULTIMATE.init(); {475#true} is VALID [2018-11-23 12:59:36,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {475#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {475#true} is VALID [2018-11-23 12:59:36,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {475#true} assume true; {475#true} is VALID [2018-11-23 12:59:36,676 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {475#true} {475#true} #99#return; {475#true} is VALID [2018-11-23 12:59:36,677 INFO L256 TraceCheckUtils]: 4: Hoare triple {475#true} call #t~ret14 := main(); {475#true} is VALID [2018-11-23 12:59:36,684 INFO L273 TraceCheckUtils]: 5: Hoare triple {475#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {477#(<= 2 main_~len~0)} is VALID [2018-11-23 12:59:36,685 INFO L256 TraceCheckUtils]: 6: Hoare triple {477#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {475#true} is VALID [2018-11-23 12:59:36,687 INFO L273 TraceCheckUtils]: 7: Hoare triple {475#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {478#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:36,692 INFO L273 TraceCheckUtils]: 8: Hoare triple {478#(<= |sll_create_#in~len| sll_create_~len)} assume !(~len > 0); {479#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 12:59:36,693 INFO L273 TraceCheckUtils]: 9: Hoare triple {479#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {479#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 12:59:36,694 INFO L273 TraceCheckUtils]: 10: Hoare triple {479#(<= |sll_create_#in~len| 0)} assume true; {479#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 12:59:36,696 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {479#(<= |sll_create_#in~len| 0)} {477#(<= 2 main_~len~0)} #89#return; {476#false} is VALID [2018-11-23 12:59:36,696 INFO L273 TraceCheckUtils]: 12: Hoare triple {476#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset; {476#false} is VALID [2018-11-23 12:59:36,696 INFO L256 TraceCheckUtils]: 13: Hoare triple {476#false} call sll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {475#true} is VALID [2018-11-23 12:59:36,697 INFO L273 TraceCheckUtils]: 14: Hoare triple {475#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {475#true} is VALID [2018-11-23 12:59:36,697 INFO L256 TraceCheckUtils]: 15: Hoare triple {475#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {475#true} is VALID [2018-11-23 12:59:36,697 INFO L273 TraceCheckUtils]: 16: Hoare triple {475#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {475#true} is VALID [2018-11-23 12:59:36,698 INFO L273 TraceCheckUtils]: 17: Hoare triple {475#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {475#true} is VALID [2018-11-23 12:59:36,698 INFO L273 TraceCheckUtils]: 18: Hoare triple {475#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {475#true} is VALID [2018-11-23 12:59:36,698 INFO L273 TraceCheckUtils]: 19: Hoare triple {475#true} assume true; {475#true} is VALID [2018-11-23 12:59:36,698 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {475#true} {475#true} #95#return; {475#true} is VALID [2018-11-23 12:59:36,699 INFO L273 TraceCheckUtils]: 21: Hoare triple {475#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 write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {475#true} is VALID [2018-11-23 12:59:36,699 INFO L273 TraceCheckUtils]: 22: Hoare triple {475#true} assume true; {475#true} is VALID [2018-11-23 12:59:36,699 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {475#true} {476#false} #91#return; {476#false} is VALID [2018-11-23 12:59:36,700 INFO L273 TraceCheckUtils]: 24: Hoare triple {476#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;~count~0 := 0; {476#false} is VALID [2018-11-23 12:59:36,700 INFO L273 TraceCheckUtils]: 25: Hoare triple {476#false} assume !!(~ptr~0.base != 0 || ~ptr~0.offset != 0);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4);~temp~2.base, ~temp~2.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call #t~mem11 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {476#false} is VALID [2018-11-23 12:59:36,700 INFO L273 TraceCheckUtils]: 26: Hoare triple {476#false} assume ~data~0 != #t~mem11;havoc #t~mem11; {476#false} is VALID [2018-11-23 12:59:36,701 INFO L273 TraceCheckUtils]: 27: Hoare triple {476#false} assume !false; {476#false} is VALID [2018-11-23 12:59:36,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:59:36,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:59:36,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:59:36,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 12:59:36,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:59:36,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:59:36,814 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:36,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:59:36,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:59:36,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:59:36,815 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 5 states. [2018-11-23 12:59:37,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:37,090 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-11-23 12:59:37,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:59:37,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 12:59:37,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:59:37,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:59:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-23 12:59:37,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:59:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-23 12:59:37,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2018-11-23 12:59:37,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:37,205 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:59:37,205 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:59:37,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:59:37,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:59:37,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-11-23 12:59:37,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:59:37,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 35 states. [2018-11-23 12:59:37,236 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 35 states. [2018-11-23 12:59:37,236 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 35 states. [2018-11-23 12:59:37,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:37,240 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 12:59:37,240 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 12:59:37,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:37,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:37,241 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 38 states. [2018-11-23 12:59:37,241 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 38 states. [2018-11-23 12:59:37,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:37,245 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 12:59:37,245 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 12:59:37,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:37,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:37,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:59:37,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:59:37,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:59:37,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-23 12:59:37,249 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 28 [2018-11-23 12:59:37,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:59:37,249 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-23 12:59:37,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:59:37,249 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 12:59:37,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:59:37,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:59:37,251 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] [2018-11-23 12:59:37,251 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:59:37,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:59:37,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1366634854, now seen corresponding path program 1 times [2018-11-23 12:59:37,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:59:37,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:59:37,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:37,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:59:37,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:37,402 INFO L256 TraceCheckUtils]: 0: Hoare triple {695#true} call ULTIMATE.init(); {695#true} is VALID [2018-11-23 12:59:37,402 INFO L273 TraceCheckUtils]: 1: Hoare triple {695#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {695#true} is VALID [2018-11-23 12:59:37,403 INFO L273 TraceCheckUtils]: 2: Hoare triple {695#true} assume true; {695#true} is VALID [2018-11-23 12:59:37,403 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {695#true} {695#true} #99#return; {695#true} is VALID [2018-11-23 12:59:37,404 INFO L256 TraceCheckUtils]: 4: Hoare triple {695#true} call #t~ret14 := main(); {695#true} is VALID [2018-11-23 12:59:37,405 INFO L273 TraceCheckUtils]: 5: Hoare triple {695#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {697#(<= 2 main_~len~0)} is VALID [2018-11-23 12:59:37,406 INFO L256 TraceCheckUtils]: 6: Hoare triple {697#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {695#true} is VALID [2018-11-23 12:59:37,406 INFO L273 TraceCheckUtils]: 7: Hoare triple {695#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {698#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:37,411 INFO L273 TraceCheckUtils]: 8: Hoare triple {698#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {698#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:37,411 INFO L256 TraceCheckUtils]: 9: Hoare triple {698#(<= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {695#true} is VALID [2018-11-23 12:59:37,411 INFO L273 TraceCheckUtils]: 10: Hoare triple {695#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {695#true} is VALID [2018-11-23 12:59:37,412 INFO L273 TraceCheckUtils]: 11: Hoare triple {695#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {695#true} is VALID [2018-11-23 12:59:37,412 INFO L273 TraceCheckUtils]: 12: Hoare triple {695#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {695#true} is VALID [2018-11-23 12:59:37,412 INFO L273 TraceCheckUtils]: 13: Hoare triple {695#true} assume true; {695#true} is VALID [2018-11-23 12:59:37,413 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {695#true} {698#(<= |sll_create_#in~len| sll_create_~len)} #97#return; {698#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:37,414 INFO L273 TraceCheckUtils]: 15: Hoare triple {698#(<= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {698#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:37,414 INFO L273 TraceCheckUtils]: 16: Hoare triple {698#(<= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {699#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 12:59:37,416 INFO L273 TraceCheckUtils]: 17: Hoare triple {699#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {700#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:37,416 INFO L273 TraceCheckUtils]: 18: Hoare triple {700#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {700#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:37,422 INFO L273 TraceCheckUtils]: 19: Hoare triple {700#(<= |sll_create_#in~len| 1)} assume true; {700#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:37,429 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {700#(<= |sll_create_#in~len| 1)} {697#(<= 2 main_~len~0)} #89#return; {696#false} is VALID [2018-11-23 12:59:37,429 INFO L273 TraceCheckUtils]: 21: Hoare triple {696#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset; {696#false} is VALID [2018-11-23 12:59:37,430 INFO L256 TraceCheckUtils]: 22: Hoare triple {696#false} call sll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {695#true} is VALID [2018-11-23 12:59:37,430 INFO L273 TraceCheckUtils]: 23: Hoare triple {695#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {695#true} is VALID [2018-11-23 12:59:37,430 INFO L256 TraceCheckUtils]: 24: Hoare triple {695#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {695#true} is VALID [2018-11-23 12:59:37,430 INFO L273 TraceCheckUtils]: 25: Hoare triple {695#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {695#true} is VALID [2018-11-23 12:59:37,430 INFO L273 TraceCheckUtils]: 26: Hoare triple {695#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {695#true} is VALID [2018-11-23 12:59:37,431 INFO L273 TraceCheckUtils]: 27: Hoare triple {695#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {695#true} is VALID [2018-11-23 12:59:37,431 INFO L273 TraceCheckUtils]: 28: Hoare triple {695#true} assume true; {695#true} is VALID [2018-11-23 12:59:37,431 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {695#true} {695#true} #95#return; {695#true} is VALID [2018-11-23 12:59:37,431 INFO L273 TraceCheckUtils]: 30: Hoare triple {695#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 write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {695#true} is VALID [2018-11-23 12:59:37,432 INFO L273 TraceCheckUtils]: 31: Hoare triple {695#true} assume true; {695#true} is VALID [2018-11-23 12:59:37,432 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {695#true} {696#false} #91#return; {696#false} is VALID [2018-11-23 12:59:37,432 INFO L273 TraceCheckUtils]: 33: Hoare triple {696#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;~count~0 := 0; {696#false} is VALID [2018-11-23 12:59:37,433 INFO L273 TraceCheckUtils]: 34: Hoare triple {696#false} assume !!(~ptr~0.base != 0 || ~ptr~0.offset != 0);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4);~temp~2.base, ~temp~2.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call #t~mem11 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {696#false} is VALID [2018-11-23 12:59:37,433 INFO L273 TraceCheckUtils]: 35: Hoare triple {696#false} assume ~data~0 != #t~mem11;havoc #t~mem11; {696#false} is VALID [2018-11-23 12:59:37,433 INFO L273 TraceCheckUtils]: 36: Hoare triple {696#false} assume !false; {696#false} is VALID [2018-11-23 12:59:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:59:37,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:59:37,436 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:59:37,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:59:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:37,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:59:37,891 INFO L256 TraceCheckUtils]: 0: Hoare triple {695#true} call ULTIMATE.init(); {695#true} is VALID [2018-11-23 12:59:37,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {695#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {695#true} is VALID [2018-11-23 12:59:37,892 INFO L273 TraceCheckUtils]: 2: Hoare triple {695#true} assume true; {695#true} is VALID [2018-11-23 12:59:37,893 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {695#true} {695#true} #99#return; {695#true} is VALID [2018-11-23 12:59:37,893 INFO L256 TraceCheckUtils]: 4: Hoare triple {695#true} call #t~ret14 := main(); {695#true} is VALID [2018-11-23 12:59:37,894 INFO L273 TraceCheckUtils]: 5: Hoare triple {695#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {697#(<= 2 main_~len~0)} is VALID [2018-11-23 12:59:37,894 INFO L256 TraceCheckUtils]: 6: Hoare triple {697#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {695#true} is VALID [2018-11-23 12:59:37,898 INFO L273 TraceCheckUtils]: 7: Hoare triple {695#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {698#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:37,903 INFO L273 TraceCheckUtils]: 8: Hoare triple {698#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {698#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:37,903 INFO L256 TraceCheckUtils]: 9: Hoare triple {698#(<= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {695#true} is VALID [2018-11-23 12:59:37,903 INFO L273 TraceCheckUtils]: 10: Hoare triple {695#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {695#true} is VALID [2018-11-23 12:59:37,904 INFO L273 TraceCheckUtils]: 11: Hoare triple {695#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {695#true} is VALID [2018-11-23 12:59:37,904 INFO L273 TraceCheckUtils]: 12: Hoare triple {695#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {695#true} is VALID [2018-11-23 12:59:37,904 INFO L273 TraceCheckUtils]: 13: Hoare triple {695#true} assume true; {695#true} is VALID [2018-11-23 12:59:37,905 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {695#true} {698#(<= |sll_create_#in~len| sll_create_~len)} #97#return; {698#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:37,909 INFO L273 TraceCheckUtils]: 15: Hoare triple {698#(<= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {698#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:37,916 INFO L273 TraceCheckUtils]: 16: Hoare triple {698#(<= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {699#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 12:59:37,917 INFO L273 TraceCheckUtils]: 17: Hoare triple {699#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {700#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:37,918 INFO L273 TraceCheckUtils]: 18: Hoare triple {700#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {700#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:37,919 INFO L273 TraceCheckUtils]: 19: Hoare triple {700#(<= |sll_create_#in~len| 1)} assume true; {700#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:37,920 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {700#(<= |sll_create_#in~len| 1)} {697#(<= 2 main_~len~0)} #89#return; {696#false} is VALID [2018-11-23 12:59:37,920 INFO L273 TraceCheckUtils]: 21: Hoare triple {696#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset; {696#false} is VALID [2018-11-23 12:59:37,920 INFO L256 TraceCheckUtils]: 22: Hoare triple {696#false} call sll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {696#false} is VALID [2018-11-23 12:59:37,920 INFO L273 TraceCheckUtils]: 23: Hoare triple {696#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {696#false} is VALID [2018-11-23 12:59:37,921 INFO L256 TraceCheckUtils]: 24: Hoare triple {696#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {696#false} is VALID [2018-11-23 12:59:37,921 INFO L273 TraceCheckUtils]: 25: Hoare triple {696#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {696#false} is VALID [2018-11-23 12:59:37,921 INFO L273 TraceCheckUtils]: 26: Hoare triple {696#false} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {696#false} is VALID [2018-11-23 12:59:37,921 INFO L273 TraceCheckUtils]: 27: Hoare triple {696#false} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {696#false} is VALID [2018-11-23 12:59:37,921 INFO L273 TraceCheckUtils]: 28: Hoare triple {696#false} assume true; {696#false} is VALID [2018-11-23 12:59:37,922 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {696#false} {696#false} #95#return; {696#false} is VALID [2018-11-23 12:59:37,922 INFO L273 TraceCheckUtils]: 30: Hoare triple {696#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 write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {696#false} is VALID [2018-11-23 12:59:37,922 INFO L273 TraceCheckUtils]: 31: Hoare triple {696#false} assume true; {696#false} is VALID [2018-11-23 12:59:37,923 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {696#false} {696#false} #91#return; {696#false} is VALID [2018-11-23 12:59:37,923 INFO L273 TraceCheckUtils]: 33: Hoare triple {696#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;~count~0 := 0; {696#false} is VALID [2018-11-23 12:59:37,923 INFO L273 TraceCheckUtils]: 34: Hoare triple {696#false} assume !!(~ptr~0.base != 0 || ~ptr~0.offset != 0);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4);~temp~2.base, ~temp~2.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call #t~mem11 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {696#false} is VALID [2018-11-23 12:59:37,924 INFO L273 TraceCheckUtils]: 35: Hoare triple {696#false} assume ~data~0 != #t~mem11;havoc #t~mem11; {696#false} is VALID [2018-11-23 12:59:37,924 INFO L273 TraceCheckUtils]: 36: Hoare triple {696#false} assume !false; {696#false} is VALID [2018-11-23 12:59:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:59:37,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:59:37,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 12:59:37,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-23 12:59:37,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:59:37,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:59:38,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:38,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:59:38,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:59:38,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:59:38,174 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 6 states. [2018-11-23 12:59:38,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:38,600 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-23 12:59:38,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:59:38,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-23 12:59:38,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:59:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:59:38,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2018-11-23 12:59:38,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:59:38,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2018-11-23 12:59:38,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2018-11-23 12:59:38,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:38,795 INFO L225 Difference]: With dead ends: 64 [2018-11-23 12:59:38,795 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:59:38,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:59:38,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:59:38,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-11-23 12:59:38,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:59:38,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 39 states. [2018-11-23 12:59:38,836 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 39 states. [2018-11-23 12:59:38,836 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 39 states. [2018-11-23 12:59:38,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:38,840 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-23 12:59:38,840 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 12:59:38,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:38,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:38,841 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 42 states. [2018-11-23 12:59:38,842 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 42 states. [2018-11-23 12:59:38,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:38,845 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-23 12:59:38,845 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 12:59:38,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:38,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:38,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:59:38,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:59:38,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:59:38,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 12:59:38,849 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 37 [2018-11-23 12:59:38,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:59:38,850 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 12:59:38,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:59:38,850 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:59:38,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:59:38,851 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:59:38,852 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:59:38,852 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:59:38,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:59:38,852 INFO L82 PathProgramCache]: Analyzing trace with hash 190110149, now seen corresponding path program 2 times [2018-11-23 12:59:38,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:59:38,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:59:38,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:38,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:59:38,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:39,389 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-23 12:59:40,190 INFO L256 TraceCheckUtils]: 0: Hoare triple {1044#true} call ULTIMATE.init(); {1044#true} is VALID [2018-11-23 12:59:40,191 INFO L273 TraceCheckUtils]: 1: Hoare triple {1044#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1044#true} is VALID [2018-11-23 12:59:40,191 INFO L273 TraceCheckUtils]: 2: Hoare triple {1044#true} assume true; {1044#true} is VALID [2018-11-23 12:59:40,191 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1044#true} {1044#true} #99#return; {1044#true} is VALID [2018-11-23 12:59:40,192 INFO L256 TraceCheckUtils]: 4: Hoare triple {1044#true} call #t~ret14 := main(); {1044#true} is VALID [2018-11-23 12:59:40,193 INFO L273 TraceCheckUtils]: 5: Hoare triple {1044#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1046#(and (<= main_~data~0 1) (<= 1 main_~data~0) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:40,195 INFO L256 TraceCheckUtils]: 6: Hoare triple {1046#(and (<= main_~data~0 1) (<= 1 main_~data~0) (= (select |#valid| |main_~#s~0.base|) 1))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {1047#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:40,195 INFO L273 TraceCheckUtils]: 7: Hoare triple {1047#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1047#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:40,196 INFO L273 TraceCheckUtils]: 8: Hoare triple {1047#(= |#valid| |old(#valid)|)} assume !!(~len > 0); {1047#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:40,197 INFO L256 TraceCheckUtils]: 9: Hoare triple {1047#(= |#valid| |old(#valid)|)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1047#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:40,199 INFO L273 TraceCheckUtils]: 10: Hoare triple {1047#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1048#(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:40,200 INFO L273 TraceCheckUtils]: 11: Hoare triple {1048#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1048#(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:40,202 INFO L273 TraceCheckUtils]: 12: Hoare triple {1048#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1048#(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:40,203 INFO L273 TraceCheckUtils]: 13: Hoare triple {1048#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {1048#(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:40,206 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1048#(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|)))))} {1047#(= |#valid| |old(#valid)|)} #97#return; {1048#(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:40,208 INFO L273 TraceCheckUtils]: 15: Hoare triple {1048#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1048#(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:40,209 INFO L273 TraceCheckUtils]: 16: Hoare triple {1048#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1048#(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:40,211 INFO L273 TraceCheckUtils]: 17: Hoare triple {1048#(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); {1048#(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:40,212 INFO L256 TraceCheckUtils]: 18: Hoare triple {1048#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1047#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:40,214 INFO L273 TraceCheckUtils]: 19: Hoare triple {1047#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1049#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:40,215 INFO L273 TraceCheckUtils]: 20: Hoare triple {1049#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1049#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:40,216 INFO L273 TraceCheckUtils]: 21: Hoare triple {1049#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1049#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:40,218 INFO L273 TraceCheckUtils]: 22: Hoare triple {1049#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {1049#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:40,223 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1049#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} {1048#(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|)))))} #97#return; {1050#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:40,224 INFO L273 TraceCheckUtils]: 24: Hoare triple {1050#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1050#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:40,226 INFO L273 TraceCheckUtils]: 25: Hoare triple {1050#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1050#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:40,228 INFO L273 TraceCheckUtils]: 26: Hoare triple {1050#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} assume !(~len > 0); {1050#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:40,230 INFO L273 TraceCheckUtils]: 27: Hoare triple {1050#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1050#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:40,233 INFO L273 TraceCheckUtils]: 28: Hoare triple {1050#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} assume true; {1050#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:40,236 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1050#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} {1046#(and (<= main_~data~0 1) (<= 1 main_~data~0) (= (select |#valid| |main_~#s~0.base|) 1))} #89#return; {1046#(and (<= main_~data~0 1) (<= 1 main_~data~0) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:40,238 INFO L273 TraceCheckUtils]: 30: Hoare triple {1046#(and (<= main_~data~0 1) (<= 1 main_~data~0) (= (select |#valid| |main_~#s~0.base|) 1))} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset; {1046#(and (<= main_~data~0 1) (<= 1 main_~data~0) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:40,239 INFO L256 TraceCheckUtils]: 31: Hoare triple {1046#(and (<= main_~data~0 1) (<= 1 main_~data~0) (= (select |#valid| |main_~#s~0.base|) 1))} call sll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {1047#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:40,240 INFO L273 TraceCheckUtils]: 32: Hoare triple {1047#(= |#valid| |old(#valid)|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1051#(and (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (<= |sll_prepend_#in~data| sll_prepend_~data) (<= sll_prepend_~data |sll_prepend_#in~data|) (= |#valid| |old(#valid)|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|))} is VALID [2018-11-23 12:59:40,242 INFO L256 TraceCheckUtils]: 33: Hoare triple {1051#(and (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (<= |sll_prepend_#in~data| sll_prepend_~data) (<= sll_prepend_~data |sll_prepend_#in~data|) (= |#valid| |old(#valid)|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1047#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:40,243 INFO L273 TraceCheckUtils]: 34: Hoare triple {1047#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1052#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= node_create_~temp~0.offset 0) (or (= 1 node_create_~data) (and (or (<= node_create_~data 1) (<= node_create_~data |node_create_#in~data|)) (or (<= |node_create_#in~data| node_create_~data) (< 1 node_create_~data)))))} is VALID [2018-11-23 12:59:40,245 INFO L273 TraceCheckUtils]: 35: Hoare triple {1052#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= node_create_~temp~0.offset 0) (or (= 1 node_create_~data) (and (or (<= node_create_~data 1) (<= node_create_~data |node_create_#in~data|)) (or (<= |node_create_#in~data| node_create_~data) (< 1 node_create_~data)))))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1052#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= node_create_~temp~0.offset 0) (or (= 1 node_create_~data) (and (or (<= node_create_~data 1) (<= node_create_~data |node_create_#in~data|)) (or (<= |node_create_#in~data| node_create_~data) (< 1 node_create_~data)))))} is VALID [2018-11-23 12:59:40,247 INFO L273 TraceCheckUtils]: 36: Hoare triple {1052#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= node_create_~temp~0.offset 0) (or (= 1 node_create_~data) (and (or (<= node_create_~data 1) (<= node_create_~data |node_create_#in~data|)) (or (<= |node_create_#in~data| node_create_~data) (< 1 node_create_~data)))))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1053#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (or (= (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|) 1) (<= 2 |node_create_#in~data|) (<= |node_create_#in~data| 0)) (= 0 |node_create_#res.offset|))} is VALID [2018-11-23 12:59:40,248 INFO L273 TraceCheckUtils]: 37: Hoare triple {1053#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (or (= (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|) 1) (<= 2 |node_create_#in~data|) (<= |node_create_#in~data| 0)) (= 0 |node_create_#res.offset|))} assume true; {1053#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (or (= (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|) 1) (<= 2 |node_create_#in~data|) (<= |node_create_#in~data| 0)) (= 0 |node_create_#res.offset|))} is VALID [2018-11-23 12:59:40,251 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1053#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (or (= (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|) 1) (<= 2 |node_create_#in~data|) (<= |node_create_#in~data| 0)) (= 0 |node_create_#res.offset|))} {1051#(and (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (<= |sll_prepend_#in~data| sll_prepend_~data) (<= sll_prepend_~data |sll_prepend_#in~data|) (= |#valid| |old(#valid)|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|))} #95#return; {1054#(and (or (= (select (select |#memory_int| |sll_prepend_#t~ret6.base|) |sll_prepend_#t~ret6.offset|) 1) (<= 2 |sll_prepend_#in~data|) (<= |sll_prepend_#in~data| 0)) (= 0 (select |old(#valid)| |sll_prepend_#t~ret6.base|)) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= 0 |sll_prepend_#t~ret6.offset|))} is VALID [2018-11-23 12:59:40,254 INFO L273 TraceCheckUtils]: 39: Hoare triple {1054#(and (or (= (select (select |#memory_int| |sll_prepend_#t~ret6.base|) |sll_prepend_#t~ret6.offset|) 1) (<= 2 |sll_prepend_#in~data|) (<= |sll_prepend_#in~data| 0)) (= 0 (select |old(#valid)| |sll_prepend_#t~ret6.base|)) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= 0 |sll_prepend_#t~ret6.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 write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {1055#(or (= 0 (select |old(#valid)| |sll_prepend_#in~head.base|)) (<= 2 |sll_prepend_#in~data|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) 1) (<= |sll_prepend_#in~data| 0))} is VALID [2018-11-23 12:59:40,255 INFO L273 TraceCheckUtils]: 40: Hoare triple {1055#(or (= 0 (select |old(#valid)| |sll_prepend_#in~head.base|)) (<= 2 |sll_prepend_#in~data|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) 1) (<= |sll_prepend_#in~data| 0))} assume true; {1055#(or (= 0 (select |old(#valid)| |sll_prepend_#in~head.base|)) (<= 2 |sll_prepend_#in~data|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) 1) (<= |sll_prepend_#in~data| 0))} is VALID [2018-11-23 12:59:40,258 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {1055#(or (= 0 (select |old(#valid)| |sll_prepend_#in~head.base|)) (<= 2 |sll_prepend_#in~data|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) 1) (<= |sll_prepend_#in~data| 0))} {1046#(and (<= main_~data~0 1) (<= 1 main_~data~0) (= (select |#valid| |main_~#s~0.base|) 1))} #91#return; {1056#(and (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (= 1 main_~data~0))} is VALID [2018-11-23 12:59:40,262 INFO L273 TraceCheckUtils]: 42: Hoare triple {1056#(and (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (= 1 main_~data~0))} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;~count~0 := 0; {1057#(and (= 1 main_~data~0) (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) main_~ptr~0.offset)))} is VALID [2018-11-23 12:59:40,263 INFO L273 TraceCheckUtils]: 43: Hoare triple {1057#(and (= 1 main_~data~0) (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) main_~ptr~0.offset)))} assume !!(~ptr~0.base != 0 || ~ptr~0.offset != 0);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4);~temp~2.base, ~temp~2.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call #t~mem11 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {1058#(and (= 1 main_~data~0) (= main_~data~0 |main_#t~mem11|))} is VALID [2018-11-23 12:59:40,263 INFO L273 TraceCheckUtils]: 44: Hoare triple {1058#(and (= 1 main_~data~0) (= main_~data~0 |main_#t~mem11|))} assume ~data~0 != #t~mem11;havoc #t~mem11; {1045#false} is VALID [2018-11-23 12:59:40,263 INFO L273 TraceCheckUtils]: 45: Hoare triple {1045#false} assume !false; {1045#false} is VALID [2018-11-23 12:59:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:59:40,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:59:40,278 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:59:40,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:59:40,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:59:40,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:59:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:40,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:59:40,485 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:40,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:40,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:40,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 12:59:40,502 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:40,502 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_27|]. (and (= |#valid| (store |v_#valid_27| |main_~#s~0.base| 1)) (= |main_~#s~0.offset| 0)) [2018-11-23 12:59:40,502 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1)) [2018-11-23 12:59:42,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:42,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:42,257 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:42,259 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 40 [2018-11-23 12:59:42,279 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 28 treesize of output 34 [2018-11-23 12:59:42,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:42,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:42,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 12:59:42,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:31 [2018-11-23 12:59:42,364 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:42,364 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_6|, |node_create_#t~malloc2.base|, v_prenex_1]. (let ((.cse0 (store |v_#valid_BEFORE_CALL_6| |node_create_#t~malloc2.base| 1))) (and (= |#valid| (store .cse0 v_prenex_1 1)) (= (select |v_#valid_BEFORE_CALL_6| |main_~#s~0.base|) 1) (= 0 (select .cse0 v_prenex_1)) (= |main_~#s~0.offset| 0) (= 0 (select |v_#valid_BEFORE_CALL_6| |node_create_#t~malloc2.base|)))) [2018-11-23 12:59:42,365 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_1, |node_create_#t~malloc2.base|]. (and (= 1 (select |#valid| v_prenex_1)) (not (= |main_~#s~0.base| v_prenex_1)) (= |main_~#s~0.offset| 0) (not (= |node_create_#t~malloc2.base| v_prenex_1)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= (select |#valid| |main_~#s~0.base|) 1) (= 1 (select |#valid| |node_create_#t~malloc2.base|))) [2018-11-23 12:59:42,754 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:42,758 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:42,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:42,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:42,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:42,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-23 12:59:43,343 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 39 [2018-11-23 12:59:43,356 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 28 treesize of output 27 [2018-11-23 12:59:43,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:43,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2018-11-23 12:59:43,466 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:43,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 12:59:43,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 12:59:43,580 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:43,592 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:43,727 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 26 treesize of output 34 [2018-11-23 12:59:43,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 26 [2018-11-23 12:59:43,750 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:43,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 25 [2018-11-23 12:59:43,815 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-23 12:59:43,845 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:59:43,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:43,952 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:59:43,957 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:59:44,017 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 51 [2018-11-23 12:59:44,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-11-23 12:59:44,040 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:44,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 41 [2018-11-23 12:59:44,103 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:44,202 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 30 treesize of output 46 [2018-11-23 12:59:44,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 23 treesize of output 29 [2018-11-23 12:59:44,247 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-23 12:59:44,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 23 treesize of output 30 [2018-11-23 12:59:44,291 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:44,312 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:59:44,409 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 27 treesize of output 45 [2018-11-23 12:59:44,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 16 [2018-11-23 12:59:44,429 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:44,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 16 treesize of output 22 [2018-11-23 12:59:44,479 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-11-23 12:59:44,495 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:44,507 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:44,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-11-23 12:59:44,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-11-23 12:59:44,547 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:44,585 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 49 treesize of output 57 [2018-11-23 12:59:44,666 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 54 treesize of output 42 [2018-11-23 12:59:44,668 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:44,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 36 [2018-11-23 12:59:44,746 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 4 xjuncts. [2018-11-23 12:59:44,790 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 12:59:44,820 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 12:59:44,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 12:59:44,862 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 5 variables, input treesize:120, output treesize:108 [2018-11-23 12:59:48,746 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:48,746 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_24|, sll_prepend_~new_head~1.base, |v_#memory_int_24|, |v_#memory_$Pointer$.base_24|, |v_#memory_int_23|]. (let ((.cse3 (select |v_#memory_int_24| sll_prepend_~new_head~1.base))) (let ((.cse0 (select .cse3 0))) (and (<= .cse0 |sll_prepend_#in~data|) (= |#memory_$Pointer$.offset| (let ((.cse1 (store |v_#memory_$Pointer$.offset_24| sll_prepend_~new_head~1.base (store (select |v_#memory_$Pointer$.offset_24| sll_prepend_~new_head~1.base) 4 (select (select |v_#memory_$Pointer$.offset_24| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))))) (store .cse1 |sll_prepend_#in~head.base| (store (select .cse1 |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset| 0)))) (<= |sll_prepend_#in~data| .cse0) (= |#memory_$Pointer$.base| (let ((.cse2 (store |v_#memory_$Pointer$.base_24| sll_prepend_~new_head~1.base (store (select |v_#memory_$Pointer$.base_24| sll_prepend_~new_head~1.base) 4 (select (select |v_#memory_$Pointer$.base_24| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))))) (store .cse2 |sll_prepend_#in~head.base| (store (select .cse2 |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset| sll_prepend_~new_head~1.base)))) (= (store |v_#memory_int_24| sll_prepend_~new_head~1.base (store .cse3 4 (select (select |v_#memory_int_23| sll_prepend_~new_head~1.base) 4))) |v_#memory_int_23|) (= 0 (select |old(#valid)| sll_prepend_~new_head~1.base)) (= |#memory_int| (store |v_#memory_int_23| |sll_prepend_#in~head.base| (store (select |v_#memory_int_23| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset| (select (select |#memory_int| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))))))) [2018-11-23 12:59:48,746 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse5 (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) (let ((.cse1 (= 0 (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) (.cse2 (= .cse5 |sll_prepend_#in~head.base|)) (.cse3 (= 0 (select |old(#valid)| .cse5)))) (or (let ((.cse0 (select (select |#memory_int| |sll_prepend_#in~head.base|) 0))) (and (<= |sll_prepend_#in~data| .cse0) .cse1 (<= .cse0 |sll_prepend_#in~data|) (= 4 |sll_prepend_#in~head.offset|) .cse2 .cse3)) (let ((.cse4 (select (select |#memory_int| .cse5) 0))) (and (<= .cse4 |sll_prepend_#in~data|) .cse1 (<= |sll_prepend_#in~data| .cse4) .cse3)) (and .cse1 .cse2 (= 0 |sll_prepend_#in~head.offset|) .cse3)))) [2018-11-23 12:59:48,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:48,930 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:48,931 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:48,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:59:48,934 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 69 treesize of output 77 [2018-11-23 12:59:48,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:49,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:49,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:124, output treesize:41 [2018-11-23 12:59:49,008 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:49,008 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_9, v_prenex_11, v_prenex_10, |v_#valid_BEFORE_CALL_10|, v_prenex_1, |node_create_#t~malloc2.base|]. (let ((.cse0 (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0)) (.cse1 (= |main_~#s~0.offset| 0)) (.cse2 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (or (and .cse0 (= 1 (select |v_#valid_BEFORE_CALL_10| |main_~#s~0.base|)) (not (= |main_~#s~0.base| v_prenex_1)) (= 1 (select |v_#valid_BEFORE_CALL_10| v_prenex_1)) (= (select |v_#valid_BEFORE_CALL_10| |node_create_#t~malloc2.base|) 1) .cse1 (not (= |node_create_#t~malloc2.base| v_prenex_1)) (= .cse2 |main_~#s~0.base|) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= 0 (select |v_#valid_BEFORE_CALL_10| .cse2))) (let ((.cse3 (select (select |#memory_int| .cse2) 0))) (and .cse0 (<= .cse3 main_~data~0) (not (= v_prenex_9 |main_~#s~0.base|)) (= (select v_prenex_11 v_prenex_9) 1) (not (= v_prenex_9 v_prenex_10)) .cse1 (= 0 (select v_prenex_11 .cse2)) (not (= |main_~#s~0.base| v_prenex_10)) (<= main_~data~0 .cse3) (= 1 (select v_prenex_11 |main_~#s~0.base|)) (= 1 (select v_prenex_11 v_prenex_10)))))) [2018-11-23 12:59:49,008 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse0 (select (select |#memory_int| .cse1) 0))) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (<= .cse0 main_~data~0) (not (= .cse1 |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (<= main_~data~0 .cse0)))) [2018-11-23 12:59:49,079 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 38 treesize of output 30 [2018-11-23 12:59:49,084 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-11-23 12:59:49,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:49,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:49,109 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:59:49,126 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:59:49,127 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:49,129 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:49,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:49,140 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:18 [2018-11-23 12:59:49,143 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:49,144 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, |main_~#s~0.base|, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0))) (let ((.cse1 (select (select |#memory_int| .cse0) 0)) (.cse2 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) 0))) (and (= .cse0 main_~ptr~0.base) (<= .cse1 main_~data~0) (= .cse2 0) (<= main_~data~0 .cse1) (not (= |main_~#s~0.base| .cse0)) (= .cse2 main_~ptr~0.offset)))) [2018-11-23 12:59:49,144 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_int| main_~ptr~0.base) 0))) (and (<= main_~data~0 .cse0) (= main_~ptr~0.offset 0) (<= .cse0 main_~data~0))) [2018-11-23 12:59:49,192 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 22 treesize of output 16 [2018-11-23 12:59:49,198 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 16 treesize of output 7 [2018-11-23 12:59:49,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:59:49,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:49,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:59:49,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-23 12:59:49,211 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:49,211 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~ptr~0.base]. (let ((.cse0 (select (select |#memory_int| main_~ptr~0.base) 0))) (and (<= main_~data~0 .cse0) (<= .cse0 main_~data~0) (= |main_#t~mem11| .cse0))) [2018-11-23 12:59:49,211 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= |main_#t~mem11| main_~data~0) (<= main_~data~0 |main_#t~mem11|)) [2018-11-23 12:59:49,248 INFO L256 TraceCheckUtils]: 0: Hoare triple {1044#true} call ULTIMATE.init(); {1044#true} is VALID [2018-11-23 12:59:49,249 INFO L273 TraceCheckUtils]: 1: Hoare triple {1044#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1044#true} is VALID [2018-11-23 12:59:49,249 INFO L273 TraceCheckUtils]: 2: Hoare triple {1044#true} assume true; {1044#true} is VALID [2018-11-23 12:59:49,249 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1044#true} {1044#true} #99#return; {1044#true} is VALID [2018-11-23 12:59:49,249 INFO L256 TraceCheckUtils]: 4: Hoare triple {1044#true} call #t~ret14 := main(); {1044#true} is VALID [2018-11-23 12:59:49,250 INFO L273 TraceCheckUtils]: 5: Hoare triple {1044#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1077#(and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:49,251 INFO L256 TraceCheckUtils]: 6: Hoare triple {1077#(and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {1047#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:49,251 INFO L273 TraceCheckUtils]: 7: Hoare triple {1047#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1047#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:49,252 INFO L273 TraceCheckUtils]: 8: Hoare triple {1047#(= |#valid| |old(#valid)|)} assume !!(~len > 0); {1047#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:49,253 INFO L256 TraceCheckUtils]: 9: Hoare triple {1047#(= |#valid| |old(#valid)|)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1047#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:49,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {1047#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:49,255 INFO L273 TraceCheckUtils]: 11: Hoare triple {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:49,256 INFO L273 TraceCheckUtils]: 12: Hoare triple {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:49,256 INFO L273 TraceCheckUtils]: 13: Hoare triple {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} assume true; {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:49,263 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} {1047#(= |#valid| |old(#valid)|)} #97#return; {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:49,264 INFO L273 TraceCheckUtils]: 15: Hoare triple {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:49,267 INFO L273 TraceCheckUtils]: 16: Hoare triple {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:49,267 INFO L273 TraceCheckUtils]: 17: Hoare triple {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} assume !!(~len > 0); {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:49,268 INFO L256 TraceCheckUtils]: 18: Hoare triple {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1047#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:49,269 INFO L273 TraceCheckUtils]: 19: Hoare triple {1047#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:49,269 INFO L273 TraceCheckUtils]: 20: Hoare triple {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:49,270 INFO L273 TraceCheckUtils]: 21: Hoare triple {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:49,271 INFO L273 TraceCheckUtils]: 22: Hoare triple {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} assume true; {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 12:59:49,273 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} {1093#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} #97#return; {1133#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} is VALID [2018-11-23 12:59:49,274 INFO L273 TraceCheckUtils]: 24: Hoare triple {1133#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1133#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} is VALID [2018-11-23 12:59:49,274 INFO L273 TraceCheckUtils]: 25: Hoare triple {1133#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1133#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} is VALID [2018-11-23 12:59:49,275 INFO L273 TraceCheckUtils]: 26: Hoare triple {1133#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} assume !(~len > 0); {1133#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} is VALID [2018-11-23 12:59:49,276 INFO L273 TraceCheckUtils]: 27: Hoare triple {1133#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1133#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} is VALID [2018-11-23 12:59:49,276 INFO L273 TraceCheckUtils]: 28: Hoare triple {1133#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} assume true; {1133#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} is VALID [2018-11-23 12:59:49,279 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1133#(exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |#valid|)))} {1077#(and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} #89#return; {1152#(and (= |main_~#s~0.offset| 0) (exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 1 (select |#valid| v_prenex_1)) (not (= |main_~#s~0.base| v_prenex_1)) (not (= |node_create_#t~malloc2.base| v_prenex_1)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= 1 (select |#valid| |node_create_#t~malloc2.base|)))) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:49,280 INFO L273 TraceCheckUtils]: 30: Hoare triple {1152#(and (= |main_~#s~0.offset| 0) (exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 1 (select |#valid| v_prenex_1)) (not (= |main_~#s~0.base| v_prenex_1)) (not (= |node_create_#t~malloc2.base| v_prenex_1)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= 1 (select |#valid| |node_create_#t~malloc2.base|)))) (= (select |#valid| |main_~#s~0.base|) 1))} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset; {1152#(and (= |main_~#s~0.offset| 0) (exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 1 (select |#valid| v_prenex_1)) (not (= |main_~#s~0.base| v_prenex_1)) (not (= |node_create_#t~malloc2.base| v_prenex_1)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= 1 (select |#valid| |node_create_#t~malloc2.base|)))) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:49,281 INFO L256 TraceCheckUtils]: 31: Hoare triple {1152#(and (= |main_~#s~0.offset| 0) (exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 1 (select |#valid| v_prenex_1)) (not (= |main_~#s~0.base| v_prenex_1)) (not (= |node_create_#t~malloc2.base| v_prenex_1)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= 1 (select |#valid| |node_create_#t~malloc2.base|)))) (= (select |#valid| |main_~#s~0.base|) 1))} call sll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {1047#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:49,282 INFO L273 TraceCheckUtils]: 32: Hoare triple {1047#(= |#valid| |old(#valid)|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1051#(and (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (<= |sll_prepend_#in~data| sll_prepend_~data) (<= sll_prepend_~data |sll_prepend_#in~data|) (= |#valid| |old(#valid)|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|))} is VALID [2018-11-23 12:59:49,283 INFO L256 TraceCheckUtils]: 33: Hoare triple {1051#(and (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (<= |sll_prepend_#in~data| sll_prepend_~data) (<= sll_prepend_~data |sll_prepend_#in~data|) (= |#valid| |old(#valid)|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1047#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:49,284 INFO L273 TraceCheckUtils]: 34: Hoare triple {1047#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1168#(and (= node_create_~data |node_create_#in~data|) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= node_create_~temp~0.offset 0))} is VALID [2018-11-23 12:59:49,285 INFO L273 TraceCheckUtils]: 35: Hoare triple {1168#(and (= node_create_~data |node_create_#in~data|) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= node_create_~temp~0.offset 0))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1168#(and (= node_create_~data |node_create_#in~data|) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= node_create_~temp~0.offset 0))} is VALID [2018-11-23 12:59:49,286 INFO L273 TraceCheckUtils]: 36: Hoare triple {1168#(and (= node_create_~data |node_create_#in~data|) (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= node_create_~temp~0.offset 0))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1175#(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|)) (= |node_create_#res.offset| 0))} is VALID [2018-11-23 12:59:49,287 INFO L273 TraceCheckUtils]: 37: Hoare triple {1175#(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|)) (= |node_create_#res.offset| 0))} assume true; {1175#(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|)) (= |node_create_#res.offset| 0))} is VALID [2018-11-23 12:59:49,290 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1175#(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|)) (= |node_create_#res.offset| 0))} {1051#(and (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (<= |sll_prepend_#in~data| sll_prepend_~data) (<= sll_prepend_~data |sll_prepend_#in~data|) (= |#valid| |old(#valid)|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|))} #95#return; {1182#(and (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (= |sll_prepend_#t~ret6.offset| 0) (<= |sll_prepend_#in~data| (select (select |#memory_int| |sll_prepend_#t~ret6.base|) 0)) (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= (select |old(#valid)| |sll_prepend_#t~ret6.base|) 0) (<= (select (select |#memory_int| |sll_prepend_#t~ret6.base|) 0) |sll_prepend_#in~data|))} is VALID [2018-11-23 12:59:49,292 INFO L273 TraceCheckUtils]: 39: Hoare triple {1182#(and (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (= |sll_prepend_#t~ret6.offset| 0) (<= |sll_prepend_#in~data| (select (select |#memory_int| |sll_prepend_#t~ret6.base|) 0)) (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= (select |old(#valid)| |sll_prepend_#t~ret6.base|) 0) (<= (select (select |#memory_int| |sll_prepend_#t~ret6.base|) 0) |sll_prepend_#in~data|))} ~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 write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {1186#(or (and (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) 0) |sll_prepend_#in~data|) (= 0 (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (<= |sll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) 0)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)))) (and (= 0 (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= 0 |sll_prepend_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) |sll_prepend_#in~head.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)))))} is VALID [2018-11-23 12:59:49,293 INFO L273 TraceCheckUtils]: 40: Hoare triple {1186#(or (and (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) 0) |sll_prepend_#in~data|) (= 0 (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (<= |sll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) 0)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)))) (and (= 0 (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= 0 |sll_prepend_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) |sll_prepend_#in~head.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)))))} assume true; {1186#(or (and (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) 0) |sll_prepend_#in~data|) (= 0 (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (<= |sll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) 0)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)))) (and (= 0 (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= 0 |sll_prepend_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) |sll_prepend_#in~head.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)))))} is VALID [2018-11-23 12:59:49,296 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {1186#(or (and (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) 0) |sll_prepend_#in~data|) (= 0 (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (<= |sll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) 0)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)))) (and (= 0 (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= 0 |sll_prepend_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) |sll_prepend_#in~head.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)))))} {1152#(and (= |main_~#s~0.offset| 0) (exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 1 (select |#valid| v_prenex_1)) (not (= |main_~#s~0.base| v_prenex_1)) (not (= |node_create_#t~malloc2.base| v_prenex_1)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= 1 (select |#valid| |node_create_#t~malloc2.base|)))) (= (select |#valid| |main_~#s~0.base|) 1))} #91#return; {1193#(and (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0) main_~data~0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (<= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0)))} is VALID [2018-11-23 12:59:49,297 INFO L273 TraceCheckUtils]: 42: Hoare triple {1193#(and (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0) main_~data~0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (<= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) 0)))} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;~count~0 := 0; {1197#(and (<= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) 0)) (= main_~ptr~0.offset 0) (<= (select (select |#memory_int| main_~ptr~0.base) 0) main_~data~0))} is VALID [2018-11-23 12:59:49,299 INFO L273 TraceCheckUtils]: 43: Hoare triple {1197#(and (<= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) 0)) (= main_~ptr~0.offset 0) (<= (select (select |#memory_int| main_~ptr~0.base) 0) main_~data~0))} assume !!(~ptr~0.base != 0 || ~ptr~0.offset != 0);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4);~temp~2.base, ~temp~2.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call #t~mem11 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {1201#(and (<= |main_#t~mem11| main_~data~0) (<= main_~data~0 |main_#t~mem11|))} is VALID [2018-11-23 12:59:49,299 INFO L273 TraceCheckUtils]: 44: Hoare triple {1201#(and (<= |main_#t~mem11| main_~data~0) (<= main_~data~0 |main_#t~mem11|))} assume ~data~0 != #t~mem11;havoc #t~mem11; {1045#false} is VALID [2018-11-23 12:59:49,300 INFO L273 TraceCheckUtils]: 45: Hoare triple {1045#false} assume !false; {1045#false} is VALID [2018-11-23 12:59:49,308 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:59:49,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:59:49,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2018-11-23 12:59:49,328 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2018-11-23 12:59:49,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:59:49,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:59:49,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:49,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:59:49,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:59:49,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=579, Unknown=3, NotChecked=0, Total=650 [2018-11-23 12:59:49,535 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 26 states. [2018-11-23 12:59:51,057 WARN L180 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 12:59:54,149 WARN L180 SmtUtils]: Spent 517.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 13:00:05,422 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-23 13:00:12,711 WARN L180 SmtUtils]: Spent 594.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 13:00:15,998 WARN L180 SmtUtils]: Spent 509.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 13:00:18,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:18,810 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-11-23 13:00:18,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:00:18,810 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2018-11-23 13:00:18,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:00:18,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 67 transitions. [2018-11-23 13:00:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:00:18,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 67 transitions. [2018-11-23 13:00:18,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 67 transitions. [2018-11-23 13:00:19,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:19,043 INFO L225 Difference]: With dead ends: 59 [2018-11-23 13:00:19,044 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 13:00:19,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=149, Invalid=1035, Unknown=6, NotChecked=0, Total=1190 [2018-11-23 13:00:19,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 13:00:19,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2018-11-23 13:00:19,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:19,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 51 states. [2018-11-23 13:00:19,182 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 51 states. [2018-11-23 13:00:19,182 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 51 states. [2018-11-23 13:00:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:19,188 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-11-23 13:00:19,188 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-11-23 13:00:19,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:19,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:19,189 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 57 states. [2018-11-23 13:00:19,189 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 57 states. [2018-11-23 13:00:19,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:19,192 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-11-23 13:00:19,193 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-11-23 13:00:19,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:19,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:19,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:19,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 13:00:19,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-11-23 13:00:19,197 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 46 [2018-11-23 13:00:19,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:19,197 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-11-23 13:00:19,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 13:00:19,197 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-23 13:00:19,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 13:00:19,199 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:19,199 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:19,199 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:19,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:19,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1987697482, now seen corresponding path program 1 times [2018-11-23 13:00:19,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:19,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:19,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:19,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:00:19,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:20,625 INFO L256 TraceCheckUtils]: 0: Hoare triple {1499#true} call ULTIMATE.init(); {1499#true} is VALID [2018-11-23 13:00:20,626 INFO L273 TraceCheckUtils]: 1: Hoare triple {1499#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1499#true} is VALID [2018-11-23 13:00:20,626 INFO L273 TraceCheckUtils]: 2: Hoare triple {1499#true} assume true; {1499#true} is VALID [2018-11-23 13:00:20,626 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1499#true} {1499#true} #99#return; {1499#true} is VALID [2018-11-23 13:00:20,627 INFO L256 TraceCheckUtils]: 4: Hoare triple {1499#true} call #t~ret14 := main(); {1499#true} is VALID [2018-11-23 13:00:20,629 INFO L273 TraceCheckUtils]: 5: Hoare triple {1499#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1501#(= (select |#valid| |main_~#s~0.base|) 1)} is VALID [2018-11-23 13:00:20,635 INFO L256 TraceCheckUtils]: 6: Hoare triple {1501#(= (select |#valid| |main_~#s~0.base|) 1)} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {1502#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:00:20,636 INFO L273 TraceCheckUtils]: 7: Hoare triple {1502#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1502#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:00:20,636 INFO L273 TraceCheckUtils]: 8: Hoare triple {1502#(= |#valid| |old(#valid)|)} assume !!(~len > 0); {1502#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:00:20,637 INFO L256 TraceCheckUtils]: 9: Hoare triple {1502#(= |#valid| |old(#valid)|)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1502#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:00:20,638 INFO L273 TraceCheckUtils]: 10: Hoare triple {1502#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1503#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:20,639 INFO L273 TraceCheckUtils]: 11: Hoare triple {1503#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1503#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:20,641 INFO L273 TraceCheckUtils]: 12: Hoare triple {1503#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1503#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:20,642 INFO L273 TraceCheckUtils]: 13: Hoare triple {1503#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {1503#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:20,645 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1503#(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|)))))} {1502#(= |#valid| |old(#valid)|)} #97#return; {1503#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:20,647 INFO L273 TraceCheckUtils]: 15: Hoare triple {1503#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1503#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:20,648 INFO L273 TraceCheckUtils]: 16: Hoare triple {1503#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1503#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:20,649 INFO L273 TraceCheckUtils]: 17: Hoare triple {1503#(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); {1503#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:20,651 INFO L256 TraceCheckUtils]: 18: Hoare triple {1503#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1502#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:00:20,652 INFO L273 TraceCheckUtils]: 19: Hoare triple {1502#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1504#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:20,654 INFO L273 TraceCheckUtils]: 20: Hoare triple {1504#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1504#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:20,656 INFO L273 TraceCheckUtils]: 21: Hoare triple {1504#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1505#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 |node_create_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:20,657 INFO L273 TraceCheckUtils]: 22: Hoare triple {1505#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 |node_create_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {1505#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 |node_create_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:20,662 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1505#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 |node_create_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} {1503#(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|)))))} #97#return; {1506#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (not (= 0 |sll_create_#t~ret4.base|)) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:20,664 INFO L273 TraceCheckUtils]: 24: Hoare triple {1506#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (not (= 0 |sll_create_#t~ret4.base|)) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1507#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-23 13:00:20,666 INFO L273 TraceCheckUtils]: 25: Hoare triple {1507#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1507#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-23 13:00:20,668 INFO L273 TraceCheckUtils]: 26: Hoare triple {1507#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)))} assume !(~len > 0); {1507#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-23 13:00:20,670 INFO L273 TraceCheckUtils]: 27: Hoare triple {1507#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1508#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 |sll_create_#res.base|)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:20,673 INFO L273 TraceCheckUtils]: 28: Hoare triple {1508#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 |sll_create_#res.base|)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} assume true; {1508#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 |sll_create_#res.base|)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:00:20,675 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1508#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 |sll_create_#res.base|)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} {1501#(= (select |#valid| |main_~#s~0.base|) 1)} #89#return; {1509#(and (not (= 0 |main_#t~ret8.base|)) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 13:00:20,677 INFO L273 TraceCheckUtils]: 30: Hoare triple {1509#(and (not (= 0 |main_#t~ret8.base|)) (= (select |#valid| |main_~#s~0.base|) 1))} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret8.base, #t~ret8.offset; {1510#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 13:00:20,678 INFO L256 TraceCheckUtils]: 31: Hoare triple {1510#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| |main_~#s~0.base|) 1))} call sll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {1511#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 13:00:20,679 INFO L273 TraceCheckUtils]: 32: Hoare triple {1511#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1512#(and (= (select |#memory_$Pointer$.base| sll_prepend_~head.base) (select |old(#memory_$Pointer$.base)| sll_prepend_~head.base)) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (= |#valid| |old(#valid)|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|))} is VALID [2018-11-23 13:00:20,680 INFO L256 TraceCheckUtils]: 33: Hoare triple {1512#(and (= (select |#memory_$Pointer$.base| sll_prepend_~head.base) (select |old(#memory_$Pointer$.base)| sll_prepend_~head.base)) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (= |#valid| |old(#valid)|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1511#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 13:00:20,681 INFO L273 TraceCheckUtils]: 34: Hoare triple {1511#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1513#(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 13:00:20,682 INFO L273 TraceCheckUtils]: 35: Hoare triple {1513#(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); {1513#(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 13:00:20,692 INFO L273 TraceCheckUtils]: 36: Hoare triple {1513#(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~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1514#(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 13:00:20,697 INFO L273 TraceCheckUtils]: 37: Hoare triple {1514#(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; {1514#(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 13:00:20,699 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1514#(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)|)))} {1512#(and (= (select |#memory_$Pointer$.base| sll_prepend_~head.base) (select |old(#memory_$Pointer$.base)| sll_prepend_~head.base)) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (= |#valid| |old(#valid)|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|))} #95#return; {1515#(and (= 0 (select |old(#valid)| |sll_prepend_#t~ret6.base|)) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (or (= (select |#memory_$Pointer$.base| sll_prepend_~head.base) (select |old(#memory_$Pointer$.base)| sll_prepend_~head.base)) (= sll_prepend_~head.base |sll_prepend_#t~ret6.base|)) (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= 0 |sll_prepend_#t~ret6.offset|))} is VALID [2018-11-23 13:00:20,701 INFO L273 TraceCheckUtils]: 39: Hoare triple {1515#(and (= 0 (select |old(#valid)| |sll_prepend_#t~ret6.base|)) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (or (= (select |#memory_$Pointer$.base| sll_prepend_~head.base) (select |old(#memory_$Pointer$.base)| sll_prepend_~head.base)) (= sll_prepend_~head.base |sll_prepend_#t~ret6.base|)) (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= 0 |sll_prepend_#t~ret6.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 write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4); {1516#(or (= 0 (select |old(#valid)| |sll_prepend_#in~head.base|)) (and (= 0 (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) 4))))} is VALID [2018-11-23 13:00:20,702 INFO L273 TraceCheckUtils]: 40: Hoare triple {1516#(or (= 0 (select |old(#valid)| |sll_prepend_#in~head.base|)) (and (= 0 (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) 4))))} assume true; {1516#(or (= 0 (select |old(#valid)| |sll_prepend_#in~head.base|)) (and (= 0 (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) 4))))} is VALID [2018-11-23 13:00:20,704 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {1516#(or (= 0 (select |old(#valid)| |sll_prepend_#in~head.base|)) (and (= 0 (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) 4))))} {1510#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| |main_~#s~0.base|) 1))} #91#return; {1517#(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 13:00:20,705 INFO L273 TraceCheckUtils]: 42: Hoare triple {1517#(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~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;~count~0 := 0; {1518#(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 13:00:20,706 INFO L273 TraceCheckUtils]: 43: Hoare triple {1518#(and (= main_~ptr~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))))} assume !!(~ptr~0.base != 0 || ~ptr~0.offset != 0);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4);~temp~2.base, ~temp~2.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call #t~mem11 := read~int(~ptr~0.base, ~ptr~0.offset, 4); {1519#(not (= 0 main_~temp~2.base))} is VALID [2018-11-23 13:00:20,707 INFO L273 TraceCheckUtils]: 44: Hoare triple {1519#(not (= 0 main_~temp~2.base))} assume !(~data~0 != #t~mem11);havoc #t~mem11;~ptr~0.base, ~ptr~0.offset := ~temp~2.base, ~temp~2.offset;#t~post12 := ~count~0;~count~0 := 1 + #t~post12;havoc #t~post12; {1520#(not (= 0 main_~ptr~0.base))} is VALID [2018-11-23 13:00:20,708 INFO L273 TraceCheckUtils]: 45: Hoare triple {1520#(not (= 0 main_~ptr~0.base))} assume !(~ptr~0.base != 0 || ~ptr~0.offset != 0); {1500#false} is VALID [2018-11-23 13:00:20,708 INFO L273 TraceCheckUtils]: 46: Hoare triple {1500#false} assume ~count~0 != 1 + ~len~0; {1500#false} is VALID [2018-11-23 13:00:20,708 INFO L273 TraceCheckUtils]: 47: Hoare triple {1500#false} assume !false; {1500#false} is VALID [2018-11-23 13:00:20,717 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:00:20,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:00:20,717 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:00:20,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:20,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:00:20,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 13:00:20,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:20,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:20,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 13:00:20,937 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:00:20,937 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 13:00:20,937 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1)) [2018-11-23 13:00:24,866 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:24,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:24,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:00:24,870 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 13:00:24,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, 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 13:00:24,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:00:24,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:00:24,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:00:24,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:35 [2018-11-23 13:00:24,931 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:00:24,931 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_16|, |node_create_#t~malloc2.base|]. (let ((.cse0 (store |v_#valid_BEFORE_CALL_16| |node_create_#t~malloc2.base| 1))) (and (= (select |v_#valid_BEFORE_CALL_16| |main_~#s~0.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |node_create_#t~malloc2.base|) 0) (= |main_~#s~0.offset| 0) (= (select .cse0 |main_#t~ret8.base|) 0) (not (= 0 |main_#t~ret8.base|)) (= |#valid| (store .cse0 |main_#t~ret8.base| 1)))) [2018-11-23 13:00:24,931 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|node_create_#t~malloc2.base|]. (and (= (select |#valid| |main_#t~ret8.base|) 1) (= |main_~#s~0.offset| 0) (not (= |node_create_#t~malloc2.base| |main_#t~ret8.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (not (= |main_~#s~0.base| |main_#t~ret8.base|)) (not (= 0 |main_#t~ret8.base|)) (= (select |#valid| |main_~#s~0.base|) 1) (= 1 (select |#valid| |node_create_#t~malloc2.base|))) [2018-11-23 13:00:25,792 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:00:25,793 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.classInvariant(MultiDimensionalSelect.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:90) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.isCompatibleSelect(MultiDimensionalStore.java:105) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.(MultiDimensionalStore.java:73) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.(MultiDimensionalSelectOverStore.java:48) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.convert(MultiDimensionalSelectOverStore.java:75) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ArrayQuantifierEliminationUtils.elimAllSos(ArrayQuantifierEliminationUtils.java:57) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:232) 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:25,797 INFO L168 Benchmark]: Toolchain (without parser) took 54182.52 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -663.4 MB). Peak memory consumption was 382.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:25,799 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:25,799 INFO L168 Benchmark]: CACSL2BoogieTranslator took 690.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:25,800 INFO L168 Benchmark]: Boogie Procedure Inliner took 154.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -835.1 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:25,801 INFO L168 Benchmark]: Boogie Preprocessor took 89.29 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:00:25,802 INFO L168 Benchmark]: RCFGBuilder took 1043.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:25,802 INFO L168 Benchmark]: TraceAbstraction took 52199.88 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 288.9 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 102.5 MB). Peak memory consumption was 391.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:25,805 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 690.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 154.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -835.1 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 89.29 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1043.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 52199.88 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 288.9 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 102.5 MB). Peak memory consumption was 391.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...