/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:48:11,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:48:11,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:48:11,768 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:48:11,768 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:48:11,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:48:11,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:48:11,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:48:11,788 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:48:11,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:48:11,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:48:11,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:48:11,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:48:11,799 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:48:11,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:48:11,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:48:11,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:48:11,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:48:11,806 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:48:11,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:48:11,816 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:48:11,820 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:48:11,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:48:11,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:48:11,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:48:11,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:48:11,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:48:11,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:48:11,827 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:48:11,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:48:11,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:48:11,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:48:11,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:48:11,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:48:11,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:48:11,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:48:11,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:48:11,835 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:48:11,835 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:48:11,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:48:11,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:48:11,838 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:48:11,874 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:48:11,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:48:11,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:48:11,879 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:48:11,879 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:48:11,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:48:11,880 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:48:11,880 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:48:11,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:48:11,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:48:11,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:48:11,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:48:11,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:48:11,883 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:48:11,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:48:11,883 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:48:11,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:48:11,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:48:11,884 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:48:11,884 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:48:11,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:48:11,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:48:11,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:48:11,885 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:48:11,885 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:48:11,886 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:48:11,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:48:11,886 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:48:11,887 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:48:11,887 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:48:12,239 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:48:12,251 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:48:12,255 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:48:12,257 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:48:12,257 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:48:12,258 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c [2020-07-08 12:48:12,326 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/759a2628e/943f4f38bb514c4da74e4ca45785c1c6/FLAG0dc4d3df1 [2020-07-08 12:48:12,781 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:48:12,782 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c [2020-07-08 12:48:12,790 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/759a2628e/943f4f38bb514c4da74e4ca45785c1c6/FLAG0dc4d3df1 [2020-07-08 12:48:13,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/759a2628e/943f4f38bb514c4da74e4ca45785c1c6 [2020-07-08 12:48:13,197 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:48:13,199 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:48:13,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:48:13,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:48:13,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:48:13,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:48:13" (1/1) ... [2020-07-08 12:48:13,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61353710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:13, skipping insertion in model container [2020-07-08 12:48:13,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:48:13" (1/1) ... [2020-07-08 12:48:13,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:48:13,239 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:48:13,513 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-08 12:48:13,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:48:13,567 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:48:13,675 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-08 12:48:13,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:48:13,719 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:48:13,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:13 WrapperNode [2020-07-08 12:48:13,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:48:13,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:48:13,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:48:13,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:48:13,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:13" (1/1) ... [2020-07-08 12:48:13,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:13" (1/1) ... [2020-07-08 12:48:13,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:13" (1/1) ... [2020-07-08 12:48:13,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:13" (1/1) ... [2020-07-08 12:48:13,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:13" (1/1) ... [2020-07-08 12:48:13,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:13" (1/1) ... [2020-07-08 12:48:13,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:13" (1/1) ... [2020-07-08 12:48:13,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:48:13,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:48:13,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:48:13,800 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:48:13,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:13" (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 [2020-07-08 12:48:13,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:48:13,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:48:13,870 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 12:48:13,870 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:48:13,870 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-07-08 12:48:13,870 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-07-08 12:48:13,870 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-07-08 12:48:13,871 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-07-08 12:48:13,871 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-07-08 12:48:13,871 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-07-08 12:48:13,871 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:48:13,871 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-08 12:48:13,871 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-08 12:48:13,872 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 12:48:13,872 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-08 12:48:13,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:48:13,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-08 12:48:13,872 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:48:13,872 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 12:48:13,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:48:13,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:48:13,873 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-07-08 12:48:13,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 12:48:13,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:48:13,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-08 12:48:13,874 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-07-08 12:48:13,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-08 12:48:13,874 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-07-08 12:48:13,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:48:13,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:48:13,874 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-07-08 12:48:13,874 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-07-08 12:48:13,875 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-07-08 12:48:13,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 12:48:13,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-08 12:48:13,875 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:48:13,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:48:13,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:48:14,651 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:48:14,651 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-08 12:48:14,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:48:14 BoogieIcfgContainer [2020-07-08 12:48:14,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:48:14,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:48:14,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:48:14,666 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:48:14,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:48:13" (1/3) ... [2020-07-08 12:48:14,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d80bd3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:48:14, skipping insertion in model container [2020-07-08 12:48:14,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:13" (2/3) ... [2020-07-08 12:48:14,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d80bd3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:48:14, skipping insertion in model container [2020-07-08 12:48:14,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:48:14" (3/3) ... [2020-07-08 12:48:14,671 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.c [2020-07-08 12:48:14,685 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:48:14,695 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:48:14,710 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:48:14,739 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:48:14,740 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:48:14,740 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:48:14,740 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:48:14,742 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:48:14,743 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:48:14,743 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:48:14,743 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:48:14,774 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states. [2020-07-08 12:48:14,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-08 12:48:14,789 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:14,790 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:48:14,791 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:14,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:14,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1213743031, now seen corresponding path program 1 times [2020-07-08 12:48:14,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:14,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912214446] [2020-07-08 12:48:14,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:15,095 INFO L280 TraceCheckUtils]: 0: Hoare triple {126#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {99#true} is VALID [2020-07-08 12:48:15,095 INFO L280 TraceCheckUtils]: 1: Hoare triple {99#true} assume true; {99#true} is VALID [2020-07-08 12:48:15,096 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {99#true} {99#true} #179#return; {99#true} is VALID [2020-07-08 12:48:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:15,133 INFO L280 TraceCheckUtils]: 0: Hoare triple {127#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {99#true} is VALID [2020-07-08 12:48:15,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {99#true} assume true; {99#true} is VALID [2020-07-08 12:48:15,134 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {99#true} {99#true} #137#return; {99#true} is VALID [2020-07-08 12:48:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:15,155 INFO L280 TraceCheckUtils]: 0: Hoare triple {99#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {99#true} is VALID [2020-07-08 12:48:15,156 INFO L280 TraceCheckUtils]: 1: Hoare triple {99#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {99#true} is VALID [2020-07-08 12:48:15,156 INFO L280 TraceCheckUtils]: 2: Hoare triple {99#true} assume true; {99#true} is VALID [2020-07-08 12:48:15,156 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {99#true} {99#true} #149#return; {99#true} is VALID [2020-07-08 12:48:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:15,163 INFO L280 TraceCheckUtils]: 0: Hoare triple {99#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {99#true} is VALID [2020-07-08 12:48:15,163 INFO L280 TraceCheckUtils]: 1: Hoare triple {99#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {99#true} is VALID [2020-07-08 12:48:15,164 INFO L280 TraceCheckUtils]: 2: Hoare triple {99#true} assume true; {99#true} is VALID [2020-07-08 12:48:15,164 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {99#true} {99#true} #151#return; {99#true} is VALID [2020-07-08 12:48:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:15,171 INFO L280 TraceCheckUtils]: 0: Hoare triple {99#true} ~cond := #in~cond; {99#true} is VALID [2020-07-08 12:48:15,172 INFO L280 TraceCheckUtils]: 1: Hoare triple {99#true} assume 0 == ~cond;assume false; {100#false} is VALID [2020-07-08 12:48:15,172 INFO L280 TraceCheckUtils]: 2: Hoare triple {100#false} assume true; {100#false} is VALID [2020-07-08 12:48:15,173 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {100#false} {99#true} #153#return; {100#false} is VALID [2020-07-08 12:48:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:15,192 INFO L280 TraceCheckUtils]: 0: Hoare triple {128#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {99#true} is VALID [2020-07-08 12:48:15,192 INFO L280 TraceCheckUtils]: 1: Hoare triple {99#true} assume true; {99#true} is VALID [2020-07-08 12:48:15,193 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {99#true} {100#false} #155#return; {100#false} is VALID [2020-07-08 12:48:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:15,217 INFO L280 TraceCheckUtils]: 0: Hoare triple {129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {99#true} is VALID [2020-07-08 12:48:15,218 INFO L280 TraceCheckUtils]: 1: Hoare triple {99#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {99#true} is VALID [2020-07-08 12:48:15,218 INFO L280 TraceCheckUtils]: 2: Hoare triple {99#true} assume true; {99#true} is VALID [2020-07-08 12:48:15,219 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {99#true} {100#false} #157#return; {100#false} is VALID [2020-07-08 12:48:15,220 INFO L263 TraceCheckUtils]: 0: Hoare triple {99#true} call ULTIMATE.init(); {126#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:48:15,221 INFO L280 TraceCheckUtils]: 1: Hoare triple {126#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {99#true} is VALID [2020-07-08 12:48:15,221 INFO L280 TraceCheckUtils]: 2: Hoare triple {99#true} assume true; {99#true} is VALID [2020-07-08 12:48:15,222 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {99#true} {99#true} #179#return; {99#true} is VALID [2020-07-08 12:48:15,222 INFO L263 TraceCheckUtils]: 4: Hoare triple {99#true} call #t~ret41 := main(); {99#true} is VALID [2020-07-08 12:48:15,223 INFO L263 TraceCheckUtils]: 5: Hoare triple {99#true} call #t~ret40.base, #t~ret40.offset := nondet_tree(); {127#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:48:15,224 INFO L280 TraceCheckUtils]: 6: Hoare triple {127#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {99#true} is VALID [2020-07-08 12:48:15,224 INFO L280 TraceCheckUtils]: 7: Hoare triple {99#true} assume true; {99#true} is VALID [2020-07-08 12:48:15,224 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {99#true} {99#true} #137#return; {99#true} is VALID [2020-07-08 12:48:15,225 INFO L263 TraceCheckUtils]: 9: Hoare triple {99#true} call task(#t~ret40.base, #t~ret40.offset); {99#true} is VALID [2020-07-08 12:48:15,225 INFO L280 TraceCheckUtils]: 10: Hoare triple {99#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {99#true} is VALID [2020-07-08 12:48:15,225 INFO L263 TraceCheckUtils]: 11: Hoare triple {99#true} call #t~ret27 := min(~t.base, ~t.offset); {99#true} is VALID [2020-07-08 12:48:15,226 INFO L280 TraceCheckUtils]: 12: Hoare triple {99#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {99#true} is VALID [2020-07-08 12:48:15,226 INFO L280 TraceCheckUtils]: 13: Hoare triple {99#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {99#true} is VALID [2020-07-08 12:48:15,226 INFO L280 TraceCheckUtils]: 14: Hoare triple {99#true} assume true; {99#true} is VALID [2020-07-08 12:48:15,227 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {99#true} {99#true} #149#return; {99#true} is VALID [2020-07-08 12:48:15,227 INFO L280 TraceCheckUtils]: 16: Hoare triple {99#true} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;~a~1 := #t~ret27;havoc #t~ret27;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {99#true} is VALID [2020-07-08 12:48:15,227 INFO L263 TraceCheckUtils]: 17: Hoare triple {99#true} call #t~ret28 := size(~t.base, ~t.offset); {99#true} is VALID [2020-07-08 12:48:15,228 INFO L280 TraceCheckUtils]: 18: Hoare triple {99#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {99#true} is VALID [2020-07-08 12:48:15,228 INFO L280 TraceCheckUtils]: 19: Hoare triple {99#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {99#true} is VALID [2020-07-08 12:48:15,228 INFO L280 TraceCheckUtils]: 20: Hoare triple {99#true} assume true; {99#true} is VALID [2020-07-08 12:48:15,229 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {99#true} {99#true} #151#return; {99#true} is VALID [2020-07-08 12:48:15,229 INFO L280 TraceCheckUtils]: 22: Hoare triple {99#true} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;~n~1 := #t~ret28;havoc #t~ret28; {99#true} is VALID [2020-07-08 12:48:15,229 INFO L263 TraceCheckUtils]: 23: Hoare triple {99#true} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {99#true} is VALID [2020-07-08 12:48:15,230 INFO L280 TraceCheckUtils]: 24: Hoare triple {99#true} ~cond := #in~cond; {99#true} is VALID [2020-07-08 12:48:15,231 INFO L280 TraceCheckUtils]: 25: Hoare triple {99#true} assume 0 == ~cond;assume false; {100#false} is VALID [2020-07-08 12:48:15,231 INFO L280 TraceCheckUtils]: 26: Hoare triple {100#false} assume true; {100#false} is VALID [2020-07-08 12:48:15,231 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {100#false} {99#true} #153#return; {100#false} is VALID [2020-07-08 12:48:15,232 INFO L280 TraceCheckUtils]: 28: Hoare triple {100#false} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(4 * ~n~1); {100#false} is VALID [2020-07-08 12:48:15,232 INFO L263 TraceCheckUtils]: 29: Hoare triple {100#false} call #Ultimate.meminit(#t~malloc29.base, #t~malloc29.offset, ~n~1, 4, 4 * ~n~1); {128#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-08 12:48:15,232 INFO L280 TraceCheckUtils]: 30: Hoare triple {128#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {99#true} is VALID [2020-07-08 12:48:15,234 INFO L280 TraceCheckUtils]: 31: Hoare triple {99#true} assume true; {99#true} is VALID [2020-07-08 12:48:15,235 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {99#true} {100#false} #155#return; {100#false} is VALID [2020-07-08 12:48:15,235 INFO L280 TraceCheckUtils]: 33: Hoare triple {100#false} ~x~0.base, ~x~0.offset := #t~malloc29.base, #t~malloc29.offset; {100#false} is VALID [2020-07-08 12:48:15,235 INFO L263 TraceCheckUtils]: 34: Hoare triple {100#false} call #t~ret30 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:48:15,236 INFO L280 TraceCheckUtils]: 35: Hoare triple {129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {99#true} is VALID [2020-07-08 12:48:15,236 INFO L280 TraceCheckUtils]: 36: Hoare triple {99#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {99#true} is VALID [2020-07-08 12:48:15,236 INFO L280 TraceCheckUtils]: 37: Hoare triple {99#true} assume true; {99#true} is VALID [2020-07-08 12:48:15,237 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {99#true} {100#false} #157#return; {100#false} is VALID [2020-07-08 12:48:15,237 INFO L280 TraceCheckUtils]: 39: Hoare triple {100#false} assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647;havoc #t~ret30;call #t~mem31 := read~int(~x~0.base, ~x~0.offset, 4); {100#false} is VALID [2020-07-08 12:48:15,237 INFO L263 TraceCheckUtils]: 40: Hoare triple {100#false} call __VERIFIER_assert((if ~a~1 == #t~mem31 then 1 else 0)); {100#false} is VALID [2020-07-08 12:48:15,238 INFO L280 TraceCheckUtils]: 41: Hoare triple {100#false} ~cond := #in~cond; {100#false} is VALID [2020-07-08 12:48:15,238 INFO L280 TraceCheckUtils]: 42: Hoare triple {100#false} assume 0 == ~cond; {100#false} is VALID [2020-07-08 12:48:15,238 INFO L280 TraceCheckUtils]: 43: Hoare triple {100#false} assume !false; {100#false} is VALID [2020-07-08 12:48:15,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:48:15,248 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912214446] [2020-07-08 12:48:15,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:48:15,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:48:15,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812429827] [2020-07-08 12:48:15,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2020-07-08 12:48:15,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:15,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:48:15,334 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:48:15,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:48:15,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:15,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:48:15,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:48:15,347 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 6 states. [2020-07-08 12:48:16,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:16,741 INFO L93 Difference]: Finished difference Result 168 states and 221 transitions. [2020-07-08 12:48:16,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:48:16,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2020-07-08 12:48:16,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:48:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:48:16,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 221 transitions. [2020-07-08 12:48:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:48:16,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 221 transitions. [2020-07-08 12:48:16,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 221 transitions. [2020-07-08 12:48:17,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:48:17,168 INFO L225 Difference]: With dead ends: 168 [2020-07-08 12:48:17,168 INFO L226 Difference]: Without dead ends: 95 [2020-07-08 12:48:17,173 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:48:17,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-08 12:48:17,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2020-07-08 12:48:17,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:48:17,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 88 states. [2020-07-08 12:48:17,313 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 88 states. [2020-07-08 12:48:17,313 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 88 states. [2020-07-08 12:48:17,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:17,325 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2020-07-08 12:48:17,326 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2020-07-08 12:48:17,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:17,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:17,329 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 95 states. [2020-07-08 12:48:17,329 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 95 states. [2020-07-08 12:48:17,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:17,345 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2020-07-08 12:48:17,345 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2020-07-08 12:48:17,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:17,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:17,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:48:17,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:48:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-07-08 12:48:17,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2020-07-08 12:48:17,368 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 44 [2020-07-08 12:48:17,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:48:17,368 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2020-07-08 12:48:17,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:48:17,369 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2020-07-08 12:48:17,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-08 12:48:17,371 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:17,371 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:48:17,371 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:48:17,372 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:17,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:17,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1392280523, now seen corresponding path program 1 times [2020-07-08 12:48:17,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:17,373 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563382475] [2020-07-08 12:48:17,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:17,508 INFO L280 TraceCheckUtils]: 0: Hoare triple {706#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {677#true} is VALID [2020-07-08 12:48:17,508 INFO L280 TraceCheckUtils]: 1: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-08 12:48:17,509 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {677#true} {677#true} #179#return; {677#true} is VALID [2020-07-08 12:48:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:17,538 INFO L280 TraceCheckUtils]: 0: Hoare triple {707#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {677#true} is VALID [2020-07-08 12:48:17,539 INFO L280 TraceCheckUtils]: 1: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-08 12:48:17,539 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {677#true} {677#true} #137#return; {677#true} is VALID [2020-07-08 12:48:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:17,547 INFO L280 TraceCheckUtils]: 0: Hoare triple {677#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {677#true} is VALID [2020-07-08 12:48:17,547 INFO L280 TraceCheckUtils]: 1: Hoare triple {677#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {677#true} is VALID [2020-07-08 12:48:17,547 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-08 12:48:17,548 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {677#true} {677#true} #149#return; {677#true} is VALID [2020-07-08 12:48:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:17,569 INFO L280 TraceCheckUtils]: 0: Hoare triple {677#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {677#true} is VALID [2020-07-08 12:48:17,570 INFO L280 TraceCheckUtils]: 1: Hoare triple {677#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {708#(= 0 |size_#res|)} is VALID [2020-07-08 12:48:17,571 INFO L280 TraceCheckUtils]: 2: Hoare triple {708#(= 0 |size_#res|)} assume true; {708#(= 0 |size_#res|)} is VALID [2020-07-08 12:48:17,572 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {708#(= 0 |size_#res|)} {677#true} #151#return; {693#(= 0 |task_#t~ret28|)} is VALID [2020-07-08 12:48:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:17,604 INFO L280 TraceCheckUtils]: 0: Hoare triple {677#true} ~cond := #in~cond; {709#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2020-07-08 12:48:17,605 INFO L280 TraceCheckUtils]: 1: Hoare triple {709#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {710#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID [2020-07-08 12:48:17,606 INFO L280 TraceCheckUtils]: 2: Hoare triple {710#(not (= 0 |assume_abort_if_not_#in~cond|))} assume true; {710#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID [2020-07-08 12:48:17,607 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {710#(not (= 0 |assume_abort_if_not_#in~cond|))} {694#(= 0 task_~n~1)} #153#return; {678#false} is VALID [2020-07-08 12:48:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:17,624 INFO L280 TraceCheckUtils]: 0: Hoare triple {711#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {677#true} is VALID [2020-07-08 12:48:17,624 INFO L280 TraceCheckUtils]: 1: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-08 12:48:17,624 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {677#true} {678#false} #155#return; {678#false} is VALID [2020-07-08 12:48:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:17,648 INFO L280 TraceCheckUtils]: 0: Hoare triple {712#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {677#true} is VALID [2020-07-08 12:48:17,649 INFO L280 TraceCheckUtils]: 1: Hoare triple {677#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {677#true} is VALID [2020-07-08 12:48:17,649 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-08 12:48:17,649 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {677#true} {678#false} #157#return; {678#false} is VALID [2020-07-08 12:48:17,651 INFO L263 TraceCheckUtils]: 0: Hoare triple {677#true} call ULTIMATE.init(); {706#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:48:17,651 INFO L280 TraceCheckUtils]: 1: Hoare triple {706#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {677#true} is VALID [2020-07-08 12:48:17,651 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-08 12:48:17,651 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {677#true} {677#true} #179#return; {677#true} is VALID [2020-07-08 12:48:17,652 INFO L263 TraceCheckUtils]: 4: Hoare triple {677#true} call #t~ret41 := main(); {677#true} is VALID [2020-07-08 12:48:17,653 INFO L263 TraceCheckUtils]: 5: Hoare triple {677#true} call #t~ret40.base, #t~ret40.offset := nondet_tree(); {707#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:48:17,653 INFO L280 TraceCheckUtils]: 6: Hoare triple {707#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {677#true} is VALID [2020-07-08 12:48:17,654 INFO L280 TraceCheckUtils]: 7: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-08 12:48:17,654 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {677#true} {677#true} #137#return; {677#true} is VALID [2020-07-08 12:48:17,654 INFO L263 TraceCheckUtils]: 9: Hoare triple {677#true} call task(#t~ret40.base, #t~ret40.offset); {677#true} is VALID [2020-07-08 12:48:17,655 INFO L280 TraceCheckUtils]: 10: Hoare triple {677#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {677#true} is VALID [2020-07-08 12:48:17,655 INFO L263 TraceCheckUtils]: 11: Hoare triple {677#true} call #t~ret27 := min(~t.base, ~t.offset); {677#true} is VALID [2020-07-08 12:48:17,655 INFO L280 TraceCheckUtils]: 12: Hoare triple {677#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {677#true} is VALID [2020-07-08 12:48:17,655 INFO L280 TraceCheckUtils]: 13: Hoare triple {677#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {677#true} is VALID [2020-07-08 12:48:17,656 INFO L280 TraceCheckUtils]: 14: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-08 12:48:17,656 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {677#true} {677#true} #149#return; {677#true} is VALID [2020-07-08 12:48:17,656 INFO L280 TraceCheckUtils]: 16: Hoare triple {677#true} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;~a~1 := #t~ret27;havoc #t~ret27;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {677#true} is VALID [2020-07-08 12:48:17,657 INFO L263 TraceCheckUtils]: 17: Hoare triple {677#true} call #t~ret28 := size(~t.base, ~t.offset); {677#true} is VALID [2020-07-08 12:48:17,657 INFO L280 TraceCheckUtils]: 18: Hoare triple {677#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {677#true} is VALID [2020-07-08 12:48:17,658 INFO L280 TraceCheckUtils]: 19: Hoare triple {677#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {708#(= 0 |size_#res|)} is VALID [2020-07-08 12:48:17,658 INFO L280 TraceCheckUtils]: 20: Hoare triple {708#(= 0 |size_#res|)} assume true; {708#(= 0 |size_#res|)} is VALID [2020-07-08 12:48:17,660 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {708#(= 0 |size_#res|)} {677#true} #151#return; {693#(= 0 |task_#t~ret28|)} is VALID [2020-07-08 12:48:17,661 INFO L280 TraceCheckUtils]: 22: Hoare triple {693#(= 0 |task_#t~ret28|)} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;~n~1 := #t~ret28;havoc #t~ret28; {694#(= 0 task_~n~1)} is VALID [2020-07-08 12:48:17,661 INFO L263 TraceCheckUtils]: 23: Hoare triple {694#(= 0 task_~n~1)} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {677#true} is VALID [2020-07-08 12:48:17,662 INFO L280 TraceCheckUtils]: 24: Hoare triple {677#true} ~cond := #in~cond; {709#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2020-07-08 12:48:17,662 INFO L280 TraceCheckUtils]: 25: Hoare triple {709#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {710#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID [2020-07-08 12:48:17,663 INFO L280 TraceCheckUtils]: 26: Hoare triple {710#(not (= 0 |assume_abort_if_not_#in~cond|))} assume true; {710#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID [2020-07-08 12:48:17,664 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {710#(not (= 0 |assume_abort_if_not_#in~cond|))} {694#(= 0 task_~n~1)} #153#return; {678#false} is VALID [2020-07-08 12:48:17,664 INFO L280 TraceCheckUtils]: 28: Hoare triple {678#false} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(4 * ~n~1); {678#false} is VALID [2020-07-08 12:48:17,665 INFO L263 TraceCheckUtils]: 29: Hoare triple {678#false} call #Ultimate.meminit(#t~malloc29.base, #t~malloc29.offset, ~n~1, 4, 4 * ~n~1); {711#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-08 12:48:17,665 INFO L280 TraceCheckUtils]: 30: Hoare triple {711#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {677#true} is VALID [2020-07-08 12:48:17,665 INFO L280 TraceCheckUtils]: 31: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-08 12:48:17,666 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {677#true} {678#false} #155#return; {678#false} is VALID [2020-07-08 12:48:17,666 INFO L280 TraceCheckUtils]: 33: Hoare triple {678#false} ~x~0.base, ~x~0.offset := #t~malloc29.base, #t~malloc29.offset; {678#false} is VALID [2020-07-08 12:48:17,666 INFO L263 TraceCheckUtils]: 34: Hoare triple {678#false} call #t~ret30 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {712#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:48:17,667 INFO L280 TraceCheckUtils]: 35: Hoare triple {712#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {677#true} is VALID [2020-07-08 12:48:17,667 INFO L280 TraceCheckUtils]: 36: Hoare triple {677#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {677#true} is VALID [2020-07-08 12:48:17,667 INFO L280 TraceCheckUtils]: 37: Hoare triple {677#true} assume true; {677#true} is VALID [2020-07-08 12:48:17,667 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {677#true} {678#false} #157#return; {678#false} is VALID [2020-07-08 12:48:17,668 INFO L280 TraceCheckUtils]: 39: Hoare triple {678#false} assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647;havoc #t~ret30;call #t~mem31 := read~int(~x~0.base, ~x~0.offset, 4); {678#false} is VALID [2020-07-08 12:48:17,668 INFO L263 TraceCheckUtils]: 40: Hoare triple {678#false} call __VERIFIER_assert((if ~a~1 == #t~mem31 then 1 else 0)); {678#false} is VALID [2020-07-08 12:48:17,668 INFO L280 TraceCheckUtils]: 41: Hoare triple {678#false} ~cond := #in~cond; {678#false} is VALID [2020-07-08 12:48:17,669 INFO L280 TraceCheckUtils]: 42: Hoare triple {678#false} assume 0 == ~cond; {678#false} is VALID [2020-07-08 12:48:17,669 INFO L280 TraceCheckUtils]: 43: Hoare triple {678#false} assume !false; {678#false} is VALID [2020-07-08 12:48:17,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:48:17,673 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563382475] [2020-07-08 12:48:17,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:48:17,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-08 12:48:17,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216066271] [2020-07-08 12:48:17,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2020-07-08 12:48:17,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:17,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 12:48:17,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:48:17,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 12:48:17,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:17,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 12:48:17,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:48:17,740 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand 11 states. [2020-07-08 12:48:20,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:20,170 INFO L93 Difference]: Finished difference Result 154 states and 197 transitions. [2020-07-08 12:48:20,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 12:48:20,170 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2020-07-08 12:48:20,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:48:20,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:48:20,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2020-07-08 12:48:20,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:48:20,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2020-07-08 12:48:20,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 197 transitions. [2020-07-08 12:48:20,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:48:20,511 INFO L225 Difference]: With dead ends: 154 [2020-07-08 12:48:20,511 INFO L226 Difference]: Without dead ends: 97 [2020-07-08 12:48:20,513 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2020-07-08 12:48:20,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-07-08 12:48:20,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2020-07-08 12:48:20,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:48:20,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 90 states. [2020-07-08 12:48:20,585 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 90 states. [2020-07-08 12:48:20,586 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 90 states. [2020-07-08 12:48:20,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:20,600 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2020-07-08 12:48:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2020-07-08 12:48:20,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:20,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:20,602 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 97 states. [2020-07-08 12:48:20,603 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 97 states. [2020-07-08 12:48:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:20,613 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2020-07-08 12:48:20,613 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2020-07-08 12:48:20,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:20,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:20,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:48:20,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:48:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-08 12:48:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2020-07-08 12:48:20,626 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 44 [2020-07-08 12:48:20,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:48:20,627 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2020-07-08 12:48:20,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 12:48:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2020-07-08 12:48:20,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-08 12:48:20,632 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:20,632 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:48:20,632 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:48:20,633 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:20,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:20,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1672920772, now seen corresponding path program 1 times [2020-07-08 12:48:20,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:20,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179467359] [2020-07-08 12:48:20,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:20,777 INFO L280 TraceCheckUtils]: 0: Hoare triple {1305#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1263#true} is VALID [2020-07-08 12:48:20,778 INFO L280 TraceCheckUtils]: 1: Hoare triple {1263#true} assume true; {1263#true} is VALID [2020-07-08 12:48:20,778 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1263#true} {1263#true} #179#return; {1263#true} is VALID [2020-07-08 12:48:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:20,860 INFO L280 TraceCheckUtils]: 0: Hoare triple {1306#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {1307#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-08 12:48:20,865 INFO L280 TraceCheckUtils]: 1: Hoare triple {1307#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1307#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-08 12:48:20,866 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1307#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {1263#true} #137#return; {1271#(and (= 0 |main_#t~ret40.base|) (= 0 |main_#t~ret40.offset|))} is VALID [2020-07-08 12:48:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:20,873 INFO L280 TraceCheckUtils]: 0: Hoare triple {1263#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1263#true} is VALID [2020-07-08 12:48:20,874 INFO L280 TraceCheckUtils]: 1: Hoare triple {1263#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1263#true} is VALID [2020-07-08 12:48:20,874 INFO L280 TraceCheckUtils]: 2: Hoare triple {1263#true} assume true; {1263#true} is VALID [2020-07-08 12:48:20,875 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1263#true} {1273#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #149#return; {1273#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-08 12:48:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:20,999 INFO L280 TraceCheckUtils]: 0: Hoare triple {1263#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1263#true} is VALID [2020-07-08 12:48:20,999 INFO L280 TraceCheckUtils]: 1: Hoare triple {1263#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1263#true} is VALID [2020-07-08 12:48:20,999 INFO L280 TraceCheckUtils]: 2: Hoare triple {1263#true} assume true; {1263#true} is VALID [2020-07-08 12:48:21,000 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1263#true} {1309#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} #175#return; {1309#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 12:48:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:21,012 INFO L280 TraceCheckUtils]: 0: Hoare triple {1263#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1263#true} is VALID [2020-07-08 12:48:21,013 INFO L280 TraceCheckUtils]: 1: Hoare triple {1263#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1263#true} is VALID [2020-07-08 12:48:21,013 INFO L280 TraceCheckUtils]: 2: Hoare triple {1263#true} assume true; {1263#true} is VALID [2020-07-08 12:48:21,015 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1263#true} {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #177#return; {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 12:48:21,017 INFO L280 TraceCheckUtils]: 0: Hoare triple {1263#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1308#(and (or (= 0 size_~t.offset) (= |size_#in~t.offset| size_~t.offset)) (= |size_#in~t.base| size_~t.base))} is VALID [2020-07-08 12:48:21,019 INFO L280 TraceCheckUtils]: 1: Hoare triple {1308#(and (or (= 0 size_~t.offset) (= |size_#in~t.offset| size_~t.offset)) (= |size_#in~t.base| size_~t.base))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {1309#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 12:48:21,019 INFO L263 TraceCheckUtils]: 2: Hoare triple {1309#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1263#true} is VALID [2020-07-08 12:48:21,020 INFO L280 TraceCheckUtils]: 3: Hoare triple {1263#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1263#true} is VALID [2020-07-08 12:48:21,020 INFO L280 TraceCheckUtils]: 4: Hoare triple {1263#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1263#true} is VALID [2020-07-08 12:48:21,020 INFO L280 TraceCheckUtils]: 5: Hoare triple {1263#true} assume true; {1263#true} is VALID [2020-07-08 12:48:21,022 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1263#true} {1309#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} #175#return; {1309#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 12:48:21,024 INFO L280 TraceCheckUtils]: 7: Hoare triple {1309#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 12:48:21,025 INFO L263 TraceCheckUtils]: 8: Hoare triple {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret26 := size(#t~mem25.base, #t~mem25.offset); {1263#true} is VALID [2020-07-08 12:48:21,025 INFO L280 TraceCheckUtils]: 9: Hoare triple {1263#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1263#true} is VALID [2020-07-08 12:48:21,025 INFO L280 TraceCheckUtils]: 10: Hoare triple {1263#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1263#true} is VALID [2020-07-08 12:48:21,025 INFO L280 TraceCheckUtils]: 11: Hoare triple {1263#true} assume true; {1263#true} is VALID [2020-07-08 12:48:21,027 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1263#true} {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #177#return; {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 12:48:21,028 INFO L280 TraceCheckUtils]: 13: Hoare triple {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;#res := 1 + (#t~ret24 + #t~ret26);havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~ret26;havoc #t~mem25.base, #t~mem25.offset; {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 12:48:21,030 INFO L280 TraceCheckUtils]: 14: Hoare triple {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 12:48:21,032 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {1273#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #151#return; {1264#false} is VALID [2020-07-08 12:48:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:21,041 INFO L280 TraceCheckUtils]: 0: Hoare triple {1263#true} ~cond := #in~cond; {1263#true} is VALID [2020-07-08 12:48:21,041 INFO L280 TraceCheckUtils]: 1: Hoare triple {1263#true} assume !(0 == ~cond); {1263#true} is VALID [2020-07-08 12:48:21,041 INFO L280 TraceCheckUtils]: 2: Hoare triple {1263#true} assume true; {1263#true} is VALID [2020-07-08 12:48:21,042 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1263#true} {1264#false} #153#return; {1264#false} is VALID [2020-07-08 12:48:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:21,061 INFO L280 TraceCheckUtils]: 0: Hoare triple {1319#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1263#true} is VALID [2020-07-08 12:48:21,061 INFO L280 TraceCheckUtils]: 1: Hoare triple {1263#true} assume true; {1263#true} is VALID [2020-07-08 12:48:21,062 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1263#true} {1264#false} #155#return; {1264#false} is VALID [2020-07-08 12:48:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:21,094 INFO L280 TraceCheckUtils]: 0: Hoare triple {1320#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {1263#true} is VALID [2020-07-08 12:48:21,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {1263#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1263#true} is VALID [2020-07-08 12:48:21,094 INFO L280 TraceCheckUtils]: 2: Hoare triple {1263#true} assume true; {1263#true} is VALID [2020-07-08 12:48:21,095 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1263#true} {1264#false} #157#return; {1264#false} is VALID [2020-07-08 12:48:21,096 INFO L263 TraceCheckUtils]: 0: Hoare triple {1263#true} call ULTIMATE.init(); {1305#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:48:21,096 INFO L280 TraceCheckUtils]: 1: Hoare triple {1305#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1263#true} is VALID [2020-07-08 12:48:21,097 INFO L280 TraceCheckUtils]: 2: Hoare triple {1263#true} assume true; {1263#true} is VALID [2020-07-08 12:48:21,097 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1263#true} {1263#true} #179#return; {1263#true} is VALID [2020-07-08 12:48:21,097 INFO L263 TraceCheckUtils]: 4: Hoare triple {1263#true} call #t~ret41 := main(); {1263#true} is VALID [2020-07-08 12:48:21,098 INFO L263 TraceCheckUtils]: 5: Hoare triple {1263#true} call #t~ret40.base, #t~ret40.offset := nondet_tree(); {1306#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:48:21,100 INFO L280 TraceCheckUtils]: 6: Hoare triple {1306#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {1307#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-08 12:48:21,101 INFO L280 TraceCheckUtils]: 7: Hoare triple {1307#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1307#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-08 12:48:21,102 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1307#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {1263#true} #137#return; {1271#(and (= 0 |main_#t~ret40.base|) (= 0 |main_#t~ret40.offset|))} is VALID [2020-07-08 12:48:21,103 INFO L263 TraceCheckUtils]: 9: Hoare triple {1271#(and (= 0 |main_#t~ret40.base|) (= 0 |main_#t~ret40.offset|))} call task(#t~ret40.base, #t~ret40.offset); {1272#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} is VALID [2020-07-08 12:48:21,104 INFO L280 TraceCheckUtils]: 10: Hoare triple {1272#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1273#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-08 12:48:21,105 INFO L263 TraceCheckUtils]: 11: Hoare triple {1273#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret27 := min(~t.base, ~t.offset); {1263#true} is VALID [2020-07-08 12:48:21,105 INFO L280 TraceCheckUtils]: 12: Hoare triple {1263#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1263#true} is VALID [2020-07-08 12:48:21,105 INFO L280 TraceCheckUtils]: 13: Hoare triple {1263#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1263#true} is VALID [2020-07-08 12:48:21,105 INFO L280 TraceCheckUtils]: 14: Hoare triple {1263#true} assume true; {1263#true} is VALID [2020-07-08 12:48:21,106 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1263#true} {1273#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #149#return; {1273#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-08 12:48:21,108 INFO L280 TraceCheckUtils]: 16: Hoare triple {1273#(and (= 0 task_~t.offset) (= 0 task_~t.base))} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;~a~1 := #t~ret27;havoc #t~ret27;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {1273#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-08 12:48:21,108 INFO L263 TraceCheckUtils]: 17: Hoare triple {1273#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret28 := size(~t.base, ~t.offset); {1263#true} is VALID [2020-07-08 12:48:21,109 INFO L280 TraceCheckUtils]: 18: Hoare triple {1263#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1308#(and (or (= 0 size_~t.offset) (= |size_#in~t.offset| size_~t.offset)) (= |size_#in~t.base| size_~t.base))} is VALID [2020-07-08 12:48:21,110 INFO L280 TraceCheckUtils]: 19: Hoare triple {1308#(and (or (= 0 size_~t.offset) (= |size_#in~t.offset| size_~t.offset)) (= |size_#in~t.base| size_~t.base))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {1309#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 12:48:21,110 INFO L263 TraceCheckUtils]: 20: Hoare triple {1309#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1263#true} is VALID [2020-07-08 12:48:21,110 INFO L280 TraceCheckUtils]: 21: Hoare triple {1263#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1263#true} is VALID [2020-07-08 12:48:21,111 INFO L280 TraceCheckUtils]: 22: Hoare triple {1263#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1263#true} is VALID [2020-07-08 12:48:21,111 INFO L280 TraceCheckUtils]: 23: Hoare triple {1263#true} assume true; {1263#true} is VALID [2020-07-08 12:48:21,112 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1263#true} {1309#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} #175#return; {1309#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 12:48:21,113 INFO L280 TraceCheckUtils]: 25: Hoare triple {1309#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 12:48:21,113 INFO L263 TraceCheckUtils]: 26: Hoare triple {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret26 := size(#t~mem25.base, #t~mem25.offset); {1263#true} is VALID [2020-07-08 12:48:21,114 INFO L280 TraceCheckUtils]: 27: Hoare triple {1263#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1263#true} is VALID [2020-07-08 12:48:21,114 INFO L280 TraceCheckUtils]: 28: Hoare triple {1263#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1263#true} is VALID [2020-07-08 12:48:21,114 INFO L280 TraceCheckUtils]: 29: Hoare triple {1263#true} assume true; {1263#true} is VALID [2020-07-08 12:48:21,116 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1263#true} {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #177#return; {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 12:48:21,116 INFO L280 TraceCheckUtils]: 31: Hoare triple {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;#res := 1 + (#t~ret24 + #t~ret26);havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~ret26;havoc #t~mem25.base, #t~mem25.offset; {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 12:48:21,117 INFO L280 TraceCheckUtils]: 32: Hoare triple {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 12:48:21,118 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {1273#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #151#return; {1264#false} is VALID [2020-07-08 12:48:21,118 INFO L280 TraceCheckUtils]: 34: Hoare triple {1264#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;~n~1 := #t~ret28;havoc #t~ret28; {1264#false} is VALID [2020-07-08 12:48:21,118 INFO L263 TraceCheckUtils]: 35: Hoare triple {1264#false} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {1263#true} is VALID [2020-07-08 12:48:21,118 INFO L280 TraceCheckUtils]: 36: Hoare triple {1263#true} ~cond := #in~cond; {1263#true} is VALID [2020-07-08 12:48:21,118 INFO L280 TraceCheckUtils]: 37: Hoare triple {1263#true} assume !(0 == ~cond); {1263#true} is VALID [2020-07-08 12:48:21,119 INFO L280 TraceCheckUtils]: 38: Hoare triple {1263#true} assume true; {1263#true} is VALID [2020-07-08 12:48:21,119 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1263#true} {1264#false} #153#return; {1264#false} is VALID [2020-07-08 12:48:21,119 INFO L280 TraceCheckUtils]: 40: Hoare triple {1264#false} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(4 * ~n~1); {1264#false} is VALID [2020-07-08 12:48:21,119 INFO L263 TraceCheckUtils]: 41: Hoare triple {1264#false} call #Ultimate.meminit(#t~malloc29.base, #t~malloc29.offset, ~n~1, 4, 4 * ~n~1); {1319#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-08 12:48:21,119 INFO L280 TraceCheckUtils]: 42: Hoare triple {1319#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1263#true} is VALID [2020-07-08 12:48:21,119 INFO L280 TraceCheckUtils]: 43: Hoare triple {1263#true} assume true; {1263#true} is VALID [2020-07-08 12:48:21,120 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {1263#true} {1264#false} #155#return; {1264#false} is VALID [2020-07-08 12:48:21,120 INFO L280 TraceCheckUtils]: 45: Hoare triple {1264#false} ~x~0.base, ~x~0.offset := #t~malloc29.base, #t~malloc29.offset; {1264#false} is VALID [2020-07-08 12:48:21,120 INFO L263 TraceCheckUtils]: 46: Hoare triple {1264#false} call #t~ret30 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {1320#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:48:21,120 INFO L280 TraceCheckUtils]: 47: Hoare triple {1320#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {1263#true} is VALID [2020-07-08 12:48:21,120 INFO L280 TraceCheckUtils]: 48: Hoare triple {1263#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1263#true} is VALID [2020-07-08 12:48:21,121 INFO L280 TraceCheckUtils]: 49: Hoare triple {1263#true} assume true; {1263#true} is VALID [2020-07-08 12:48:21,121 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {1263#true} {1264#false} #157#return; {1264#false} is VALID [2020-07-08 12:48:21,121 INFO L280 TraceCheckUtils]: 51: Hoare triple {1264#false} assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647;havoc #t~ret30;call #t~mem31 := read~int(~x~0.base, ~x~0.offset, 4); {1264#false} is VALID [2020-07-08 12:48:21,121 INFO L263 TraceCheckUtils]: 52: Hoare triple {1264#false} call __VERIFIER_assert((if ~a~1 == #t~mem31 then 1 else 0)); {1264#false} is VALID [2020-07-08 12:48:21,122 INFO L280 TraceCheckUtils]: 53: Hoare triple {1264#false} ~cond := #in~cond; {1264#false} is VALID [2020-07-08 12:48:21,122 INFO L280 TraceCheckUtils]: 54: Hoare triple {1264#false} assume 0 == ~cond; {1264#false} is VALID [2020-07-08 12:48:21,122 INFO L280 TraceCheckUtils]: 55: Hoare triple {1264#false} assume !false; {1264#false} is VALID [2020-07-08 12:48:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-08 12:48:21,127 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179467359] [2020-07-08 12:48:21,127 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122078912] [2020-07-08 12:48:21,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:48:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:21,217 INFO L264 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 25 conjunts are in the unsatisfiable core [2020-07-08 12:48:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:21,244 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:48:21,394 INFO L263 TraceCheckUtils]: 0: Hoare triple {1263#true} call ULTIMATE.init(); {1263#true} is VALID [2020-07-08 12:48:21,394 INFO L280 TraceCheckUtils]: 1: Hoare triple {1263#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1263#true} is VALID [2020-07-08 12:48:21,394 INFO L280 TraceCheckUtils]: 2: Hoare triple {1263#true} assume true; {1263#true} is VALID [2020-07-08 12:48:21,395 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1263#true} {1263#true} #179#return; {1263#true} is VALID [2020-07-08 12:48:21,395 INFO L263 TraceCheckUtils]: 4: Hoare triple {1263#true} call #t~ret41 := main(); {1263#true} is VALID [2020-07-08 12:48:21,395 INFO L263 TraceCheckUtils]: 5: Hoare triple {1263#true} call #t~ret40.base, #t~ret40.offset := nondet_tree(); {1263#true} is VALID [2020-07-08 12:48:21,396 INFO L280 TraceCheckUtils]: 6: Hoare triple {1263#true} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {1307#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-08 12:48:21,397 INFO L280 TraceCheckUtils]: 7: Hoare triple {1307#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1307#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-08 12:48:21,399 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1307#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {1263#true} #137#return; {1271#(and (= 0 |main_#t~ret40.base|) (= 0 |main_#t~ret40.offset|))} is VALID [2020-07-08 12:48:21,400 INFO L263 TraceCheckUtils]: 9: Hoare triple {1271#(and (= 0 |main_#t~ret40.base|) (= 0 |main_#t~ret40.offset|))} call task(#t~ret40.base, #t~ret40.offset); {1272#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} is VALID [2020-07-08 12:48:21,401 INFO L280 TraceCheckUtils]: 10: Hoare triple {1272#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1273#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-08 12:48:21,401 INFO L263 TraceCheckUtils]: 11: Hoare triple {1273#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret27 := min(~t.base, ~t.offset); {1263#true} is VALID [2020-07-08 12:48:21,402 INFO L280 TraceCheckUtils]: 12: Hoare triple {1263#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1263#true} is VALID [2020-07-08 12:48:21,402 INFO L280 TraceCheckUtils]: 13: Hoare triple {1263#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1263#true} is VALID [2020-07-08 12:48:21,402 INFO L280 TraceCheckUtils]: 14: Hoare triple {1263#true} assume true; {1263#true} is VALID [2020-07-08 12:48:21,403 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1263#true} {1273#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #149#return; {1273#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-08 12:48:21,405 INFO L280 TraceCheckUtils]: 16: Hoare triple {1273#(and (= 0 task_~t.offset) (= 0 task_~t.base))} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;~a~1 := #t~ret27;havoc #t~ret27;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {1273#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-08 12:48:21,405 INFO L263 TraceCheckUtils]: 17: Hoare triple {1273#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret28 := size(~t.base, ~t.offset); {1263#true} is VALID [2020-07-08 12:48:21,406 INFO L280 TraceCheckUtils]: 18: Hoare triple {1263#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1378#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} is VALID [2020-07-08 12:48:21,407 INFO L280 TraceCheckUtils]: 19: Hoare triple {1378#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 12:48:21,407 INFO L263 TraceCheckUtils]: 20: Hoare triple {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1263#true} is VALID [2020-07-08 12:48:21,407 INFO L280 TraceCheckUtils]: 21: Hoare triple {1263#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1263#true} is VALID [2020-07-08 12:48:21,408 INFO L280 TraceCheckUtils]: 22: Hoare triple {1263#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1263#true} is VALID [2020-07-08 12:48:21,408 INFO L280 TraceCheckUtils]: 23: Hoare triple {1263#true} assume true; {1263#true} is VALID [2020-07-08 12:48:21,409 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1263#true} {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #175#return; {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 12:48:21,410 INFO L280 TraceCheckUtils]: 25: Hoare triple {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 12:48:21,410 INFO L263 TraceCheckUtils]: 26: Hoare triple {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret26 := size(#t~mem25.base, #t~mem25.offset); {1263#true} is VALID [2020-07-08 12:48:21,410 INFO L280 TraceCheckUtils]: 27: Hoare triple {1263#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1263#true} is VALID [2020-07-08 12:48:21,411 INFO L280 TraceCheckUtils]: 28: Hoare triple {1263#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1263#true} is VALID [2020-07-08 12:48:21,411 INFO L280 TraceCheckUtils]: 29: Hoare triple {1263#true} assume true; {1263#true} is VALID [2020-07-08 12:48:21,412 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1263#true} {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #177#return; {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 12:48:21,413 INFO L280 TraceCheckUtils]: 31: Hoare triple {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;#res := 1 + (#t~ret24 + #t~ret26);havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~ret26;havoc #t~mem25.base, #t~mem25.offset; {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 12:48:21,414 INFO L280 TraceCheckUtils]: 32: Hoare triple {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 12:48:21,415 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1314#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {1273#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #151#return; {1264#false} is VALID [2020-07-08 12:48:21,416 INFO L280 TraceCheckUtils]: 34: Hoare triple {1264#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;~n~1 := #t~ret28;havoc #t~ret28; {1264#false} is VALID [2020-07-08 12:48:21,416 INFO L263 TraceCheckUtils]: 35: Hoare triple {1264#false} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {1264#false} is VALID [2020-07-08 12:48:21,416 INFO L280 TraceCheckUtils]: 36: Hoare triple {1264#false} ~cond := #in~cond; {1264#false} is VALID [2020-07-08 12:48:21,416 INFO L280 TraceCheckUtils]: 37: Hoare triple {1264#false} assume !(0 == ~cond); {1264#false} is VALID [2020-07-08 12:48:21,417 INFO L280 TraceCheckUtils]: 38: Hoare triple {1264#false} assume true; {1264#false} is VALID [2020-07-08 12:48:21,417 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1264#false} {1264#false} #153#return; {1264#false} is VALID [2020-07-08 12:48:21,417 INFO L280 TraceCheckUtils]: 40: Hoare triple {1264#false} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(4 * ~n~1); {1264#false} is VALID [2020-07-08 12:48:21,417 INFO L263 TraceCheckUtils]: 41: Hoare triple {1264#false} call #Ultimate.meminit(#t~malloc29.base, #t~malloc29.offset, ~n~1, 4, 4 * ~n~1); {1264#false} is VALID [2020-07-08 12:48:21,418 INFO L280 TraceCheckUtils]: 42: Hoare triple {1264#false} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1264#false} is VALID [2020-07-08 12:48:21,418 INFO L280 TraceCheckUtils]: 43: Hoare triple {1264#false} assume true; {1264#false} is VALID [2020-07-08 12:48:21,418 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {1264#false} {1264#false} #155#return; {1264#false} is VALID [2020-07-08 12:48:21,418 INFO L280 TraceCheckUtils]: 45: Hoare triple {1264#false} ~x~0.base, ~x~0.offset := #t~malloc29.base, #t~malloc29.offset; {1264#false} is VALID [2020-07-08 12:48:21,419 INFO L263 TraceCheckUtils]: 46: Hoare triple {1264#false} call #t~ret30 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {1264#false} is VALID [2020-07-08 12:48:21,419 INFO L280 TraceCheckUtils]: 47: Hoare triple {1264#false} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {1264#false} is VALID [2020-07-08 12:48:21,419 INFO L280 TraceCheckUtils]: 48: Hoare triple {1264#false} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1264#false} is VALID [2020-07-08 12:48:21,419 INFO L280 TraceCheckUtils]: 49: Hoare triple {1264#false} assume true; {1264#false} is VALID [2020-07-08 12:48:21,420 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {1264#false} {1264#false} #157#return; {1264#false} is VALID [2020-07-08 12:48:21,420 INFO L280 TraceCheckUtils]: 51: Hoare triple {1264#false} assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647;havoc #t~ret30;call #t~mem31 := read~int(~x~0.base, ~x~0.offset, 4); {1264#false} is VALID [2020-07-08 12:48:21,420 INFO L263 TraceCheckUtils]: 52: Hoare triple {1264#false} call __VERIFIER_assert((if ~a~1 == #t~mem31 then 1 else 0)); {1264#false} is VALID [2020-07-08 12:48:21,420 INFO L280 TraceCheckUtils]: 53: Hoare triple {1264#false} ~cond := #in~cond; {1264#false} is VALID [2020-07-08 12:48:21,421 INFO L280 TraceCheckUtils]: 54: Hoare triple {1264#false} assume 0 == ~cond; {1264#false} is VALID [2020-07-08 12:48:21,421 INFO L280 TraceCheckUtils]: 55: Hoare triple {1264#false} assume !false; {1264#false} is VALID [2020-07-08 12:48:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-08 12:48:21,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:48:21,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 14 [2020-07-08 12:48:21,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859768493] [2020-07-08 12:48:21,428 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2020-07-08 12:48:21,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:21,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 12:48:21,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:48:21,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 12:48:21,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:21,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 12:48:21,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-07-08 12:48:21,522 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand 14 states. [2020-07-08 12:48:24,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:24,847 INFO L93 Difference]: Finished difference Result 164 states and 209 transitions. [2020-07-08 12:48:24,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 12:48:24,847 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2020-07-08 12:48:24,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:48:24,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:48:24,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 205 transitions. [2020-07-08 12:48:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:48:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 205 transitions. [2020-07-08 12:48:24,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 205 transitions. [2020-07-08 12:48:25,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:48:25,163 INFO L225 Difference]: With dead ends: 164 [2020-07-08 12:48:25,163 INFO L226 Difference]: Without dead ends: 96 [2020-07-08 12:48:25,165 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2020-07-08 12:48:25,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-08 12:48:25,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2020-07-08 12:48:25,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:48:25,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 92 states. [2020-07-08 12:48:25,240 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 92 states. [2020-07-08 12:48:25,240 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 92 states. [2020-07-08 12:48:25,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:25,247 INFO L93 Difference]: Finished difference Result 96 states and 123 transitions. [2020-07-08 12:48:25,247 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2020-07-08 12:48:25,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:25,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:25,248 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 96 states. [2020-07-08 12:48:25,248 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 96 states. [2020-07-08 12:48:25,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:25,255 INFO L93 Difference]: Finished difference Result 96 states and 123 transitions. [2020-07-08 12:48:25,255 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2020-07-08 12:48:25,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:25,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:25,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:48:25,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:48:25,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-07-08 12:48:25,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2020-07-08 12:48:25,262 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 56 [2020-07-08 12:48:25,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:48:25,262 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 116 transitions. [2020-07-08 12:48:25,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 12:48:25,262 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2020-07-08 12:48:25,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-08 12:48:25,263 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:25,264 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:48:25,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-08 12:48:25,477 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:25,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:25,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1614566559, now seen corresponding path program 1 times [2020-07-08 12:48:25,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:25,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979120652] [2020-07-08 12:48:25,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:25,623 INFO L280 TraceCheckUtils]: 0: Hoare triple {2108#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2056#true} is VALID [2020-07-08 12:48:25,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {2056#true} assume true; {2056#true} is VALID [2020-07-08 12:48:25,624 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2056#true} {2056#true} #179#return; {2056#true} is VALID [2020-07-08 12:48:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:25,737 INFO L280 TraceCheckUtils]: 0: Hoare triple {2109#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2056#true} is VALID [2020-07-08 12:48:25,737 INFO L280 TraceCheckUtils]: 1: Hoare triple {2056#true} assume true; {2056#true} is VALID [2020-07-08 12:48:25,738 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2056#true} {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #145#return; {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-08 12:48:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:25,749 INFO L280 TraceCheckUtils]: 0: Hoare triple {2109#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2056#true} is VALID [2020-07-08 12:48:25,749 INFO L280 TraceCheckUtils]: 1: Hoare triple {2056#true} assume true; {2056#true} is VALID [2020-07-08 12:48:25,750 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2056#true} {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #147#return; {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-08 12:48:25,752 INFO L280 TraceCheckUtils]: 0: Hoare triple {2109#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~nondet1 % 256);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet3; {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-08 12:48:25,754 INFO L263 TraceCheckUtils]: 1: Hoare triple {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2109#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:48:25,754 INFO L280 TraceCheckUtils]: 2: Hoare triple {2109#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2056#true} is VALID [2020-07-08 12:48:25,754 INFO L280 TraceCheckUtils]: 3: Hoare triple {2056#true} assume true; {2056#true} is VALID [2020-07-08 12:48:25,755 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2056#true} {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #145#return; {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-08 12:48:25,756 INFO L280 TraceCheckUtils]: 5: Hoare triple {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret4.base, #t~ret4.offset; {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-08 12:48:25,757 INFO L263 TraceCheckUtils]: 6: Hoare triple {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2109#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:48:25,757 INFO L280 TraceCheckUtils]: 7: Hoare triple {2109#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2056#true} is VALID [2020-07-08 12:48:25,758 INFO L280 TraceCheckUtils]: 8: Hoare triple {2056#true} assume true; {2056#true} is VALID [2020-07-08 12:48:25,758 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2056#true} {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #147#return; {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-08 12:48:25,759 INFO L280 TraceCheckUtils]: 10: Hoare triple {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2117#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-08 12:48:25,760 INFO L280 TraceCheckUtils]: 11: Hoare triple {2117#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} assume true; {2117#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-08 12:48:25,761 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2117#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} {2056#true} #137#return; {2074#(not (= 0 |main_#t~ret40.base|))} is VALID [2020-07-08 12:48:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:25,796 INFO L280 TraceCheckUtils]: 0: Hoare triple {2056#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2118#(= min_~n.base |min_#in~n.base|)} is VALID [2020-07-08 12:48:25,797 INFO L280 TraceCheckUtils]: 1: Hoare triple {2118#(= min_~n.base |min_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2119#(= 0 |min_#in~n.base|)} is VALID [2020-07-08 12:48:25,797 INFO L280 TraceCheckUtils]: 2: Hoare triple {2119#(= 0 |min_#in~n.base|)} assume true; {2119#(= 0 |min_#in~n.base|)} is VALID [2020-07-08 12:48:25,798 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2119#(= 0 |min_#in~n.base|)} {2076#(not (= 0 task_~t.base))} #149#return; {2057#false} is VALID [2020-07-08 12:48:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:25,811 INFO L280 TraceCheckUtils]: 0: Hoare triple {2056#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2056#true} is VALID [2020-07-08 12:48:25,811 INFO L280 TraceCheckUtils]: 1: Hoare triple {2056#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2056#true} is VALID [2020-07-08 12:48:25,812 INFO L280 TraceCheckUtils]: 2: Hoare triple {2056#true} assume true; {2056#true} is VALID [2020-07-08 12:48:25,812 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2056#true} {2056#true} #175#return; {2056#true} is VALID [2020-07-08 12:48:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:25,815 INFO L280 TraceCheckUtils]: 0: Hoare triple {2056#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2056#true} is VALID [2020-07-08 12:48:25,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {2056#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2056#true} is VALID [2020-07-08 12:48:25,816 INFO L280 TraceCheckUtils]: 2: Hoare triple {2056#true} assume true; {2056#true} is VALID [2020-07-08 12:48:25,816 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2056#true} {2056#true} #177#return; {2056#true} is VALID [2020-07-08 12:48:25,816 INFO L280 TraceCheckUtils]: 0: Hoare triple {2056#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2056#true} is VALID [2020-07-08 12:48:25,817 INFO L280 TraceCheckUtils]: 1: Hoare triple {2056#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2056#true} is VALID [2020-07-08 12:48:25,817 INFO L263 TraceCheckUtils]: 2: Hoare triple {2056#true} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {2056#true} is VALID [2020-07-08 12:48:25,817 INFO L280 TraceCheckUtils]: 3: Hoare triple {2056#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2056#true} is VALID [2020-07-08 12:48:25,817 INFO L280 TraceCheckUtils]: 4: Hoare triple {2056#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2056#true} is VALID [2020-07-08 12:48:25,818 INFO L280 TraceCheckUtils]: 5: Hoare triple {2056#true} assume true; {2056#true} is VALID [2020-07-08 12:48:25,818 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {2056#true} {2056#true} #175#return; {2056#true} is VALID [2020-07-08 12:48:25,818 INFO L280 TraceCheckUtils]: 7: Hoare triple {2056#true} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2056#true} is VALID [2020-07-08 12:48:25,818 INFO L263 TraceCheckUtils]: 8: Hoare triple {2056#true} call #t~ret26 := size(#t~mem25.base, #t~mem25.offset); {2056#true} is VALID [2020-07-08 12:48:25,819 INFO L280 TraceCheckUtils]: 9: Hoare triple {2056#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2056#true} is VALID [2020-07-08 12:48:25,819 INFO L280 TraceCheckUtils]: 10: Hoare triple {2056#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2056#true} is VALID [2020-07-08 12:48:25,819 INFO L280 TraceCheckUtils]: 11: Hoare triple {2056#true} assume true; {2056#true} is VALID [2020-07-08 12:48:25,819 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2056#true} {2056#true} #177#return; {2056#true} is VALID [2020-07-08 12:48:25,820 INFO L280 TraceCheckUtils]: 13: Hoare triple {2056#true} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;#res := 1 + (#t~ret24 + #t~ret26);havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~ret26;havoc #t~mem25.base, #t~mem25.offset; {2056#true} is VALID [2020-07-08 12:48:25,820 INFO L280 TraceCheckUtils]: 14: Hoare triple {2056#true} assume true; {2056#true} is VALID [2020-07-08 12:48:25,820 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2056#true} {2057#false} #151#return; {2057#false} is VALID [2020-07-08 12:48:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:25,825 INFO L280 TraceCheckUtils]: 0: Hoare triple {2056#true} ~cond := #in~cond; {2056#true} is VALID [2020-07-08 12:48:25,825 INFO L280 TraceCheckUtils]: 1: Hoare triple {2056#true} assume !(0 == ~cond); {2056#true} is VALID [2020-07-08 12:48:25,825 INFO L280 TraceCheckUtils]: 2: Hoare triple {2056#true} assume true; {2056#true} is VALID [2020-07-08 12:48:25,826 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2056#true} {2057#false} #153#return; {2057#false} is VALID [2020-07-08 12:48:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:25,842 INFO L280 TraceCheckUtils]: 0: Hoare triple {2128#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2056#true} is VALID [2020-07-08 12:48:25,842 INFO L280 TraceCheckUtils]: 1: Hoare triple {2056#true} assume true; {2056#true} is VALID [2020-07-08 12:48:25,843 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2056#true} {2057#false} #155#return; {2057#false} is VALID [2020-07-08 12:48:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:25,887 INFO L280 TraceCheckUtils]: 0: Hoare triple {2129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2056#true} is VALID [2020-07-08 12:48:25,887 INFO L280 TraceCheckUtils]: 1: Hoare triple {2056#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2056#true} is VALID [2020-07-08 12:48:25,887 INFO L280 TraceCheckUtils]: 2: Hoare triple {2056#true} assume true; {2056#true} is VALID [2020-07-08 12:48:25,887 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2056#true} {2057#false} #157#return; {2057#false} is VALID [2020-07-08 12:48:25,889 INFO L263 TraceCheckUtils]: 0: Hoare triple {2056#true} call ULTIMATE.init(); {2108#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:48:25,889 INFO L280 TraceCheckUtils]: 1: Hoare triple {2108#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2056#true} is VALID [2020-07-08 12:48:25,889 INFO L280 TraceCheckUtils]: 2: Hoare triple {2056#true} assume true; {2056#true} is VALID [2020-07-08 12:48:25,890 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2056#true} {2056#true} #179#return; {2056#true} is VALID [2020-07-08 12:48:25,890 INFO L263 TraceCheckUtils]: 4: Hoare triple {2056#true} call #t~ret41 := main(); {2056#true} is VALID [2020-07-08 12:48:25,891 INFO L263 TraceCheckUtils]: 5: Hoare triple {2056#true} call #t~ret40.base, #t~ret40.offset := nondet_tree(); {2109#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:48:25,894 INFO L280 TraceCheckUtils]: 6: Hoare triple {2109#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~nondet1 % 256);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet3; {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-08 12:48:25,895 INFO L263 TraceCheckUtils]: 7: Hoare triple {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2109#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:48:25,896 INFO L280 TraceCheckUtils]: 8: Hoare triple {2109#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2056#true} is VALID [2020-07-08 12:48:25,896 INFO L280 TraceCheckUtils]: 9: Hoare triple {2056#true} assume true; {2056#true} is VALID [2020-07-08 12:48:25,897 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2056#true} {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #145#return; {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-08 12:48:25,898 INFO L280 TraceCheckUtils]: 11: Hoare triple {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret4.base, #t~ret4.offset; {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-08 12:48:25,899 INFO L263 TraceCheckUtils]: 12: Hoare triple {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2109#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:48:25,900 INFO L280 TraceCheckUtils]: 13: Hoare triple {2109#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2056#true} is VALID [2020-07-08 12:48:25,900 INFO L280 TraceCheckUtils]: 14: Hoare triple {2056#true} assume true; {2056#true} is VALID [2020-07-08 12:48:25,901 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2056#true} {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #147#return; {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-08 12:48:25,903 INFO L280 TraceCheckUtils]: 16: Hoare triple {2110#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2117#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-08 12:48:25,903 INFO L280 TraceCheckUtils]: 17: Hoare triple {2117#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} assume true; {2117#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-08 12:48:25,904 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2117#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} {2056#true} #137#return; {2074#(not (= 0 |main_#t~ret40.base|))} is VALID [2020-07-08 12:48:25,905 INFO L263 TraceCheckUtils]: 19: Hoare triple {2074#(not (= 0 |main_#t~ret40.base|))} call task(#t~ret40.base, #t~ret40.offset); {2075#(not (= |task_#in~t.base| 0))} is VALID [2020-07-08 12:48:25,906 INFO L280 TraceCheckUtils]: 20: Hoare triple {2075#(not (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2076#(not (= 0 task_~t.base))} is VALID [2020-07-08 12:48:25,906 INFO L263 TraceCheckUtils]: 21: Hoare triple {2076#(not (= 0 task_~t.base))} call #t~ret27 := min(~t.base, ~t.offset); {2056#true} is VALID [2020-07-08 12:48:25,907 INFO L280 TraceCheckUtils]: 22: Hoare triple {2056#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2118#(= min_~n.base |min_#in~n.base|)} is VALID [2020-07-08 12:48:25,908 INFO L280 TraceCheckUtils]: 23: Hoare triple {2118#(= min_~n.base |min_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2119#(= 0 |min_#in~n.base|)} is VALID [2020-07-08 12:48:25,908 INFO L280 TraceCheckUtils]: 24: Hoare triple {2119#(= 0 |min_#in~n.base|)} assume true; {2119#(= 0 |min_#in~n.base|)} is VALID [2020-07-08 12:48:25,909 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2119#(= 0 |min_#in~n.base|)} {2076#(not (= 0 task_~t.base))} #149#return; {2057#false} is VALID [2020-07-08 12:48:25,910 INFO L280 TraceCheckUtils]: 26: Hoare triple {2057#false} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;~a~1 := #t~ret27;havoc #t~ret27;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {2057#false} is VALID [2020-07-08 12:48:25,910 INFO L263 TraceCheckUtils]: 27: Hoare triple {2057#false} call #t~ret28 := size(~t.base, ~t.offset); {2056#true} is VALID [2020-07-08 12:48:25,910 INFO L280 TraceCheckUtils]: 28: Hoare triple {2056#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2056#true} is VALID [2020-07-08 12:48:25,913 INFO L280 TraceCheckUtils]: 29: Hoare triple {2056#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2056#true} is VALID [2020-07-08 12:48:25,913 INFO L263 TraceCheckUtils]: 30: Hoare triple {2056#true} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {2056#true} is VALID [2020-07-08 12:48:25,913 INFO L280 TraceCheckUtils]: 31: Hoare triple {2056#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2056#true} is VALID [2020-07-08 12:48:25,913 INFO L280 TraceCheckUtils]: 32: Hoare triple {2056#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2056#true} is VALID [2020-07-08 12:48:25,913 INFO L280 TraceCheckUtils]: 33: Hoare triple {2056#true} assume true; {2056#true} is VALID [2020-07-08 12:48:25,914 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2056#true} {2056#true} #175#return; {2056#true} is VALID [2020-07-08 12:48:25,914 INFO L280 TraceCheckUtils]: 35: Hoare triple {2056#true} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2056#true} is VALID [2020-07-08 12:48:25,914 INFO L263 TraceCheckUtils]: 36: Hoare triple {2056#true} call #t~ret26 := size(#t~mem25.base, #t~mem25.offset); {2056#true} is VALID [2020-07-08 12:48:25,915 INFO L280 TraceCheckUtils]: 37: Hoare triple {2056#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2056#true} is VALID [2020-07-08 12:48:25,916 INFO L280 TraceCheckUtils]: 38: Hoare triple {2056#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2056#true} is VALID [2020-07-08 12:48:25,916 INFO L280 TraceCheckUtils]: 39: Hoare triple {2056#true} assume true; {2056#true} is VALID [2020-07-08 12:48:25,916 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2056#true} {2056#true} #177#return; {2056#true} is VALID [2020-07-08 12:48:25,917 INFO L280 TraceCheckUtils]: 41: Hoare triple {2056#true} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;#res := 1 + (#t~ret24 + #t~ret26);havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~ret26;havoc #t~mem25.base, #t~mem25.offset; {2056#true} is VALID [2020-07-08 12:48:25,917 INFO L280 TraceCheckUtils]: 42: Hoare triple {2056#true} assume true; {2056#true} is VALID [2020-07-08 12:48:25,917 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {2056#true} {2057#false} #151#return; {2057#false} is VALID [2020-07-08 12:48:25,917 INFO L280 TraceCheckUtils]: 44: Hoare triple {2057#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;~n~1 := #t~ret28;havoc #t~ret28; {2057#false} is VALID [2020-07-08 12:48:25,918 INFO L263 TraceCheckUtils]: 45: Hoare triple {2057#false} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {2056#true} is VALID [2020-07-08 12:48:25,918 INFO L280 TraceCheckUtils]: 46: Hoare triple {2056#true} ~cond := #in~cond; {2056#true} is VALID [2020-07-08 12:48:25,923 INFO L280 TraceCheckUtils]: 47: Hoare triple {2056#true} assume !(0 == ~cond); {2056#true} is VALID [2020-07-08 12:48:25,924 INFO L280 TraceCheckUtils]: 48: Hoare triple {2056#true} assume true; {2056#true} is VALID [2020-07-08 12:48:25,924 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {2056#true} {2057#false} #153#return; {2057#false} is VALID [2020-07-08 12:48:25,924 INFO L280 TraceCheckUtils]: 50: Hoare triple {2057#false} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(4 * ~n~1); {2057#false} is VALID [2020-07-08 12:48:25,925 INFO L263 TraceCheckUtils]: 51: Hoare triple {2057#false} call #Ultimate.meminit(#t~malloc29.base, #t~malloc29.offset, ~n~1, 4, 4 * ~n~1); {2128#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-08 12:48:25,925 INFO L280 TraceCheckUtils]: 52: Hoare triple {2128#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2056#true} is VALID [2020-07-08 12:48:25,925 INFO L280 TraceCheckUtils]: 53: Hoare triple {2056#true} assume true; {2056#true} is VALID [2020-07-08 12:48:25,926 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {2056#true} {2057#false} #155#return; {2057#false} is VALID [2020-07-08 12:48:25,926 INFO L280 TraceCheckUtils]: 55: Hoare triple {2057#false} ~x~0.base, ~x~0.offset := #t~malloc29.base, #t~malloc29.offset; {2057#false} is VALID [2020-07-08 12:48:25,928 INFO L263 TraceCheckUtils]: 56: Hoare triple {2057#false} call #t~ret30 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {2129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:48:25,929 INFO L280 TraceCheckUtils]: 57: Hoare triple {2129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2056#true} is VALID [2020-07-08 12:48:25,929 INFO L280 TraceCheckUtils]: 58: Hoare triple {2056#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2056#true} is VALID [2020-07-08 12:48:25,929 INFO L280 TraceCheckUtils]: 59: Hoare triple {2056#true} assume true; {2056#true} is VALID [2020-07-08 12:48:25,930 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {2056#true} {2057#false} #157#return; {2057#false} is VALID [2020-07-08 12:48:25,930 INFO L280 TraceCheckUtils]: 61: Hoare triple {2057#false} assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647;havoc #t~ret30;call #t~mem31 := read~int(~x~0.base, ~x~0.offset, 4); {2057#false} is VALID [2020-07-08 12:48:25,930 INFO L263 TraceCheckUtils]: 62: Hoare triple {2057#false} call __VERIFIER_assert((if ~a~1 == #t~mem31 then 1 else 0)); {2057#false} is VALID [2020-07-08 12:48:25,931 INFO L280 TraceCheckUtils]: 63: Hoare triple {2057#false} ~cond := #in~cond; {2057#false} is VALID [2020-07-08 12:48:25,931 INFO L280 TraceCheckUtils]: 64: Hoare triple {2057#false} assume 0 == ~cond; {2057#false} is VALID [2020-07-08 12:48:25,931 INFO L280 TraceCheckUtils]: 65: Hoare triple {2057#false} assume !false; {2057#false} is VALID [2020-07-08 12:48:25,945 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-08 12:48:25,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979120652] [2020-07-08 12:48:25,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:48:25,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-08 12:48:25,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089264831] [2020-07-08 12:48:25,949 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2020-07-08 12:48:25,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:25,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 12:48:26,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:48:26,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 12:48:26,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:26,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 12:48:26,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-07-08 12:48:26,043 INFO L87 Difference]: Start difference. First operand 92 states and 116 transitions. Second operand 13 states. [2020-07-08 12:48:29,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:29,051 INFO L93 Difference]: Finished difference Result 163 states and 208 transitions. [2020-07-08 12:48:29,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-08 12:48:29,052 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2020-07-08 12:48:29,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:48:29,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 12:48:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 200 transitions. [2020-07-08 12:48:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 12:48:29,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 200 transitions. [2020-07-08 12:48:29,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 200 transitions. [2020-07-08 12:48:29,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:48:29,381 INFO L225 Difference]: With dead ends: 163 [2020-07-08 12:48:29,381 INFO L226 Difference]: Without dead ends: 98 [2020-07-08 12:48:29,382 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2020-07-08 12:48:29,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-08 12:48:29,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2020-07-08 12:48:29,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:48:29,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 94 states. [2020-07-08 12:48:29,459 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 94 states. [2020-07-08 12:48:29,459 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 94 states. [2020-07-08 12:48:29,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:29,466 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2020-07-08 12:48:29,466 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2020-07-08 12:48:29,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:29,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:29,467 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 98 states. [2020-07-08 12:48:29,467 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 98 states. [2020-07-08 12:48:29,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:29,474 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2020-07-08 12:48:29,474 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2020-07-08 12:48:29,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:29,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:29,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:48:29,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:48:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-08 12:48:29,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2020-07-08 12:48:29,481 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 66 [2020-07-08 12:48:29,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:48:29,481 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2020-07-08 12:48:29,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 12:48:29,482 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2020-07-08 12:48:29,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-08 12:48:29,485 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:29,486 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2020-07-08 12:48:29,486 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 12:48:29,486 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:29,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:29,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1598247989, now seen corresponding path program 1 times [2020-07-08 12:48:29,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:29,487 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787881057] [2020-07-08 12:48:29,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:29,595 INFO L280 TraceCheckUtils]: 0: Hoare triple {2767#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2701#true} is VALID [2020-07-08 12:48:29,595 INFO L280 TraceCheckUtils]: 1: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:29,595 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2701#true} {2701#true} #179#return; {2701#true} is VALID [2020-07-08 12:48:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:29,671 INFO L280 TraceCheckUtils]: 0: Hoare triple {2768#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2701#true} is VALID [2020-07-08 12:48:29,672 INFO L280 TraceCheckUtils]: 1: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:29,673 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2701#true} {2769#(= nondet_tree_~n~0.offset 0)} #145#return; {2769#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-08 12:48:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:29,680 INFO L280 TraceCheckUtils]: 0: Hoare triple {2768#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2701#true} is VALID [2020-07-08 12:48:29,681 INFO L280 TraceCheckUtils]: 1: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:29,681 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2701#true} {2769#(= nondet_tree_~n~0.offset 0)} #147#return; {2769#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-08 12:48:29,683 INFO L280 TraceCheckUtils]: 0: Hoare triple {2768#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~nondet1 % 256);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet3; {2769#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-08 12:48:29,684 INFO L263 TraceCheckUtils]: 1: Hoare triple {2769#(= nondet_tree_~n~0.offset 0)} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2768#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:48:29,685 INFO L280 TraceCheckUtils]: 2: Hoare triple {2768#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2701#true} is VALID [2020-07-08 12:48:29,685 INFO L280 TraceCheckUtils]: 3: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:29,686 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2701#true} {2769#(= nondet_tree_~n~0.offset 0)} #145#return; {2769#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-08 12:48:29,687 INFO L280 TraceCheckUtils]: 5: Hoare triple {2769#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret4.base, #t~ret4.offset; {2769#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-08 12:48:29,688 INFO L263 TraceCheckUtils]: 6: Hoare triple {2769#(= nondet_tree_~n~0.offset 0)} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2768#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:48:29,688 INFO L280 TraceCheckUtils]: 7: Hoare triple {2768#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2701#true} is VALID [2020-07-08 12:48:29,689 INFO L280 TraceCheckUtils]: 8: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:29,690 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2701#true} {2769#(= nondet_tree_~n~0.offset 0)} #147#return; {2769#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-08 12:48:29,690 INFO L280 TraceCheckUtils]: 10: Hoare triple {2769#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2776#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-08 12:48:29,691 INFO L280 TraceCheckUtils]: 11: Hoare triple {2776#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} assume true; {2776#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-08 12:48:29,693 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2776#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} {2701#true} #137#return; {2719#(= 0 |main_#t~ret40.offset|)} is VALID [2020-07-08 12:48:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:29,850 INFO L280 TraceCheckUtils]: 0: Hoare triple {2701#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2701#true} is VALID [2020-07-08 12:48:29,851 INFO L280 TraceCheckUtils]: 1: Hoare triple {2701#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2701#true} is VALID [2020-07-08 12:48:29,851 INFO L280 TraceCheckUtils]: 2: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:29,852 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2701#true} {2778#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} #141#return; {2778#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:29,857 INFO L280 TraceCheckUtils]: 0: Hoare triple {2701#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2701#true} is VALID [2020-07-08 12:48:29,858 INFO L280 TraceCheckUtils]: 1: Hoare triple {2701#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2701#true} is VALID [2020-07-08 12:48:29,858 INFO L280 TraceCheckUtils]: 2: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:29,860 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2701#true} {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #143#return; {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:29,861 INFO L280 TraceCheckUtils]: 0: Hoare triple {2701#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2777#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} is VALID [2020-07-08 12:48:29,862 INFO L280 TraceCheckUtils]: 1: Hoare triple {2777#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} assume !(~n.base == 0 && ~n.offset == 0);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 4); {2778#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:29,862 INFO L263 TraceCheckUtils]: 2: Hoare triple {2778#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} call #t~ret7 := min(#t~mem6.base, #t~mem6.offset); {2701#true} is VALID [2020-07-08 12:48:29,863 INFO L280 TraceCheckUtils]: 3: Hoare triple {2701#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2701#true} is VALID [2020-07-08 12:48:29,863 INFO L280 TraceCheckUtils]: 4: Hoare triple {2701#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2701#true} is VALID [2020-07-08 12:48:29,863 INFO L280 TraceCheckUtils]: 5: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:29,865 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {2701#true} {2778#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} #141#return; {2778#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:29,866 INFO L280 TraceCheckUtils]: 7: Hoare triple {2778#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~a~0 := #t~ret7;havoc #t~ret7;havoc #t~mem6.base, #t~mem6.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~n.base, 8 + ~n.offset, 4); {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:29,867 INFO L263 TraceCheckUtils]: 8: Hoare triple {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret9 := min(#t~mem8.base, #t~mem8.offset); {2701#true} is VALID [2020-07-08 12:48:29,867 INFO L280 TraceCheckUtils]: 9: Hoare triple {2701#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2701#true} is VALID [2020-07-08 12:48:29,868 INFO L280 TraceCheckUtils]: 10: Hoare triple {2701#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2701#true} is VALID [2020-07-08 12:48:29,868 INFO L280 TraceCheckUtils]: 11: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:29,873 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2701#true} {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #143#return; {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:29,875 INFO L280 TraceCheckUtils]: 13: Hoare triple {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~b~0 := #t~ret9;havoc #t~ret9;havoc #t~mem8.base, #t~mem8.offset; {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:29,876 INFO L280 TraceCheckUtils]: 14: Hoare triple {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume ~a~0 <= ~b~0;#res := ~a~0; {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:29,876 INFO L280 TraceCheckUtils]: 15: Hoare triple {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume true; {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:29,877 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} {2721#(= 0 task_~t.offset)} #149#return; {2739#(not (= 0 task_~t.base))} is VALID [2020-07-08 12:48:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:29,891 INFO L280 TraceCheckUtils]: 0: Hoare triple {2701#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2701#true} is VALID [2020-07-08 12:48:29,892 INFO L280 TraceCheckUtils]: 1: Hoare triple {2701#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2701#true} is VALID [2020-07-08 12:48:29,892 INFO L280 TraceCheckUtils]: 2: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:29,892 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2701#true} {2701#true} #175#return; {2701#true} is VALID [2020-07-08 12:48:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:29,896 INFO L280 TraceCheckUtils]: 0: Hoare triple {2701#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2701#true} is VALID [2020-07-08 12:48:29,896 INFO L280 TraceCheckUtils]: 1: Hoare triple {2701#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2701#true} is VALID [2020-07-08 12:48:29,897 INFO L280 TraceCheckUtils]: 2: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:29,897 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2701#true} {2701#true} #177#return; {2701#true} is VALID [2020-07-08 12:48:29,897 INFO L280 TraceCheckUtils]: 0: Hoare triple {2701#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2701#true} is VALID [2020-07-08 12:48:29,897 INFO L280 TraceCheckUtils]: 1: Hoare triple {2701#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2701#true} is VALID [2020-07-08 12:48:29,898 INFO L263 TraceCheckUtils]: 2: Hoare triple {2701#true} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {2701#true} is VALID [2020-07-08 12:48:29,898 INFO L280 TraceCheckUtils]: 3: Hoare triple {2701#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2701#true} is VALID [2020-07-08 12:48:29,898 INFO L280 TraceCheckUtils]: 4: Hoare triple {2701#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2701#true} is VALID [2020-07-08 12:48:29,898 INFO L280 TraceCheckUtils]: 5: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:29,898 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {2701#true} {2701#true} #175#return; {2701#true} is VALID [2020-07-08 12:48:29,899 INFO L280 TraceCheckUtils]: 7: Hoare triple {2701#true} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2701#true} is VALID [2020-07-08 12:48:29,899 INFO L263 TraceCheckUtils]: 8: Hoare triple {2701#true} call #t~ret26 := size(#t~mem25.base, #t~mem25.offset); {2701#true} is VALID [2020-07-08 12:48:29,899 INFO L280 TraceCheckUtils]: 9: Hoare triple {2701#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2701#true} is VALID [2020-07-08 12:48:29,899 INFO L280 TraceCheckUtils]: 10: Hoare triple {2701#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2701#true} is VALID [2020-07-08 12:48:29,899 INFO L280 TraceCheckUtils]: 11: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:29,900 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2701#true} {2701#true} #177#return; {2701#true} is VALID [2020-07-08 12:48:29,900 INFO L280 TraceCheckUtils]: 13: Hoare triple {2701#true} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;#res := 1 + (#t~ret24 + #t~ret26);havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~ret26;havoc #t~mem25.base, #t~mem25.offset; {2701#true} is VALID [2020-07-08 12:48:29,900 INFO L280 TraceCheckUtils]: 14: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:29,901 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2701#true} {2739#(not (= 0 task_~t.base))} #151#return; {2739#(not (= 0 task_~t.base))} is VALID [2020-07-08 12:48:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:29,907 INFO L280 TraceCheckUtils]: 0: Hoare triple {2701#true} ~cond := #in~cond; {2701#true} is VALID [2020-07-08 12:48:29,907 INFO L280 TraceCheckUtils]: 1: Hoare triple {2701#true} assume !(0 == ~cond); {2701#true} is VALID [2020-07-08 12:48:29,907 INFO L280 TraceCheckUtils]: 2: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:29,908 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2701#true} {2739#(not (= 0 task_~t.base))} #153#return; {2739#(not (= 0 task_~t.base))} is VALID [2020-07-08 12:48:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:29,932 INFO L280 TraceCheckUtils]: 0: Hoare triple {2796#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2701#true} is VALID [2020-07-08 12:48:29,932 INFO L280 TraceCheckUtils]: 1: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:29,933 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2701#true} {2739#(not (= 0 task_~t.base))} #155#return; {2739#(not (= 0 task_~t.base))} is VALID [2020-07-08 12:48:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:29,996 INFO L280 TraceCheckUtils]: 0: Hoare triple {2797#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2798#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2020-07-08 12:48:29,997 INFO L280 TraceCheckUtils]: 1: Hoare triple {2798#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2799#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-08 12:48:29,997 INFO L280 TraceCheckUtils]: 2: Hoare triple {2799#(= 0 |tree_inorder_#in~t.base|)} assume true; {2799#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-08 12:48:29,999 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2799#(= 0 |tree_inorder_#in~t.base|)} {2739#(not (= 0 task_~t.base))} #157#return; {2702#false} is VALID [2020-07-08 12:48:30,000 INFO L263 TraceCheckUtils]: 0: Hoare triple {2701#true} call ULTIMATE.init(); {2767#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:48:30,000 INFO L280 TraceCheckUtils]: 1: Hoare triple {2767#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2701#true} is VALID [2020-07-08 12:48:30,000 INFO L280 TraceCheckUtils]: 2: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:30,000 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2701#true} {2701#true} #179#return; {2701#true} is VALID [2020-07-08 12:48:30,001 INFO L263 TraceCheckUtils]: 4: Hoare triple {2701#true} call #t~ret41 := main(); {2701#true} is VALID [2020-07-08 12:48:30,002 INFO L263 TraceCheckUtils]: 5: Hoare triple {2701#true} call #t~ret40.base, #t~ret40.offset := nondet_tree(); {2768#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:48:30,003 INFO L280 TraceCheckUtils]: 6: Hoare triple {2768#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~nondet1 % 256);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet3; {2769#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-08 12:48:30,004 INFO L263 TraceCheckUtils]: 7: Hoare triple {2769#(= nondet_tree_~n~0.offset 0)} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2768#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:48:30,004 INFO L280 TraceCheckUtils]: 8: Hoare triple {2768#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2701#true} is VALID [2020-07-08 12:48:30,004 INFO L280 TraceCheckUtils]: 9: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:30,005 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2701#true} {2769#(= nondet_tree_~n~0.offset 0)} #145#return; {2769#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-08 12:48:30,006 INFO L280 TraceCheckUtils]: 11: Hoare triple {2769#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret4.base, #t~ret4.offset; {2769#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-08 12:48:30,017 INFO L263 TraceCheckUtils]: 12: Hoare triple {2769#(= nondet_tree_~n~0.offset 0)} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2768#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:48:30,018 INFO L280 TraceCheckUtils]: 13: Hoare triple {2768#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2701#true} is VALID [2020-07-08 12:48:30,018 INFO L280 TraceCheckUtils]: 14: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:30,019 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2701#true} {2769#(= nondet_tree_~n~0.offset 0)} #147#return; {2769#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-08 12:48:30,020 INFO L280 TraceCheckUtils]: 16: Hoare triple {2769#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2776#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-08 12:48:30,021 INFO L280 TraceCheckUtils]: 17: Hoare triple {2776#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} assume true; {2776#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-08 12:48:30,022 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2776#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} {2701#true} #137#return; {2719#(= 0 |main_#t~ret40.offset|)} is VALID [2020-07-08 12:48:30,023 INFO L263 TraceCheckUtils]: 19: Hoare triple {2719#(= 0 |main_#t~ret40.offset|)} call task(#t~ret40.base, #t~ret40.offset); {2720#(= 0 |task_#in~t.offset|)} is VALID [2020-07-08 12:48:30,023 INFO L280 TraceCheckUtils]: 20: Hoare triple {2720#(= 0 |task_#in~t.offset|)} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2721#(= 0 task_~t.offset)} is VALID [2020-07-08 12:48:30,024 INFO L263 TraceCheckUtils]: 21: Hoare triple {2721#(= 0 task_~t.offset)} call #t~ret27 := min(~t.base, ~t.offset); {2701#true} is VALID [2020-07-08 12:48:30,024 INFO L280 TraceCheckUtils]: 22: Hoare triple {2701#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2777#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} is VALID [2020-07-08 12:48:30,025 INFO L280 TraceCheckUtils]: 23: Hoare triple {2777#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} assume !(~n.base == 0 && ~n.offset == 0);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 4); {2778#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:30,026 INFO L263 TraceCheckUtils]: 24: Hoare triple {2778#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} call #t~ret7 := min(#t~mem6.base, #t~mem6.offset); {2701#true} is VALID [2020-07-08 12:48:30,026 INFO L280 TraceCheckUtils]: 25: Hoare triple {2701#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2701#true} is VALID [2020-07-08 12:48:30,026 INFO L280 TraceCheckUtils]: 26: Hoare triple {2701#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2701#true} is VALID [2020-07-08 12:48:30,026 INFO L280 TraceCheckUtils]: 27: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:30,027 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2701#true} {2778#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} #141#return; {2778#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:30,028 INFO L280 TraceCheckUtils]: 29: Hoare triple {2778#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~a~0 := #t~ret7;havoc #t~ret7;havoc #t~mem6.base, #t~mem6.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~n.base, 8 + ~n.offset, 4); {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:30,028 INFO L263 TraceCheckUtils]: 30: Hoare triple {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret9 := min(#t~mem8.base, #t~mem8.offset); {2701#true} is VALID [2020-07-08 12:48:30,029 INFO L280 TraceCheckUtils]: 31: Hoare triple {2701#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2701#true} is VALID [2020-07-08 12:48:30,029 INFO L280 TraceCheckUtils]: 32: Hoare triple {2701#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2701#true} is VALID [2020-07-08 12:48:30,029 INFO L280 TraceCheckUtils]: 33: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:30,030 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2701#true} {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #143#return; {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:30,030 INFO L280 TraceCheckUtils]: 35: Hoare triple {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~b~0 := #t~ret9;havoc #t~ret9;havoc #t~mem8.base, #t~mem8.offset; {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:30,031 INFO L280 TraceCheckUtils]: 36: Hoare triple {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume ~a~0 <= ~b~0;#res := ~a~0; {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:30,031 INFO L280 TraceCheckUtils]: 37: Hoare triple {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume true; {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:30,032 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} {2721#(= 0 task_~t.offset)} #149#return; {2739#(not (= 0 task_~t.base))} is VALID [2020-07-08 12:48:30,033 INFO L280 TraceCheckUtils]: 39: Hoare triple {2739#(not (= 0 task_~t.base))} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;~a~1 := #t~ret27;havoc #t~ret27;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {2739#(not (= 0 task_~t.base))} is VALID [2020-07-08 12:48:30,033 INFO L263 TraceCheckUtils]: 40: Hoare triple {2739#(not (= 0 task_~t.base))} call #t~ret28 := size(~t.base, ~t.offset); {2701#true} is VALID [2020-07-08 12:48:30,033 INFO L280 TraceCheckUtils]: 41: Hoare triple {2701#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2701#true} is VALID [2020-07-08 12:48:30,034 INFO L280 TraceCheckUtils]: 42: Hoare triple {2701#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2701#true} is VALID [2020-07-08 12:48:30,034 INFO L263 TraceCheckUtils]: 43: Hoare triple {2701#true} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {2701#true} is VALID [2020-07-08 12:48:30,034 INFO L280 TraceCheckUtils]: 44: Hoare triple {2701#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2701#true} is VALID [2020-07-08 12:48:30,034 INFO L280 TraceCheckUtils]: 45: Hoare triple {2701#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2701#true} is VALID [2020-07-08 12:48:30,034 INFO L280 TraceCheckUtils]: 46: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:30,034 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2701#true} {2701#true} #175#return; {2701#true} is VALID [2020-07-08 12:48:30,035 INFO L280 TraceCheckUtils]: 48: Hoare triple {2701#true} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2701#true} is VALID [2020-07-08 12:48:30,035 INFO L263 TraceCheckUtils]: 49: Hoare triple {2701#true} call #t~ret26 := size(#t~mem25.base, #t~mem25.offset); {2701#true} is VALID [2020-07-08 12:48:30,035 INFO L280 TraceCheckUtils]: 50: Hoare triple {2701#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2701#true} is VALID [2020-07-08 12:48:30,035 INFO L280 TraceCheckUtils]: 51: Hoare triple {2701#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2701#true} is VALID [2020-07-08 12:48:30,035 INFO L280 TraceCheckUtils]: 52: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:30,036 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {2701#true} {2701#true} #177#return; {2701#true} is VALID [2020-07-08 12:48:30,036 INFO L280 TraceCheckUtils]: 54: Hoare triple {2701#true} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;#res := 1 + (#t~ret24 + #t~ret26);havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~ret26;havoc #t~mem25.base, #t~mem25.offset; {2701#true} is VALID [2020-07-08 12:48:30,036 INFO L280 TraceCheckUtils]: 55: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:30,038 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2701#true} {2739#(not (= 0 task_~t.base))} #151#return; {2739#(not (= 0 task_~t.base))} is VALID [2020-07-08 12:48:30,039 INFO L280 TraceCheckUtils]: 57: Hoare triple {2739#(not (= 0 task_~t.base))} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;~n~1 := #t~ret28;havoc #t~ret28; {2739#(not (= 0 task_~t.base))} is VALID [2020-07-08 12:48:30,040 INFO L263 TraceCheckUtils]: 58: Hoare triple {2739#(not (= 0 task_~t.base))} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {2701#true} is VALID [2020-07-08 12:48:30,040 INFO L280 TraceCheckUtils]: 59: Hoare triple {2701#true} ~cond := #in~cond; {2701#true} is VALID [2020-07-08 12:48:30,040 INFO L280 TraceCheckUtils]: 60: Hoare triple {2701#true} assume !(0 == ~cond); {2701#true} is VALID [2020-07-08 12:48:30,040 INFO L280 TraceCheckUtils]: 61: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:30,042 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2701#true} {2739#(not (= 0 task_~t.base))} #153#return; {2739#(not (= 0 task_~t.base))} is VALID [2020-07-08 12:48:30,042 INFO L280 TraceCheckUtils]: 63: Hoare triple {2739#(not (= 0 task_~t.base))} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(4 * ~n~1); {2739#(not (= 0 task_~t.base))} is VALID [2020-07-08 12:48:30,043 INFO L263 TraceCheckUtils]: 64: Hoare triple {2739#(not (= 0 task_~t.base))} call #Ultimate.meminit(#t~malloc29.base, #t~malloc29.offset, ~n~1, 4, 4 * ~n~1); {2796#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-08 12:48:30,044 INFO L280 TraceCheckUtils]: 65: Hoare triple {2796#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2701#true} is VALID [2020-07-08 12:48:30,044 INFO L280 TraceCheckUtils]: 66: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:30,045 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {2701#true} {2739#(not (= 0 task_~t.base))} #155#return; {2739#(not (= 0 task_~t.base))} is VALID [2020-07-08 12:48:30,046 INFO L280 TraceCheckUtils]: 68: Hoare triple {2739#(not (= 0 task_~t.base))} ~x~0.base, ~x~0.offset := #t~malloc29.base, #t~malloc29.offset; {2739#(not (= 0 task_~t.base))} is VALID [2020-07-08 12:48:30,047 INFO L263 TraceCheckUtils]: 69: Hoare triple {2739#(not (= 0 task_~t.base))} call #t~ret30 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {2797#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 12:48:30,048 INFO L280 TraceCheckUtils]: 70: Hoare triple {2797#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2798#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2020-07-08 12:48:30,049 INFO L280 TraceCheckUtils]: 71: Hoare triple {2798#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2799#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-08 12:48:30,049 INFO L280 TraceCheckUtils]: 72: Hoare triple {2799#(= 0 |tree_inorder_#in~t.base|)} assume true; {2799#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-08 12:48:30,051 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {2799#(= 0 |tree_inorder_#in~t.base|)} {2739#(not (= 0 task_~t.base))} #157#return; {2702#false} is VALID [2020-07-08 12:48:30,052 INFO L280 TraceCheckUtils]: 74: Hoare triple {2702#false} assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647;havoc #t~ret30;call #t~mem31 := read~int(~x~0.base, ~x~0.offset, 4); {2702#false} is VALID [2020-07-08 12:48:30,052 INFO L263 TraceCheckUtils]: 75: Hoare triple {2702#false} call __VERIFIER_assert((if ~a~1 == #t~mem31 then 1 else 0)); {2702#false} is VALID [2020-07-08 12:48:30,052 INFO L280 TraceCheckUtils]: 76: Hoare triple {2702#false} ~cond := #in~cond; {2702#false} is VALID [2020-07-08 12:48:30,052 INFO L280 TraceCheckUtils]: 77: Hoare triple {2702#false} assume 0 == ~cond; {2702#false} is VALID [2020-07-08 12:48:30,053 INFO L280 TraceCheckUtils]: 78: Hoare triple {2702#false} assume !false; {2702#false} is VALID [2020-07-08 12:48:30,061 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-08 12:48:30,061 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787881057] [2020-07-08 12:48:30,061 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937944761] [2020-07-08 12:48:30,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:48:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:30,165 INFO L264 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 31 conjunts are in the unsatisfiable core [2020-07-08 12:48:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:30,194 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:48:30,400 INFO L263 TraceCheckUtils]: 0: Hoare triple {2701#true} call ULTIMATE.init(); {2701#true} is VALID [2020-07-08 12:48:30,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {2701#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2701#true} is VALID [2020-07-08 12:48:30,401 INFO L280 TraceCheckUtils]: 2: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:30,401 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2701#true} {2701#true} #179#return; {2701#true} is VALID [2020-07-08 12:48:30,401 INFO L263 TraceCheckUtils]: 4: Hoare triple {2701#true} call #t~ret41 := main(); {2701#true} is VALID [2020-07-08 12:48:30,401 INFO L263 TraceCheckUtils]: 5: Hoare triple {2701#true} call #t~ret40.base, #t~ret40.offset := nondet_tree(); {2701#true} is VALID [2020-07-08 12:48:30,403 INFO L280 TraceCheckUtils]: 6: Hoare triple {2701#true} assume !(0 != #t~nondet1 % 256);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet3; {2769#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-08 12:48:30,403 INFO L263 TraceCheckUtils]: 7: Hoare triple {2769#(= nondet_tree_~n~0.offset 0)} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2701#true} is VALID [2020-07-08 12:48:30,403 INFO L280 TraceCheckUtils]: 8: Hoare triple {2701#true} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2701#true} is VALID [2020-07-08 12:48:30,403 INFO L280 TraceCheckUtils]: 9: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:30,404 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2701#true} {2769#(= nondet_tree_~n~0.offset 0)} #145#return; {2769#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-08 12:48:30,404 INFO L280 TraceCheckUtils]: 11: Hoare triple {2769#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret4.base, #t~ret4.offset; {2769#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-08 12:48:30,405 INFO L263 TraceCheckUtils]: 12: Hoare triple {2769#(= nondet_tree_~n~0.offset 0)} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2701#true} is VALID [2020-07-08 12:48:30,405 INFO L280 TraceCheckUtils]: 13: Hoare triple {2701#true} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2701#true} is VALID [2020-07-08 12:48:30,405 INFO L280 TraceCheckUtils]: 14: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:30,406 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2701#true} {2769#(= nondet_tree_~n~0.offset 0)} #147#return; {2769#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-08 12:48:30,407 INFO L280 TraceCheckUtils]: 16: Hoare triple {2769#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2776#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-08 12:48:30,409 INFO L280 TraceCheckUtils]: 17: Hoare triple {2776#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} assume true; {2776#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-08 12:48:30,410 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2776#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} {2701#true} #137#return; {2719#(= 0 |main_#t~ret40.offset|)} is VALID [2020-07-08 12:48:30,411 INFO L263 TraceCheckUtils]: 19: Hoare triple {2719#(= 0 |main_#t~ret40.offset|)} call task(#t~ret40.base, #t~ret40.offset); {2720#(= 0 |task_#in~t.offset|)} is VALID [2020-07-08 12:48:30,412 INFO L280 TraceCheckUtils]: 20: Hoare triple {2720#(= 0 |task_#in~t.offset|)} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2721#(= 0 task_~t.offset)} is VALID [2020-07-08 12:48:30,412 INFO L263 TraceCheckUtils]: 21: Hoare triple {2721#(= 0 task_~t.offset)} call #t~ret27 := min(~t.base, ~t.offset); {2701#true} is VALID [2020-07-08 12:48:30,412 INFO L280 TraceCheckUtils]: 22: Hoare triple {2701#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2777#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} is VALID [2020-07-08 12:48:30,413 INFO L280 TraceCheckUtils]: 23: Hoare triple {2777#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} assume !(~n.base == 0 && ~n.offset == 0);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 4); {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:30,414 INFO L263 TraceCheckUtils]: 24: Hoare triple {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret7 := min(#t~mem6.base, #t~mem6.offset); {2701#true} is VALID [2020-07-08 12:48:30,414 INFO L280 TraceCheckUtils]: 25: Hoare triple {2701#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2701#true} is VALID [2020-07-08 12:48:30,414 INFO L280 TraceCheckUtils]: 26: Hoare triple {2701#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2701#true} is VALID [2020-07-08 12:48:30,414 INFO L280 TraceCheckUtils]: 27: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:30,415 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2701#true} {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #141#return; {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:30,416 INFO L280 TraceCheckUtils]: 29: Hoare triple {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~a~0 := #t~ret7;havoc #t~ret7;havoc #t~mem6.base, #t~mem6.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~n.base, 8 + ~n.offset, 4); {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:30,416 INFO L263 TraceCheckUtils]: 30: Hoare triple {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret9 := min(#t~mem8.base, #t~mem8.offset); {2701#true} is VALID [2020-07-08 12:48:30,416 INFO L280 TraceCheckUtils]: 31: Hoare triple {2701#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2701#true} is VALID [2020-07-08 12:48:30,416 INFO L280 TraceCheckUtils]: 32: Hoare triple {2701#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2701#true} is VALID [2020-07-08 12:48:30,416 INFO L280 TraceCheckUtils]: 33: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:30,417 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2701#true} {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #143#return; {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:30,418 INFO L280 TraceCheckUtils]: 35: Hoare triple {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~b~0 := #t~ret9;havoc #t~ret9;havoc #t~mem8.base, #t~mem8.offset; {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:30,420 INFO L280 TraceCheckUtils]: 36: Hoare triple {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume ~a~0 <= ~b~0;#res := ~a~0; {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:30,421 INFO L280 TraceCheckUtils]: 37: Hoare triple {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume true; {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-08 12:48:30,422 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2783#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} {2721#(= 0 task_~t.offset)} #149#return; {2917#(and (not (= 0 task_~t.base)) (= 0 task_~t.offset))} is VALID [2020-07-08 12:48:30,423 INFO L280 TraceCheckUtils]: 39: Hoare triple {2917#(and (not (= 0 task_~t.base)) (= 0 task_~t.offset))} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;~a~1 := #t~ret27;havoc #t~ret27;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {2917#(and (not (= 0 task_~t.base)) (= 0 task_~t.offset))} is VALID [2020-07-08 12:48:30,423 INFO L263 TraceCheckUtils]: 40: Hoare triple {2917#(and (not (= 0 task_~t.base)) (= 0 task_~t.offset))} call #t~ret28 := size(~t.base, ~t.offset); {2701#true} is VALID [2020-07-08 12:48:30,423 INFO L280 TraceCheckUtils]: 41: Hoare triple {2701#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2701#true} is VALID [2020-07-08 12:48:30,423 INFO L280 TraceCheckUtils]: 42: Hoare triple {2701#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2701#true} is VALID [2020-07-08 12:48:30,423 INFO L263 TraceCheckUtils]: 43: Hoare triple {2701#true} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {2701#true} is VALID [2020-07-08 12:48:30,424 INFO L280 TraceCheckUtils]: 44: Hoare triple {2701#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2701#true} is VALID [2020-07-08 12:48:30,424 INFO L280 TraceCheckUtils]: 45: Hoare triple {2701#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2701#true} is VALID [2020-07-08 12:48:30,424 INFO L280 TraceCheckUtils]: 46: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:30,424 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2701#true} {2701#true} #175#return; {2701#true} is VALID [2020-07-08 12:48:30,424 INFO L280 TraceCheckUtils]: 48: Hoare triple {2701#true} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2701#true} is VALID [2020-07-08 12:48:30,425 INFO L263 TraceCheckUtils]: 49: Hoare triple {2701#true} call #t~ret26 := size(#t~mem25.base, #t~mem25.offset); {2701#true} is VALID [2020-07-08 12:48:30,425 INFO L280 TraceCheckUtils]: 50: Hoare triple {2701#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2701#true} is VALID [2020-07-08 12:48:30,425 INFO L280 TraceCheckUtils]: 51: Hoare triple {2701#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2701#true} is VALID [2020-07-08 12:48:30,425 INFO L280 TraceCheckUtils]: 52: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:30,425 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {2701#true} {2701#true} #177#return; {2701#true} is VALID [2020-07-08 12:48:30,426 INFO L280 TraceCheckUtils]: 54: Hoare triple {2701#true} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;#res := 1 + (#t~ret24 + #t~ret26);havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~ret26;havoc #t~mem25.base, #t~mem25.offset; {2701#true} is VALID [2020-07-08 12:48:30,426 INFO L280 TraceCheckUtils]: 55: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:30,427 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2701#true} {2917#(and (not (= 0 task_~t.base)) (= 0 task_~t.offset))} #151#return; {2739#(not (= 0 task_~t.base))} is VALID [2020-07-08 12:48:30,427 INFO L280 TraceCheckUtils]: 57: Hoare triple {2739#(not (= 0 task_~t.base))} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;~n~1 := #t~ret28;havoc #t~ret28; {2739#(not (= 0 task_~t.base))} is VALID [2020-07-08 12:48:30,428 INFO L263 TraceCheckUtils]: 58: Hoare triple {2739#(not (= 0 task_~t.base))} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {2701#true} is VALID [2020-07-08 12:48:30,428 INFO L280 TraceCheckUtils]: 59: Hoare triple {2701#true} ~cond := #in~cond; {2701#true} is VALID [2020-07-08 12:48:30,428 INFO L280 TraceCheckUtils]: 60: Hoare triple {2701#true} assume !(0 == ~cond); {2701#true} is VALID [2020-07-08 12:48:30,428 INFO L280 TraceCheckUtils]: 61: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:30,431 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2701#true} {2739#(not (= 0 task_~t.base))} #153#return; {2739#(not (= 0 task_~t.base))} is VALID [2020-07-08 12:48:30,431 INFO L280 TraceCheckUtils]: 63: Hoare triple {2739#(not (= 0 task_~t.base))} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(4 * ~n~1); {2739#(not (= 0 task_~t.base))} is VALID [2020-07-08 12:48:30,432 INFO L263 TraceCheckUtils]: 64: Hoare triple {2739#(not (= 0 task_~t.base))} call #Ultimate.meminit(#t~malloc29.base, #t~malloc29.offset, ~n~1, 4, 4 * ~n~1); {2701#true} is VALID [2020-07-08 12:48:30,432 INFO L280 TraceCheckUtils]: 65: Hoare triple {2701#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2701#true} is VALID [2020-07-08 12:48:30,432 INFO L280 TraceCheckUtils]: 66: Hoare triple {2701#true} assume true; {2701#true} is VALID [2020-07-08 12:48:30,433 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {2701#true} {2739#(not (= 0 task_~t.base))} #155#return; {2739#(not (= 0 task_~t.base))} is VALID [2020-07-08 12:48:30,434 INFO L280 TraceCheckUtils]: 68: Hoare triple {2739#(not (= 0 task_~t.base))} ~x~0.base, ~x~0.offset := #t~malloc29.base, #t~malloc29.offset; {2739#(not (= 0 task_~t.base))} is VALID [2020-07-08 12:48:30,434 INFO L263 TraceCheckUtils]: 69: Hoare triple {2739#(not (= 0 task_~t.base))} call #t~ret30 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {2701#true} is VALID [2020-07-08 12:48:30,434 INFO L280 TraceCheckUtils]: 70: Hoare triple {2701#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2798#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2020-07-08 12:48:30,435 INFO L280 TraceCheckUtils]: 71: Hoare triple {2798#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2799#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-08 12:48:30,436 INFO L280 TraceCheckUtils]: 72: Hoare triple {2799#(= 0 |tree_inorder_#in~t.base|)} assume true; {2799#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-08 12:48:30,437 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {2799#(= 0 |tree_inorder_#in~t.base|)} {2739#(not (= 0 task_~t.base))} #157#return; {2702#false} is VALID [2020-07-08 12:48:30,438 INFO L280 TraceCheckUtils]: 74: Hoare triple {2702#false} assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647;havoc #t~ret30;call #t~mem31 := read~int(~x~0.base, ~x~0.offset, 4); {2702#false} is VALID [2020-07-08 12:48:30,438 INFO L263 TraceCheckUtils]: 75: Hoare triple {2702#false} call __VERIFIER_assert((if ~a~1 == #t~mem31 then 1 else 0)); {2702#false} is VALID [2020-07-08 12:48:30,438 INFO L280 TraceCheckUtils]: 76: Hoare triple {2702#false} ~cond := #in~cond; {2702#false} is VALID [2020-07-08 12:48:30,438 INFO L280 TraceCheckUtils]: 77: Hoare triple {2702#false} assume 0 == ~cond; {2702#false} is VALID [2020-07-08 12:48:30,438 INFO L280 TraceCheckUtils]: 78: Hoare triple {2702#false} assume !false; {2702#false} is VALID [2020-07-08 12:48:30,445 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-08 12:48:30,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:48:30,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 18 [2020-07-08 12:48:30,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360210506] [2020-07-08 12:48:30,447 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 79 [2020-07-08 12:48:30,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:30,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-08 12:48:30,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:48:30,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-08 12:48:30,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:30,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-08 12:48:30,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2020-07-08 12:48:30,559 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand 18 states. [2020-07-08 12:48:35,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:35,109 INFO L93 Difference]: Finished difference Result 151 states and 192 transitions. [2020-07-08 12:48:35,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-08 12:48:35,110 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 79 [2020-07-08 12:48:35,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:48:35,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-08 12:48:35,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 184 transitions. [2020-07-08 12:48:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-08 12:48:35,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 184 transitions. [2020-07-08 12:48:35,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 184 transitions. [2020-07-08 12:48:35,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:48:35,428 INFO L225 Difference]: With dead ends: 151 [2020-07-08 12:48:35,428 INFO L226 Difference]: Without dead ends: 98 [2020-07-08 12:48:35,429 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2020-07-08 12:48:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-08 12:48:35,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2020-07-08 12:48:35,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:48:35,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 96 states. [2020-07-08 12:48:35,543 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 96 states. [2020-07-08 12:48:35,544 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 96 states. [2020-07-08 12:48:35,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:35,550 INFO L93 Difference]: Finished difference Result 98 states and 125 transitions. [2020-07-08 12:48:35,550 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 125 transitions. [2020-07-08 12:48:35,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:35,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:35,552 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 98 states. [2020-07-08 12:48:35,552 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 98 states. [2020-07-08 12:48:35,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:35,559 INFO L93 Difference]: Finished difference Result 98 states and 125 transitions. [2020-07-08 12:48:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 125 transitions. [2020-07-08 12:48:35,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:35,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:35,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:48:35,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:48:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-07-08 12:48:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2020-07-08 12:48:35,566 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 79 [2020-07-08 12:48:35,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:48:35,567 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2020-07-08 12:48:35,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-08 12:48:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2020-07-08 12:48:35,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-08 12:48:35,569 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:35,569 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2020-07-08 12:48:35,787 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:48:35,788 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:35,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:35,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1471493578, now seen corresponding path program 1 times [2020-07-08 12:48:35,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:35,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771690828] [2020-07-08 12:48:35,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:48:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:48:35,912 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:48:35,912 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:48:35,912 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 12:48:35,981 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 12:48:35,982 WARN L170 areAnnotationChecker]: minENTRY has no Hoare annotation [2020-07-08 12:48:35,982 WARN L170 areAnnotationChecker]: taskENTRY has no Hoare annotation [2020-07-08 12:48:35,982 WARN L170 areAnnotationChecker]: sizeENTRY has no Hoare annotation [2020-07-08 12:48:35,982 WARN L170 areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation [2020-07-08 12:48:35,982 WARN L170 areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation [2020-07-08 12:48:35,982 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:48:35,982 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:48:35,982 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 12:48:35,982 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:48:35,982 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:48:35,982 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 12:48:35,983 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2020-07-08 12:48:35,983 WARN L170 areAnnotationChecker]: tree_inorderENTRY has no Hoare annotation [2020-07-08 12:48:35,983 WARN L170 areAnnotationChecker]: tree_delENTRY has no Hoare annotation [2020-07-08 12:48:35,983 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:48:35,983 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-08 12:48:35,983 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-08 12:48:35,983 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2020-07-08 12:48:35,983 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2020-07-08 12:48:35,983 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2020-07-08 12:48:35,984 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2020-07-08 12:48:35,984 WARN L170 areAnnotationChecker]: nondet_treeFINAL has no Hoare annotation [2020-07-08 12:48:35,984 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-08 12:48:35,984 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-08 12:48:35,984 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:48:35,984 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:48:35,984 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-08 12:48:35,984 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-08 12:48:35,984 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2020-07-08 12:48:35,984 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2020-07-08 12:48:35,985 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 12:48:35,985 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 12:48:35,985 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2020-07-08 12:48:35,985 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2020-07-08 12:48:35,985 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2020-07-08 12:48:35,985 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-08 12:48:35,985 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-08 12:48:35,985 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:48:35,985 WARN L170 areAnnotationChecker]: minFINAL has no Hoare annotation [2020-07-08 12:48:35,986 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-08 12:48:35,986 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-08 12:48:35,986 WARN L170 areAnnotationChecker]: L81-1 has no Hoare annotation [2020-07-08 12:48:35,986 WARN L170 areAnnotationChecker]: sizeFINAL has no Hoare annotation [2020-07-08 12:48:35,986 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2020-07-08 12:48:35,986 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2020-07-08 12:48:35,986 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2020-07-08 12:48:35,986 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2020-07-08 12:48:35,986 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2020-07-08 12:48:35,987 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2020-07-08 12:48:35,987 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:48:35,987 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2020-07-08 12:48:35,987 WARN L170 areAnnotationChecker]: L103-1 has no Hoare annotation [2020-07-08 12:48:35,987 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-08 12:48:35,987 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-08 12:48:35,988 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2020-07-08 12:48:35,988 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2020-07-08 12:48:35,988 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2020-07-08 12:48:35,988 WARN L170 areAnnotationChecker]: tree_inorderFINAL has no Hoare annotation [2020-07-08 12:48:35,988 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2020-07-08 12:48:35,988 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2020-07-08 12:48:35,988 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2020-07-08 12:48:35,988 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2020-07-08 12:48:35,989 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2020-07-08 12:48:35,989 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2020-07-08 12:48:35,989 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2020-07-08 12:48:35,989 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2020-07-08 12:48:35,989 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2020-07-08 12:48:35,989 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-08 12:48:35,989 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2020-07-08 12:48:35,990 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2020-07-08 12:48:35,990 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2020-07-08 12:48:35,990 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2020-07-08 12:48:35,990 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2020-07-08 12:48:35,990 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2020-07-08 12:48:35,990 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2020-07-08 12:48:35,990 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-08 12:48:35,991 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-08 12:48:35,991 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-08 12:48:35,991 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-08 12:48:35,991 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:48:35,991 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:48:35,991 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:48:35,991 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:48:35,991 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:48:35,991 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2020-07-08 12:48:35,991 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2020-07-08 12:48:35,992 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2020-07-08 12:48:35,992 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2020-07-08 12:48:35,992 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2020-07-08 12:48:35,992 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2020-07-08 12:48:35,992 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2020-07-08 12:48:35,992 WARN L170 areAnnotationChecker]: tree_delFINAL has no Hoare annotation [2020-07-08 12:48:35,992 WARN L170 areAnnotationChecker]: L54-3 has no Hoare annotation [2020-07-08 12:48:35,992 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-08 12:48:35,992 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-08 12:48:35,993 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-08 12:48:35,993 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2020-07-08 12:48:35,993 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2020-07-08 12:48:35,993 WARN L170 areAnnotationChecker]: L77-3 has no Hoare annotation [2020-07-08 12:48:35,993 WARN L170 areAnnotationChecker]: L77-2 has no Hoare annotation [2020-07-08 12:48:35,993 WARN L170 areAnnotationChecker]: L77-2 has no Hoare annotation [2020-07-08 12:48:35,993 WARN L170 areAnnotationChecker]: L85-1 has no Hoare annotation [2020-07-08 12:48:35,993 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:48:35,993 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2020-07-08 12:48:35,993 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2020-07-08 12:48:35,994 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2020-07-08 12:48:35,994 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2020-07-08 12:48:35,994 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2020-07-08 12:48:35,994 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2020-07-08 12:48:35,994 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2020-07-08 12:48:35,994 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2020-07-08 12:48:35,994 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2020-07-08 12:48:35,994 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2020-07-08 12:48:35,994 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2020-07-08 12:48:35,995 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-08 12:48:35,995 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-08 12:48:35,995 WARN L170 areAnnotationChecker]: tree_delEXIT has no Hoare annotation [2020-07-08 12:48:35,995 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-08 12:48:35,995 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-08 12:48:35,995 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-08 12:48:35,995 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-08 12:48:35,995 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2020-07-08 12:48:35,995 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2020-07-08 12:48:35,996 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-08 12:48:35,996 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-08 12:48:35,996 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2020-07-08 12:48:35,996 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2020-07-08 12:48:35,996 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2020-07-08 12:48:35,996 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2020-07-08 12:48:35,996 WARN L170 areAnnotationChecker]: L98-3 has no Hoare annotation [2020-07-08 12:48:35,996 WARN L170 areAnnotationChecker]: L98-3 has no Hoare annotation [2020-07-08 12:48:35,997 WARN L170 areAnnotationChecker]: L98-3 has no Hoare annotation [2020-07-08 12:48:35,997 WARN L170 areAnnotationChecker]: L98-2 has no Hoare annotation [2020-07-08 12:48:35,997 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2020-07-08 12:48:35,997 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2020-07-08 12:48:35,997 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2020-07-08 12:48:35,997 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2020-07-08 12:48:35,997 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2020-07-08 12:48:35,998 WARN L170 areAnnotationChecker]: L98-4 has no Hoare annotation [2020-07-08 12:48:35,998 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2020-07-08 12:48:35,998 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2020-07-08 12:48:35,998 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2020-07-08 12:48:35,998 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2020-07-08 12:48:35,998 WARN L170 areAnnotationChecker]: taskFINAL has no Hoare annotation [2020-07-08 12:48:35,998 WARN L170 areAnnotationChecker]: taskEXIT has no Hoare annotation [2020-07-08 12:48:35,999 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:48:36,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:48:36 BoogieIcfgContainer [2020-07-08 12:48:36,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:48:36,005 INFO L168 Benchmark]: Toolchain (without parser) took 22806.05 ms. Allocated memory was 138.4 MB in the beginning and 454.0 MB in the end (delta: 315.6 MB). Free memory was 102.7 MB in the beginning and 388.4 MB in the end (delta: -285.8 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:48:36,006 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 12:48:36,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 521.16 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 102.5 MB in the beginning and 177.8 MB in the end (delta: -75.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:48:36,007 INFO L168 Benchmark]: Boogie Preprocessor took 77.93 ms. Allocated memory is still 202.4 MB. Free memory was 177.8 MB in the beginning and 174.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:48:36,008 INFO L168 Benchmark]: RCFGBuilder took 861.11 ms. Allocated memory is still 202.4 MB. Free memory was 174.5 MB in the beginning and 113.3 MB in the end (delta: 61.2 MB). Peak memory consumption was 61.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:48:36,008 INFO L168 Benchmark]: TraceAbstraction took 21339.85 ms. Allocated memory was 202.4 MB in the beginning and 454.0 MB in the end (delta: 251.7 MB). Free memory was 113.3 MB in the beginning and 388.4 MB in the end (delta: -275.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 12:48:36,011 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 521.16 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 102.5 MB in the beginning and 177.8 MB in the end (delta: -75.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 77.93 ms. Allocated memory is still 202.4 MB. Free memory was 177.8 MB in the beginning and 174.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 861.11 ms. Allocated memory is still 202.4 MB. Free memory was 174.5 MB in the beginning and 113.3 MB in the end (delta: 61.2 MB). Peak memory consumption was 61.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21339.85 ms. Allocated memory was 202.4 MB in the beginning and 454.0 MB in the end (delta: 251.7 MB). Free memory was 113.3 MB in the beginning and 388.4 MB in the end (delta: -275.1 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 14]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L103] CALL, EXPR nondet_tree() [L23] COND FALSE !(__VERIFIER_nondet_bool()) [L26] struct node *n = (struct node *)malloc(sizeof(struct node)); [L27] n->data = __VERIFIER_nondet_int() [L28] CALL, EXPR nondet_tree() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] return 0; VAL [\result={0:0}] [L28] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L28] n->left = nondet_tree() [L29] CALL, EXPR nondet_tree() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] return 0; VAL [\result={0:0}] [L29] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L29] n->right = nondet_tree() [L30] return n; VAL [\result={-1:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}] [L103] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L103] CALL task(nondet_tree()) VAL [t={-1:0}] [L81] CALL, EXPR min(t) VAL [n={-1:0}] [L35] COND FALSE !(!n) [L38] EXPR n->left VAL [n={-1:0}, n={-1:0}, n->left={0:0}] [L38] CALL, EXPR min(n->left) VAL [n={0:0}] [L35] COND TRUE !n [L36] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L38] RET, EXPR min(n->left) VAL [min(n->left)=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L38] int a = min(n->left); [L39] EXPR n->right VAL [a=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L39] CALL, EXPR min(n->right) VAL [n={0:0}] [L35] COND TRUE !n [L36] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L39] RET, EXPR min(n->right) VAL [a=2147483647, min(n->right)=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L39] int b = min(n->right); [L40] COND TRUE a <= b [L40] return a; VAL [\result=2147483647, a=2147483647, b=2147483647, n={-1:0}, n={-1:0}] [L81] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L81] int a = min(t); [L82] int b; VAL [a=2147483647, b={2:0}, t={-1:0}, t={-1:0}] [L84] CALL, EXPR size(t) VAL [t={-1:0}] [L76] COND FALSE !(!t) [L77] EXPR t->left VAL [t={-1:0}, t={-1:0}, t->left={0:0}] [L77] CALL, EXPR size(t->left) VAL [t={0:0}] [L76] COND TRUE !t [L76] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L77] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}] [L77] EXPR t->right VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L77] CALL, EXPR size(t->right) VAL [t={0:0}] [L76] COND TRUE !t [L76] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L77] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L77] return size(t->left) + size(t->right) + 1; [L84] RET, EXPR size(t) VAL [a=2147483647, b={2:0}, size(t)=1, t={-1:0}, t={-1:0}] [L84] int n = size(t); [L85] CALL assume_abort_if_not(n != 0) VAL [\old(cond)=1] [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L85] RET assume_abort_if_not(n != 0) VAL [a=2147483647, b={2:0}, n=1, t={-1:0}, t={-1:0}] [L86] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}] [L86] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}] [L87] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L65] COND FALSE !(!t) [L68] EXPR t->left VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}] [L68] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L65] COND TRUE !t [L66] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L68] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L68] i = tree_inorder(t->left, a, i) [L69] EXPR i++ [L69] EXPR t->data [L69] a[i++] = t->data [L70] EXPR t->right VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}] [L70] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L65] COND TRUE !t [L66] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L70] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L70] i = tree_inorder(t->right, a, i) [L71] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L87] RET tree_inorder(t, x, n) VAL [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, tree_inorder(t, x, n)=2, x={-2:0}] [L88] EXPR x[0] VAL [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}, x[0]=0] [L88] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L14] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L14] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.1s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 418 SDtfs, 767 SDslu, 1539 SDs, 0 SdLazy, 2255 SolverSat, 749 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 305 GetRequests, 213 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 5 MinimizatonAttempts, 24 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 515 NumberOfCodeBlocks, 515 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 417 ConstructedInterpolants, 0 QuantifiedInterpolants, 77974 SizeOfPredicates, 14 NumberOfNonLiveVariables, 630 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 103/111 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...