/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_rec_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:23:34,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:23:34,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:23:34,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:23:34,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:23:34,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:23:34,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:23:34,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:23:34,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:23:34,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:23:34,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:23:34,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:23:34,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:23:34,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:23:34,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:23:34,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:23:34,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:23:34,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:23:34,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:23:34,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:23:34,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:23:34,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:23:34,366 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:23:34,367 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:23:34,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:23:34,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:23:34,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:23:34,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:23:34,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:23:34,374 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:23:34,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:23:34,377 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:23:34,378 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:23:34,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:23:34,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:23:34,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:23:34,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:23:34,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:23:34,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:23:34,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:23:34,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:23:34,390 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-17 22:23:34,405 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:23:34,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:23:34,407 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:23:34,407 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:23:34,407 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:23:34,408 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:23:34,408 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:23:34,408 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:23:34,408 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:23:34,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:23:34,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:23:34,409 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:23:34,409 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:23:34,409 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:23:34,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:23:34,409 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:23:34,410 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:23:34,410 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:23:34,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:23:34,410 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:23:34,410 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:23:34,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:23:34,411 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:23:34,411 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:23:34,411 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:23:34,411 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:23:34,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:23:34,412 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:23:34,412 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:23:34,412 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:23:34,711 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:23:34,722 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:23:34,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:23:34,727 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:23:34,727 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:23:34,728 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c [2020-07-17 22:23:34,783 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12ac4f0b5/cb02f88d67964cfd93b347f832e4fa97/FLAGcc616888e [2020-07-17 22:23:35,198 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:23:35,199 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c [2020-07-17 22:23:35,206 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12ac4f0b5/cb02f88d67964cfd93b347f832e4fa97/FLAGcc616888e [2020-07-17 22:23:35,522 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12ac4f0b5/cb02f88d67964cfd93b347f832e4fa97 [2020-07-17 22:23:35,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:23:35,536 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:23:35,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:23:35,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:23:35,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:23:35,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:23:35" (1/1) ... [2020-07-17 22:23:35,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cbe310f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:35, skipping insertion in model container [2020-07-17 22:23:35,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:23:35" (1/1) ... [2020-07-17 22:23:35,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:23:35,574 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:23:35,736 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-17 22:23:35,739 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-17 22:23:35,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:23:35,777 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:23:35,797 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-17 22:23:35,799 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-17 22:23:35,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:23:35,918 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:23:35,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:35 WrapperNode [2020-07-17 22:23:35,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:23:35,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:23:35,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:23:35,920 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:23:35,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:35" (1/1) ... [2020-07-17 22:23:35,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:35" (1/1) ... [2020-07-17 22:23:35,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:35" (1/1) ... [2020-07-17 22:23:35,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:35" (1/1) ... [2020-07-17 22:23:35,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:35" (1/1) ... [2020-07-17 22:23:35,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:35" (1/1) ... [2020-07-17 22:23:35,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:35" (1/1) ... [2020-07-17 22:23:35,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:23:35,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:23:35,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:23:35,986 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:23:35,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:35" (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-17 22:23:36,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:23:36,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:23:36,055 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:23:36,055 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:23:36,055 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-07-17 22:23:36,055 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-07-17 22:23:36,056 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-07-17 22:23:36,056 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-07-17 22:23:36,056 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-07-17 22:23:36,056 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-07-17 22:23:36,056 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:23:36,057 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-17 22:23:36,057 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-17 22:23:36,057 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:23:36,057 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-17 22:23:36,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:23:36,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-17 22:23:36,058 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:23:36,058 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:23:36,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:23:36,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:23:36,058 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-07-17 22:23:36,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:23:36,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:23:36,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-17 22:23:36,059 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-07-17 22:23:36,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-17 22:23:36,059 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-07-17 22:23:36,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:23:36,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:23:36,060 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-07-17 22:23:36,060 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-07-17 22:23:36,060 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-07-17 22:23:36,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:23:36,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-17 22:23:36,060 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:23:36,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:23:36,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:23:36,848 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:23:36,848 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:23:36,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:23:36 BoogieIcfgContainer [2020-07-17 22:23:36,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:23:36,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:23:36,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:23:36,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:23:36,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:23:35" (1/3) ... [2020-07-17 22:23:36,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285f6b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:23:36, skipping insertion in model container [2020-07-17 22:23:36,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:35" (2/3) ... [2020-07-17 22:23:36,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285f6b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:23:36, skipping insertion in model container [2020-07-17 22:23:36,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:23:36" (3/3) ... [2020-07-17 22:23:36,868 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2020-07-17 22:23:36,879 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:23:36,886 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:23:36,900 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:23:36,925 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:23:36,925 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:23:36,925 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:23:36,926 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:23:36,926 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:23:36,926 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:23:36,926 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:23:36,926 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:23:36,947 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2020-07-17 22:23:36,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-17 22:23:36,957 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:23:36,958 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-17 22:23:36,959 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:23:36,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:23:36,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1217563597, now seen corresponding path program 1 times [2020-07-17 22:23:36,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:23:36,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368483663] [2020-07-17 22:23:36,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:23:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:37,218 INFO L280 TraceCheckUtils]: 0: Hoare triple {125#(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; {98#true} is VALID [2020-07-17 22:23:37,219 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-17 22:23:37,219 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {98#true} {98#true} #167#return; {98#true} is VALID [2020-07-17 22:23:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:37,250 INFO L280 TraceCheckUtils]: 0: Hoare triple {126#(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; {98#true} is VALID [2020-07-17 22:23:37,250 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-17 22:23:37,251 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {98#true} {98#true} #123#return; {98#true} is VALID [2020-07-17 22:23:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:37,258 INFO L280 TraceCheckUtils]: 0: Hoare triple {98#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {98#true} is VALID [2020-07-17 22:23:37,258 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {98#true} is VALID [2020-07-17 22:23:37,259 INFO L280 TraceCheckUtils]: 2: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-17 22:23:37,259 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {98#true} {98#true} #137#return; {98#true} is VALID [2020-07-17 22:23:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:37,265 INFO L280 TraceCheckUtils]: 0: Hoare triple {98#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {98#true} is VALID [2020-07-17 22:23:37,266 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {98#true} is VALID [2020-07-17 22:23:37,267 INFO L280 TraceCheckUtils]: 2: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-17 22:23:37,267 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {98#true} {98#true} #139#return; {98#true} is VALID [2020-07-17 22:23:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:37,274 INFO L280 TraceCheckUtils]: 0: Hoare triple {98#true} ~cond := #in~cond; {98#true} is VALID [2020-07-17 22:23:37,275 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} assume 0 == ~cond;assume false; {99#false} is VALID [2020-07-17 22:23:37,275 INFO L280 TraceCheckUtils]: 2: Hoare triple {99#false} assume true; {99#false} is VALID [2020-07-17 22:23:37,276 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {99#false} {98#true} #141#return; {99#false} is VALID [2020-07-17 22:23:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:37,292 INFO L280 TraceCheckUtils]: 0: Hoare triple {127#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {98#true} is VALID [2020-07-17 22:23:37,292 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-17 22:23:37,293 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {98#true} {99#false} #143#return; {99#false} is VALID [2020-07-17 22:23:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:37,333 INFO L280 TraceCheckUtils]: 0: Hoare triple {128#(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; {98#true} is VALID [2020-07-17 22:23:37,334 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {98#true} is VALID [2020-07-17 22:23:37,334 INFO L280 TraceCheckUtils]: 2: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-17 22:23:37,335 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {98#true} {99#false} #145#return; {99#false} is VALID [2020-07-17 22:23:37,336 INFO L263 TraceCheckUtils]: 0: Hoare triple {98#true} call ULTIMATE.init(); {125#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:23:37,337 INFO L280 TraceCheckUtils]: 1: Hoare triple {125#(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; {98#true} is VALID [2020-07-17 22:23:37,337 INFO L280 TraceCheckUtils]: 2: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-17 22:23:37,337 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {98#true} {98#true} #167#return; {98#true} is VALID [2020-07-17 22:23:37,338 INFO L263 TraceCheckUtils]: 4: Hoare triple {98#true} call #t~ret39 := main(); {98#true} is VALID [2020-07-17 22:23:37,339 INFO L263 TraceCheckUtils]: 5: Hoare triple {98#true} call #t~ret38.base, #t~ret38.offset := nondet_tree(); {126#(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-17 22:23:37,339 INFO L280 TraceCheckUtils]: 6: Hoare triple {126#(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; {98#true} is VALID [2020-07-17 22:23:37,339 INFO L280 TraceCheckUtils]: 7: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-17 22:23:37,340 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {98#true} {98#true} #123#return; {98#true} is VALID [2020-07-17 22:23:37,340 INFO L263 TraceCheckUtils]: 9: Hoare triple {98#true} call task(#t~ret38.base, #t~ret38.offset); {98#true} is VALID [2020-07-17 22:23:37,340 INFO L280 TraceCheckUtils]: 10: Hoare triple {98#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {98#true} is VALID [2020-07-17 22:23:37,341 INFO L263 TraceCheckUtils]: 11: Hoare triple {98#true} call #t~ret25 := min(~t.base, ~t.offset); {98#true} is VALID [2020-07-17 22:23:37,341 INFO L280 TraceCheckUtils]: 12: Hoare triple {98#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {98#true} is VALID [2020-07-17 22:23:37,341 INFO L280 TraceCheckUtils]: 13: Hoare triple {98#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {98#true} is VALID [2020-07-17 22:23:37,342 INFO L280 TraceCheckUtils]: 14: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-17 22:23:37,342 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {98#true} {98#true} #137#return; {98#true} is VALID [2020-07-17 22:23:37,342 INFO L280 TraceCheckUtils]: 16: Hoare triple {98#true} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;~a~1 := #t~ret25;havoc #t~ret25;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {98#true} is VALID [2020-07-17 22:23:37,343 INFO L263 TraceCheckUtils]: 17: Hoare triple {98#true} call #t~ret26 := size(~t.base, ~t.offset); {98#true} is VALID [2020-07-17 22:23:37,343 INFO L280 TraceCheckUtils]: 18: Hoare triple {98#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {98#true} is VALID [2020-07-17 22:23:37,343 INFO L280 TraceCheckUtils]: 19: Hoare triple {98#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {98#true} is VALID [2020-07-17 22:23:37,344 INFO L280 TraceCheckUtils]: 20: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-17 22:23:37,344 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {98#true} {98#true} #139#return; {98#true} is VALID [2020-07-17 22:23:37,344 INFO L280 TraceCheckUtils]: 22: Hoare triple {98#true} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;~n~1 := #t~ret26;havoc #t~ret26; {98#true} is VALID [2020-07-17 22:23:37,345 INFO L263 TraceCheckUtils]: 23: Hoare triple {98#true} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {98#true} is VALID [2020-07-17 22:23:37,345 INFO L280 TraceCheckUtils]: 24: Hoare triple {98#true} ~cond := #in~cond; {98#true} is VALID [2020-07-17 22:23:37,346 INFO L280 TraceCheckUtils]: 25: Hoare triple {98#true} assume 0 == ~cond;assume false; {99#false} is VALID [2020-07-17 22:23:37,346 INFO L280 TraceCheckUtils]: 26: Hoare triple {99#false} assume true; {99#false} is VALID [2020-07-17 22:23:37,347 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {99#false} {98#true} #141#return; {99#false} is VALID [2020-07-17 22:23:37,347 INFO L280 TraceCheckUtils]: 28: Hoare triple {99#false} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(4 * ~n~1); {99#false} is VALID [2020-07-17 22:23:37,347 INFO L263 TraceCheckUtils]: 29: Hoare triple {99#false} call #Ultimate.meminit(#t~malloc27.base, #t~malloc27.offset, ~n~1, 4, 4 * ~n~1); {127#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-17 22:23:37,348 INFO L280 TraceCheckUtils]: 30: Hoare triple {127#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {98#true} is VALID [2020-07-17 22:23:37,348 INFO L280 TraceCheckUtils]: 31: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-17 22:23:37,348 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {98#true} {99#false} #143#return; {99#false} is VALID [2020-07-17 22:23:37,349 INFO L280 TraceCheckUtils]: 33: Hoare triple {99#false} ~x~0.base, ~x~0.offset := #t~malloc27.base, #t~malloc27.offset; {99#false} is VALID [2020-07-17 22:23:37,349 INFO L263 TraceCheckUtils]: 34: Hoare triple {99#false} call #t~ret28 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {128#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:23:37,349 INFO L280 TraceCheckUtils]: 35: Hoare triple {128#(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; {98#true} is VALID [2020-07-17 22:23:37,350 INFO L280 TraceCheckUtils]: 36: Hoare triple {98#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {98#true} is VALID [2020-07-17 22:23:37,350 INFO L280 TraceCheckUtils]: 37: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-17 22:23:37,350 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {98#true} {99#false} #145#return; {99#false} is VALID [2020-07-17 22:23:37,351 INFO L280 TraceCheckUtils]: 39: Hoare triple {99#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;havoc #t~ret28;call #t~mem29 := read~int(~x~0.base, ~x~0.offset, 4); {99#false} is VALID [2020-07-17 22:23:37,351 INFO L263 TraceCheckUtils]: 40: Hoare triple {99#false} call __VERIFIER_assert((if ~a~1 == #t~mem29 then 1 else 0)); {99#false} is VALID [2020-07-17 22:23:37,351 INFO L280 TraceCheckUtils]: 41: Hoare triple {99#false} ~cond := #in~cond; {99#false} is VALID [2020-07-17 22:23:37,352 INFO L280 TraceCheckUtils]: 42: Hoare triple {99#false} assume 0 == ~cond; {99#false} is VALID [2020-07-17 22:23:37,352 INFO L280 TraceCheckUtils]: 43: Hoare triple {99#false} assume !false; {99#false} is VALID [2020-07-17 22:23:37,358 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-17 22:23:37,359 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368483663] [2020-07-17 22:23:37,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:23:37,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:23:37,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782937901] [2020-07-17 22:23:37,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2020-07-17 22:23:37,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:23:37,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:23:37,460 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-17 22:23:37,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:23:37,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:23:37,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:23:37,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:23:37,473 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 6 states. [2020-07-17 22:23:38,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:38,825 INFO L93 Difference]: Finished difference Result 165 states and 215 transitions. [2020-07-17 22:23:38,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:23:38,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2020-07-17 22:23:38,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:23:38,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:23:38,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2020-07-17 22:23:38,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:23:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2020-07-17 22:23:38,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 215 transitions. [2020-07-17 22:23:39,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:23:39,251 INFO L225 Difference]: With dead ends: 165 [2020-07-17 22:23:39,251 INFO L226 Difference]: Without dead ends: 93 [2020-07-17 22:23:39,255 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:23:39,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-17 22:23:39,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-07-17 22:23:39,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:23:39,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 87 states. [2020-07-17 22:23:39,374 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 87 states. [2020-07-17 22:23:39,374 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 87 states. [2020-07-17 22:23:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:39,386 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2020-07-17 22:23:39,387 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 119 transitions. [2020-07-17 22:23:39,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:39,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:39,390 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 93 states. [2020-07-17 22:23:39,390 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 93 states. [2020-07-17 22:23:39,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:39,400 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2020-07-17 22:23:39,400 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 119 transitions. [2020-07-17 22:23:39,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:39,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:39,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:23:39,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:23:39,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-17 22:23:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2020-07-17 22:23:39,412 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 44 [2020-07-17 22:23:39,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:23:39,412 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2020-07-17 22:23:39,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:23:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2020-07-17 22:23:39,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-17 22:23:39,415 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:23:39,415 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-17 22:23:39,415 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:23:39,415 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:23:39,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:23:39,416 INFO L82 PathProgramCache]: Analyzing trace with hash -471380145, now seen corresponding path program 1 times [2020-07-17 22:23:39,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:23:39,417 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124879975] [2020-07-17 22:23:39,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:23:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:39,530 INFO L280 TraceCheckUtils]: 0: Hoare triple {697#(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; {668#true} is VALID [2020-07-17 22:23:39,530 INFO L280 TraceCheckUtils]: 1: Hoare triple {668#true} assume true; {668#true} is VALID [2020-07-17 22:23:39,531 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {668#true} {668#true} #167#return; {668#true} is VALID [2020-07-17 22:23:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:39,559 INFO L280 TraceCheckUtils]: 0: Hoare triple {698#(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; {668#true} is VALID [2020-07-17 22:23:39,559 INFO L280 TraceCheckUtils]: 1: Hoare triple {668#true} assume true; {668#true} is VALID [2020-07-17 22:23:39,560 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {668#true} {668#true} #123#return; {668#true} is VALID [2020-07-17 22:23:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:39,564 INFO L280 TraceCheckUtils]: 0: Hoare triple {668#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {668#true} is VALID [2020-07-17 22:23:39,564 INFO L280 TraceCheckUtils]: 1: Hoare triple {668#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {668#true} is VALID [2020-07-17 22:23:39,565 INFO L280 TraceCheckUtils]: 2: Hoare triple {668#true} assume true; {668#true} is VALID [2020-07-17 22:23:39,565 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {668#true} {668#true} #137#return; {668#true} is VALID [2020-07-17 22:23:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:39,582 INFO L280 TraceCheckUtils]: 0: Hoare triple {668#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {668#true} is VALID [2020-07-17 22:23:39,583 INFO L280 TraceCheckUtils]: 1: Hoare triple {668#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {699#(= 0 |size_#res|)} is VALID [2020-07-17 22:23:39,584 INFO L280 TraceCheckUtils]: 2: Hoare triple {699#(= 0 |size_#res|)} assume true; {699#(= 0 |size_#res|)} is VALID [2020-07-17 22:23:39,585 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {699#(= 0 |size_#res|)} {668#true} #139#return; {684#(= 0 |task_#t~ret26|)} is VALID [2020-07-17 22:23:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:39,616 INFO L280 TraceCheckUtils]: 0: Hoare triple {668#true} ~cond := #in~cond; {700#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2020-07-17 22:23:39,617 INFO L280 TraceCheckUtils]: 1: Hoare triple {700#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {701#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID [2020-07-17 22:23:39,617 INFO L280 TraceCheckUtils]: 2: Hoare triple {701#(not (= 0 |assume_abort_if_not_#in~cond|))} assume true; {701#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID [2020-07-17 22:23:39,618 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {701#(not (= 0 |assume_abort_if_not_#in~cond|))} {685#(= 0 task_~n~1)} #141#return; {669#false} is VALID [2020-07-17 22:23:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:39,633 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {668#true} is VALID [2020-07-17 22:23:39,634 INFO L280 TraceCheckUtils]: 1: Hoare triple {668#true} assume true; {668#true} is VALID [2020-07-17 22:23:39,634 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {668#true} {669#false} #143#return; {669#false} is VALID [2020-07-17 22:23:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:39,657 INFO L280 TraceCheckUtils]: 0: Hoare triple {703#(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; {668#true} is VALID [2020-07-17 22:23:39,658 INFO L280 TraceCheckUtils]: 1: Hoare triple {668#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {668#true} is VALID [2020-07-17 22:23:39,658 INFO L280 TraceCheckUtils]: 2: Hoare triple {668#true} assume true; {668#true} is VALID [2020-07-17 22:23:39,658 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {668#true} {669#false} #145#return; {669#false} is VALID [2020-07-17 22:23:39,659 INFO L263 TraceCheckUtils]: 0: Hoare triple {668#true} call ULTIMATE.init(); {697#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:23:39,660 INFO L280 TraceCheckUtils]: 1: Hoare triple {697#(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; {668#true} is VALID [2020-07-17 22:23:39,660 INFO L280 TraceCheckUtils]: 2: Hoare triple {668#true} assume true; {668#true} is VALID [2020-07-17 22:23:39,660 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {668#true} {668#true} #167#return; {668#true} is VALID [2020-07-17 22:23:39,661 INFO L263 TraceCheckUtils]: 4: Hoare triple {668#true} call #t~ret39 := main(); {668#true} is VALID [2020-07-17 22:23:39,662 INFO L263 TraceCheckUtils]: 5: Hoare triple {668#true} call #t~ret38.base, #t~ret38.offset := nondet_tree(); {698#(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-17 22:23:39,662 INFO L280 TraceCheckUtils]: 6: Hoare triple {698#(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; {668#true} is VALID [2020-07-17 22:23:39,662 INFO L280 TraceCheckUtils]: 7: Hoare triple {668#true} assume true; {668#true} is VALID [2020-07-17 22:23:39,662 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {668#true} {668#true} #123#return; {668#true} is VALID [2020-07-17 22:23:39,663 INFO L263 TraceCheckUtils]: 9: Hoare triple {668#true} call task(#t~ret38.base, #t~ret38.offset); {668#true} is VALID [2020-07-17 22:23:39,663 INFO L280 TraceCheckUtils]: 10: Hoare triple {668#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {668#true} is VALID [2020-07-17 22:23:39,663 INFO L263 TraceCheckUtils]: 11: Hoare triple {668#true} call #t~ret25 := min(~t.base, ~t.offset); {668#true} is VALID [2020-07-17 22:23:39,664 INFO L280 TraceCheckUtils]: 12: Hoare triple {668#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {668#true} is VALID [2020-07-17 22:23:39,664 INFO L280 TraceCheckUtils]: 13: Hoare triple {668#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {668#true} is VALID [2020-07-17 22:23:39,664 INFO L280 TraceCheckUtils]: 14: Hoare triple {668#true} assume true; {668#true} is VALID [2020-07-17 22:23:39,664 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {668#true} {668#true} #137#return; {668#true} is VALID [2020-07-17 22:23:39,665 INFO L280 TraceCheckUtils]: 16: Hoare triple {668#true} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;~a~1 := #t~ret25;havoc #t~ret25;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {668#true} is VALID [2020-07-17 22:23:39,665 INFO L263 TraceCheckUtils]: 17: Hoare triple {668#true} call #t~ret26 := size(~t.base, ~t.offset); {668#true} is VALID [2020-07-17 22:23:39,665 INFO L280 TraceCheckUtils]: 18: Hoare triple {668#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {668#true} is VALID [2020-07-17 22:23:39,666 INFO L280 TraceCheckUtils]: 19: Hoare triple {668#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {699#(= 0 |size_#res|)} is VALID [2020-07-17 22:23:39,667 INFO L280 TraceCheckUtils]: 20: Hoare triple {699#(= 0 |size_#res|)} assume true; {699#(= 0 |size_#res|)} is VALID [2020-07-17 22:23:39,668 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {699#(= 0 |size_#res|)} {668#true} #139#return; {684#(= 0 |task_#t~ret26|)} is VALID [2020-07-17 22:23:39,669 INFO L280 TraceCheckUtils]: 22: Hoare triple {684#(= 0 |task_#t~ret26|)} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;~n~1 := #t~ret26;havoc #t~ret26; {685#(= 0 task_~n~1)} is VALID [2020-07-17 22:23:39,669 INFO L263 TraceCheckUtils]: 23: Hoare triple {685#(= 0 task_~n~1)} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {668#true} is VALID [2020-07-17 22:23:39,670 INFO L280 TraceCheckUtils]: 24: Hoare triple {668#true} ~cond := #in~cond; {700#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2020-07-17 22:23:39,670 INFO L280 TraceCheckUtils]: 25: Hoare triple {700#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {701#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID [2020-07-17 22:23:39,671 INFO L280 TraceCheckUtils]: 26: Hoare triple {701#(not (= 0 |assume_abort_if_not_#in~cond|))} assume true; {701#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID [2020-07-17 22:23:39,672 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {701#(not (= 0 |assume_abort_if_not_#in~cond|))} {685#(= 0 task_~n~1)} #141#return; {669#false} is VALID [2020-07-17 22:23:39,672 INFO L280 TraceCheckUtils]: 28: Hoare triple {669#false} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(4 * ~n~1); {669#false} is VALID [2020-07-17 22:23:39,672 INFO L263 TraceCheckUtils]: 29: Hoare triple {669#false} call #Ultimate.meminit(#t~malloc27.base, #t~malloc27.offset, ~n~1, 4, 4 * ~n~1); {702#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-17 22:23:39,673 INFO L280 TraceCheckUtils]: 30: Hoare triple {702#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {668#true} is VALID [2020-07-17 22:23:39,673 INFO L280 TraceCheckUtils]: 31: Hoare triple {668#true} assume true; {668#true} is VALID [2020-07-17 22:23:39,673 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {668#true} {669#false} #143#return; {669#false} is VALID [2020-07-17 22:23:39,674 INFO L280 TraceCheckUtils]: 33: Hoare triple {669#false} ~x~0.base, ~x~0.offset := #t~malloc27.base, #t~malloc27.offset; {669#false} is VALID [2020-07-17 22:23:39,674 INFO L263 TraceCheckUtils]: 34: Hoare triple {669#false} call #t~ret28 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {703#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:23:39,674 INFO L280 TraceCheckUtils]: 35: Hoare triple {703#(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; {668#true} is VALID [2020-07-17 22:23:39,674 INFO L280 TraceCheckUtils]: 36: Hoare triple {668#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {668#true} is VALID [2020-07-17 22:23:39,675 INFO L280 TraceCheckUtils]: 37: Hoare triple {668#true} assume true; {668#true} is VALID [2020-07-17 22:23:39,675 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {668#true} {669#false} #145#return; {669#false} is VALID [2020-07-17 22:23:39,675 INFO L280 TraceCheckUtils]: 39: Hoare triple {669#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;havoc #t~ret28;call #t~mem29 := read~int(~x~0.base, ~x~0.offset, 4); {669#false} is VALID [2020-07-17 22:23:39,675 INFO L263 TraceCheckUtils]: 40: Hoare triple {669#false} call __VERIFIER_assert((if ~a~1 == #t~mem29 then 1 else 0)); {669#false} is VALID [2020-07-17 22:23:39,676 INFO L280 TraceCheckUtils]: 41: Hoare triple {669#false} ~cond := #in~cond; {669#false} is VALID [2020-07-17 22:23:39,676 INFO L280 TraceCheckUtils]: 42: Hoare triple {669#false} assume 0 == ~cond; {669#false} is VALID [2020-07-17 22:23:39,676 INFO L280 TraceCheckUtils]: 43: Hoare triple {669#false} assume !false; {669#false} is VALID [2020-07-17 22:23:39,679 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-17 22:23:39,679 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124879975] [2020-07-17 22:23:39,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:23:39,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-17 22:23:39,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338251775] [2020-07-17 22:23:39,682 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2020-07-17 22:23:39,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:23:39,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:23:39,733 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-17 22:23:39,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:23:39,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:23:39,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:23:39,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:23:39,734 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand 11 states. [2020-07-17 22:23:41,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:41,945 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2020-07-17 22:23:41,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:23:41,945 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2020-07-17 22:23:41,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:23:41,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:23:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2020-07-17 22:23:41,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:23:41,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2020-07-17 22:23:41,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 194 transitions. [2020-07-17 22:23:42,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:23:42,283 INFO L225 Difference]: With dead ends: 151 [2020-07-17 22:23:42,283 INFO L226 Difference]: Without dead ends: 95 [2020-07-17 22:23:42,287 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-17 22:23:42,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-17 22:23:42,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2020-07-17 22:23:42,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:23:42,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 89 states. [2020-07-17 22:23:42,351 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 89 states. [2020-07-17 22:23:42,351 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 89 states. [2020-07-17 22:23:42,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:42,359 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2020-07-17 22:23:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2020-07-17 22:23:42,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:42,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:42,361 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 95 states. [2020-07-17 22:23:42,361 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 95 states. [2020-07-17 22:23:42,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:42,368 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2020-07-17 22:23:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2020-07-17 22:23:42,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:42,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:42,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:23:42,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:23:42,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-07-17 22:23:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions. [2020-07-17 22:23:42,375 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 112 transitions. Word has length 44 [2020-07-17 22:23:42,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:23:42,376 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 112 transitions. [2020-07-17 22:23:42,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:23:42,376 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions. [2020-07-17 22:23:42,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-17 22:23:42,378 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:23:42,378 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-17 22:23:42,378 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:23:42,378 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:23:42,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:23:42,379 INFO L82 PathProgramCache]: Analyzing trace with hash 800610240, now seen corresponding path program 1 times [2020-07-17 22:23:42,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:23:42,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554051103] [2020-07-17 22:23:42,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:23:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:42,485 INFO L280 TraceCheckUtils]: 0: Hoare triple {1288#(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; {1246#true} is VALID [2020-07-17 22:23:42,485 INFO L280 TraceCheckUtils]: 1: Hoare triple {1246#true} assume true; {1246#true} is VALID [2020-07-17 22:23:42,485 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1246#true} {1246#true} #167#return; {1246#true} is VALID [2020-07-17 22:23:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:42,542 INFO L280 TraceCheckUtils]: 0: Hoare triple {1289#(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; {1290#(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-17 22:23:42,552 INFO L280 TraceCheckUtils]: 1: Hoare triple {1290#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1290#(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-17 22:23:42,557 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1290#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {1246#true} #123#return; {1254#(and (= 0 |main_#t~ret38.offset|) (= 0 |main_#t~ret38.base|))} is VALID [2020-07-17 22:23:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:42,576 INFO L280 TraceCheckUtils]: 0: Hoare triple {1246#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1246#true} is VALID [2020-07-17 22:23:42,576 INFO L280 TraceCheckUtils]: 1: Hoare triple {1246#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1246#true} is VALID [2020-07-17 22:23:42,577 INFO L280 TraceCheckUtils]: 2: Hoare triple {1246#true} assume true; {1246#true} is VALID [2020-07-17 22:23:42,578 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1246#true} {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #137#return; {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-17 22:23:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:42,664 INFO L280 TraceCheckUtils]: 0: Hoare triple {1246#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1246#true} is VALID [2020-07-17 22:23:42,665 INFO L280 TraceCheckUtils]: 1: Hoare triple {1246#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1246#true} is VALID [2020-07-17 22:23:42,665 INFO L280 TraceCheckUtils]: 2: Hoare triple {1246#true} assume true; {1246#true} is VALID [2020-07-17 22:23:42,666 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1246#true} {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #163#return; {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:42,674 INFO L280 TraceCheckUtils]: 0: Hoare triple {1246#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1246#true} is VALID [2020-07-17 22:23:42,674 INFO L280 TraceCheckUtils]: 1: Hoare triple {1246#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1246#true} is VALID [2020-07-17 22:23:42,675 INFO L280 TraceCheckUtils]: 2: Hoare triple {1246#true} assume true; {1246#true} is VALID [2020-07-17 22:23:42,676 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1246#true} {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #165#return; {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:42,677 INFO L280 TraceCheckUtils]: 0: Hoare triple {1246#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1291#(and (or (= 0 size_~t.offset) (= |size_#in~t.offset| size_~t.offset)) (= |size_#in~t.base| size_~t.base))} is VALID [2020-07-17 22:23:42,678 INFO L280 TraceCheckUtils]: 1: Hoare triple {1291#(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~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:42,679 INFO L263 TraceCheckUtils]: 2: Hoare triple {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {1246#true} is VALID [2020-07-17 22:23:42,679 INFO L280 TraceCheckUtils]: 3: Hoare triple {1246#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1246#true} is VALID [2020-07-17 22:23:42,679 INFO L280 TraceCheckUtils]: 4: Hoare triple {1246#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1246#true} is VALID [2020-07-17 22:23:42,679 INFO L280 TraceCheckUtils]: 5: Hoare triple {1246#true} assume true; {1246#true} is VALID [2020-07-17 22:23:42,681 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1246#true} {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #163#return; {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:42,682 INFO L280 TraceCheckUtils]: 7: Hoare triple {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:42,683 INFO L263 TraceCheckUtils]: 8: Hoare triple {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1246#true} is VALID [2020-07-17 22:23:42,683 INFO L280 TraceCheckUtils]: 9: Hoare triple {1246#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1246#true} is VALID [2020-07-17 22:23:42,683 INFO L280 TraceCheckUtils]: 10: Hoare triple {1246#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1246#true} is VALID [2020-07-17 22:23:42,684 INFO L280 TraceCheckUtils]: 11: Hoare triple {1246#true} assume true; {1246#true} is VALID [2020-07-17 22:23:42,685 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1246#true} {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #165#return; {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:42,685 INFO L280 TraceCheckUtils]: 13: Hoare triple {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~ret22;havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~mem21.base, #t~mem21.offset; {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:42,687 INFO L280 TraceCheckUtils]: 14: Hoare triple {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:42,689 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #139#return; {1247#false} is VALID [2020-07-17 22:23:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:42,695 INFO L280 TraceCheckUtils]: 0: Hoare triple {1246#true} ~cond := #in~cond; {1246#true} is VALID [2020-07-17 22:23:42,696 INFO L280 TraceCheckUtils]: 1: Hoare triple {1246#true} assume !(0 == ~cond); {1246#true} is VALID [2020-07-17 22:23:42,696 INFO L280 TraceCheckUtils]: 2: Hoare triple {1246#true} assume true; {1246#true} is VALID [2020-07-17 22:23:42,696 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1246#true} {1247#false} #141#return; {1247#false} is VALID [2020-07-17 22:23:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:42,716 INFO L280 TraceCheckUtils]: 0: Hoare triple {1301#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1246#true} is VALID [2020-07-17 22:23:42,716 INFO L280 TraceCheckUtils]: 1: Hoare triple {1246#true} assume true; {1246#true} is VALID [2020-07-17 22:23:42,716 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1246#true} {1247#false} #143#return; {1247#false} is VALID [2020-07-17 22:23:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:42,754 INFO L280 TraceCheckUtils]: 0: Hoare triple {1302#(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; {1246#true} is VALID [2020-07-17 22:23:42,754 INFO L280 TraceCheckUtils]: 1: Hoare triple {1246#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1246#true} is VALID [2020-07-17 22:23:42,755 INFO L280 TraceCheckUtils]: 2: Hoare triple {1246#true} assume true; {1246#true} is VALID [2020-07-17 22:23:42,755 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1246#true} {1247#false} #145#return; {1247#false} is VALID [2020-07-17 22:23:42,757 INFO L263 TraceCheckUtils]: 0: Hoare triple {1246#true} call ULTIMATE.init(); {1288#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:23:42,757 INFO L280 TraceCheckUtils]: 1: Hoare triple {1288#(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; {1246#true} is VALID [2020-07-17 22:23:42,757 INFO L280 TraceCheckUtils]: 2: Hoare triple {1246#true} assume true; {1246#true} is VALID [2020-07-17 22:23:42,758 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1246#true} {1246#true} #167#return; {1246#true} is VALID [2020-07-17 22:23:42,758 INFO L263 TraceCheckUtils]: 4: Hoare triple {1246#true} call #t~ret39 := main(); {1246#true} is VALID [2020-07-17 22:23:42,759 INFO L263 TraceCheckUtils]: 5: Hoare triple {1246#true} call #t~ret38.base, #t~ret38.offset := nondet_tree(); {1289#(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-17 22:23:42,760 INFO L280 TraceCheckUtils]: 6: Hoare triple {1289#(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; {1290#(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-17 22:23:42,761 INFO L280 TraceCheckUtils]: 7: Hoare triple {1290#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1290#(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-17 22:23:42,762 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1290#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {1246#true} #123#return; {1254#(and (= 0 |main_#t~ret38.offset|) (= 0 |main_#t~ret38.base|))} is VALID [2020-07-17 22:23:42,763 INFO L263 TraceCheckUtils]: 9: Hoare triple {1254#(and (= 0 |main_#t~ret38.offset|) (= 0 |main_#t~ret38.base|))} call task(#t~ret38.base, #t~ret38.offset); {1255#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} is VALID [2020-07-17 22:23:42,764 INFO L280 TraceCheckUtils]: 10: Hoare triple {1255#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-17 22:23:42,764 INFO L263 TraceCheckUtils]: 11: Hoare triple {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret25 := min(~t.base, ~t.offset); {1246#true} is VALID [2020-07-17 22:23:42,764 INFO L280 TraceCheckUtils]: 12: Hoare triple {1246#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1246#true} is VALID [2020-07-17 22:23:42,764 INFO L280 TraceCheckUtils]: 13: Hoare triple {1246#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1246#true} is VALID [2020-07-17 22:23:42,765 INFO L280 TraceCheckUtils]: 14: Hoare triple {1246#true} assume true; {1246#true} is VALID [2020-07-17 22:23:42,766 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1246#true} {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #137#return; {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-17 22:23:42,767 INFO L280 TraceCheckUtils]: 16: Hoare triple {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;~a~1 := #t~ret25;havoc #t~ret25;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-17 22:23:42,767 INFO L263 TraceCheckUtils]: 17: Hoare triple {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret26 := size(~t.base, ~t.offset); {1246#true} is VALID [2020-07-17 22:23:42,768 INFO L280 TraceCheckUtils]: 18: Hoare triple {1246#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1291#(and (or (= 0 size_~t.offset) (= |size_#in~t.offset| size_~t.offset)) (= |size_#in~t.base| size_~t.base))} is VALID [2020-07-17 22:23:42,768 INFO L280 TraceCheckUtils]: 19: Hoare triple {1291#(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~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:42,769 INFO L263 TraceCheckUtils]: 20: Hoare triple {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {1246#true} is VALID [2020-07-17 22:23:42,769 INFO L280 TraceCheckUtils]: 21: Hoare triple {1246#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1246#true} is VALID [2020-07-17 22:23:42,769 INFO L280 TraceCheckUtils]: 22: Hoare triple {1246#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1246#true} is VALID [2020-07-17 22:23:42,769 INFO L280 TraceCheckUtils]: 23: Hoare triple {1246#true} assume true; {1246#true} is VALID [2020-07-17 22:23:42,771 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1246#true} {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #163#return; {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:42,772 INFO L280 TraceCheckUtils]: 25: Hoare triple {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:42,772 INFO L263 TraceCheckUtils]: 26: Hoare triple {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1246#true} is VALID [2020-07-17 22:23:42,772 INFO L280 TraceCheckUtils]: 27: Hoare triple {1246#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1246#true} is VALID [2020-07-17 22:23:42,773 INFO L280 TraceCheckUtils]: 28: Hoare triple {1246#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1246#true} is VALID [2020-07-17 22:23:42,773 INFO L280 TraceCheckUtils]: 29: Hoare triple {1246#true} assume true; {1246#true} is VALID [2020-07-17 22:23:42,775 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1246#true} {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #165#return; {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:42,776 INFO L280 TraceCheckUtils]: 31: Hoare triple {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~ret22;havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~mem21.base, #t~mem21.offset; {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:42,776 INFO L280 TraceCheckUtils]: 32: Hoare triple {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:42,778 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #139#return; {1247#false} is VALID [2020-07-17 22:23:42,778 INFO L280 TraceCheckUtils]: 34: Hoare triple {1247#false} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;~n~1 := #t~ret26;havoc #t~ret26; {1247#false} is VALID [2020-07-17 22:23:42,778 INFO L263 TraceCheckUtils]: 35: Hoare triple {1247#false} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {1246#true} is VALID [2020-07-17 22:23:42,779 INFO L280 TraceCheckUtils]: 36: Hoare triple {1246#true} ~cond := #in~cond; {1246#true} is VALID [2020-07-17 22:23:42,779 INFO L280 TraceCheckUtils]: 37: Hoare triple {1246#true} assume !(0 == ~cond); {1246#true} is VALID [2020-07-17 22:23:42,779 INFO L280 TraceCheckUtils]: 38: Hoare triple {1246#true} assume true; {1246#true} is VALID [2020-07-17 22:23:42,779 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1246#true} {1247#false} #141#return; {1247#false} is VALID [2020-07-17 22:23:42,780 INFO L280 TraceCheckUtils]: 40: Hoare triple {1247#false} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(4 * ~n~1); {1247#false} is VALID [2020-07-17 22:23:42,780 INFO L263 TraceCheckUtils]: 41: Hoare triple {1247#false} call #Ultimate.meminit(#t~malloc27.base, #t~malloc27.offset, ~n~1, 4, 4 * ~n~1); {1301#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-17 22:23:42,780 INFO L280 TraceCheckUtils]: 42: Hoare triple {1301#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1246#true} is VALID [2020-07-17 22:23:42,780 INFO L280 TraceCheckUtils]: 43: Hoare triple {1246#true} assume true; {1246#true} is VALID [2020-07-17 22:23:42,781 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {1246#true} {1247#false} #143#return; {1247#false} is VALID [2020-07-17 22:23:42,781 INFO L280 TraceCheckUtils]: 45: Hoare triple {1247#false} ~x~0.base, ~x~0.offset := #t~malloc27.base, #t~malloc27.offset; {1247#false} is VALID [2020-07-17 22:23:42,781 INFO L263 TraceCheckUtils]: 46: Hoare triple {1247#false} call #t~ret28 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {1302#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:23:42,782 INFO L280 TraceCheckUtils]: 47: Hoare triple {1302#(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; {1246#true} is VALID [2020-07-17 22:23:42,782 INFO L280 TraceCheckUtils]: 48: Hoare triple {1246#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1246#true} is VALID [2020-07-17 22:23:42,782 INFO L280 TraceCheckUtils]: 49: Hoare triple {1246#true} assume true; {1246#true} is VALID [2020-07-17 22:23:42,794 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {1246#true} {1247#false} #145#return; {1247#false} is VALID [2020-07-17 22:23:42,795 INFO L280 TraceCheckUtils]: 51: Hoare triple {1247#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;havoc #t~ret28;call #t~mem29 := read~int(~x~0.base, ~x~0.offset, 4); {1247#false} is VALID [2020-07-17 22:23:42,795 INFO L263 TraceCheckUtils]: 52: Hoare triple {1247#false} call __VERIFIER_assert((if ~a~1 == #t~mem29 then 1 else 0)); {1247#false} is VALID [2020-07-17 22:23:42,795 INFO L280 TraceCheckUtils]: 53: Hoare triple {1247#false} ~cond := #in~cond; {1247#false} is VALID [2020-07-17 22:23:42,795 INFO L280 TraceCheckUtils]: 54: Hoare triple {1247#false} assume 0 == ~cond; {1247#false} is VALID [2020-07-17 22:23:42,796 INFO L280 TraceCheckUtils]: 55: Hoare triple {1247#false} assume !false; {1247#false} is VALID [2020-07-17 22:23:42,801 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-17 22:23:42,801 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554051103] [2020-07-17 22:23:42,801 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337910305] [2020-07-17 22:23:42,802 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-17 22:23:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:42,889 INFO L264 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 25 conjunts are in the unsatisfiable core [2020-07-17 22:23:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:42,921 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:23:43,072 INFO L263 TraceCheckUtils]: 0: Hoare triple {1246#true} call ULTIMATE.init(); {1246#true} is VALID [2020-07-17 22:23:43,073 INFO L280 TraceCheckUtils]: 1: Hoare triple {1246#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1246#true} is VALID [2020-07-17 22:23:43,073 INFO L280 TraceCheckUtils]: 2: Hoare triple {1246#true} assume true; {1246#true} is VALID [2020-07-17 22:23:43,074 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1246#true} {1246#true} #167#return; {1246#true} is VALID [2020-07-17 22:23:43,074 INFO L263 TraceCheckUtils]: 4: Hoare triple {1246#true} call #t~ret39 := main(); {1246#true} is VALID [2020-07-17 22:23:43,074 INFO L263 TraceCheckUtils]: 5: Hoare triple {1246#true} call #t~ret38.base, #t~ret38.offset := nondet_tree(); {1246#true} is VALID [2020-07-17 22:23:43,075 INFO L280 TraceCheckUtils]: 6: Hoare triple {1246#true} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {1290#(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-17 22:23:43,076 INFO L280 TraceCheckUtils]: 7: Hoare triple {1290#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1290#(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-17 22:23:43,077 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1290#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {1246#true} #123#return; {1254#(and (= 0 |main_#t~ret38.offset|) (= 0 |main_#t~ret38.base|))} is VALID [2020-07-17 22:23:43,077 INFO L263 TraceCheckUtils]: 9: Hoare triple {1254#(and (= 0 |main_#t~ret38.offset|) (= 0 |main_#t~ret38.base|))} call task(#t~ret38.base, #t~ret38.offset); {1255#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} is VALID [2020-07-17 22:23:43,078 INFO L280 TraceCheckUtils]: 10: Hoare triple {1255#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-17 22:23:43,078 INFO L263 TraceCheckUtils]: 11: Hoare triple {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret25 := min(~t.base, ~t.offset); {1246#true} is VALID [2020-07-17 22:23:43,078 INFO L280 TraceCheckUtils]: 12: Hoare triple {1246#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1246#true} is VALID [2020-07-17 22:23:43,079 INFO L280 TraceCheckUtils]: 13: Hoare triple {1246#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1246#true} is VALID [2020-07-17 22:23:43,079 INFO L280 TraceCheckUtils]: 14: Hoare triple {1246#true} assume true; {1246#true} is VALID [2020-07-17 22:23:43,081 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1246#true} {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #137#return; {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-17 22:23:43,083 INFO L280 TraceCheckUtils]: 16: Hoare triple {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;~a~1 := #t~ret25;havoc #t~ret25;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-17 22:23:43,084 INFO L263 TraceCheckUtils]: 17: Hoare triple {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret26 := size(~t.base, ~t.offset); {1246#true} is VALID [2020-07-17 22:23:43,088 INFO L280 TraceCheckUtils]: 18: Hoare triple {1246#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1360#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} is VALID [2020-07-17 22:23:43,089 INFO L280 TraceCheckUtils]: 19: Hoare triple {1360#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:43,089 INFO L263 TraceCheckUtils]: 20: Hoare triple {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {1246#true} is VALID [2020-07-17 22:23:43,089 INFO L280 TraceCheckUtils]: 21: Hoare triple {1246#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1246#true} is VALID [2020-07-17 22:23:43,089 INFO L280 TraceCheckUtils]: 22: Hoare triple {1246#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1246#true} is VALID [2020-07-17 22:23:43,089 INFO L280 TraceCheckUtils]: 23: Hoare triple {1246#true} assume true; {1246#true} is VALID [2020-07-17 22:23:43,090 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1246#true} {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #163#return; {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:43,091 INFO L280 TraceCheckUtils]: 25: Hoare triple {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:43,091 INFO L263 TraceCheckUtils]: 26: Hoare triple {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1246#true} is VALID [2020-07-17 22:23:43,091 INFO L280 TraceCheckUtils]: 27: Hoare triple {1246#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1246#true} is VALID [2020-07-17 22:23:43,091 INFO L280 TraceCheckUtils]: 28: Hoare triple {1246#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1246#true} is VALID [2020-07-17 22:23:43,092 INFO L280 TraceCheckUtils]: 29: Hoare triple {1246#true} assume true; {1246#true} is VALID [2020-07-17 22:23:43,095 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1246#true} {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #165#return; {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:43,096 INFO L280 TraceCheckUtils]: 31: Hoare triple {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~ret22;havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~mem21.base, #t~mem21.offset; {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:43,098 INFO L280 TraceCheckUtils]: 32: Hoare triple {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:43,099 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1292#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #139#return; {1247#false} is VALID [2020-07-17 22:23:43,100 INFO L280 TraceCheckUtils]: 34: Hoare triple {1247#false} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;~n~1 := #t~ret26;havoc #t~ret26; {1247#false} is VALID [2020-07-17 22:23:43,100 INFO L263 TraceCheckUtils]: 35: Hoare triple {1247#false} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {1247#false} is VALID [2020-07-17 22:23:43,100 INFO L280 TraceCheckUtils]: 36: Hoare triple {1247#false} ~cond := #in~cond; {1247#false} is VALID [2020-07-17 22:23:43,100 INFO L280 TraceCheckUtils]: 37: Hoare triple {1247#false} assume !(0 == ~cond); {1247#false} is VALID [2020-07-17 22:23:43,101 INFO L280 TraceCheckUtils]: 38: Hoare triple {1247#false} assume true; {1247#false} is VALID [2020-07-17 22:23:43,101 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1247#false} {1247#false} #141#return; {1247#false} is VALID [2020-07-17 22:23:43,101 INFO L280 TraceCheckUtils]: 40: Hoare triple {1247#false} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(4 * ~n~1); {1247#false} is VALID [2020-07-17 22:23:43,101 INFO L263 TraceCheckUtils]: 41: Hoare triple {1247#false} call #Ultimate.meminit(#t~malloc27.base, #t~malloc27.offset, ~n~1, 4, 4 * ~n~1); {1247#false} is VALID [2020-07-17 22:23:43,102 INFO L280 TraceCheckUtils]: 42: Hoare triple {1247#false} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1247#false} is VALID [2020-07-17 22:23:43,102 INFO L280 TraceCheckUtils]: 43: Hoare triple {1247#false} assume true; {1247#false} is VALID [2020-07-17 22:23:43,102 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {1247#false} {1247#false} #143#return; {1247#false} is VALID [2020-07-17 22:23:43,102 INFO L280 TraceCheckUtils]: 45: Hoare triple {1247#false} ~x~0.base, ~x~0.offset := #t~malloc27.base, #t~malloc27.offset; {1247#false} is VALID [2020-07-17 22:23:43,103 INFO L263 TraceCheckUtils]: 46: Hoare triple {1247#false} call #t~ret28 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {1247#false} is VALID [2020-07-17 22:23:43,103 INFO L280 TraceCheckUtils]: 47: Hoare triple {1247#false} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {1247#false} is VALID [2020-07-17 22:23:43,103 INFO L280 TraceCheckUtils]: 48: Hoare triple {1247#false} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1247#false} is VALID [2020-07-17 22:23:43,103 INFO L280 TraceCheckUtils]: 49: Hoare triple {1247#false} assume true; {1247#false} is VALID [2020-07-17 22:23:43,104 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {1247#false} {1247#false} #145#return; {1247#false} is VALID [2020-07-17 22:23:43,104 INFO L280 TraceCheckUtils]: 51: Hoare triple {1247#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;havoc #t~ret28;call #t~mem29 := read~int(~x~0.base, ~x~0.offset, 4); {1247#false} is VALID [2020-07-17 22:23:43,104 INFO L263 TraceCheckUtils]: 52: Hoare triple {1247#false} call __VERIFIER_assert((if ~a~1 == #t~mem29 then 1 else 0)); {1247#false} is VALID [2020-07-17 22:23:43,104 INFO L280 TraceCheckUtils]: 53: Hoare triple {1247#false} ~cond := #in~cond; {1247#false} is VALID [2020-07-17 22:23:43,105 INFO L280 TraceCheckUtils]: 54: Hoare triple {1247#false} assume 0 == ~cond; {1247#false} is VALID [2020-07-17 22:23:43,105 INFO L280 TraceCheckUtils]: 55: Hoare triple {1247#false} assume !false; {1247#false} is VALID [2020-07-17 22:23:43,111 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-17 22:23:43,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:23:43,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 13 [2020-07-17 22:23:43,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239082488] [2020-07-17 22:23:43,113 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2020-07-17 22:23:43,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:23:43,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-17 22:23:43,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:23:43,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 22:23:43,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:23:43,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 22:23:43,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:23:43,194 INFO L87 Difference]: Start difference. First operand 89 states and 112 transitions. Second operand 13 states. [2020-07-17 22:23:46,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:46,305 INFO L93 Difference]: Finished difference Result 161 states and 206 transitions. [2020-07-17 22:23:46,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 22:23:46,306 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2020-07-17 22:23:46,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:23:46,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:23:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 202 transitions. [2020-07-17 22:23:46,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:23:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 202 transitions. [2020-07-17 22:23:46,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 202 transitions. [2020-07-17 22:23:46,615 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:23:46,619 INFO L225 Difference]: With dead ends: 161 [2020-07-17 22:23:46,619 INFO L226 Difference]: Without dead ends: 94 [2020-07-17 22:23:46,621 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2020-07-17 22:23:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-07-17 22:23:46,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2020-07-17 22:23:46,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:23:46,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 91 states. [2020-07-17 22:23:46,691 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 91 states. [2020-07-17 22:23:46,691 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 91 states. [2020-07-17 22:23:46,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:46,697 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2020-07-17 22:23:46,697 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2020-07-17 22:23:46,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:46,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:46,698 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 94 states. [2020-07-17 22:23:46,699 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 94 states. [2020-07-17 22:23:46,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:46,705 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2020-07-17 22:23:46,705 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2020-07-17 22:23:46,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:46,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:46,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:23:46,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:23:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-17 22:23:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2020-07-17 22:23:46,711 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 56 [2020-07-17 22:23:46,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:23:46,711 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2020-07-17 22:23:46,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 22:23:46,712 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2020-07-17 22:23:46,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-17 22:23:46,713 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:23:46,713 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-17 22:23:46,928 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:23:46,928 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:23:46,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:23:46,929 INFO L82 PathProgramCache]: Analyzing trace with hash 487198237, now seen corresponding path program 1 times [2020-07-17 22:23:46,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:23:46,930 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429189686] [2020-07-17 22:23:46,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:23:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:47,011 INFO L280 TraceCheckUtils]: 0: Hoare triple {2082#(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; {2030#true} is VALID [2020-07-17 22:23:47,012 INFO L280 TraceCheckUtils]: 1: Hoare triple {2030#true} assume true; {2030#true} is VALID [2020-07-17 22:23:47,012 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2030#true} {2030#true} #167#return; {2030#true} is VALID [2020-07-17 22:23:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:47,102 INFO L280 TraceCheckUtils]: 0: Hoare triple {2083#(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; {2030#true} is VALID [2020-07-17 22:23:47,102 INFO L280 TraceCheckUtils]: 1: Hoare triple {2030#true} assume true; {2030#true} is VALID [2020-07-17 22:23:47,105 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2030#true} {2084#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #133#return; {2084#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-17 22:23:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:47,134 INFO L280 TraceCheckUtils]: 0: Hoare triple {2083#(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; {2030#true} is VALID [2020-07-17 22:23:47,135 INFO L280 TraceCheckUtils]: 1: Hoare triple {2030#true} assume true; {2030#true} is VALID [2020-07-17 22:23:47,140 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2030#true} {2084#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #135#return; {2084#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-17 22:23:47,143 INFO L280 TraceCheckUtils]: 0: Hoare triple {2083#(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; {2084#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-17 22:23:47,144 INFO L263 TraceCheckUtils]: 1: Hoare triple {2084#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2083#(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-17 22:23:47,144 INFO L280 TraceCheckUtils]: 2: Hoare triple {2083#(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; {2030#true} is VALID [2020-07-17 22:23:47,145 INFO L280 TraceCheckUtils]: 3: Hoare triple {2030#true} assume true; {2030#true} is VALID [2020-07-17 22:23:47,146 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2030#true} {2084#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #133#return; {2084#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-17 22:23:47,146 INFO L280 TraceCheckUtils]: 5: Hoare triple {2084#(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; {2084#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-17 22:23:47,147 INFO L263 TraceCheckUtils]: 6: Hoare triple {2084#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2083#(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-17 22:23:47,147 INFO L280 TraceCheckUtils]: 7: Hoare triple {2083#(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; {2030#true} is VALID [2020-07-17 22:23:47,148 INFO L280 TraceCheckUtils]: 8: Hoare triple {2030#true} assume true; {2030#true} is VALID [2020-07-17 22:23:47,148 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2030#true} {2084#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #135#return; {2084#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-17 22:23:47,149 INFO L280 TraceCheckUtils]: 10: Hoare triple {2084#(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; {2091#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-17 22:23:47,150 INFO L280 TraceCheckUtils]: 11: Hoare triple {2091#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} assume true; {2091#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-17 22:23:47,150 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2091#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} {2030#true} #123#return; {2048#(not (= 0 |main_#t~ret38.base|))} is VALID [2020-07-17 22:23:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:47,188 INFO L280 TraceCheckUtils]: 0: Hoare triple {2030#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2092#(= min_~n.base |min_#in~n.base|)} is VALID [2020-07-17 22:23:47,188 INFO L280 TraceCheckUtils]: 1: Hoare triple {2092#(= min_~n.base |min_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2093#(= 0 |min_#in~n.base|)} is VALID [2020-07-17 22:23:47,189 INFO L280 TraceCheckUtils]: 2: Hoare triple {2093#(= 0 |min_#in~n.base|)} assume true; {2093#(= 0 |min_#in~n.base|)} is VALID [2020-07-17 22:23:47,190 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2093#(= 0 |min_#in~n.base|)} {2050#(not (= 0 task_~t.base))} #137#return; {2031#false} is VALID [2020-07-17 22:23:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:47,207 INFO L280 TraceCheckUtils]: 0: Hoare triple {2030#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2030#true} is VALID [2020-07-17 22:23:47,208 INFO L280 TraceCheckUtils]: 1: Hoare triple {2030#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2030#true} is VALID [2020-07-17 22:23:47,208 INFO L280 TraceCheckUtils]: 2: Hoare triple {2030#true} assume true; {2030#true} is VALID [2020-07-17 22:23:47,208 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2030#true} {2030#true} #163#return; {2030#true} is VALID [2020-07-17 22:23:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:47,212 INFO L280 TraceCheckUtils]: 0: Hoare triple {2030#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2030#true} is VALID [2020-07-17 22:23:47,212 INFO L280 TraceCheckUtils]: 1: Hoare triple {2030#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2030#true} is VALID [2020-07-17 22:23:47,212 INFO L280 TraceCheckUtils]: 2: Hoare triple {2030#true} assume true; {2030#true} is VALID [2020-07-17 22:23:47,212 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2030#true} {2030#true} #165#return; {2030#true} is VALID [2020-07-17 22:23:47,213 INFO L280 TraceCheckUtils]: 0: Hoare triple {2030#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2030#true} is VALID [2020-07-17 22:23:47,213 INFO L280 TraceCheckUtils]: 1: Hoare triple {2030#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2030#true} is VALID [2020-07-17 22:23:47,213 INFO L263 TraceCheckUtils]: 2: Hoare triple {2030#true} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {2030#true} is VALID [2020-07-17 22:23:47,213 INFO L280 TraceCheckUtils]: 3: Hoare triple {2030#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2030#true} is VALID [2020-07-17 22:23:47,214 INFO L280 TraceCheckUtils]: 4: Hoare triple {2030#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2030#true} is VALID [2020-07-17 22:23:47,214 INFO L280 TraceCheckUtils]: 5: Hoare triple {2030#true} assume true; {2030#true} is VALID [2020-07-17 22:23:47,214 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {2030#true} {2030#true} #163#return; {2030#true} is VALID [2020-07-17 22:23:47,214 INFO L280 TraceCheckUtils]: 7: Hoare triple {2030#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2030#true} is VALID [2020-07-17 22:23:47,215 INFO L263 TraceCheckUtils]: 8: Hoare triple {2030#true} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {2030#true} is VALID [2020-07-17 22:23:47,215 INFO L280 TraceCheckUtils]: 9: Hoare triple {2030#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2030#true} is VALID [2020-07-17 22:23:47,215 INFO L280 TraceCheckUtils]: 10: Hoare triple {2030#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2030#true} is VALID [2020-07-17 22:23:47,215 INFO L280 TraceCheckUtils]: 11: Hoare triple {2030#true} assume true; {2030#true} is VALID [2020-07-17 22:23:47,215 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2030#true} {2030#true} #165#return; {2030#true} is VALID [2020-07-17 22:23:47,216 INFO L280 TraceCheckUtils]: 13: Hoare triple {2030#true} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~ret22;havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~mem21.base, #t~mem21.offset; {2030#true} is VALID [2020-07-17 22:23:47,216 INFO L280 TraceCheckUtils]: 14: Hoare triple {2030#true} assume true; {2030#true} is VALID [2020-07-17 22:23:47,216 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2030#true} {2031#false} #139#return; {2031#false} is VALID [2020-07-17 22:23:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:47,220 INFO L280 TraceCheckUtils]: 0: Hoare triple {2030#true} ~cond := #in~cond; {2030#true} is VALID [2020-07-17 22:23:47,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {2030#true} assume !(0 == ~cond); {2030#true} is VALID [2020-07-17 22:23:47,220 INFO L280 TraceCheckUtils]: 2: Hoare triple {2030#true} assume true; {2030#true} is VALID [2020-07-17 22:23:47,221 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2030#true} {2031#false} #141#return; {2031#false} is VALID [2020-07-17 22:23:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:47,238 INFO L280 TraceCheckUtils]: 0: Hoare triple {2102#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2030#true} is VALID [2020-07-17 22:23:47,239 INFO L280 TraceCheckUtils]: 1: Hoare triple {2030#true} assume true; {2030#true} is VALID [2020-07-17 22:23:47,239 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2030#true} {2031#false} #143#return; {2031#false} is VALID [2020-07-17 22:23:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:47,271 INFO L280 TraceCheckUtils]: 0: Hoare triple {2103#(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; {2030#true} is VALID [2020-07-17 22:23:47,271 INFO L280 TraceCheckUtils]: 1: Hoare triple {2030#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2030#true} is VALID [2020-07-17 22:23:47,271 INFO L280 TraceCheckUtils]: 2: Hoare triple {2030#true} assume true; {2030#true} is VALID [2020-07-17 22:23:47,271 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2030#true} {2031#false} #145#return; {2031#false} is VALID [2020-07-17 22:23:47,277 INFO L263 TraceCheckUtils]: 0: Hoare triple {2030#true} call ULTIMATE.init(); {2082#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:23:47,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {2082#(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; {2030#true} is VALID [2020-07-17 22:23:47,277 INFO L280 TraceCheckUtils]: 2: Hoare triple {2030#true} assume true; {2030#true} is VALID [2020-07-17 22:23:47,277 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2030#true} {2030#true} #167#return; {2030#true} is VALID [2020-07-17 22:23:47,278 INFO L263 TraceCheckUtils]: 4: Hoare triple {2030#true} call #t~ret39 := main(); {2030#true} is VALID [2020-07-17 22:23:47,279 INFO L263 TraceCheckUtils]: 5: Hoare triple {2030#true} call #t~ret38.base, #t~ret38.offset := nondet_tree(); {2083#(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-17 22:23:47,281 INFO L280 TraceCheckUtils]: 6: Hoare triple {2083#(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; {2084#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-17 22:23:47,282 INFO L263 TraceCheckUtils]: 7: Hoare triple {2084#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2083#(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-17 22:23:47,282 INFO L280 TraceCheckUtils]: 8: Hoare triple {2083#(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; {2030#true} is VALID [2020-07-17 22:23:47,282 INFO L280 TraceCheckUtils]: 9: Hoare triple {2030#true} assume true; {2030#true} is VALID [2020-07-17 22:23:47,283 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2030#true} {2084#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #133#return; {2084#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-17 22:23:47,284 INFO L280 TraceCheckUtils]: 11: Hoare triple {2084#(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; {2084#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-17 22:23:47,285 INFO L263 TraceCheckUtils]: 12: Hoare triple {2084#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2083#(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-17 22:23:47,285 INFO L280 TraceCheckUtils]: 13: Hoare triple {2083#(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; {2030#true} is VALID [2020-07-17 22:23:47,285 INFO L280 TraceCheckUtils]: 14: Hoare triple {2030#true} assume true; {2030#true} is VALID [2020-07-17 22:23:47,286 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2030#true} {2084#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #135#return; {2084#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-17 22:23:47,287 INFO L280 TraceCheckUtils]: 16: Hoare triple {2084#(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; {2091#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-17 22:23:47,287 INFO L280 TraceCheckUtils]: 17: Hoare triple {2091#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} assume true; {2091#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-17 22:23:47,288 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2091#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} {2030#true} #123#return; {2048#(not (= 0 |main_#t~ret38.base|))} is VALID [2020-07-17 22:23:47,289 INFO L263 TraceCheckUtils]: 19: Hoare triple {2048#(not (= 0 |main_#t~ret38.base|))} call task(#t~ret38.base, #t~ret38.offset); {2049#(not (= |task_#in~t.base| 0))} is VALID [2020-07-17 22:23:47,289 INFO L280 TraceCheckUtils]: 20: Hoare triple {2049#(not (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2050#(not (= 0 task_~t.base))} is VALID [2020-07-17 22:23:47,290 INFO L263 TraceCheckUtils]: 21: Hoare triple {2050#(not (= 0 task_~t.base))} call #t~ret25 := min(~t.base, ~t.offset); {2030#true} is VALID [2020-07-17 22:23:47,290 INFO L280 TraceCheckUtils]: 22: Hoare triple {2030#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2092#(= min_~n.base |min_#in~n.base|)} is VALID [2020-07-17 22:23:47,291 INFO L280 TraceCheckUtils]: 23: Hoare triple {2092#(= min_~n.base |min_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2093#(= 0 |min_#in~n.base|)} is VALID [2020-07-17 22:23:47,291 INFO L280 TraceCheckUtils]: 24: Hoare triple {2093#(= 0 |min_#in~n.base|)} assume true; {2093#(= 0 |min_#in~n.base|)} is VALID [2020-07-17 22:23:47,292 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2093#(= 0 |min_#in~n.base|)} {2050#(not (= 0 task_~t.base))} #137#return; {2031#false} is VALID [2020-07-17 22:23:47,293 INFO L280 TraceCheckUtils]: 26: Hoare triple {2031#false} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;~a~1 := #t~ret25;havoc #t~ret25;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {2031#false} is VALID [2020-07-17 22:23:47,294 INFO L263 TraceCheckUtils]: 27: Hoare triple {2031#false} call #t~ret26 := size(~t.base, ~t.offset); {2030#true} is VALID [2020-07-17 22:23:47,294 INFO L280 TraceCheckUtils]: 28: Hoare triple {2030#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2030#true} is VALID [2020-07-17 22:23:47,294 INFO L280 TraceCheckUtils]: 29: Hoare triple {2030#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2030#true} is VALID [2020-07-17 22:23:47,295 INFO L263 TraceCheckUtils]: 30: Hoare triple {2030#true} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {2030#true} is VALID [2020-07-17 22:23:47,295 INFO L280 TraceCheckUtils]: 31: Hoare triple {2030#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2030#true} is VALID [2020-07-17 22:23:47,295 INFO L280 TraceCheckUtils]: 32: Hoare triple {2030#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2030#true} is VALID [2020-07-17 22:23:47,295 INFO L280 TraceCheckUtils]: 33: Hoare triple {2030#true} assume true; {2030#true} is VALID [2020-07-17 22:23:47,296 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2030#true} {2030#true} #163#return; {2030#true} is VALID [2020-07-17 22:23:47,296 INFO L280 TraceCheckUtils]: 35: Hoare triple {2030#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2030#true} is VALID [2020-07-17 22:23:47,296 INFO L263 TraceCheckUtils]: 36: Hoare triple {2030#true} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {2030#true} is VALID [2020-07-17 22:23:47,296 INFO L280 TraceCheckUtils]: 37: Hoare triple {2030#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2030#true} is VALID [2020-07-17 22:23:47,297 INFO L280 TraceCheckUtils]: 38: Hoare triple {2030#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2030#true} is VALID [2020-07-17 22:23:47,297 INFO L280 TraceCheckUtils]: 39: Hoare triple {2030#true} assume true; {2030#true} is VALID [2020-07-17 22:23:47,297 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2030#true} {2030#true} #165#return; {2030#true} is VALID [2020-07-17 22:23:47,297 INFO L280 TraceCheckUtils]: 41: Hoare triple {2030#true} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~ret22;havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~mem21.base, #t~mem21.offset; {2030#true} is VALID [2020-07-17 22:23:47,297 INFO L280 TraceCheckUtils]: 42: Hoare triple {2030#true} assume true; {2030#true} is VALID [2020-07-17 22:23:47,298 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {2030#true} {2031#false} #139#return; {2031#false} is VALID [2020-07-17 22:23:47,298 INFO L280 TraceCheckUtils]: 44: Hoare triple {2031#false} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;~n~1 := #t~ret26;havoc #t~ret26; {2031#false} is VALID [2020-07-17 22:23:47,298 INFO L263 TraceCheckUtils]: 45: Hoare triple {2031#false} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {2030#true} is VALID [2020-07-17 22:23:47,298 INFO L280 TraceCheckUtils]: 46: Hoare triple {2030#true} ~cond := #in~cond; {2030#true} is VALID [2020-07-17 22:23:47,298 INFO L280 TraceCheckUtils]: 47: Hoare triple {2030#true} assume !(0 == ~cond); {2030#true} is VALID [2020-07-17 22:23:47,299 INFO L280 TraceCheckUtils]: 48: Hoare triple {2030#true} assume true; {2030#true} is VALID [2020-07-17 22:23:47,299 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {2030#true} {2031#false} #141#return; {2031#false} is VALID [2020-07-17 22:23:47,299 INFO L280 TraceCheckUtils]: 50: Hoare triple {2031#false} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(4 * ~n~1); {2031#false} is VALID [2020-07-17 22:23:47,299 INFO L263 TraceCheckUtils]: 51: Hoare triple {2031#false} call #Ultimate.meminit(#t~malloc27.base, #t~malloc27.offset, ~n~1, 4, 4 * ~n~1); {2102#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-17 22:23:47,299 INFO L280 TraceCheckUtils]: 52: Hoare triple {2102#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2030#true} is VALID [2020-07-17 22:23:47,300 INFO L280 TraceCheckUtils]: 53: Hoare triple {2030#true} assume true; {2030#true} is VALID [2020-07-17 22:23:47,300 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {2030#true} {2031#false} #143#return; {2031#false} is VALID [2020-07-17 22:23:47,300 INFO L280 TraceCheckUtils]: 55: Hoare triple {2031#false} ~x~0.base, ~x~0.offset := #t~malloc27.base, #t~malloc27.offset; {2031#false} is VALID [2020-07-17 22:23:47,300 INFO L263 TraceCheckUtils]: 56: Hoare triple {2031#false} call #t~ret28 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {2103#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:23:47,300 INFO L280 TraceCheckUtils]: 57: Hoare triple {2103#(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; {2030#true} is VALID [2020-07-17 22:23:47,301 INFO L280 TraceCheckUtils]: 58: Hoare triple {2030#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2030#true} is VALID [2020-07-17 22:23:47,301 INFO L280 TraceCheckUtils]: 59: Hoare triple {2030#true} assume true; {2030#true} is VALID [2020-07-17 22:23:47,301 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {2030#true} {2031#false} #145#return; {2031#false} is VALID [2020-07-17 22:23:47,301 INFO L280 TraceCheckUtils]: 61: Hoare triple {2031#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;havoc #t~ret28;call #t~mem29 := read~int(~x~0.base, ~x~0.offset, 4); {2031#false} is VALID [2020-07-17 22:23:47,301 INFO L263 TraceCheckUtils]: 62: Hoare triple {2031#false} call __VERIFIER_assert((if ~a~1 == #t~mem29 then 1 else 0)); {2031#false} is VALID [2020-07-17 22:23:47,302 INFO L280 TraceCheckUtils]: 63: Hoare triple {2031#false} ~cond := #in~cond; {2031#false} is VALID [2020-07-17 22:23:47,302 INFO L280 TraceCheckUtils]: 64: Hoare triple {2031#false} assume 0 == ~cond; {2031#false} is VALID [2020-07-17 22:23:47,302 INFO L280 TraceCheckUtils]: 65: Hoare triple {2031#false} assume !false; {2031#false} is VALID [2020-07-17 22:23:47,307 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-17 22:23:47,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429189686] [2020-07-17 22:23:47,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:23:47,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-17 22:23:47,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676401219] [2020-07-17 22:23:47,308 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2020-07-17 22:23:47,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:23:47,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-17 22:23:47,371 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-17 22:23:47,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 22:23:47,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:23:47,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 22:23:47,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:23:47,373 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand 13 states. [2020-07-17 22:23:50,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:50,118 INFO L93 Difference]: Finished difference Result 160 states and 205 transitions. [2020-07-17 22:23:50,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-17 22:23:50,119 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2020-07-17 22:23:50,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:23:50,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:23:50,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 197 transitions. [2020-07-17 22:23:50,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:23:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 197 transitions. [2020-07-17 22:23:50,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 197 transitions. [2020-07-17 22:23:50,459 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-17 22:23:50,462 INFO L225 Difference]: With dead ends: 160 [2020-07-17 22:23:50,463 INFO L226 Difference]: Without dead ends: 96 [2020-07-17 22:23:50,464 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-17 22:23:50,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-17 22:23:50,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2020-07-17 22:23:50,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:23:50,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 93 states. [2020-07-17 22:23:50,535 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 93 states. [2020-07-17 22:23:50,535 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 93 states. [2020-07-17 22:23:50,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:50,541 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2020-07-17 22:23:50,541 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2020-07-17 22:23:50,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:50,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:50,542 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 96 states. [2020-07-17 22:23:50,542 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 96 states. [2020-07-17 22:23:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:50,548 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2020-07-17 22:23:50,548 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2020-07-17 22:23:50,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:50,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:50,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:23:50,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:23:50,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-17 22:23:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2020-07-17 22:23:50,554 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 66 [2020-07-17 22:23:50,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:23:50,554 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2020-07-17 22:23:50,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 22:23:50,554 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2020-07-17 22:23:50,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-17 22:23:50,556 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:23:50,556 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-17 22:23:50,556 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:23:50,556 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:23:50,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:23:50,557 INFO L82 PathProgramCache]: Analyzing trace with hash -505239167, now seen corresponding path program 1 times [2020-07-17 22:23:50,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:23:50,557 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103271879] [2020-07-17 22:23:50,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:23:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:50,667 INFO L280 TraceCheckUtils]: 0: Hoare triple {2733#(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; {2667#true} is VALID [2020-07-17 22:23:50,668 INFO L280 TraceCheckUtils]: 1: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:50,668 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2667#true} {2667#true} #167#return; {2667#true} is VALID [2020-07-17 22:23:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:50,764 INFO L280 TraceCheckUtils]: 0: Hoare triple {2734#(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; {2667#true} is VALID [2020-07-17 22:23:50,765 INFO L280 TraceCheckUtils]: 1: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:50,765 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2667#true} {2735#(= nondet_tree_~n~0.offset 0)} #133#return; {2735#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-17 22:23:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:50,790 INFO L280 TraceCheckUtils]: 0: Hoare triple {2734#(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; {2667#true} is VALID [2020-07-17 22:23:50,791 INFO L280 TraceCheckUtils]: 1: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:50,791 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2667#true} {2735#(= nondet_tree_~n~0.offset 0)} #135#return; {2735#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-17 22:23:50,793 INFO L280 TraceCheckUtils]: 0: Hoare triple {2734#(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; {2735#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-17 22:23:50,794 INFO L263 TraceCheckUtils]: 1: Hoare triple {2735#(= nondet_tree_~n~0.offset 0)} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2734#(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-17 22:23:50,794 INFO L280 TraceCheckUtils]: 2: Hoare triple {2734#(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; {2667#true} is VALID [2020-07-17 22:23:50,794 INFO L280 TraceCheckUtils]: 3: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:50,796 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2667#true} {2735#(= nondet_tree_~n~0.offset 0)} #133#return; {2735#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-17 22:23:50,797 INFO L280 TraceCheckUtils]: 5: Hoare triple {2735#(= 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; {2735#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-17 22:23:50,797 INFO L263 TraceCheckUtils]: 6: Hoare triple {2735#(= nondet_tree_~n~0.offset 0)} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2734#(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-17 22:23:50,798 INFO L280 TraceCheckUtils]: 7: Hoare triple {2734#(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; {2667#true} is VALID [2020-07-17 22:23:50,798 INFO L280 TraceCheckUtils]: 8: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:50,799 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2667#true} {2735#(= nondet_tree_~n~0.offset 0)} #135#return; {2735#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-17 22:23:50,799 INFO L280 TraceCheckUtils]: 10: Hoare triple {2735#(= 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; {2742#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-17 22:23:50,803 INFO L280 TraceCheckUtils]: 11: Hoare triple {2742#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} assume true; {2742#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-17 22:23:50,804 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2742#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} {2667#true} #123#return; {2685#(= 0 |main_#t~ret38.offset|)} is VALID [2020-07-17 22:23:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:50,910 INFO L280 TraceCheckUtils]: 0: Hoare triple {2667#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2667#true} is VALID [2020-07-17 22:23:50,911 INFO L280 TraceCheckUtils]: 1: Hoare triple {2667#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2667#true} is VALID [2020-07-17 22:23:50,911 INFO L280 TraceCheckUtils]: 2: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:50,913 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2667#true} {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #129#return; {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-17 22:23:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:50,923 INFO L280 TraceCheckUtils]: 0: Hoare triple {2667#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2667#true} is VALID [2020-07-17 22:23:50,924 INFO L280 TraceCheckUtils]: 1: Hoare triple {2667#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2667#true} is VALID [2020-07-17 22:23:50,924 INFO L280 TraceCheckUtils]: 2: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:50,925 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2667#true} {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #131#return; {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-17 22:23:50,926 INFO L280 TraceCheckUtils]: 0: Hoare triple {2667#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2743#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} is VALID [2020-07-17 22:23:50,927 INFO L280 TraceCheckUtils]: 1: Hoare triple {2743#(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); {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-17 22:23:50,928 INFO L263 TraceCheckUtils]: 2: Hoare triple {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret7 := min(#t~mem6.base, #t~mem6.offset); {2667#true} is VALID [2020-07-17 22:23:50,928 INFO L280 TraceCheckUtils]: 3: Hoare triple {2667#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2667#true} is VALID [2020-07-17 22:23:50,928 INFO L280 TraceCheckUtils]: 4: Hoare triple {2667#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2667#true} is VALID [2020-07-17 22:23:50,928 INFO L280 TraceCheckUtils]: 5: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:50,929 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {2667#true} {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #129#return; {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-17 22:23:50,930 INFO L280 TraceCheckUtils]: 7: Hoare triple {2744#(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); {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-17 22:23:50,930 INFO L263 TraceCheckUtils]: 8: Hoare triple {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret9 := min(#t~mem8.base, #t~mem8.offset); {2667#true} is VALID [2020-07-17 22:23:50,930 INFO L280 TraceCheckUtils]: 9: Hoare triple {2667#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2667#true} is VALID [2020-07-17 22:23:50,930 INFO L280 TraceCheckUtils]: 10: Hoare triple {2667#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2667#true} is VALID [2020-07-17 22:23:50,931 INFO L280 TraceCheckUtils]: 11: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:50,931 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2667#true} {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #131#return; {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-17 22:23:50,932 INFO L280 TraceCheckUtils]: 13: Hoare triple {2744#(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~mem8.base, #t~mem8.offset;havoc #t~ret9; {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-17 22:23:50,933 INFO L280 TraceCheckUtils]: 14: Hoare triple {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume ~a~0 <= ~b~0;#res := ~a~0; {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-17 22:23:50,946 INFO L280 TraceCheckUtils]: 15: Hoare triple {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume true; {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-17 22:23:50,948 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} {2687#(= 0 task_~t.offset)} #137#return; {2705#(not (= 0 task_~t.base))} is VALID [2020-07-17 22:23:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:50,964 INFO L280 TraceCheckUtils]: 0: Hoare triple {2667#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2667#true} is VALID [2020-07-17 22:23:50,965 INFO L280 TraceCheckUtils]: 1: Hoare triple {2667#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2667#true} is VALID [2020-07-17 22:23:50,965 INFO L280 TraceCheckUtils]: 2: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:50,965 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2667#true} {2667#true} #163#return; {2667#true} is VALID [2020-07-17 22:23:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:50,969 INFO L280 TraceCheckUtils]: 0: Hoare triple {2667#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2667#true} is VALID [2020-07-17 22:23:50,969 INFO L280 TraceCheckUtils]: 1: Hoare triple {2667#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2667#true} is VALID [2020-07-17 22:23:50,970 INFO L280 TraceCheckUtils]: 2: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:50,970 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2667#true} {2667#true} #165#return; {2667#true} is VALID [2020-07-17 22:23:50,970 INFO L280 TraceCheckUtils]: 0: Hoare triple {2667#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2667#true} is VALID [2020-07-17 22:23:50,970 INFO L280 TraceCheckUtils]: 1: Hoare triple {2667#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2667#true} is VALID [2020-07-17 22:23:50,971 INFO L263 TraceCheckUtils]: 2: Hoare triple {2667#true} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {2667#true} is VALID [2020-07-17 22:23:50,971 INFO L280 TraceCheckUtils]: 3: Hoare triple {2667#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2667#true} is VALID [2020-07-17 22:23:50,971 INFO L280 TraceCheckUtils]: 4: Hoare triple {2667#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2667#true} is VALID [2020-07-17 22:23:50,972 INFO L280 TraceCheckUtils]: 5: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:50,972 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {2667#true} {2667#true} #163#return; {2667#true} is VALID [2020-07-17 22:23:50,972 INFO L280 TraceCheckUtils]: 7: Hoare triple {2667#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2667#true} is VALID [2020-07-17 22:23:50,972 INFO L263 TraceCheckUtils]: 8: Hoare triple {2667#true} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {2667#true} is VALID [2020-07-17 22:23:50,973 INFO L280 TraceCheckUtils]: 9: Hoare triple {2667#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2667#true} is VALID [2020-07-17 22:23:50,973 INFO L280 TraceCheckUtils]: 10: Hoare triple {2667#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2667#true} is VALID [2020-07-17 22:23:50,973 INFO L280 TraceCheckUtils]: 11: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:50,973 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2667#true} {2667#true} #165#return; {2667#true} is VALID [2020-07-17 22:23:50,973 INFO L280 TraceCheckUtils]: 13: Hoare triple {2667#true} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~ret22;havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~mem21.base, #t~mem21.offset; {2667#true} is VALID [2020-07-17 22:23:50,974 INFO L280 TraceCheckUtils]: 14: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:50,977 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2667#true} {2705#(not (= 0 task_~t.base))} #139#return; {2705#(not (= 0 task_~t.base))} is VALID [2020-07-17 22:23:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:50,984 INFO L280 TraceCheckUtils]: 0: Hoare triple {2667#true} ~cond := #in~cond; {2667#true} is VALID [2020-07-17 22:23:50,984 INFO L280 TraceCheckUtils]: 1: Hoare triple {2667#true} assume !(0 == ~cond); {2667#true} is VALID [2020-07-17 22:23:50,984 INFO L280 TraceCheckUtils]: 2: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:50,985 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2667#true} {2705#(not (= 0 task_~t.base))} #141#return; {2705#(not (= 0 task_~t.base))} is VALID [2020-07-17 22:23:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:51,017 INFO L280 TraceCheckUtils]: 0: Hoare triple {2761#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2667#true} is VALID [2020-07-17 22:23:51,017 INFO L280 TraceCheckUtils]: 1: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:51,018 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2667#true} {2705#(not (= 0 task_~t.base))} #143#return; {2705#(not (= 0 task_~t.base))} is VALID [2020-07-17 22:23:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:51,079 INFO L280 TraceCheckUtils]: 0: Hoare triple {2762#(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; {2763#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2020-07-17 22:23:51,080 INFO L280 TraceCheckUtils]: 1: Hoare triple {2763#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2764#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-17 22:23:51,081 INFO L280 TraceCheckUtils]: 2: Hoare triple {2764#(= 0 |tree_inorder_#in~t.base|)} assume true; {2764#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-17 22:23:51,082 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2764#(= 0 |tree_inorder_#in~t.base|)} {2705#(not (= 0 task_~t.base))} #145#return; {2668#false} is VALID [2020-07-17 22:23:51,083 INFO L263 TraceCheckUtils]: 0: Hoare triple {2667#true} call ULTIMATE.init(); {2733#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:23:51,083 INFO L280 TraceCheckUtils]: 1: Hoare triple {2733#(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; {2667#true} is VALID [2020-07-17 22:23:51,084 INFO L280 TraceCheckUtils]: 2: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:51,084 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2667#true} {2667#true} #167#return; {2667#true} is VALID [2020-07-17 22:23:51,084 INFO L263 TraceCheckUtils]: 4: Hoare triple {2667#true} call #t~ret39 := main(); {2667#true} is VALID [2020-07-17 22:23:51,085 INFO L263 TraceCheckUtils]: 5: Hoare triple {2667#true} call #t~ret38.base, #t~ret38.offset := nondet_tree(); {2734#(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-17 22:23:51,086 INFO L280 TraceCheckUtils]: 6: Hoare triple {2734#(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; {2735#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-17 22:23:51,087 INFO L263 TraceCheckUtils]: 7: Hoare triple {2735#(= nondet_tree_~n~0.offset 0)} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2734#(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-17 22:23:51,087 INFO L280 TraceCheckUtils]: 8: Hoare triple {2734#(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; {2667#true} is VALID [2020-07-17 22:23:51,088 INFO L280 TraceCheckUtils]: 9: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:51,107 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2667#true} {2735#(= nondet_tree_~n~0.offset 0)} #133#return; {2735#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-17 22:23:51,107 INFO L280 TraceCheckUtils]: 11: Hoare triple {2735#(= 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; {2735#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-17 22:23:51,108 INFO L263 TraceCheckUtils]: 12: Hoare triple {2735#(= nondet_tree_~n~0.offset 0)} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2734#(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-17 22:23:51,108 INFO L280 TraceCheckUtils]: 13: Hoare triple {2734#(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; {2667#true} is VALID [2020-07-17 22:23:51,109 INFO L280 TraceCheckUtils]: 14: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:51,110 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2667#true} {2735#(= nondet_tree_~n~0.offset 0)} #135#return; {2735#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-17 22:23:51,110 INFO L280 TraceCheckUtils]: 16: Hoare triple {2735#(= 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; {2742#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-17 22:23:51,111 INFO L280 TraceCheckUtils]: 17: Hoare triple {2742#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} assume true; {2742#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-17 22:23:51,113 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2742#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} {2667#true} #123#return; {2685#(= 0 |main_#t~ret38.offset|)} is VALID [2020-07-17 22:23:51,114 INFO L263 TraceCheckUtils]: 19: Hoare triple {2685#(= 0 |main_#t~ret38.offset|)} call task(#t~ret38.base, #t~ret38.offset); {2686#(= 0 |task_#in~t.offset|)} is VALID [2020-07-17 22:23:51,115 INFO L280 TraceCheckUtils]: 20: Hoare triple {2686#(= 0 |task_#in~t.offset|)} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2687#(= 0 task_~t.offset)} is VALID [2020-07-17 22:23:51,115 INFO L263 TraceCheckUtils]: 21: Hoare triple {2687#(= 0 task_~t.offset)} call #t~ret25 := min(~t.base, ~t.offset); {2667#true} is VALID [2020-07-17 22:23:51,116 INFO L280 TraceCheckUtils]: 22: Hoare triple {2667#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2743#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} is VALID [2020-07-17 22:23:51,116 INFO L280 TraceCheckUtils]: 23: Hoare triple {2743#(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); {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-17 22:23:51,117 INFO L263 TraceCheckUtils]: 24: Hoare triple {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret7 := min(#t~mem6.base, #t~mem6.offset); {2667#true} is VALID [2020-07-17 22:23:51,117 INFO L280 TraceCheckUtils]: 25: Hoare triple {2667#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2667#true} is VALID [2020-07-17 22:23:51,117 INFO L280 TraceCheckUtils]: 26: Hoare triple {2667#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2667#true} is VALID [2020-07-17 22:23:51,117 INFO L280 TraceCheckUtils]: 27: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:51,118 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2667#true} {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #129#return; {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-17 22:23:51,118 INFO L280 TraceCheckUtils]: 29: Hoare triple {2744#(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); {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-17 22:23:51,119 INFO L263 TraceCheckUtils]: 30: Hoare triple {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret9 := min(#t~mem8.base, #t~mem8.offset); {2667#true} is VALID [2020-07-17 22:23:51,119 INFO L280 TraceCheckUtils]: 31: Hoare triple {2667#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2667#true} is VALID [2020-07-17 22:23:51,119 INFO L280 TraceCheckUtils]: 32: Hoare triple {2667#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2667#true} is VALID [2020-07-17 22:23:51,119 INFO L280 TraceCheckUtils]: 33: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:51,120 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2667#true} {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #131#return; {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-17 22:23:51,120 INFO L280 TraceCheckUtils]: 35: Hoare triple {2744#(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~mem8.base, #t~mem8.offset;havoc #t~ret9; {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-17 22:23:51,121 INFO L280 TraceCheckUtils]: 36: Hoare triple {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume ~a~0 <= ~b~0;#res := ~a~0; {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-17 22:23:51,121 INFO L280 TraceCheckUtils]: 37: Hoare triple {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume true; {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-17 22:23:51,122 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2744#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} {2687#(= 0 task_~t.offset)} #137#return; {2705#(not (= 0 task_~t.base))} is VALID [2020-07-17 22:23:51,123 INFO L280 TraceCheckUtils]: 39: Hoare triple {2705#(not (= 0 task_~t.base))} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;~a~1 := #t~ret25;havoc #t~ret25;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {2705#(not (= 0 task_~t.base))} is VALID [2020-07-17 22:23:51,123 INFO L263 TraceCheckUtils]: 40: Hoare triple {2705#(not (= 0 task_~t.base))} call #t~ret26 := size(~t.base, ~t.offset); {2667#true} is VALID [2020-07-17 22:23:51,123 INFO L280 TraceCheckUtils]: 41: Hoare triple {2667#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2667#true} is VALID [2020-07-17 22:23:51,123 INFO L280 TraceCheckUtils]: 42: Hoare triple {2667#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2667#true} is VALID [2020-07-17 22:23:51,123 INFO L263 TraceCheckUtils]: 43: Hoare triple {2667#true} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {2667#true} is VALID [2020-07-17 22:23:51,124 INFO L280 TraceCheckUtils]: 44: Hoare triple {2667#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2667#true} is VALID [2020-07-17 22:23:51,124 INFO L280 TraceCheckUtils]: 45: Hoare triple {2667#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2667#true} is VALID [2020-07-17 22:23:51,124 INFO L280 TraceCheckUtils]: 46: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:51,124 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2667#true} {2667#true} #163#return; {2667#true} is VALID [2020-07-17 22:23:51,124 INFO L280 TraceCheckUtils]: 48: Hoare triple {2667#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2667#true} is VALID [2020-07-17 22:23:51,124 INFO L263 TraceCheckUtils]: 49: Hoare triple {2667#true} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {2667#true} is VALID [2020-07-17 22:23:51,125 INFO L280 TraceCheckUtils]: 50: Hoare triple {2667#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2667#true} is VALID [2020-07-17 22:23:51,125 INFO L280 TraceCheckUtils]: 51: Hoare triple {2667#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2667#true} is VALID [2020-07-17 22:23:51,125 INFO L280 TraceCheckUtils]: 52: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:51,125 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {2667#true} {2667#true} #165#return; {2667#true} is VALID [2020-07-17 22:23:51,125 INFO L280 TraceCheckUtils]: 54: Hoare triple {2667#true} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~ret22;havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~mem21.base, #t~mem21.offset; {2667#true} is VALID [2020-07-17 22:23:51,125 INFO L280 TraceCheckUtils]: 55: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:51,126 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2667#true} {2705#(not (= 0 task_~t.base))} #139#return; {2705#(not (= 0 task_~t.base))} is VALID [2020-07-17 22:23:51,127 INFO L280 TraceCheckUtils]: 57: Hoare triple {2705#(not (= 0 task_~t.base))} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;~n~1 := #t~ret26;havoc #t~ret26; {2705#(not (= 0 task_~t.base))} is VALID [2020-07-17 22:23:51,127 INFO L263 TraceCheckUtils]: 58: Hoare triple {2705#(not (= 0 task_~t.base))} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {2667#true} is VALID [2020-07-17 22:23:51,127 INFO L280 TraceCheckUtils]: 59: Hoare triple {2667#true} ~cond := #in~cond; {2667#true} is VALID [2020-07-17 22:23:51,127 INFO L280 TraceCheckUtils]: 60: Hoare triple {2667#true} assume !(0 == ~cond); {2667#true} is VALID [2020-07-17 22:23:51,127 INFO L280 TraceCheckUtils]: 61: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:51,128 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2667#true} {2705#(not (= 0 task_~t.base))} #141#return; {2705#(not (= 0 task_~t.base))} is VALID [2020-07-17 22:23:51,128 INFO L280 TraceCheckUtils]: 63: Hoare triple {2705#(not (= 0 task_~t.base))} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(4 * ~n~1); {2705#(not (= 0 task_~t.base))} is VALID [2020-07-17 22:23:51,129 INFO L263 TraceCheckUtils]: 64: Hoare triple {2705#(not (= 0 task_~t.base))} call #Ultimate.meminit(#t~malloc27.base, #t~malloc27.offset, ~n~1, 4, 4 * ~n~1); {2761#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-17 22:23:51,130 INFO L280 TraceCheckUtils]: 65: Hoare triple {2761#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2667#true} is VALID [2020-07-17 22:23:51,130 INFO L280 TraceCheckUtils]: 66: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:51,131 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {2667#true} {2705#(not (= 0 task_~t.base))} #143#return; {2705#(not (= 0 task_~t.base))} is VALID [2020-07-17 22:23:51,131 INFO L280 TraceCheckUtils]: 68: Hoare triple {2705#(not (= 0 task_~t.base))} ~x~0.base, ~x~0.offset := #t~malloc27.base, #t~malloc27.offset; {2705#(not (= 0 task_~t.base))} is VALID [2020-07-17 22:23:51,132 INFO L263 TraceCheckUtils]: 69: Hoare triple {2705#(not (= 0 task_~t.base))} call #t~ret28 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {2762#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:23:51,133 INFO L280 TraceCheckUtils]: 70: Hoare triple {2762#(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; {2763#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2020-07-17 22:23:51,133 INFO L280 TraceCheckUtils]: 71: Hoare triple {2763#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2764#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-17 22:23:51,134 INFO L280 TraceCheckUtils]: 72: Hoare triple {2764#(= 0 |tree_inorder_#in~t.base|)} assume true; {2764#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-17 22:23:51,135 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {2764#(= 0 |tree_inorder_#in~t.base|)} {2705#(not (= 0 task_~t.base))} #145#return; {2668#false} is VALID [2020-07-17 22:23:51,135 INFO L280 TraceCheckUtils]: 74: Hoare triple {2668#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;havoc #t~ret28;call #t~mem29 := read~int(~x~0.base, ~x~0.offset, 4); {2668#false} is VALID [2020-07-17 22:23:51,135 INFO L263 TraceCheckUtils]: 75: Hoare triple {2668#false} call __VERIFIER_assert((if ~a~1 == #t~mem29 then 1 else 0)); {2668#false} is VALID [2020-07-17 22:23:51,136 INFO L280 TraceCheckUtils]: 76: Hoare triple {2668#false} ~cond := #in~cond; {2668#false} is VALID [2020-07-17 22:23:51,136 INFO L280 TraceCheckUtils]: 77: Hoare triple {2668#false} assume 0 == ~cond; {2668#false} is VALID [2020-07-17 22:23:51,136 INFO L280 TraceCheckUtils]: 78: Hoare triple {2668#false} assume !false; {2668#false} is VALID [2020-07-17 22:23:51,143 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-17 22:23:51,144 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103271879] [2020-07-17 22:23:51,144 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455070649] [2020-07-17 22:23:51,144 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-17 22:23:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:51,242 INFO L264 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 39 conjunts are in the unsatisfiable core [2020-07-17 22:23:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:51,280 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:23:51,457 INFO L263 TraceCheckUtils]: 0: Hoare triple {2667#true} call ULTIMATE.init(); {2667#true} is VALID [2020-07-17 22:23:51,458 INFO L280 TraceCheckUtils]: 1: Hoare triple {2667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2667#true} is VALID [2020-07-17 22:23:51,458 INFO L280 TraceCheckUtils]: 2: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:51,458 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2667#true} {2667#true} #167#return; {2667#true} is VALID [2020-07-17 22:23:51,458 INFO L263 TraceCheckUtils]: 4: Hoare triple {2667#true} call #t~ret39 := main(); {2667#true} is VALID [2020-07-17 22:23:51,458 INFO L263 TraceCheckUtils]: 5: Hoare triple {2667#true} call #t~ret38.base, #t~ret38.offset := nondet_tree(); {2667#true} is VALID [2020-07-17 22:23:51,460 INFO L280 TraceCheckUtils]: 6: Hoare triple {2667#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; {2735#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-17 22:23:51,460 INFO L263 TraceCheckUtils]: 7: Hoare triple {2735#(= nondet_tree_~n~0.offset 0)} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2667#true} is VALID [2020-07-17 22:23:51,460 INFO L280 TraceCheckUtils]: 8: Hoare triple {2667#true} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2667#true} is VALID [2020-07-17 22:23:51,460 INFO L280 TraceCheckUtils]: 9: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:51,461 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2667#true} {2735#(= nondet_tree_~n~0.offset 0)} #133#return; {2735#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-17 22:23:51,461 INFO L280 TraceCheckUtils]: 11: Hoare triple {2735#(= 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; {2735#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-17 22:23:51,462 INFO L263 TraceCheckUtils]: 12: Hoare triple {2735#(= nondet_tree_~n~0.offset 0)} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2667#true} is VALID [2020-07-17 22:23:51,462 INFO L280 TraceCheckUtils]: 13: Hoare triple {2667#true} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2667#true} is VALID [2020-07-17 22:23:51,462 INFO L280 TraceCheckUtils]: 14: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:51,462 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2667#true} {2735#(= nondet_tree_~n~0.offset 0)} #135#return; {2735#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-17 22:23:51,463 INFO L280 TraceCheckUtils]: 16: Hoare triple {2735#(= 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; {2742#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-17 22:23:51,464 INFO L280 TraceCheckUtils]: 17: Hoare triple {2742#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} assume true; {2742#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-17 22:23:51,465 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2742#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} {2667#true} #123#return; {2685#(= 0 |main_#t~ret38.offset|)} is VALID [2020-07-17 22:23:51,466 INFO L263 TraceCheckUtils]: 19: Hoare triple {2685#(= 0 |main_#t~ret38.offset|)} call task(#t~ret38.base, #t~ret38.offset); {2686#(= 0 |task_#in~t.offset|)} is VALID [2020-07-17 22:23:51,467 INFO L280 TraceCheckUtils]: 20: Hoare triple {2686#(= 0 |task_#in~t.offset|)} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2687#(= 0 task_~t.offset)} is VALID [2020-07-17 22:23:51,467 INFO L263 TraceCheckUtils]: 21: Hoare triple {2687#(= 0 task_~t.offset)} call #t~ret25 := min(~t.base, ~t.offset); {2667#true} is VALID [2020-07-17 22:23:51,467 INFO L280 TraceCheckUtils]: 22: Hoare triple {2667#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2667#true} is VALID [2020-07-17 22:23:51,467 INFO L280 TraceCheckUtils]: 23: Hoare triple {2667#true} assume !(~n.base == 0 && ~n.offset == 0);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 4); {2667#true} is VALID [2020-07-17 22:23:51,467 INFO L263 TraceCheckUtils]: 24: Hoare triple {2667#true} call #t~ret7 := min(#t~mem6.base, #t~mem6.offset); {2667#true} is VALID [2020-07-17 22:23:51,467 INFO L280 TraceCheckUtils]: 25: Hoare triple {2667#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2667#true} is VALID [2020-07-17 22:23:51,467 INFO L280 TraceCheckUtils]: 26: Hoare triple {2667#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2667#true} is VALID [2020-07-17 22:23:51,468 INFO L280 TraceCheckUtils]: 27: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:51,468 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2667#true} {2667#true} #129#return; {2667#true} is VALID [2020-07-17 22:23:51,468 INFO L280 TraceCheckUtils]: 29: Hoare triple {2667#true} 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); {2667#true} is VALID [2020-07-17 22:23:51,468 INFO L263 TraceCheckUtils]: 30: Hoare triple {2667#true} call #t~ret9 := min(#t~mem8.base, #t~mem8.offset); {2667#true} is VALID [2020-07-17 22:23:51,468 INFO L280 TraceCheckUtils]: 31: Hoare triple {2667#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2667#true} is VALID [2020-07-17 22:23:51,468 INFO L280 TraceCheckUtils]: 32: Hoare triple {2667#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2667#true} is VALID [2020-07-17 22:23:51,468 INFO L280 TraceCheckUtils]: 33: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:51,469 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2667#true} {2667#true} #131#return; {2667#true} is VALID [2020-07-17 22:23:51,469 INFO L280 TraceCheckUtils]: 35: Hoare triple {2667#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~b~0 := #t~ret9;havoc #t~mem8.base, #t~mem8.offset;havoc #t~ret9; {2667#true} is VALID [2020-07-17 22:23:51,469 INFO L280 TraceCheckUtils]: 36: Hoare triple {2667#true} assume ~a~0 <= ~b~0;#res := ~a~0; {2667#true} is VALID [2020-07-17 22:23:51,469 INFO L280 TraceCheckUtils]: 37: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:51,470 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2667#true} {2687#(= 0 task_~t.offset)} #137#return; {2687#(= 0 task_~t.offset)} is VALID [2020-07-17 22:23:51,470 INFO L280 TraceCheckUtils]: 39: Hoare triple {2687#(= 0 task_~t.offset)} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;~a~1 := #t~ret25;havoc #t~ret25;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {2687#(= 0 task_~t.offset)} is VALID [2020-07-17 22:23:51,470 INFO L263 TraceCheckUtils]: 40: Hoare triple {2687#(= 0 task_~t.offset)} call #t~ret26 := size(~t.base, ~t.offset); {2667#true} is VALID [2020-07-17 22:23:51,471 INFO L280 TraceCheckUtils]: 41: Hoare triple {2667#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2891#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} is VALID [2020-07-17 22:23:51,471 INFO L280 TraceCheckUtils]: 42: Hoare triple {2891#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2895#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:51,472 INFO L263 TraceCheckUtils]: 43: Hoare triple {2895#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {2667#true} is VALID [2020-07-17 22:23:51,472 INFO L280 TraceCheckUtils]: 44: Hoare triple {2667#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2667#true} is VALID [2020-07-17 22:23:51,472 INFO L280 TraceCheckUtils]: 45: Hoare triple {2667#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2667#true} is VALID [2020-07-17 22:23:51,472 INFO L280 TraceCheckUtils]: 46: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:51,473 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2667#true} {2895#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #163#return; {2895#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:51,474 INFO L280 TraceCheckUtils]: 48: Hoare triple {2895#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2895#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:51,474 INFO L263 TraceCheckUtils]: 49: Hoare triple {2895#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {2667#true} is VALID [2020-07-17 22:23:51,474 INFO L280 TraceCheckUtils]: 50: Hoare triple {2667#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2667#true} is VALID [2020-07-17 22:23:51,474 INFO L280 TraceCheckUtils]: 51: Hoare triple {2667#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2667#true} is VALID [2020-07-17 22:23:51,474 INFO L280 TraceCheckUtils]: 52: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:51,475 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {2667#true} {2895#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #165#return; {2895#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:51,476 INFO L280 TraceCheckUtils]: 54: Hoare triple {2895#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~ret22;havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~mem21.base, #t~mem21.offset; {2895#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:51,476 INFO L280 TraceCheckUtils]: 55: Hoare triple {2895#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {2895#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-17 22:23:51,477 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2895#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {2687#(= 0 task_~t.offset)} #139#return; {2705#(not (= 0 task_~t.base))} is VALID [2020-07-17 22:23:51,478 INFO L280 TraceCheckUtils]: 57: Hoare triple {2705#(not (= 0 task_~t.base))} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;~n~1 := #t~ret26;havoc #t~ret26; {2705#(not (= 0 task_~t.base))} is VALID [2020-07-17 22:23:51,478 INFO L263 TraceCheckUtils]: 58: Hoare triple {2705#(not (= 0 task_~t.base))} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {2667#true} is VALID [2020-07-17 22:23:51,478 INFO L280 TraceCheckUtils]: 59: Hoare triple {2667#true} ~cond := #in~cond; {2667#true} is VALID [2020-07-17 22:23:51,478 INFO L280 TraceCheckUtils]: 60: Hoare triple {2667#true} assume !(0 == ~cond); {2667#true} is VALID [2020-07-17 22:23:51,478 INFO L280 TraceCheckUtils]: 61: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:51,479 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2667#true} {2705#(not (= 0 task_~t.base))} #141#return; {2705#(not (= 0 task_~t.base))} is VALID [2020-07-17 22:23:51,479 INFO L280 TraceCheckUtils]: 63: Hoare triple {2705#(not (= 0 task_~t.base))} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(4 * ~n~1); {2705#(not (= 0 task_~t.base))} is VALID [2020-07-17 22:23:51,480 INFO L263 TraceCheckUtils]: 64: Hoare triple {2705#(not (= 0 task_~t.base))} call #Ultimate.meminit(#t~malloc27.base, #t~malloc27.offset, ~n~1, 4, 4 * ~n~1); {2667#true} is VALID [2020-07-17 22:23:51,480 INFO L280 TraceCheckUtils]: 65: Hoare triple {2667#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2667#true} is VALID [2020-07-17 22:23:51,480 INFO L280 TraceCheckUtils]: 66: Hoare triple {2667#true} assume true; {2667#true} is VALID [2020-07-17 22:23:51,481 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {2667#true} {2705#(not (= 0 task_~t.base))} #143#return; {2705#(not (= 0 task_~t.base))} is VALID [2020-07-17 22:23:51,481 INFO L280 TraceCheckUtils]: 68: Hoare triple {2705#(not (= 0 task_~t.base))} ~x~0.base, ~x~0.offset := #t~malloc27.base, #t~malloc27.offset; {2705#(not (= 0 task_~t.base))} is VALID [2020-07-17 22:23:51,481 INFO L263 TraceCheckUtils]: 69: Hoare triple {2705#(not (= 0 task_~t.base))} call #t~ret28 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {2667#true} is VALID [2020-07-17 22:23:51,482 INFO L280 TraceCheckUtils]: 70: Hoare triple {2667#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2763#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2020-07-17 22:23:51,483 INFO L280 TraceCheckUtils]: 71: Hoare triple {2763#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2764#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-17 22:23:51,483 INFO L280 TraceCheckUtils]: 72: Hoare triple {2764#(= 0 |tree_inorder_#in~t.base|)} assume true; {2764#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-17 22:23:51,484 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {2764#(= 0 |tree_inorder_#in~t.base|)} {2705#(not (= 0 task_~t.base))} #145#return; {2668#false} is VALID [2020-07-17 22:23:51,484 INFO L280 TraceCheckUtils]: 74: Hoare triple {2668#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;havoc #t~ret28;call #t~mem29 := read~int(~x~0.base, ~x~0.offset, 4); {2668#false} is VALID [2020-07-17 22:23:51,485 INFO L263 TraceCheckUtils]: 75: Hoare triple {2668#false} call __VERIFIER_assert((if ~a~1 == #t~mem29 then 1 else 0)); {2668#false} is VALID [2020-07-17 22:23:51,485 INFO L280 TraceCheckUtils]: 76: Hoare triple {2668#false} ~cond := #in~cond; {2668#false} is VALID [2020-07-17 22:23:51,485 INFO L280 TraceCheckUtils]: 77: Hoare triple {2668#false} assume 0 == ~cond; {2668#false} is VALID [2020-07-17 22:23:51,485 INFO L280 TraceCheckUtils]: 78: Hoare triple {2668#false} assume !false; {2668#false} is VALID [2020-07-17 22:23:51,491 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-17 22:23:51,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:23:51,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 18 [2020-07-17 22:23:51,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135558354] [2020-07-17 22:23:51,492 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 79 [2020-07-17 22:23:51,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:23:51,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-17 22:23:51,611 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:23:51,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-17 22:23:51,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:23:51,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-17 22:23:51,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2020-07-17 22:23:51,613 INFO L87 Difference]: Start difference. First operand 93 states and 118 transitions. Second operand 18 states. [2020-07-17 22:23:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:56,432 INFO L93 Difference]: Finished difference Result 150 states and 192 transitions. [2020-07-17 22:23:56,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-17 22:23:56,432 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 79 [2020-07-17 22:23:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:23:56,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-17 22:23:56,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 188 transitions. [2020-07-17 22:23:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-17 22:23:56,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 188 transitions. [2020-07-17 22:23:56,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 188 transitions. [2020-07-17 22:23:56,771 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:23:56,778 INFO L225 Difference]: With dead ends: 150 [2020-07-17 22:23:56,778 INFO L226 Difference]: Without dead ends: 98 [2020-07-17 22:23:56,779 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=954, Unknown=0, NotChecked=0, Total=1122 [2020-07-17 22:23:56,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-17 22:23:56,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2020-07-17 22:23:56,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:23:56,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 97 states. [2020-07-17 22:23:56,883 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 97 states. [2020-07-17 22:23:56,883 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 97 states. [2020-07-17 22:23:56,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:56,888 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2020-07-17 22:23:56,888 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 123 transitions. [2020-07-17 22:23:56,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:56,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:56,889 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 98 states. [2020-07-17 22:23:56,889 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 98 states. [2020-07-17 22:23:56,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:56,894 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2020-07-17 22:23:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 123 transitions. [2020-07-17 22:23:56,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:56,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:56,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:23:56,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:23:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-17 22:23:56,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 122 transitions. [2020-07-17 22:23:56,900 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 122 transitions. Word has length 79 [2020-07-17 22:23:56,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:23:56,901 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 122 transitions. [2020-07-17 22:23:56,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-17 22:23:56,901 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 122 transitions. [2020-07-17 22:23:56,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-17 22:23:56,902 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:23:56,902 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-17 22:23:57,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:23:57,116 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:23:57,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:23:57,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1062270604, now seen corresponding path program 1 times [2020-07-17 22:23:57,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:23:57,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191275787] [2020-07-17 22:23:57,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:23:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:23:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:23:57,319 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:23:57,320 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:23:57,320 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:23:57,431 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:23:57,432 WARN L170 areAnnotationChecker]: minENTRY has no Hoare annotation [2020-07-17 22:23:57,432 WARN L170 areAnnotationChecker]: taskENTRY has no Hoare annotation [2020-07-17 22:23:57,432 WARN L170 areAnnotationChecker]: sizeENTRY has no Hoare annotation [2020-07-17 22:23:57,432 WARN L170 areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation [2020-07-17 22:23:57,432 WARN L170 areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation [2020-07-17 22:23:57,432 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:23:57,432 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:23:57,432 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:23:57,433 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:23:57,433 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:23:57,433 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:23:57,433 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2020-07-17 22:23:57,433 WARN L170 areAnnotationChecker]: tree_inorderENTRY has no Hoare annotation [2020-07-17 22:23:57,433 WARN L170 areAnnotationChecker]: tree_delENTRY has no Hoare annotation [2020-07-17 22:23:57,433 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:23:57,433 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-17 22:23:57,433 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-17 22:23:57,434 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-17 22:23:57,434 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-17 22:23:57,434 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2020-07-17 22:23:57,434 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2020-07-17 22:23:57,434 WARN L170 areAnnotationChecker]: nondet_treeFINAL has no Hoare annotation [2020-07-17 22:23:57,434 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-17 22:23:57,434 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-17 22:23:57,434 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:23:57,434 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:23:57,435 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-17 22:23:57,435 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-17 22:23:57,435 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2020-07-17 22:23:57,435 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2020-07-17 22:23:57,435 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:23:57,435 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:23:57,435 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2020-07-17 22:23:57,435 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-17 22:23:57,435 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-17 22:23:57,435 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-17 22:23:57,436 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-17 22:23:57,436 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:23:57,436 WARN L170 areAnnotationChecker]: minFINAL has no Hoare annotation [2020-07-17 22:23:57,436 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:23:57,436 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:23:57,436 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2020-07-17 22:23:57,436 WARN L170 areAnnotationChecker]: sizeFINAL has no Hoare annotation [2020-07-17 22:23:57,436 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-17 22:23:57,436 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-17 22:23:57,436 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2020-07-17 22:23:57,437 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2020-07-17 22:23:57,437 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2020-07-17 22:23:57,437 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2020-07-17 22:23:57,437 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:23:57,437 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2020-07-17 22:23:57,437 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2020-07-17 22:23:57,437 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-17 22:23:57,437 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-17 22:23:57,437 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2020-07-17 22:23:57,437 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2020-07-17 22:23:57,438 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2020-07-17 22:23:57,438 WARN L170 areAnnotationChecker]: tree_inorderFINAL has no Hoare annotation [2020-07-17 22:23:57,438 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-17 22:23:57,438 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-17 22:23:57,438 WARN L170 areAnnotationChecker]: tree_delFINAL has no Hoare annotation [2020-07-17 22:23:57,438 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-17 22:23:57,438 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-17 22:23:57,439 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2020-07-17 22:23:57,439 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2020-07-17 22:23:57,439 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2020-07-17 22:23:57,439 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-17 22:23:57,439 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2020-07-17 22:23:57,439 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2020-07-17 22:23:57,439 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2020-07-17 22:23:57,439 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2020-07-17 22:23:57,439 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2020-07-17 22:23:57,440 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2020-07-17 22:23:57,440 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2020-07-17 22:23:57,440 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-17 22:23:57,440 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-17 22:23:57,440 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-17 22:23:57,440 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:23:57,440 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:23:57,440 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:23:57,440 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:23:57,440 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:23:57,441 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:23:57,441 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2020-07-17 22:23:57,441 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2020-07-17 22:23:57,441 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2020-07-17 22:23:57,441 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2020-07-17 22:23:57,441 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2020-07-17 22:23:57,441 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2020-07-17 22:23:57,441 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2020-07-17 22:23:57,441 WARN L170 areAnnotationChecker]: tree_delEXIT has no Hoare annotation [2020-07-17 22:23:57,441 WARN L170 areAnnotationChecker]: tree_delEXIT has no Hoare annotation [2020-07-17 22:23:57,442 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2020-07-17 22:23:57,442 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-17 22:23:57,442 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-17 22:23:57,442 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-17 22:23:57,442 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2020-07-17 22:23:57,442 WARN L170 areAnnotationChecker]: L85-1 has no Hoare annotation [2020-07-17 22:23:57,442 WARN L170 areAnnotationChecker]: L70-3 has no Hoare annotation [2020-07-17 22:23:57,442 WARN L170 areAnnotationChecker]: L70-2 has no Hoare annotation [2020-07-17 22:23:57,442 WARN L170 areAnnotationChecker]: L70-2 has no Hoare annotation [2020-07-17 22:23:57,442 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2020-07-17 22:23:57,443 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:23:57,443 WARN L170 areAnnotationChecker]: L81-1 has no Hoare annotation [2020-07-17 22:23:57,443 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2020-07-17 22:23:57,443 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2020-07-17 22:23:57,443 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2020-07-17 22:23:57,443 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2020-07-17 22:23:57,443 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2020-07-17 22:23:57,443 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2020-07-17 22:23:57,443 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2020-07-17 22:23:57,443 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2020-07-17 22:23:57,443 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2020-07-17 22:23:57,444 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2020-07-17 22:23:57,444 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2020-07-17 22:23:57,444 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2020-07-17 22:23:57,444 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2020-07-17 22:23:57,444 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-17 22:23:57,444 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-17 22:23:57,444 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2020-07-17 22:23:57,444 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2020-07-17 22:23:57,444 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-17 22:23:57,444 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-17 22:23:57,445 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2020-07-17 22:23:57,445 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2020-07-17 22:23:57,445 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2020-07-17 22:23:57,445 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2020-07-17 22:23:57,445 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-17 22:23:57,445 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-17 22:23:57,445 WARN L170 areAnnotationChecker]: L91-3 has no Hoare annotation [2020-07-17 22:23:57,445 WARN L170 areAnnotationChecker]: L91-3 has no Hoare annotation [2020-07-17 22:23:57,445 WARN L170 areAnnotationChecker]: L91-3 has no Hoare annotation [2020-07-17 22:23:57,445 WARN L170 areAnnotationChecker]: L91-2 has no Hoare annotation [2020-07-17 22:23:57,445 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2020-07-17 22:23:57,446 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2020-07-17 22:23:57,446 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2020-07-17 22:23:57,446 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2020-07-17 22:23:57,446 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2020-07-17 22:23:57,446 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2020-07-17 22:23:57,446 WARN L170 areAnnotationChecker]: L91-4 has no Hoare annotation [2020-07-17 22:23:57,446 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2020-07-17 22:23:57,446 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2020-07-17 22:23:57,446 WARN L170 areAnnotationChecker]: taskFINAL has no Hoare annotation [2020-07-17 22:23:57,446 WARN L170 areAnnotationChecker]: taskEXIT has no Hoare annotation [2020-07-17 22:23:57,447 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-17 22:23:57,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:23:57 BoogieIcfgContainer [2020-07-17 22:23:57,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:23:57,455 INFO L168 Benchmark]: Toolchain (without parser) took 21919.84 ms. Allocated memory was 137.9 MB in the beginning and 446.2 MB in the end (delta: 308.3 MB). Free memory was 102.5 MB in the beginning and 352.1 MB in the end (delta: -249.6 MB). Peak memory consumption was 58.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:23:57,459 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:23:57,461 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.60 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 102.1 MB in the beginning and 180.0 MB in the end (delta: -77.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:23:57,461 INFO L168 Benchmark]: Boogie Preprocessor took 65.13 ms. Allocated memory is still 201.9 MB. Free memory was 180.0 MB in the beginning and 176.0 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:23:57,461 INFO L168 Benchmark]: RCFGBuilder took 868.59 ms. Allocated memory is still 201.9 MB. Free memory was 176.0 MB in the beginning and 117.6 MB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:23:57,462 INFO L168 Benchmark]: TraceAbstraction took 20596.35 ms. Allocated memory was 201.9 MB in the beginning and 446.2 MB in the end (delta: 244.3 MB). Free memory was 116.9 MB in the beginning and 352.1 MB in the end (delta: -235.1 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:23:57,469 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.24 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 382.60 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 102.1 MB in the beginning and 180.0 MB in the end (delta: -77.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.13 ms. Allocated memory is still 201.9 MB. Free memory was 180.0 MB in the beginning and 176.0 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 868.59 ms. Allocated memory is still 201.9 MB. Free memory was 176.0 MB in the beginning and 117.6 MB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20596.35 ms. Allocated memory was 201.9 MB in the beginning and 446.2 MB in the end (delta: 244.3 MB). Free memory was 116.9 MB in the beginning and 352.1 MB in the end (delta: -235.1 MB). Peak memory consumption was 9.2 MB. 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: [L96] 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}] [L96] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L96] CALL task(nondet_tree()) VAL [t={-1:0}] [L74] 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}] [L74] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L74] int a = min(t); [L75] int b; VAL [a=2147483647, b={2:0}, t={-1:0}, t={-1:0}] [L77] CALL, EXPR size(t) VAL [t={-1:0}] [L69] COND FALSE !(!t) [L70] EXPR t->left VAL [t={-1:0}, t={-1:0}, t->left={0:0}] [L70] CALL, EXPR size(t->left) VAL [t={0:0}] [L69] COND TRUE !t [L69] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L70] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}] [L70] EXPR t->right VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L70] CALL, EXPR size(t->right) VAL [t={0:0}] [L69] COND TRUE !t [L69] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L70] 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}] [L70] return size(t->left) + size(t->right) + 1; [L77] RET, EXPR size(t) VAL [a=2147483647, b={2:0}, size(t)=1, t={-1:0}, t={-1:0}] [L77] int n = size(t); [L78] CALL assume_abort_if_not(n != 0) VAL [\old(cond)=1] [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L78] RET assume_abort_if_not(n != 0) VAL [a=2147483647, b={2:0}, n=1, t={-1:0}, t={-1:0}] [L79] 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}] [L79] 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}] [L80] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L58] COND FALSE !(!t) [L61] 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}] [L61] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L58] COND TRUE !t [L59] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L61] 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] [L61] i = tree_inorder(t->left, a, i) [L62] EXPR i++ [L62] EXPR t->data [L62] a[i++] = t->data [L63] 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}] [L63] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L58] COND TRUE !t [L59] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L63] 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] [L63] i = tree_inorder(t->right, a, i) [L64] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L80] 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}] [L81] 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] [L81] 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, 95 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.3s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 16.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 426 SDtfs, 638 SDslu, 1680 SDs, 0 SdLazy, 2306 SolverSat, 653 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 213 SyntacticMatches, 4 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 5 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 515 NumberOfCodeBlocks, 515 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 417 ConstructedInterpolants, 0 QuantifiedInterpolants, 74882 SizeOfPredicates, 16 NumberOfNonLiveVariables, 630 ConjunctsInSsa, 64 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...