/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.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:00:52,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:00:52,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:00:52,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:00:52,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:00:52,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:00:52,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:00:52,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:00:52,409 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:00:52,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:00:52,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:00:52,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:00:52,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:00:52,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:00:52,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:00:52,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:00:52,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:00:52,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:00:52,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:00:52,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:00:52,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:00:52,422 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:00:52,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:00:52,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:00:52,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:00:52,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:00:52,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:00:52,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:00:52,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:00:52,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:00:52,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:00:52,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:00:52,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:00:52,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:00:52,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:00:52,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:00:52,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:00:52,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:00:52,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:00:52,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:00:52,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:00:52,446 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-10 15:00:52,465 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:00:52,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:00:52,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:00:52,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:00:52,468 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:00:52,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:00:52,469 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:00:52,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:00:52,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:00:52,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:00:52,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:00:52,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:00:52,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:00:52,471 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:00:52,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:00:52,471 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:00:52,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:00:52,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:00:52,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:00:52,472 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:00:52,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:00:52,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:00:52,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:00:52,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:00:52,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:00:52,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:00:52,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:00:52,474 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:00:52,474 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:00:52,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:00:52,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:00:52,810 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:00:52,813 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:00:52,815 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:00:52,815 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:00:52,816 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_rec.c [2020-07-10 15:00:52,896 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d69a78f7/a0a1ad16ebae455aa2ec471dd7b1a0ee/FLAG74761cf0c [2020-07-10 15:00:53,350 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:00:53,351 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec.c [2020-07-10 15:00:53,357 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d69a78f7/a0a1ad16ebae455aa2ec471dd7b1a0ee/FLAG74761cf0c [2020-07-10 15:00:53,745 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d69a78f7/a0a1ad16ebae455aa2ec471dd7b1a0ee [2020-07-10 15:00:53,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:00:53,754 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:00:53,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:00:53,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:00:53,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:00:53,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:00:53" (1/1) ... [2020-07-10 15:00:53,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce54b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:00:53, skipping insertion in model container [2020-07-10 15:00:53,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:00:53" (1/1) ... [2020-07-10 15:00:53,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:00:53,792 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:00:53,972 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-10 15:00:53,975 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-10 15:00:53,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:00:54,009 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:00:54,123 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-10 15:00:54,126 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-10 15:00:54,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:00:54,180 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:00:54,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:00:54 WrapperNode [2020-07-10 15:00:54,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:00:54,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:00:54,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:00:54,182 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:00:54,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:00:54" (1/1) ... [2020-07-10 15:00:54,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:00:54" (1/1) ... [2020-07-10 15:00:54,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:00:54" (1/1) ... [2020-07-10 15:00:54,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:00:54" (1/1) ... [2020-07-10 15:00:54,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:00:54" (1/1) ... [2020-07-10 15:00:54,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:00:54" (1/1) ... [2020-07-10 15:00:54,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:00:54" (1/1) ... [2020-07-10 15:00:54,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:00:54,249 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:00:54,249 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:00:54,249 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:00:54,250 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:00:54" (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-10 15:00:54,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:00:54,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:00:54,306 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2020-07-10 15:00:54,306 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:00:54,307 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-07-10 15:00:54,307 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-07-10 15:00:54,307 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-07-10 15:00:54,307 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-07-10 15:00:54,307 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-07-10 15:00:54,307 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-07-10 15:00:54,308 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:00:54,308 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-10 15:00:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 15:00:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:00:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 15:00:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:00:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-10 15:00:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2020-07-10 15:00:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:00:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:00:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-07-10 15:00:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:00:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:00:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 15:00:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-07-10 15:00:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:00:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 15:00:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-07-10 15:00:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:00:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-07-10 15:00:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-07-10 15:00:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-07-10 15:00:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:00:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-10 15:00:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:00:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:00:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:00:55,039 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:00:55,040 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 15:00:55,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:00:55 BoogieIcfgContainer [2020-07-10 15:00:55,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:00:55,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:00:55,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:00:55,050 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:00:55,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:00:53" (1/3) ... [2020-07-10 15:00:55,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33796358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:00:55, skipping insertion in model container [2020-07-10 15:00:55,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:00:54" (2/3) ... [2020-07-10 15:00:55,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33796358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:00:55, skipping insertion in model container [2020-07-10 15:00:55,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:00:55" (3/3) ... [2020-07-10 15:00:55,053 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_del_rec.c [2020-07-10 15:00:55,063 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:00:55,069 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:00:55,079 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:00:55,102 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:00:55,102 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:00:55,102 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:00:55,102 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:00:55,103 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:00:55,103 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:00:55,103 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:00:55,103 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:00:55,124 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2020-07-10 15:00:55,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-10 15:00:55,134 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:00:55,135 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-10 15:00:55,135 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:00:55,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:00:55,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1057238675, now seen corresponding path program 1 times [2020-07-10 15:00:55,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:00:55,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183188595] [2020-07-10 15:00:55,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:00:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:55,531 INFO L280 TraceCheckUtils]: 0: Hoare triple {129#(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; {100#true} is VALID [2020-07-10 15:00:55,531 INFO L280 TraceCheckUtils]: 1: Hoare triple {100#true} assume true; {100#true} is VALID [2020-07-10 15:00:55,532 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {100#true} {100#true} #183#return; {100#true} is VALID [2020-07-10 15:00:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:55,571 INFO L280 TraceCheckUtils]: 0: Hoare triple {130#(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; {100#true} is VALID [2020-07-10 15:00:55,571 INFO L280 TraceCheckUtils]: 1: Hoare triple {100#true} assume true; {100#true} is VALID [2020-07-10 15:00:55,572 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {100#true} {100#true} #139#return; {100#true} is VALID [2020-07-10 15:00:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:55,579 INFO L280 TraceCheckUtils]: 0: Hoare triple {100#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {100#true} is VALID [2020-07-10 15:00:55,579 INFO L280 TraceCheckUtils]: 1: Hoare triple {100#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {100#true} is VALID [2020-07-10 15:00:55,580 INFO L280 TraceCheckUtils]: 2: Hoare triple {100#true} assume true; {100#true} is VALID [2020-07-10 15:00:55,580 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {100#true} {100#true} #153#return; {100#true} is VALID [2020-07-10 15:00:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:55,633 INFO L280 TraceCheckUtils]: 0: Hoare triple {100#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {100#true} is VALID [2020-07-10 15:00:55,635 INFO L280 TraceCheckUtils]: 1: Hoare triple {100#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {131#(= 0 |size_#res|)} is VALID [2020-07-10 15:00:55,640 INFO L280 TraceCheckUtils]: 2: Hoare triple {131#(= 0 |size_#res|)} assume true; {131#(= 0 |size_#res|)} is VALID [2020-07-10 15:00:55,643 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {131#(= 0 |size_#res|)} {100#true} #155#return; {116#(= 0 |task_#t~ret27|)} is VALID [2020-07-10 15:00:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:55,692 INFO L280 TraceCheckUtils]: 0: Hoare triple {100#true} ~cond := #in~cond; {132#(= assume_cycle_if_not_~cond |assume_cycle_if_not_#in~cond|)} is VALID [2020-07-10 15:00:55,694 INFO L280 TraceCheckUtils]: 1: Hoare triple {132#(= assume_cycle_if_not_~cond |assume_cycle_if_not_#in~cond|)} assume !(0 == ~cond); {133#(not (= 0 |assume_cycle_if_not_#in~cond|))} is VALID [2020-07-10 15:00:55,694 INFO L280 TraceCheckUtils]: 2: Hoare triple {133#(not (= 0 |assume_cycle_if_not_#in~cond|))} assume true; {133#(not (= 0 |assume_cycle_if_not_#in~cond|))} is VALID [2020-07-10 15:00:55,696 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {133#(not (= 0 |assume_cycle_if_not_#in~cond|))} {117#(= 0 task_~n~1)} #157#return; {101#false} is VALID [2020-07-10 15:00:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:55,723 INFO L280 TraceCheckUtils]: 0: Hoare triple {134#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {100#true} is VALID [2020-07-10 15:00:55,724 INFO L280 TraceCheckUtils]: 1: Hoare triple {100#true} assume true; {100#true} is VALID [2020-07-10 15:00:55,724 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {100#true} {101#false} #159#return; {101#false} is VALID [2020-07-10 15:00:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:55,754 INFO L280 TraceCheckUtils]: 0: Hoare triple {135#(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; {100#true} is VALID [2020-07-10 15:00:55,755 INFO L280 TraceCheckUtils]: 1: Hoare triple {100#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {100#true} is VALID [2020-07-10 15:00:55,755 INFO L280 TraceCheckUtils]: 2: Hoare triple {100#true} assume true; {100#true} is VALID [2020-07-10 15:00:55,755 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {100#true} {101#false} #161#return; {101#false} is VALID [2020-07-10 15:00:55,757 INFO L263 TraceCheckUtils]: 0: Hoare triple {100#true} call ULTIMATE.init(); {129#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:00:55,757 INFO L280 TraceCheckUtils]: 1: Hoare triple {129#(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; {100#true} is VALID [2020-07-10 15:00:55,757 INFO L280 TraceCheckUtils]: 2: Hoare triple {100#true} assume true; {100#true} is VALID [2020-07-10 15:00:55,758 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {100#true} {100#true} #183#return; {100#true} is VALID [2020-07-10 15:00:55,758 INFO L263 TraceCheckUtils]: 4: Hoare triple {100#true} call #t~ret40 := main(); {100#true} is VALID [2020-07-10 15:00:55,759 INFO L263 TraceCheckUtils]: 5: Hoare triple {100#true} call #t~ret39.base, #t~ret39.offset := nondet_tree(); {130#(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-10 15:00:55,760 INFO L280 TraceCheckUtils]: 6: Hoare triple {130#(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; {100#true} is VALID [2020-07-10 15:00:55,760 INFO L280 TraceCheckUtils]: 7: Hoare triple {100#true} assume true; {100#true} is VALID [2020-07-10 15:00:55,760 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {100#true} {100#true} #139#return; {100#true} is VALID [2020-07-10 15:00:55,761 INFO L263 TraceCheckUtils]: 9: Hoare triple {100#true} call task(#t~ret39.base, #t~ret39.offset); {100#true} is VALID [2020-07-10 15:00:55,761 INFO L280 TraceCheckUtils]: 10: Hoare triple {100#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {100#true} is VALID [2020-07-10 15:00:55,761 INFO L263 TraceCheckUtils]: 11: Hoare triple {100#true} call #t~ret26 := min(~t.base, ~t.offset); {100#true} is VALID [2020-07-10 15:00:55,762 INFO L280 TraceCheckUtils]: 12: Hoare triple {100#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {100#true} is VALID [2020-07-10 15:00:55,762 INFO L280 TraceCheckUtils]: 13: Hoare triple {100#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {100#true} is VALID [2020-07-10 15:00:55,762 INFO L280 TraceCheckUtils]: 14: Hoare triple {100#true} assume true; {100#true} is VALID [2020-07-10 15:00:55,763 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {100#true} {100#true} #153#return; {100#true} is VALID [2020-07-10 15:00:55,763 INFO L280 TraceCheckUtils]: 16: Hoare triple {100#true} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;~a~1 := #t~ret26;havoc #t~ret26;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {100#true} is VALID [2020-07-10 15:00:55,764 INFO L263 TraceCheckUtils]: 17: Hoare triple {100#true} call #t~ret27 := size(~t.base, ~t.offset); {100#true} is VALID [2020-07-10 15:00:55,764 INFO L280 TraceCheckUtils]: 18: Hoare triple {100#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {100#true} is VALID [2020-07-10 15:00:55,765 INFO L280 TraceCheckUtils]: 19: Hoare triple {100#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {131#(= 0 |size_#res|)} is VALID [2020-07-10 15:00:55,766 INFO L280 TraceCheckUtils]: 20: Hoare triple {131#(= 0 |size_#res|)} assume true; {131#(= 0 |size_#res|)} is VALID [2020-07-10 15:00:55,767 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {131#(= 0 |size_#res|)} {100#true} #155#return; {116#(= 0 |task_#t~ret27|)} is VALID [2020-07-10 15:00:55,768 INFO L280 TraceCheckUtils]: 22: Hoare triple {116#(= 0 |task_#t~ret27|)} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;~n~1 := #t~ret27;havoc #t~ret27; {117#(= 0 task_~n~1)} is VALID [2020-07-10 15:00:55,768 INFO L263 TraceCheckUtils]: 23: Hoare triple {117#(= 0 task_~n~1)} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {100#true} is VALID [2020-07-10 15:00:55,769 INFO L280 TraceCheckUtils]: 24: Hoare triple {100#true} ~cond := #in~cond; {132#(= assume_cycle_if_not_~cond |assume_cycle_if_not_#in~cond|)} is VALID [2020-07-10 15:00:55,770 INFO L280 TraceCheckUtils]: 25: Hoare triple {132#(= assume_cycle_if_not_~cond |assume_cycle_if_not_#in~cond|)} assume !(0 == ~cond); {133#(not (= 0 |assume_cycle_if_not_#in~cond|))} is VALID [2020-07-10 15:00:55,771 INFO L280 TraceCheckUtils]: 26: Hoare triple {133#(not (= 0 |assume_cycle_if_not_#in~cond|))} assume true; {133#(not (= 0 |assume_cycle_if_not_#in~cond|))} is VALID [2020-07-10 15:00:55,772 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {133#(not (= 0 |assume_cycle_if_not_#in~cond|))} {117#(= 0 task_~n~1)} #157#return; {101#false} is VALID [2020-07-10 15:00:55,772 INFO L280 TraceCheckUtils]: 28: Hoare triple {101#false} call #t~malloc28.base, #t~malloc28.offset := #Ultimate.allocOnHeap(4 * ~n~1); {101#false} is VALID [2020-07-10 15:00:55,773 INFO L263 TraceCheckUtils]: 29: Hoare triple {101#false} call #Ultimate.meminit(#t~malloc28.base, #t~malloc28.offset, ~n~1, 4, 4 * ~n~1); {134#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:00:55,773 INFO L280 TraceCheckUtils]: 30: Hoare triple {134#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {100#true} is VALID [2020-07-10 15:00:55,773 INFO L280 TraceCheckUtils]: 31: Hoare triple {100#true} assume true; {100#true} is VALID [2020-07-10 15:00:55,774 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {100#true} {101#false} #159#return; {101#false} is VALID [2020-07-10 15:00:55,774 INFO L280 TraceCheckUtils]: 33: Hoare triple {101#false} ~x~0.base, ~x~0.offset := #t~malloc28.base, #t~malloc28.offset; {101#false} is VALID [2020-07-10 15:00:55,774 INFO L263 TraceCheckUtils]: 34: Hoare triple {101#false} call #t~ret29 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {135#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:00:55,775 INFO L280 TraceCheckUtils]: 35: Hoare triple {135#(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; {100#true} is VALID [2020-07-10 15:00:55,775 INFO L280 TraceCheckUtils]: 36: Hoare triple {100#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {100#true} is VALID [2020-07-10 15:00:55,775 INFO L280 TraceCheckUtils]: 37: Hoare triple {100#true} assume true; {100#true} is VALID [2020-07-10 15:00:55,776 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {100#true} {101#false} #161#return; {101#false} is VALID [2020-07-10 15:00:55,776 INFO L280 TraceCheckUtils]: 39: Hoare triple {101#false} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;havoc #t~ret29;call #t~mem30 := read~int(~x~0.base, ~x~0.offset, 4); {101#false} is VALID [2020-07-10 15:00:55,776 INFO L263 TraceCheckUtils]: 40: Hoare triple {101#false} call __VERIFIER_assert((if ~a~1 == #t~mem30 then 1 else 0)); {101#false} is VALID [2020-07-10 15:00:55,777 INFO L280 TraceCheckUtils]: 41: Hoare triple {101#false} ~cond := #in~cond; {101#false} is VALID [2020-07-10 15:00:55,777 INFO L280 TraceCheckUtils]: 42: Hoare triple {101#false} assume 0 == ~cond; {101#false} is VALID [2020-07-10 15:00:55,777 INFO L280 TraceCheckUtils]: 43: Hoare triple {101#false} assume !false; {101#false} is VALID [2020-07-10 15:00:55,784 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-10 15:00:55,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183188595] [2020-07-10 15:00:55,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:00:55,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 15:00:55,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546491443] [2020-07-10 15:00:55,793 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2020-07-10 15:00:55,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:00:55,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:00:55,868 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-10 15:00:55,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:00:55,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:00:55,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:00:55,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:00:55,880 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 11 states. [2020-07-10 15:00:58,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:00:58,560 INFO L93 Difference]: Finished difference Result 171 states and 229 transitions. [2020-07-10 15:00:58,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:00:58,560 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2020-07-10 15:00:58,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:00:58,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:00:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 229 transitions. [2020-07-10 15:00:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:00:58,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 229 transitions. [2020-07-10 15:00:58,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 229 transitions. [2020-07-10 15:00:58,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:00:59,007 INFO L225 Difference]: With dead ends: 171 [2020-07-10 15:00:59,007 INFO L226 Difference]: Without dead ends: 96 [2020-07-10 15:00:59,017 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2020-07-10 15:00:59,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-10 15:00:59,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2020-07-10 15:00:59,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:00:59,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 90 states. [2020-07-10 15:00:59,131 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 90 states. [2020-07-10 15:00:59,131 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 90 states. [2020-07-10 15:00:59,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:00:59,143 INFO L93 Difference]: Finished difference Result 96 states and 125 transitions. [2020-07-10 15:00:59,144 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2020-07-10 15:00:59,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:00:59,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:00:59,147 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 96 states. [2020-07-10 15:00:59,148 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 96 states. [2020-07-10 15:00:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:00:59,158 INFO L93 Difference]: Finished difference Result 96 states and 125 transitions. [2020-07-10 15:00:59,158 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2020-07-10 15:00:59,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:00:59,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:00:59,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:00:59,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:00:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-10 15:00:59,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2020-07-10 15:00:59,170 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 44 [2020-07-10 15:00:59,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:00:59,171 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2020-07-10 15:00:59,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:00:59,171 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2020-07-10 15:00:59,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-10 15:00:59,174 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:00:59,174 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-10 15:00:59,174 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:00:59,175 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:00:59,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:00:59,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1861604494, now seen corresponding path program 1 times [2020-07-10 15:00:59,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:00:59,176 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670516557] [2020-07-10 15:00:59,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:00:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:59,322 INFO L280 TraceCheckUtils]: 0: Hoare triple {744#(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; {702#true} is VALID [2020-07-10 15:00:59,322 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 15:00:59,322 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {702#true} {702#true} #183#return; {702#true} is VALID [2020-07-10 15:00:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:59,387 INFO L280 TraceCheckUtils]: 0: Hoare triple {745#(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; {746#(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-10 15:00:59,388 INFO L280 TraceCheckUtils]: 1: Hoare triple {746#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {746#(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-10 15:00:59,390 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {746#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {702#true} #139#return; {710#(and (= 0 |main_#t~ret39.base|) (= 0 |main_#t~ret39.offset|))} is VALID [2020-07-10 15:00:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:59,405 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {702#true} is VALID [2020-07-10 15:00:59,406 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {702#true} is VALID [2020-07-10 15:00:59,406 INFO L280 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 15:00:59,407 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {702#true} {712#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #153#return; {712#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-10 15:00:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:59,488 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {702#true} is VALID [2020-07-10 15:00:59,488 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {702#true} is VALID [2020-07-10 15:00:59,488 INFO L280 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 15:00:59,490 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {702#true} {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #179#return; {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:00:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:59,495 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {702#true} is VALID [2020-07-10 15:00:59,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {702#true} is VALID [2020-07-10 15:00:59,496 INFO L280 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 15:00:59,498 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {702#true} {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #181#return; {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:00:59,498 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {747#(and (or (= 0 size_~t.offset) (= |size_#in~t.offset| size_~t.offset)) (= |size_#in~t.base| size_~t.base))} is VALID [2020-07-10 15:00:59,500 INFO L280 TraceCheckUtils]: 1: Hoare triple {747#(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~mem22.base, #t~mem22.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:00:59,500 INFO L263 TraceCheckUtils]: 2: Hoare triple {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret23 := size(#t~mem22.base, #t~mem22.offset); {702#true} is VALID [2020-07-10 15:00:59,500 INFO L280 TraceCheckUtils]: 3: Hoare triple {702#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {702#true} is VALID [2020-07-10 15:00:59,501 INFO L280 TraceCheckUtils]: 4: Hoare triple {702#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {702#true} is VALID [2020-07-10 15:00:59,501 INFO L280 TraceCheckUtils]: 5: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 15:00:59,502 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {702#true} {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #179#return; {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:00:59,503 INFO L280 TraceCheckUtils]: 7: Hoare triple {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret23 && #t~ret23 <= 2147483647;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:00:59,503 INFO L263 TraceCheckUtils]: 8: Hoare triple {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret25 := size(#t~mem24.base, #t~mem24.offset); {702#true} is VALID [2020-07-10 15:00:59,503 INFO L280 TraceCheckUtils]: 9: Hoare triple {702#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {702#true} is VALID [2020-07-10 15:00:59,504 INFO L280 TraceCheckUtils]: 10: Hoare triple {702#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {702#true} is VALID [2020-07-10 15:00:59,504 INFO L280 TraceCheckUtils]: 11: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 15:00:59,505 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {702#true} {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #181#return; {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:00:59,506 INFO L280 TraceCheckUtils]: 13: Hoare triple {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;#res := 1 + (#t~ret23 + #t~ret25);havoc #t~mem22.base, #t~mem22.offset;havoc #t~ret25;havoc #t~ret23;havoc #t~mem24.base, #t~mem24.offset; {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:00:59,507 INFO L280 TraceCheckUtils]: 14: Hoare triple {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:00:59,508 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {712#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #155#return; {703#false} is VALID [2020-07-10 15:00:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:59,514 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} ~cond := #in~cond; {702#true} is VALID [2020-07-10 15:00:59,514 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} assume !(0 == ~cond); {702#true} is VALID [2020-07-10 15:00:59,515 INFO L280 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 15:00:59,515 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {702#true} {703#false} #157#return; {703#false} is VALID [2020-07-10 15:00:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:59,537 INFO L280 TraceCheckUtils]: 0: Hoare triple {757#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {702#true} is VALID [2020-07-10 15:00:59,537 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 15:00:59,537 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {702#true} {703#false} #159#return; {703#false} is VALID [2020-07-10 15:00:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:59,566 INFO L280 TraceCheckUtils]: 0: Hoare triple {758#(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; {702#true} is VALID [2020-07-10 15:00:59,566 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {702#true} is VALID [2020-07-10 15:00:59,567 INFO L280 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 15:00:59,567 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {702#true} {703#false} #161#return; {703#false} is VALID [2020-07-10 15:00:59,568 INFO L263 TraceCheckUtils]: 0: Hoare triple {702#true} call ULTIMATE.init(); {744#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:00:59,569 INFO L280 TraceCheckUtils]: 1: Hoare triple {744#(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; {702#true} is VALID [2020-07-10 15:00:59,569 INFO L280 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 15:00:59,569 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {702#true} {702#true} #183#return; {702#true} is VALID [2020-07-10 15:00:59,570 INFO L263 TraceCheckUtils]: 4: Hoare triple {702#true} call #t~ret40 := main(); {702#true} is VALID [2020-07-10 15:00:59,571 INFO L263 TraceCheckUtils]: 5: Hoare triple {702#true} call #t~ret39.base, #t~ret39.offset := nondet_tree(); {745#(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-10 15:00:59,572 INFO L280 TraceCheckUtils]: 6: Hoare triple {745#(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; {746#(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-10 15:00:59,573 INFO L280 TraceCheckUtils]: 7: Hoare triple {746#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {746#(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-10 15:00:59,574 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {746#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {702#true} #139#return; {710#(and (= 0 |main_#t~ret39.base|) (= 0 |main_#t~ret39.offset|))} is VALID [2020-07-10 15:00:59,575 INFO L263 TraceCheckUtils]: 9: Hoare triple {710#(and (= 0 |main_#t~ret39.base|) (= 0 |main_#t~ret39.offset|))} call task(#t~ret39.base, #t~ret39.offset); {711#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} is VALID [2020-07-10 15:00:59,576 INFO L280 TraceCheckUtils]: 10: Hoare triple {711#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {712#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-10 15:00:59,576 INFO L263 TraceCheckUtils]: 11: Hoare triple {712#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret26 := min(~t.base, ~t.offset); {702#true} is VALID [2020-07-10 15:00:59,577 INFO L280 TraceCheckUtils]: 12: Hoare triple {702#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {702#true} is VALID [2020-07-10 15:00:59,577 INFO L280 TraceCheckUtils]: 13: Hoare triple {702#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {702#true} is VALID [2020-07-10 15:00:59,577 INFO L280 TraceCheckUtils]: 14: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 15:00:59,579 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {702#true} {712#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #153#return; {712#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-10 15:00:59,580 INFO L280 TraceCheckUtils]: 16: Hoare triple {712#(and (= 0 task_~t.offset) (= 0 task_~t.base))} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;~a~1 := #t~ret26;havoc #t~ret26;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {712#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-10 15:00:59,580 INFO L263 TraceCheckUtils]: 17: Hoare triple {712#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret27 := size(~t.base, ~t.offset); {702#true} is VALID [2020-07-10 15:00:59,581 INFO L280 TraceCheckUtils]: 18: Hoare triple {702#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {747#(and (or (= 0 size_~t.offset) (= |size_#in~t.offset| size_~t.offset)) (= |size_#in~t.base| size_~t.base))} is VALID [2020-07-10 15:00:59,582 INFO L280 TraceCheckUtils]: 19: Hoare triple {747#(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~mem22.base, #t~mem22.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:00:59,582 INFO L263 TraceCheckUtils]: 20: Hoare triple {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret23 := size(#t~mem22.base, #t~mem22.offset); {702#true} is VALID [2020-07-10 15:00:59,582 INFO L280 TraceCheckUtils]: 21: Hoare triple {702#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {702#true} is VALID [2020-07-10 15:00:59,583 INFO L280 TraceCheckUtils]: 22: Hoare triple {702#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {702#true} is VALID [2020-07-10 15:00:59,583 INFO L280 TraceCheckUtils]: 23: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 15:00:59,584 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {702#true} {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #179#return; {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:00:59,585 INFO L280 TraceCheckUtils]: 25: Hoare triple {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret23 && #t~ret23 <= 2147483647;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:00:59,585 INFO L263 TraceCheckUtils]: 26: Hoare triple {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret25 := size(#t~mem24.base, #t~mem24.offset); {702#true} is VALID [2020-07-10 15:00:59,599 INFO L280 TraceCheckUtils]: 27: Hoare triple {702#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {702#true} is VALID [2020-07-10 15:00:59,600 INFO L280 TraceCheckUtils]: 28: Hoare triple {702#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {702#true} is VALID [2020-07-10 15:00:59,600 INFO L280 TraceCheckUtils]: 29: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 15:00:59,611 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {702#true} {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #181#return; {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:00:59,611 INFO L280 TraceCheckUtils]: 31: Hoare triple {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;#res := 1 + (#t~ret23 + #t~ret25);havoc #t~mem22.base, #t~mem22.offset;havoc #t~ret25;havoc #t~ret23;havoc #t~mem24.base, #t~mem24.offset; {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:00:59,612 INFO L280 TraceCheckUtils]: 32: Hoare triple {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:00:59,613 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {712#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #155#return; {703#false} is VALID [2020-07-10 15:00:59,613 INFO L280 TraceCheckUtils]: 34: Hoare triple {703#false} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;~n~1 := #t~ret27;havoc #t~ret27; {703#false} is VALID [2020-07-10 15:00:59,613 INFO L263 TraceCheckUtils]: 35: Hoare triple {703#false} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {702#true} is VALID [2020-07-10 15:00:59,613 INFO L280 TraceCheckUtils]: 36: Hoare triple {702#true} ~cond := #in~cond; {702#true} is VALID [2020-07-10 15:00:59,614 INFO L280 TraceCheckUtils]: 37: Hoare triple {702#true} assume !(0 == ~cond); {702#true} is VALID [2020-07-10 15:00:59,614 INFO L280 TraceCheckUtils]: 38: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 15:00:59,614 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {702#true} {703#false} #157#return; {703#false} is VALID [2020-07-10 15:00:59,614 INFO L280 TraceCheckUtils]: 40: Hoare triple {703#false} call #t~malloc28.base, #t~malloc28.offset := #Ultimate.allocOnHeap(4 * ~n~1); {703#false} is VALID [2020-07-10 15:00:59,614 INFO L263 TraceCheckUtils]: 41: Hoare triple {703#false} call #Ultimate.meminit(#t~malloc28.base, #t~malloc28.offset, ~n~1, 4, 4 * ~n~1); {757#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:00:59,614 INFO L280 TraceCheckUtils]: 42: Hoare triple {757#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {702#true} is VALID [2020-07-10 15:00:59,615 INFO L280 TraceCheckUtils]: 43: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 15:00:59,615 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {702#true} {703#false} #159#return; {703#false} is VALID [2020-07-10 15:00:59,615 INFO L280 TraceCheckUtils]: 45: Hoare triple {703#false} ~x~0.base, ~x~0.offset := #t~malloc28.base, #t~malloc28.offset; {703#false} is VALID [2020-07-10 15:00:59,615 INFO L263 TraceCheckUtils]: 46: Hoare triple {703#false} call #t~ret29 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {758#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:00:59,615 INFO L280 TraceCheckUtils]: 47: Hoare triple {758#(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; {702#true} is VALID [2020-07-10 15:00:59,616 INFO L280 TraceCheckUtils]: 48: Hoare triple {702#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {702#true} is VALID [2020-07-10 15:00:59,616 INFO L280 TraceCheckUtils]: 49: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 15:00:59,616 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {702#true} {703#false} #161#return; {703#false} is VALID [2020-07-10 15:00:59,616 INFO L280 TraceCheckUtils]: 51: Hoare triple {703#false} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;havoc #t~ret29;call #t~mem30 := read~int(~x~0.base, ~x~0.offset, 4); {703#false} is VALID [2020-07-10 15:00:59,617 INFO L263 TraceCheckUtils]: 52: Hoare triple {703#false} call __VERIFIER_assert((if ~a~1 == #t~mem30 then 1 else 0)); {703#false} is VALID [2020-07-10 15:00:59,617 INFO L280 TraceCheckUtils]: 53: Hoare triple {703#false} ~cond := #in~cond; {703#false} is VALID [2020-07-10 15:00:59,617 INFO L280 TraceCheckUtils]: 54: Hoare triple {703#false} assume 0 == ~cond; {703#false} is VALID [2020-07-10 15:00:59,617 INFO L280 TraceCheckUtils]: 55: Hoare triple {703#false} assume !false; {703#false} is VALID [2020-07-10 15:00:59,623 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-10 15:00:59,624 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670516557] [2020-07-10 15:00:59,624 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540340348] [2020-07-10 15:00:59,624 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-10 15:00:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:59,704 INFO L264 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 25 conjunts are in the unsatisfiable core [2020-07-10 15:00:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:59,742 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:00:59,907 INFO L263 TraceCheckUtils]: 0: Hoare triple {702#true} call ULTIMATE.init(); {702#true} is VALID [2020-07-10 15:00:59,908 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {702#true} is VALID [2020-07-10 15:00:59,908 INFO L280 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 15:00:59,908 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {702#true} {702#true} #183#return; {702#true} is VALID [2020-07-10 15:00:59,909 INFO L263 TraceCheckUtils]: 4: Hoare triple {702#true} call #t~ret40 := main(); {702#true} is VALID [2020-07-10 15:00:59,909 INFO L263 TraceCheckUtils]: 5: Hoare triple {702#true} call #t~ret39.base, #t~ret39.offset := nondet_tree(); {702#true} is VALID [2020-07-10 15:00:59,910 INFO L280 TraceCheckUtils]: 6: Hoare triple {702#true} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {746#(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-10 15:00:59,910 INFO L280 TraceCheckUtils]: 7: Hoare triple {746#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {746#(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-10 15:00:59,911 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {746#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {702#true} #139#return; {710#(and (= 0 |main_#t~ret39.base|) (= 0 |main_#t~ret39.offset|))} is VALID [2020-07-10 15:00:59,915 INFO L263 TraceCheckUtils]: 9: Hoare triple {710#(and (= 0 |main_#t~ret39.base|) (= 0 |main_#t~ret39.offset|))} call task(#t~ret39.base, #t~ret39.offset); {711#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} is VALID [2020-07-10 15:00:59,916 INFO L280 TraceCheckUtils]: 10: Hoare triple {711#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {712#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-10 15:00:59,916 INFO L263 TraceCheckUtils]: 11: Hoare triple {712#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret26 := min(~t.base, ~t.offset); {702#true} is VALID [2020-07-10 15:00:59,916 INFO L280 TraceCheckUtils]: 12: Hoare triple {702#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {702#true} is VALID [2020-07-10 15:00:59,917 INFO L280 TraceCheckUtils]: 13: Hoare triple {702#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {702#true} is VALID [2020-07-10 15:00:59,917 INFO L280 TraceCheckUtils]: 14: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 15:00:59,918 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {702#true} {712#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #153#return; {712#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-10 15:00:59,919 INFO L280 TraceCheckUtils]: 16: Hoare triple {712#(and (= 0 task_~t.offset) (= 0 task_~t.base))} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;~a~1 := #t~ret26;havoc #t~ret26;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {712#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-10 15:00:59,919 INFO L263 TraceCheckUtils]: 17: Hoare triple {712#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret27 := size(~t.base, ~t.offset); {702#true} is VALID [2020-07-10 15:00:59,919 INFO L280 TraceCheckUtils]: 18: Hoare triple {702#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {816#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} is VALID [2020-07-10 15:00:59,920 INFO L280 TraceCheckUtils]: 19: Hoare triple {816#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:00:59,921 INFO L263 TraceCheckUtils]: 20: Hoare triple {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret23 := size(#t~mem22.base, #t~mem22.offset); {702#true} is VALID [2020-07-10 15:00:59,921 INFO L280 TraceCheckUtils]: 21: Hoare triple {702#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {702#true} is VALID [2020-07-10 15:00:59,921 INFO L280 TraceCheckUtils]: 22: Hoare triple {702#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {702#true} is VALID [2020-07-10 15:00:59,922 INFO L280 TraceCheckUtils]: 23: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 15:00:59,925 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {702#true} {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #179#return; {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:00:59,925 INFO L280 TraceCheckUtils]: 25: Hoare triple {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret23 && #t~ret23 <= 2147483647;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:00:59,925 INFO L263 TraceCheckUtils]: 26: Hoare triple {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret25 := size(#t~mem24.base, #t~mem24.offset); {702#true} is VALID [2020-07-10 15:00:59,926 INFO L280 TraceCheckUtils]: 27: Hoare triple {702#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {702#true} is VALID [2020-07-10 15:00:59,926 INFO L280 TraceCheckUtils]: 28: Hoare triple {702#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {702#true} is VALID [2020-07-10 15:00:59,926 INFO L280 TraceCheckUtils]: 29: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 15:00:59,927 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {702#true} {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #181#return; {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:00:59,927 INFO L280 TraceCheckUtils]: 31: Hoare triple {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;#res := 1 + (#t~ret23 + #t~ret25);havoc #t~mem22.base, #t~mem22.offset;havoc #t~ret25;havoc #t~ret23;havoc #t~mem24.base, #t~mem24.offset; {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:00:59,928 INFO L280 TraceCheckUtils]: 32: Hoare triple {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:00:59,928 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {748#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {712#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #155#return; {703#false} is VALID [2020-07-10 15:00:59,929 INFO L280 TraceCheckUtils]: 34: Hoare triple {703#false} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;~n~1 := #t~ret27;havoc #t~ret27; {703#false} is VALID [2020-07-10 15:00:59,929 INFO L263 TraceCheckUtils]: 35: Hoare triple {703#false} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {703#false} is VALID [2020-07-10 15:00:59,929 INFO L280 TraceCheckUtils]: 36: Hoare triple {703#false} ~cond := #in~cond; {703#false} is VALID [2020-07-10 15:00:59,929 INFO L280 TraceCheckUtils]: 37: Hoare triple {703#false} assume !(0 == ~cond); {703#false} is VALID [2020-07-10 15:00:59,929 INFO L280 TraceCheckUtils]: 38: Hoare triple {703#false} assume true; {703#false} is VALID [2020-07-10 15:00:59,930 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {703#false} {703#false} #157#return; {703#false} is VALID [2020-07-10 15:00:59,930 INFO L280 TraceCheckUtils]: 40: Hoare triple {703#false} call #t~malloc28.base, #t~malloc28.offset := #Ultimate.allocOnHeap(4 * ~n~1); {703#false} is VALID [2020-07-10 15:00:59,930 INFO L263 TraceCheckUtils]: 41: Hoare triple {703#false} call #Ultimate.meminit(#t~malloc28.base, #t~malloc28.offset, ~n~1, 4, 4 * ~n~1); {703#false} is VALID [2020-07-10 15:00:59,930 INFO L280 TraceCheckUtils]: 42: Hoare triple {703#false} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {703#false} is VALID [2020-07-10 15:00:59,930 INFO L280 TraceCheckUtils]: 43: Hoare triple {703#false} assume true; {703#false} is VALID [2020-07-10 15:00:59,931 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {703#false} {703#false} #159#return; {703#false} is VALID [2020-07-10 15:00:59,931 INFO L280 TraceCheckUtils]: 45: Hoare triple {703#false} ~x~0.base, ~x~0.offset := #t~malloc28.base, #t~malloc28.offset; {703#false} is VALID [2020-07-10 15:00:59,931 INFO L263 TraceCheckUtils]: 46: Hoare triple {703#false} call #t~ret29 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {703#false} is VALID [2020-07-10 15:00:59,931 INFO L280 TraceCheckUtils]: 47: Hoare triple {703#false} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {703#false} is VALID [2020-07-10 15:00:59,932 INFO L280 TraceCheckUtils]: 48: Hoare triple {703#false} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {703#false} is VALID [2020-07-10 15:00:59,932 INFO L280 TraceCheckUtils]: 49: Hoare triple {703#false} assume true; {703#false} is VALID [2020-07-10 15:00:59,932 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {703#false} {703#false} #161#return; {703#false} is VALID [2020-07-10 15:00:59,932 INFO L280 TraceCheckUtils]: 51: Hoare triple {703#false} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;havoc #t~ret29;call #t~mem30 := read~int(~x~0.base, ~x~0.offset, 4); {703#false} is VALID [2020-07-10 15:00:59,932 INFO L263 TraceCheckUtils]: 52: Hoare triple {703#false} call __VERIFIER_assert((if ~a~1 == #t~mem30 then 1 else 0)); {703#false} is VALID [2020-07-10 15:00:59,933 INFO L280 TraceCheckUtils]: 53: Hoare triple {703#false} ~cond := #in~cond; {703#false} is VALID [2020-07-10 15:00:59,933 INFO L280 TraceCheckUtils]: 54: Hoare triple {703#false} assume 0 == ~cond; {703#false} is VALID [2020-07-10 15:00:59,933 INFO L280 TraceCheckUtils]: 55: Hoare triple {703#false} assume !false; {703#false} is VALID [2020-07-10 15:00:59,937 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-10 15:00:59,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:00:59,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 13 [2020-07-10 15:00:59,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271062448] [2020-07-10 15:00:59,940 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2020-07-10 15:00:59,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:00:59,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 15:01:00,015 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-10 15:01:00,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 15:01:00,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:01:00,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 15:01:00,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:01:00,017 INFO L87 Difference]: Start difference. First operand 90 states and 114 transitions. Second operand 13 states. [2020-07-10 15:01:03,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:03,279 INFO L93 Difference]: Finished difference Result 162 states and 208 transitions. [2020-07-10 15:01:03,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 15:01:03,279 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2020-07-10 15:01:03,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:01:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:01:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 204 transitions. [2020-07-10 15:01:03,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:01:03,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 204 transitions. [2020-07-10 15:01:03,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 204 transitions. [2020-07-10 15:01:03,606 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:03,612 INFO L225 Difference]: With dead ends: 162 [2020-07-10 15:01:03,612 INFO L226 Difference]: Without dead ends: 95 [2020-07-10 15:01:03,615 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-10 15:01:03,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-10 15:01:03,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2020-07-10 15:01:03,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:01:03,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 92 states. [2020-07-10 15:01:03,675 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 92 states. [2020-07-10 15:01:03,675 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 92 states. [2020-07-10 15:01:03,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:03,683 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2020-07-10 15:01:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2020-07-10 15:01:03,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:03,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:03,685 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 95 states. [2020-07-10 15:01:03,685 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 95 states. [2020-07-10 15:01:03,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:03,693 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2020-07-10 15:01:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2020-07-10 15:01:03,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:03,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:03,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:01:03,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:01:03,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-07-10 15:01:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 117 transitions. [2020-07-10 15:01:03,701 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 117 transitions. Word has length 56 [2020-07-10 15:01:03,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:01:03,701 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 117 transitions. [2020-07-10 15:01:03,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 15:01:03,701 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 117 transitions. [2020-07-10 15:01:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-10 15:01:03,703 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:01:03,704 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-10 15:01:03,919 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:01:03,919 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:01:03,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:01:03,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1883823467, now seen corresponding path program 1 times [2020-07-10 15:01:03,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:01:03,921 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645153642] [2020-07-10 15:01:03,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:01:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:04,045 INFO L280 TraceCheckUtils]: 0: Hoare triple {1542#(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; {1490#true} is VALID [2020-07-10 15:01:04,045 INFO L280 TraceCheckUtils]: 1: Hoare triple {1490#true} assume true; {1490#true} is VALID [2020-07-10 15:01:04,046 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1490#true} {1490#true} #183#return; {1490#true} is VALID [2020-07-10 15:01:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:04,182 INFO L280 TraceCheckUtils]: 0: Hoare triple {1543#(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; {1490#true} is VALID [2020-07-10 15:01:04,182 INFO L280 TraceCheckUtils]: 1: Hoare triple {1490#true} assume true; {1490#true} is VALID [2020-07-10 15:01:04,183 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1490#true} {1544#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #149#return; {1544#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-10 15:01:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:04,190 INFO L280 TraceCheckUtils]: 0: Hoare triple {1543#(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; {1490#true} is VALID [2020-07-10 15:01:04,191 INFO L280 TraceCheckUtils]: 1: Hoare triple {1490#true} assume true; {1490#true} is VALID [2020-07-10 15:01:04,192 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1490#true} {1544#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #151#return; {1544#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-10 15:01:04,194 INFO L280 TraceCheckUtils]: 0: Hoare triple {1543#(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; {1544#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-10 15:01:04,196 INFO L263 TraceCheckUtils]: 1: Hoare triple {1544#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {1543#(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-10 15:01:04,196 INFO L280 TraceCheckUtils]: 2: Hoare triple {1543#(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; {1490#true} is VALID [2020-07-10 15:01:04,197 INFO L280 TraceCheckUtils]: 3: Hoare triple {1490#true} assume true; {1490#true} is VALID [2020-07-10 15:01:04,198 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1490#true} {1544#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #149#return; {1544#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-10 15:01:04,199 INFO L280 TraceCheckUtils]: 5: Hoare triple {1544#(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; {1544#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-10 15:01:04,200 INFO L263 TraceCheckUtils]: 6: Hoare triple {1544#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {1543#(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-10 15:01:04,200 INFO L280 TraceCheckUtils]: 7: Hoare triple {1543#(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; {1490#true} is VALID [2020-07-10 15:01:04,200 INFO L280 TraceCheckUtils]: 8: Hoare triple {1490#true} assume true; {1490#true} is VALID [2020-07-10 15:01:04,201 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1490#true} {1544#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #151#return; {1544#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-10 15:01:04,202 INFO L280 TraceCheckUtils]: 10: Hoare triple {1544#(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; {1551#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-10 15:01:04,203 INFO L280 TraceCheckUtils]: 11: Hoare triple {1551#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} assume true; {1551#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-10 15:01:04,204 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1551#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} {1490#true} #139#return; {1508#(not (= 0 |main_#t~ret39.base|))} is VALID [2020-07-10 15:01:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:04,242 INFO L280 TraceCheckUtils]: 0: Hoare triple {1490#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1552#(= min_~n.base |min_#in~n.base|)} is VALID [2020-07-10 15:01:04,243 INFO L280 TraceCheckUtils]: 1: Hoare triple {1552#(= min_~n.base |min_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1553#(= 0 |min_#in~n.base|)} is VALID [2020-07-10 15:01:04,244 INFO L280 TraceCheckUtils]: 2: Hoare triple {1553#(= 0 |min_#in~n.base|)} assume true; {1553#(= 0 |min_#in~n.base|)} is VALID [2020-07-10 15:01:04,245 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1553#(= 0 |min_#in~n.base|)} {1510#(not (= 0 task_~t.base))} #153#return; {1491#false} is VALID [2020-07-10 15:01:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:04,258 INFO L280 TraceCheckUtils]: 0: Hoare triple {1490#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1490#true} is VALID [2020-07-10 15:01:04,258 INFO L280 TraceCheckUtils]: 1: Hoare triple {1490#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1490#true} is VALID [2020-07-10 15:01:04,258 INFO L280 TraceCheckUtils]: 2: Hoare triple {1490#true} assume true; {1490#true} is VALID [2020-07-10 15:01:04,259 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1490#true} {1490#true} #179#return; {1490#true} is VALID [2020-07-10 15:01:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:04,262 INFO L280 TraceCheckUtils]: 0: Hoare triple {1490#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1490#true} is VALID [2020-07-10 15:01:04,263 INFO L280 TraceCheckUtils]: 1: Hoare triple {1490#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1490#true} is VALID [2020-07-10 15:01:04,263 INFO L280 TraceCheckUtils]: 2: Hoare triple {1490#true} assume true; {1490#true} is VALID [2020-07-10 15:01:04,263 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1490#true} {1490#true} #181#return; {1490#true} is VALID [2020-07-10 15:01:04,263 INFO L280 TraceCheckUtils]: 0: Hoare triple {1490#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1490#true} is VALID [2020-07-10 15:01:04,264 INFO L280 TraceCheckUtils]: 1: Hoare triple {1490#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {1490#true} is VALID [2020-07-10 15:01:04,264 INFO L263 TraceCheckUtils]: 2: Hoare triple {1490#true} call #t~ret23 := size(#t~mem22.base, #t~mem22.offset); {1490#true} is VALID [2020-07-10 15:01:04,264 INFO L280 TraceCheckUtils]: 3: Hoare triple {1490#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1490#true} is VALID [2020-07-10 15:01:04,264 INFO L280 TraceCheckUtils]: 4: Hoare triple {1490#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1490#true} is VALID [2020-07-10 15:01:04,265 INFO L280 TraceCheckUtils]: 5: Hoare triple {1490#true} assume true; {1490#true} is VALID [2020-07-10 15:01:04,265 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1490#true} {1490#true} #179#return; {1490#true} is VALID [2020-07-10 15:01:04,265 INFO L280 TraceCheckUtils]: 7: Hoare triple {1490#true} assume -2147483648 <= #t~ret23 && #t~ret23 <= 2147483647;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {1490#true} is VALID [2020-07-10 15:01:04,266 INFO L263 TraceCheckUtils]: 8: Hoare triple {1490#true} call #t~ret25 := size(#t~mem24.base, #t~mem24.offset); {1490#true} is VALID [2020-07-10 15:01:04,266 INFO L280 TraceCheckUtils]: 9: Hoare triple {1490#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1490#true} is VALID [2020-07-10 15:01:04,266 INFO L280 TraceCheckUtils]: 10: Hoare triple {1490#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1490#true} is VALID [2020-07-10 15:01:04,267 INFO L280 TraceCheckUtils]: 11: Hoare triple {1490#true} assume true; {1490#true} is VALID [2020-07-10 15:01:04,267 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1490#true} {1490#true} #181#return; {1490#true} is VALID [2020-07-10 15:01:04,267 INFO L280 TraceCheckUtils]: 13: Hoare triple {1490#true} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;#res := 1 + (#t~ret23 + #t~ret25);havoc #t~mem22.base, #t~mem22.offset;havoc #t~ret25;havoc #t~ret23;havoc #t~mem24.base, #t~mem24.offset; {1490#true} is VALID [2020-07-10 15:01:04,267 INFO L280 TraceCheckUtils]: 14: Hoare triple {1490#true} assume true; {1490#true} is VALID [2020-07-10 15:01:04,268 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1490#true} {1491#false} #155#return; {1491#false} is VALID [2020-07-10 15:01:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:04,272 INFO L280 TraceCheckUtils]: 0: Hoare triple {1490#true} ~cond := #in~cond; {1490#true} is VALID [2020-07-10 15:01:04,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {1490#true} assume !(0 == ~cond); {1490#true} is VALID [2020-07-10 15:01:04,273 INFO L280 TraceCheckUtils]: 2: Hoare triple {1490#true} assume true; {1490#true} is VALID [2020-07-10 15:01:04,273 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1490#true} {1491#false} #157#return; {1491#false} is VALID [2020-07-10 15:01:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:04,290 INFO L280 TraceCheckUtils]: 0: Hoare triple {1562#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1490#true} is VALID [2020-07-10 15:01:04,290 INFO L280 TraceCheckUtils]: 1: Hoare triple {1490#true} assume true; {1490#true} is VALID [2020-07-10 15:01:04,291 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1490#true} {1491#false} #159#return; {1491#false} is VALID [2020-07-10 15:01:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:04,315 INFO L280 TraceCheckUtils]: 0: Hoare triple {1563#(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; {1490#true} is VALID [2020-07-10 15:01:04,316 INFO L280 TraceCheckUtils]: 1: Hoare triple {1490#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1490#true} is VALID [2020-07-10 15:01:04,316 INFO L280 TraceCheckUtils]: 2: Hoare triple {1490#true} assume true; {1490#true} is VALID [2020-07-10 15:01:04,316 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1490#true} {1491#false} #161#return; {1491#false} is VALID [2020-07-10 15:01:04,317 INFO L263 TraceCheckUtils]: 0: Hoare triple {1490#true} call ULTIMATE.init(); {1542#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:01:04,318 INFO L280 TraceCheckUtils]: 1: Hoare triple {1542#(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; {1490#true} is VALID [2020-07-10 15:01:04,318 INFO L280 TraceCheckUtils]: 2: Hoare triple {1490#true} assume true; {1490#true} is VALID [2020-07-10 15:01:04,319 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1490#true} {1490#true} #183#return; {1490#true} is VALID [2020-07-10 15:01:04,319 INFO L263 TraceCheckUtils]: 4: Hoare triple {1490#true} call #t~ret40 := main(); {1490#true} is VALID [2020-07-10 15:01:04,321 INFO L263 TraceCheckUtils]: 5: Hoare triple {1490#true} call #t~ret39.base, #t~ret39.offset := nondet_tree(); {1543#(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-10 15:01:04,323 INFO L280 TraceCheckUtils]: 6: Hoare triple {1543#(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; {1544#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-10 15:01:04,324 INFO L263 TraceCheckUtils]: 7: Hoare triple {1544#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {1543#(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-10 15:01:04,325 INFO L280 TraceCheckUtils]: 8: Hoare triple {1543#(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; {1490#true} is VALID [2020-07-10 15:01:04,325 INFO L280 TraceCheckUtils]: 9: Hoare triple {1490#true} assume true; {1490#true} is VALID [2020-07-10 15:01:04,326 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1490#true} {1544#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #149#return; {1544#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-10 15:01:04,326 INFO L280 TraceCheckUtils]: 11: Hoare triple {1544#(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; {1544#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-10 15:01:04,327 INFO L263 TraceCheckUtils]: 12: Hoare triple {1544#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {1543#(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-10 15:01:04,328 INFO L280 TraceCheckUtils]: 13: Hoare triple {1543#(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; {1490#true} is VALID [2020-07-10 15:01:04,328 INFO L280 TraceCheckUtils]: 14: Hoare triple {1490#true} assume true; {1490#true} is VALID [2020-07-10 15:01:04,329 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1490#true} {1544#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #151#return; {1544#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-10 15:01:04,330 INFO L280 TraceCheckUtils]: 16: Hoare triple {1544#(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; {1551#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-10 15:01:04,330 INFO L280 TraceCheckUtils]: 17: Hoare triple {1551#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} assume true; {1551#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-10 15:01:04,331 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1551#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} {1490#true} #139#return; {1508#(not (= 0 |main_#t~ret39.base|))} is VALID [2020-07-10 15:01:04,332 INFO L263 TraceCheckUtils]: 19: Hoare triple {1508#(not (= 0 |main_#t~ret39.base|))} call task(#t~ret39.base, #t~ret39.offset); {1509#(not (= |task_#in~t.base| 0))} is VALID [2020-07-10 15:01:04,333 INFO L280 TraceCheckUtils]: 20: Hoare triple {1509#(not (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1510#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:01:04,333 INFO L263 TraceCheckUtils]: 21: Hoare triple {1510#(not (= 0 task_~t.base))} call #t~ret26 := min(~t.base, ~t.offset); {1490#true} is VALID [2020-07-10 15:01:04,334 INFO L280 TraceCheckUtils]: 22: Hoare triple {1490#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1552#(= min_~n.base |min_#in~n.base|)} is VALID [2020-07-10 15:01:04,334 INFO L280 TraceCheckUtils]: 23: Hoare triple {1552#(= min_~n.base |min_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1553#(= 0 |min_#in~n.base|)} is VALID [2020-07-10 15:01:04,335 INFO L280 TraceCheckUtils]: 24: Hoare triple {1553#(= 0 |min_#in~n.base|)} assume true; {1553#(= 0 |min_#in~n.base|)} is VALID [2020-07-10 15:01:04,336 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1553#(= 0 |min_#in~n.base|)} {1510#(not (= 0 task_~t.base))} #153#return; {1491#false} is VALID [2020-07-10 15:01:04,336 INFO L280 TraceCheckUtils]: 26: Hoare triple {1491#false} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;~a~1 := #t~ret26;havoc #t~ret26;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {1491#false} is VALID [2020-07-10 15:01:04,336 INFO L263 TraceCheckUtils]: 27: Hoare triple {1491#false} call #t~ret27 := size(~t.base, ~t.offset); {1490#true} is VALID [2020-07-10 15:01:04,337 INFO L280 TraceCheckUtils]: 28: Hoare triple {1490#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1490#true} is VALID [2020-07-10 15:01:04,337 INFO L280 TraceCheckUtils]: 29: Hoare triple {1490#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {1490#true} is VALID [2020-07-10 15:01:04,337 INFO L263 TraceCheckUtils]: 30: Hoare triple {1490#true} call #t~ret23 := size(#t~mem22.base, #t~mem22.offset); {1490#true} is VALID [2020-07-10 15:01:04,337 INFO L280 TraceCheckUtils]: 31: Hoare triple {1490#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1490#true} is VALID [2020-07-10 15:01:04,338 INFO L280 TraceCheckUtils]: 32: Hoare triple {1490#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1490#true} is VALID [2020-07-10 15:01:04,338 INFO L280 TraceCheckUtils]: 33: Hoare triple {1490#true} assume true; {1490#true} is VALID [2020-07-10 15:01:04,338 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1490#true} {1490#true} #179#return; {1490#true} is VALID [2020-07-10 15:01:04,338 INFO L280 TraceCheckUtils]: 35: Hoare triple {1490#true} assume -2147483648 <= #t~ret23 && #t~ret23 <= 2147483647;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {1490#true} is VALID [2020-07-10 15:01:04,338 INFO L263 TraceCheckUtils]: 36: Hoare triple {1490#true} call #t~ret25 := size(#t~mem24.base, #t~mem24.offset); {1490#true} is VALID [2020-07-10 15:01:04,339 INFO L280 TraceCheckUtils]: 37: Hoare triple {1490#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1490#true} is VALID [2020-07-10 15:01:04,339 INFO L280 TraceCheckUtils]: 38: Hoare triple {1490#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1490#true} is VALID [2020-07-10 15:01:04,339 INFO L280 TraceCheckUtils]: 39: Hoare triple {1490#true} assume true; {1490#true} is VALID [2020-07-10 15:01:04,339 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1490#true} {1490#true} #181#return; {1490#true} is VALID [2020-07-10 15:01:04,339 INFO L280 TraceCheckUtils]: 41: Hoare triple {1490#true} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;#res := 1 + (#t~ret23 + #t~ret25);havoc #t~mem22.base, #t~mem22.offset;havoc #t~ret25;havoc #t~ret23;havoc #t~mem24.base, #t~mem24.offset; {1490#true} is VALID [2020-07-10 15:01:04,339 INFO L280 TraceCheckUtils]: 42: Hoare triple {1490#true} assume true; {1490#true} is VALID [2020-07-10 15:01:04,340 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {1490#true} {1491#false} #155#return; {1491#false} is VALID [2020-07-10 15:01:04,340 INFO L280 TraceCheckUtils]: 44: Hoare triple {1491#false} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;~n~1 := #t~ret27;havoc #t~ret27; {1491#false} is VALID [2020-07-10 15:01:04,340 INFO L263 TraceCheckUtils]: 45: Hoare triple {1491#false} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {1490#true} is VALID [2020-07-10 15:01:04,340 INFO L280 TraceCheckUtils]: 46: Hoare triple {1490#true} ~cond := #in~cond; {1490#true} is VALID [2020-07-10 15:01:04,340 INFO L280 TraceCheckUtils]: 47: Hoare triple {1490#true} assume !(0 == ~cond); {1490#true} is VALID [2020-07-10 15:01:04,341 INFO L280 TraceCheckUtils]: 48: Hoare triple {1490#true} assume true; {1490#true} is VALID [2020-07-10 15:01:04,341 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {1490#true} {1491#false} #157#return; {1491#false} is VALID [2020-07-10 15:01:04,341 INFO L280 TraceCheckUtils]: 50: Hoare triple {1491#false} call #t~malloc28.base, #t~malloc28.offset := #Ultimate.allocOnHeap(4 * ~n~1); {1491#false} is VALID [2020-07-10 15:01:04,341 INFO L263 TraceCheckUtils]: 51: Hoare triple {1491#false} call #Ultimate.meminit(#t~malloc28.base, #t~malloc28.offset, ~n~1, 4, 4 * ~n~1); {1562#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:01:04,341 INFO L280 TraceCheckUtils]: 52: Hoare triple {1562#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1490#true} is VALID [2020-07-10 15:01:04,342 INFO L280 TraceCheckUtils]: 53: Hoare triple {1490#true} assume true; {1490#true} is VALID [2020-07-10 15:01:04,342 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {1490#true} {1491#false} #159#return; {1491#false} is VALID [2020-07-10 15:01:04,342 INFO L280 TraceCheckUtils]: 55: Hoare triple {1491#false} ~x~0.base, ~x~0.offset := #t~malloc28.base, #t~malloc28.offset; {1491#false} is VALID [2020-07-10 15:01:04,342 INFO L263 TraceCheckUtils]: 56: Hoare triple {1491#false} call #t~ret29 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {1563#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:01:04,343 INFO L280 TraceCheckUtils]: 57: Hoare triple {1563#(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; {1490#true} is VALID [2020-07-10 15:01:04,343 INFO L280 TraceCheckUtils]: 58: Hoare triple {1490#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1490#true} is VALID [2020-07-10 15:01:04,343 INFO L280 TraceCheckUtils]: 59: Hoare triple {1490#true} assume true; {1490#true} is VALID [2020-07-10 15:01:04,343 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {1490#true} {1491#false} #161#return; {1491#false} is VALID [2020-07-10 15:01:04,344 INFO L280 TraceCheckUtils]: 61: Hoare triple {1491#false} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;havoc #t~ret29;call #t~mem30 := read~int(~x~0.base, ~x~0.offset, 4); {1491#false} is VALID [2020-07-10 15:01:04,344 INFO L263 TraceCheckUtils]: 62: Hoare triple {1491#false} call __VERIFIER_assert((if ~a~1 == #t~mem30 then 1 else 0)); {1491#false} is VALID [2020-07-10 15:01:04,344 INFO L280 TraceCheckUtils]: 63: Hoare triple {1491#false} ~cond := #in~cond; {1491#false} is VALID [2020-07-10 15:01:04,344 INFO L280 TraceCheckUtils]: 64: Hoare triple {1491#false} assume 0 == ~cond; {1491#false} is VALID [2020-07-10 15:01:04,345 INFO L280 TraceCheckUtils]: 65: Hoare triple {1491#false} assume !false; {1491#false} is VALID [2020-07-10 15:01:04,349 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-10 15:01:04,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645153642] [2020-07-10 15:01:04,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:01:04,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-10 15:01:04,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358430262] [2020-07-10 15:01:04,351 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2020-07-10 15:01:04,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:01:04,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 15:01:04,419 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-10 15:01:04,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 15:01:04,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:01:04,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 15:01:04,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:01:04,421 INFO L87 Difference]: Start difference. First operand 92 states and 117 transitions. Second operand 13 states. [2020-07-10 15:01:07,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:07,281 INFO L93 Difference]: Finished difference Result 161 states and 207 transitions. [2020-07-10 15:01:07,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 15:01:07,282 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2020-07-10 15:01:07,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:01:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:01:07,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 199 transitions. [2020-07-10 15:01:07,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:01:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 199 transitions. [2020-07-10 15:01:07,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 199 transitions. [2020-07-10 15:01:07,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:07,597 INFO L225 Difference]: With dead ends: 161 [2020-07-10 15:01:07,597 INFO L226 Difference]: Without dead ends: 97 [2020-07-10 15:01:07,599 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-10 15:01:07,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-07-10 15:01:07,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2020-07-10 15:01:07,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:01:07,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 94 states. [2020-07-10 15:01:07,681 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 94 states. [2020-07-10 15:01:07,682 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 94 states. [2020-07-10 15:01:07,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:07,689 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2020-07-10 15:01:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2020-07-10 15:01:07,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:07,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:07,690 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 97 states. [2020-07-10 15:01:07,691 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 97 states. [2020-07-10 15:01:07,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:07,697 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2020-07-10 15:01:07,697 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2020-07-10 15:01:07,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:07,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:07,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:01:07,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:01:07,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-10 15:01:07,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2020-07-10 15:01:07,704 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 66 [2020-07-10 15:01:07,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:01:07,704 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2020-07-10 15:01:07,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 15:01:07,705 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2020-07-10 15:01:07,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-10 15:01:07,706 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:01:07,707 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-10 15:01:07,707 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:01:07,707 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:01:07,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:01:07,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1030140767, now seen corresponding path program 1 times [2020-07-10 15:01:07,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:01:07,708 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163939510] [2020-07-10 15:01:07,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:01:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:07,817 INFO L280 TraceCheckUtils]: 0: Hoare triple {2197#(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; {2131#true} is VALID [2020-07-10 15:01:07,817 INFO L280 TraceCheckUtils]: 1: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:07,818 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2131#true} {2131#true} #183#return; {2131#true} is VALID [2020-07-10 15:01:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:07,890 INFO L280 TraceCheckUtils]: 0: Hoare triple {2198#(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; {2131#true} is VALID [2020-07-10 15:01:07,890 INFO L280 TraceCheckUtils]: 1: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:07,891 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2131#true} {2199#(= nondet_tree_~n~0.offset 0)} #149#return; {2199#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:01:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:07,897 INFO L280 TraceCheckUtils]: 0: Hoare triple {2198#(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; {2131#true} is VALID [2020-07-10 15:01:07,897 INFO L280 TraceCheckUtils]: 1: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:07,898 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2131#true} {2199#(= nondet_tree_~n~0.offset 0)} #151#return; {2199#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:01:07,899 INFO L280 TraceCheckUtils]: 0: Hoare triple {2198#(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; {2199#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:01:07,900 INFO L263 TraceCheckUtils]: 1: Hoare triple {2199#(= nondet_tree_~n~0.offset 0)} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2198#(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-10 15:01:07,901 INFO L280 TraceCheckUtils]: 2: Hoare triple {2198#(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; {2131#true} is VALID [2020-07-10 15:01:07,901 INFO L280 TraceCheckUtils]: 3: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:07,902 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2131#true} {2199#(= nondet_tree_~n~0.offset 0)} #149#return; {2199#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:01:07,902 INFO L280 TraceCheckUtils]: 5: Hoare triple {2199#(= 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; {2199#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:01:07,903 INFO L263 TraceCheckUtils]: 6: Hoare triple {2199#(= nondet_tree_~n~0.offset 0)} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2198#(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-10 15:01:07,904 INFO L280 TraceCheckUtils]: 7: Hoare triple {2198#(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; {2131#true} is VALID [2020-07-10 15:01:07,904 INFO L280 TraceCheckUtils]: 8: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:07,905 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2131#true} {2199#(= nondet_tree_~n~0.offset 0)} #151#return; {2199#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:01:07,906 INFO L280 TraceCheckUtils]: 10: Hoare triple {2199#(= 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; {2206#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-10 15:01:07,906 INFO L280 TraceCheckUtils]: 11: Hoare triple {2206#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} assume true; {2206#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-10 15:01:07,907 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2206#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} {2131#true} #139#return; {2149#(= 0 |main_#t~ret39.offset|)} is VALID [2020-07-10 15:01:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:07,961 INFO L280 TraceCheckUtils]: 0: Hoare triple {2131#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2131#true} is VALID [2020-07-10 15:01:07,961 INFO L280 TraceCheckUtils]: 1: Hoare triple {2131#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2131#true} is VALID [2020-07-10 15:01:07,961 INFO L280 TraceCheckUtils]: 2: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:07,962 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2131#true} {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #145#return; {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:01:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:07,968 INFO L280 TraceCheckUtils]: 0: Hoare triple {2131#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2131#true} is VALID [2020-07-10 15:01:07,968 INFO L280 TraceCheckUtils]: 1: Hoare triple {2131#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2131#true} is VALID [2020-07-10 15:01:07,968 INFO L280 TraceCheckUtils]: 2: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:07,969 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2131#true} {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #147#return; {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:01:07,970 INFO L280 TraceCheckUtils]: 0: Hoare triple {2131#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2207#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} is VALID [2020-07-10 15:01:07,971 INFO L280 TraceCheckUtils]: 1: Hoare triple {2207#(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 := read~int(~n.base, ~n.offset, 4);~a~0 := #t~mem6;havoc #t~mem6;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 4); {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:01:07,971 INFO L263 TraceCheckUtils]: 2: Hoare triple {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret8 := min(#t~mem7.base, #t~mem7.offset); {2131#true} is VALID [2020-07-10 15:01:07,972 INFO L280 TraceCheckUtils]: 3: Hoare triple {2131#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2131#true} is VALID [2020-07-10 15:01:07,972 INFO L280 TraceCheckUtils]: 4: Hoare triple {2131#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2131#true} is VALID [2020-07-10 15:01:07,972 INFO L280 TraceCheckUtils]: 5: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:07,973 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {2131#true} {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #145#return; {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:01:07,974 INFO L280 TraceCheckUtils]: 7: Hoare triple {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~b~0 := #t~ret8;havoc #t~ret8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~n.base, 8 + ~n.offset, 4); {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:01:07,974 INFO L263 TraceCheckUtils]: 8: Hoare triple {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret10 := min(#t~mem9.base, #t~mem9.offset); {2131#true} is VALID [2020-07-10 15:01:07,974 INFO L280 TraceCheckUtils]: 9: Hoare triple {2131#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2131#true} is VALID [2020-07-10 15:01:07,974 INFO L280 TraceCheckUtils]: 10: Hoare triple {2131#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2131#true} is VALID [2020-07-10 15:01:07,975 INFO L280 TraceCheckUtils]: 11: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:07,976 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2131#true} {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #147#return; {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:01:07,976 INFO L280 TraceCheckUtils]: 13: Hoare triple {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~c~0 := #t~ret10;havoc #t~mem9.base, #t~mem9.offset;havoc #t~ret10; {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:01:07,977 INFO L280 TraceCheckUtils]: 14: Hoare triple {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume ~b~0 <= ~a~0 && ~b~0 <= ~c~0;#res := ~b~0; {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:01:07,977 INFO L280 TraceCheckUtils]: 15: Hoare triple {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume true; {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:01:07,979 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} {2151#(= 0 task_~t.offset)} #153#return; {2169#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:01:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:07,991 INFO L280 TraceCheckUtils]: 0: Hoare triple {2131#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2131#true} is VALID [2020-07-10 15:01:07,991 INFO L280 TraceCheckUtils]: 1: Hoare triple {2131#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2131#true} is VALID [2020-07-10 15:01:07,992 INFO L280 TraceCheckUtils]: 2: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:07,992 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2131#true} {2131#true} #179#return; {2131#true} is VALID [2020-07-10 15:01:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:07,995 INFO L280 TraceCheckUtils]: 0: Hoare triple {2131#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2131#true} is VALID [2020-07-10 15:01:07,996 INFO L280 TraceCheckUtils]: 1: Hoare triple {2131#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2131#true} is VALID [2020-07-10 15:01:07,996 INFO L280 TraceCheckUtils]: 2: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:07,996 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2131#true} {2131#true} #181#return; {2131#true} is VALID [2020-07-10 15:01:07,997 INFO L280 TraceCheckUtils]: 0: Hoare triple {2131#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2131#true} is VALID [2020-07-10 15:01:07,997 INFO L280 TraceCheckUtils]: 1: Hoare triple {2131#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2131#true} is VALID [2020-07-10 15:01:07,997 INFO L263 TraceCheckUtils]: 2: Hoare triple {2131#true} call #t~ret23 := size(#t~mem22.base, #t~mem22.offset); {2131#true} is VALID [2020-07-10 15:01:07,997 INFO L280 TraceCheckUtils]: 3: Hoare triple {2131#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2131#true} is VALID [2020-07-10 15:01:07,998 INFO L280 TraceCheckUtils]: 4: Hoare triple {2131#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2131#true} is VALID [2020-07-10 15:01:07,998 INFO L280 TraceCheckUtils]: 5: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:07,998 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {2131#true} {2131#true} #179#return; {2131#true} is VALID [2020-07-10 15:01:07,998 INFO L280 TraceCheckUtils]: 7: Hoare triple {2131#true} assume -2147483648 <= #t~ret23 && #t~ret23 <= 2147483647;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2131#true} is VALID [2020-07-10 15:01:07,999 INFO L263 TraceCheckUtils]: 8: Hoare triple {2131#true} call #t~ret25 := size(#t~mem24.base, #t~mem24.offset); {2131#true} is VALID [2020-07-10 15:01:07,999 INFO L280 TraceCheckUtils]: 9: Hoare triple {2131#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2131#true} is VALID [2020-07-10 15:01:07,999 INFO L280 TraceCheckUtils]: 10: Hoare triple {2131#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2131#true} is VALID [2020-07-10 15:01:07,999 INFO L280 TraceCheckUtils]: 11: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,000 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2131#true} {2131#true} #181#return; {2131#true} is VALID [2020-07-10 15:01:08,000 INFO L280 TraceCheckUtils]: 13: Hoare triple {2131#true} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;#res := 1 + (#t~ret23 + #t~ret25);havoc #t~mem22.base, #t~mem22.offset;havoc #t~ret25;havoc #t~ret23;havoc #t~mem24.base, #t~mem24.offset; {2131#true} is VALID [2020-07-10 15:01:08,000 INFO L280 TraceCheckUtils]: 14: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,001 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2131#true} {2169#(not (= 0 task_~t.base))} #155#return; {2169#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:01:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:08,006 INFO L280 TraceCheckUtils]: 0: Hoare triple {2131#true} ~cond := #in~cond; {2131#true} is VALID [2020-07-10 15:01:08,007 INFO L280 TraceCheckUtils]: 1: Hoare triple {2131#true} assume !(0 == ~cond); {2131#true} is VALID [2020-07-10 15:01:08,007 INFO L280 TraceCheckUtils]: 2: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,008 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2131#true} {2169#(not (= 0 task_~t.base))} #157#return; {2169#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:01:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:08,028 INFO L280 TraceCheckUtils]: 0: Hoare triple {2225#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2131#true} is VALID [2020-07-10 15:01:08,028 INFO L280 TraceCheckUtils]: 1: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,029 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2131#true} {2169#(not (= 0 task_~t.base))} #159#return; {2169#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:01:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:08,100 INFO L280 TraceCheckUtils]: 0: Hoare triple {2226#(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; {2227#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2020-07-10 15:01:08,101 INFO L280 TraceCheckUtils]: 1: Hoare triple {2227#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2228#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-10 15:01:08,101 INFO L280 TraceCheckUtils]: 2: Hoare triple {2228#(= 0 |tree_inorder_#in~t.base|)} assume true; {2228#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-10 15:01:08,103 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2228#(= 0 |tree_inorder_#in~t.base|)} {2169#(not (= 0 task_~t.base))} #161#return; {2132#false} is VALID [2020-07-10 15:01:08,104 INFO L263 TraceCheckUtils]: 0: Hoare triple {2131#true} call ULTIMATE.init(); {2197#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:01:08,104 INFO L280 TraceCheckUtils]: 1: Hoare triple {2197#(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; {2131#true} is VALID [2020-07-10 15:01:08,105 INFO L280 TraceCheckUtils]: 2: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,105 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2131#true} {2131#true} #183#return; {2131#true} is VALID [2020-07-10 15:01:08,105 INFO L263 TraceCheckUtils]: 4: Hoare triple {2131#true} call #t~ret40 := main(); {2131#true} is VALID [2020-07-10 15:01:08,106 INFO L263 TraceCheckUtils]: 5: Hoare triple {2131#true} call #t~ret39.base, #t~ret39.offset := nondet_tree(); {2198#(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-10 15:01:08,108 INFO L280 TraceCheckUtils]: 6: Hoare triple {2198#(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; {2199#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:01:08,109 INFO L263 TraceCheckUtils]: 7: Hoare triple {2199#(= nondet_tree_~n~0.offset 0)} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2198#(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-10 15:01:08,110 INFO L280 TraceCheckUtils]: 8: Hoare triple {2198#(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; {2131#true} is VALID [2020-07-10 15:01:08,110 INFO L280 TraceCheckUtils]: 9: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,111 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2131#true} {2199#(= nondet_tree_~n~0.offset 0)} #149#return; {2199#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:01:08,112 INFO L280 TraceCheckUtils]: 11: Hoare triple {2199#(= 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; {2199#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:01:08,113 INFO L263 TraceCheckUtils]: 12: Hoare triple {2199#(= nondet_tree_~n~0.offset 0)} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2198#(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-10 15:01:08,113 INFO L280 TraceCheckUtils]: 13: Hoare triple {2198#(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; {2131#true} is VALID [2020-07-10 15:01:08,114 INFO L280 TraceCheckUtils]: 14: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,115 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2131#true} {2199#(= nondet_tree_~n~0.offset 0)} #151#return; {2199#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:01:08,116 INFO L280 TraceCheckUtils]: 16: Hoare triple {2199#(= 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; {2206#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-10 15:01:08,117 INFO L280 TraceCheckUtils]: 17: Hoare triple {2206#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} assume true; {2206#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-10 15:01:08,118 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2206#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} {2131#true} #139#return; {2149#(= 0 |main_#t~ret39.offset|)} is VALID [2020-07-10 15:01:08,119 INFO L263 TraceCheckUtils]: 19: Hoare triple {2149#(= 0 |main_#t~ret39.offset|)} call task(#t~ret39.base, #t~ret39.offset); {2150#(= 0 |task_#in~t.offset|)} is VALID [2020-07-10 15:01:08,120 INFO L280 TraceCheckUtils]: 20: Hoare triple {2150#(= 0 |task_#in~t.offset|)} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2151#(= 0 task_~t.offset)} is VALID [2020-07-10 15:01:08,120 INFO L263 TraceCheckUtils]: 21: Hoare triple {2151#(= 0 task_~t.offset)} call #t~ret26 := min(~t.base, ~t.offset); {2131#true} is VALID [2020-07-10 15:01:08,121 INFO L280 TraceCheckUtils]: 22: Hoare triple {2131#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2207#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} is VALID [2020-07-10 15:01:08,122 INFO L280 TraceCheckUtils]: 23: Hoare triple {2207#(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 := read~int(~n.base, ~n.offset, 4);~a~0 := #t~mem6;havoc #t~mem6;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 4); {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:01:08,122 INFO L263 TraceCheckUtils]: 24: Hoare triple {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret8 := min(#t~mem7.base, #t~mem7.offset); {2131#true} is VALID [2020-07-10 15:01:08,122 INFO L280 TraceCheckUtils]: 25: Hoare triple {2131#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2131#true} is VALID [2020-07-10 15:01:08,123 INFO L280 TraceCheckUtils]: 26: Hoare triple {2131#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2131#true} is VALID [2020-07-10 15:01:08,123 INFO L280 TraceCheckUtils]: 27: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,124 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2131#true} {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #145#return; {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:01:08,125 INFO L280 TraceCheckUtils]: 29: Hoare triple {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~b~0 := #t~ret8;havoc #t~ret8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~n.base, 8 + ~n.offset, 4); {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:01:08,125 INFO L263 TraceCheckUtils]: 30: Hoare triple {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret10 := min(#t~mem9.base, #t~mem9.offset); {2131#true} is VALID [2020-07-10 15:01:08,125 INFO L280 TraceCheckUtils]: 31: Hoare triple {2131#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2131#true} is VALID [2020-07-10 15:01:08,126 INFO L280 TraceCheckUtils]: 32: Hoare triple {2131#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2131#true} is VALID [2020-07-10 15:01:08,126 INFO L280 TraceCheckUtils]: 33: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,127 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2131#true} {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #147#return; {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:01:08,128 INFO L280 TraceCheckUtils]: 35: Hoare triple {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~c~0 := #t~ret10;havoc #t~mem9.base, #t~mem9.offset;havoc #t~ret10; {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:01:08,128 INFO L280 TraceCheckUtils]: 36: Hoare triple {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume ~b~0 <= ~a~0 && ~b~0 <= ~c~0;#res := ~b~0; {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:01:08,129 INFO L280 TraceCheckUtils]: 37: Hoare triple {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume true; {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:01:08,130 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2208#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} {2151#(= 0 task_~t.offset)} #153#return; {2169#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:01:08,131 INFO L280 TraceCheckUtils]: 39: Hoare triple {2169#(not (= 0 task_~t.base))} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;~a~1 := #t~ret26;havoc #t~ret26;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {2169#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:01:08,131 INFO L263 TraceCheckUtils]: 40: Hoare triple {2169#(not (= 0 task_~t.base))} call #t~ret27 := size(~t.base, ~t.offset); {2131#true} is VALID [2020-07-10 15:01:08,131 INFO L280 TraceCheckUtils]: 41: Hoare triple {2131#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2131#true} is VALID [2020-07-10 15:01:08,132 INFO L280 TraceCheckUtils]: 42: Hoare triple {2131#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2131#true} is VALID [2020-07-10 15:01:08,132 INFO L263 TraceCheckUtils]: 43: Hoare triple {2131#true} call #t~ret23 := size(#t~mem22.base, #t~mem22.offset); {2131#true} is VALID [2020-07-10 15:01:08,132 INFO L280 TraceCheckUtils]: 44: Hoare triple {2131#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2131#true} is VALID [2020-07-10 15:01:08,132 INFO L280 TraceCheckUtils]: 45: Hoare triple {2131#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2131#true} is VALID [2020-07-10 15:01:08,132 INFO L280 TraceCheckUtils]: 46: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,133 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2131#true} {2131#true} #179#return; {2131#true} is VALID [2020-07-10 15:01:08,133 INFO L280 TraceCheckUtils]: 48: Hoare triple {2131#true} assume -2147483648 <= #t~ret23 && #t~ret23 <= 2147483647;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2131#true} is VALID [2020-07-10 15:01:08,133 INFO L263 TraceCheckUtils]: 49: Hoare triple {2131#true} call #t~ret25 := size(#t~mem24.base, #t~mem24.offset); {2131#true} is VALID [2020-07-10 15:01:08,133 INFO L280 TraceCheckUtils]: 50: Hoare triple {2131#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2131#true} is VALID [2020-07-10 15:01:08,134 INFO L280 TraceCheckUtils]: 51: Hoare triple {2131#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2131#true} is VALID [2020-07-10 15:01:08,134 INFO L280 TraceCheckUtils]: 52: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,134 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {2131#true} {2131#true} #181#return; {2131#true} is VALID [2020-07-10 15:01:08,134 INFO L280 TraceCheckUtils]: 54: Hoare triple {2131#true} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;#res := 1 + (#t~ret23 + #t~ret25);havoc #t~mem22.base, #t~mem22.offset;havoc #t~ret25;havoc #t~ret23;havoc #t~mem24.base, #t~mem24.offset; {2131#true} is VALID [2020-07-10 15:01:08,135 INFO L280 TraceCheckUtils]: 55: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,136 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2131#true} {2169#(not (= 0 task_~t.base))} #155#return; {2169#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:01:08,136 INFO L280 TraceCheckUtils]: 57: Hoare triple {2169#(not (= 0 task_~t.base))} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;~n~1 := #t~ret27;havoc #t~ret27; {2169#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:01:08,137 INFO L263 TraceCheckUtils]: 58: Hoare triple {2169#(not (= 0 task_~t.base))} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {2131#true} is VALID [2020-07-10 15:01:08,137 INFO L280 TraceCheckUtils]: 59: Hoare triple {2131#true} ~cond := #in~cond; {2131#true} is VALID [2020-07-10 15:01:08,137 INFO L280 TraceCheckUtils]: 60: Hoare triple {2131#true} assume !(0 == ~cond); {2131#true} is VALID [2020-07-10 15:01:08,138 INFO L280 TraceCheckUtils]: 61: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,138 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2131#true} {2169#(not (= 0 task_~t.base))} #157#return; {2169#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:01:08,139 INFO L280 TraceCheckUtils]: 63: Hoare triple {2169#(not (= 0 task_~t.base))} call #t~malloc28.base, #t~malloc28.offset := #Ultimate.allocOnHeap(4 * ~n~1); {2169#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:01:08,141 INFO L263 TraceCheckUtils]: 64: Hoare triple {2169#(not (= 0 task_~t.base))} call #Ultimate.meminit(#t~malloc28.base, #t~malloc28.offset, ~n~1, 4, 4 * ~n~1); {2225#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:01:08,141 INFO L280 TraceCheckUtils]: 65: Hoare triple {2225#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2131#true} is VALID [2020-07-10 15:01:08,141 INFO L280 TraceCheckUtils]: 66: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,142 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {2131#true} {2169#(not (= 0 task_~t.base))} #159#return; {2169#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:01:08,143 INFO L280 TraceCheckUtils]: 68: Hoare triple {2169#(not (= 0 task_~t.base))} ~x~0.base, ~x~0.offset := #t~malloc28.base, #t~malloc28.offset; {2169#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:01:08,145 INFO L263 TraceCheckUtils]: 69: Hoare triple {2169#(not (= 0 task_~t.base))} call #t~ret29 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {2226#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:01:08,145 INFO L280 TraceCheckUtils]: 70: Hoare triple {2226#(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; {2227#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2020-07-10 15:01:08,146 INFO L280 TraceCheckUtils]: 71: Hoare triple {2227#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2228#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-10 15:01:08,147 INFO L280 TraceCheckUtils]: 72: Hoare triple {2228#(= 0 |tree_inorder_#in~t.base|)} assume true; {2228#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-10 15:01:08,179 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {2228#(= 0 |tree_inorder_#in~t.base|)} {2169#(not (= 0 task_~t.base))} #161#return; {2132#false} is VALID [2020-07-10 15:01:08,180 INFO L280 TraceCheckUtils]: 74: Hoare triple {2132#false} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;havoc #t~ret29;call #t~mem30 := read~int(~x~0.base, ~x~0.offset, 4); {2132#false} is VALID [2020-07-10 15:01:08,180 INFO L263 TraceCheckUtils]: 75: Hoare triple {2132#false} call __VERIFIER_assert((if ~a~1 == #t~mem30 then 1 else 0)); {2132#false} is VALID [2020-07-10 15:01:08,180 INFO L280 TraceCheckUtils]: 76: Hoare triple {2132#false} ~cond := #in~cond; {2132#false} is VALID [2020-07-10 15:01:08,181 INFO L280 TraceCheckUtils]: 77: Hoare triple {2132#false} assume 0 == ~cond; {2132#false} is VALID [2020-07-10 15:01:08,181 INFO L280 TraceCheckUtils]: 78: Hoare triple {2132#false} assume !false; {2132#false} is VALID [2020-07-10 15:01:08,200 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-10 15:01:08,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163939510] [2020-07-10 15:01:08,204 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469376855] [2020-07-10 15:01:08,204 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-10 15:01:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:08,329 INFO L264 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 39 conjunts are in the unsatisfiable core [2020-07-10 15:01:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:08,379 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:01:08,575 INFO L263 TraceCheckUtils]: 0: Hoare triple {2131#true} call ULTIMATE.init(); {2131#true} is VALID [2020-07-10 15:01:08,575 INFO L280 TraceCheckUtils]: 1: Hoare triple {2131#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2131#true} is VALID [2020-07-10 15:01:08,575 INFO L280 TraceCheckUtils]: 2: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,576 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2131#true} {2131#true} #183#return; {2131#true} is VALID [2020-07-10 15:01:08,576 INFO L263 TraceCheckUtils]: 4: Hoare triple {2131#true} call #t~ret40 := main(); {2131#true} is VALID [2020-07-10 15:01:08,576 INFO L263 TraceCheckUtils]: 5: Hoare triple {2131#true} call #t~ret39.base, #t~ret39.offset := nondet_tree(); {2131#true} is VALID [2020-07-10 15:01:08,578 INFO L280 TraceCheckUtils]: 6: Hoare triple {2131#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; {2199#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:01:08,578 INFO L263 TraceCheckUtils]: 7: Hoare triple {2199#(= nondet_tree_~n~0.offset 0)} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2131#true} is VALID [2020-07-10 15:01:08,579 INFO L280 TraceCheckUtils]: 8: Hoare triple {2131#true} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2131#true} is VALID [2020-07-10 15:01:08,579 INFO L280 TraceCheckUtils]: 9: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,581 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2131#true} {2199#(= nondet_tree_~n~0.offset 0)} #149#return; {2199#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:01:08,582 INFO L280 TraceCheckUtils]: 11: Hoare triple {2199#(= 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; {2199#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:01:08,582 INFO L263 TraceCheckUtils]: 12: Hoare triple {2199#(= nondet_tree_~n~0.offset 0)} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2131#true} is VALID [2020-07-10 15:01:08,583 INFO L280 TraceCheckUtils]: 13: Hoare triple {2131#true} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2131#true} is VALID [2020-07-10 15:01:08,583 INFO L280 TraceCheckUtils]: 14: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,584 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2131#true} {2199#(= nondet_tree_~n~0.offset 0)} #151#return; {2199#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:01:08,585 INFO L280 TraceCheckUtils]: 16: Hoare triple {2199#(= 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; {2206#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-10 15:01:08,586 INFO L280 TraceCheckUtils]: 17: Hoare triple {2206#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} assume true; {2206#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-10 15:01:08,587 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2206#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} {2131#true} #139#return; {2149#(= 0 |main_#t~ret39.offset|)} is VALID [2020-07-10 15:01:08,588 INFO L263 TraceCheckUtils]: 19: Hoare triple {2149#(= 0 |main_#t~ret39.offset|)} call task(#t~ret39.base, #t~ret39.offset); {2150#(= 0 |task_#in~t.offset|)} is VALID [2020-07-10 15:01:08,589 INFO L280 TraceCheckUtils]: 20: Hoare triple {2150#(= 0 |task_#in~t.offset|)} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2151#(= 0 task_~t.offset)} is VALID [2020-07-10 15:01:08,589 INFO L263 TraceCheckUtils]: 21: Hoare triple {2151#(= 0 task_~t.offset)} call #t~ret26 := min(~t.base, ~t.offset); {2131#true} is VALID [2020-07-10 15:01:08,589 INFO L280 TraceCheckUtils]: 22: Hoare triple {2131#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2131#true} is VALID [2020-07-10 15:01:08,590 INFO L280 TraceCheckUtils]: 23: Hoare triple {2131#true} assume !(~n.base == 0 && ~n.offset == 0);call #t~mem6 := read~int(~n.base, ~n.offset, 4);~a~0 := #t~mem6;havoc #t~mem6;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 4); {2131#true} is VALID [2020-07-10 15:01:08,590 INFO L263 TraceCheckUtils]: 24: Hoare triple {2131#true} call #t~ret8 := min(#t~mem7.base, #t~mem7.offset); {2131#true} is VALID [2020-07-10 15:01:08,590 INFO L280 TraceCheckUtils]: 25: Hoare triple {2131#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2131#true} is VALID [2020-07-10 15:01:08,590 INFO L280 TraceCheckUtils]: 26: Hoare triple {2131#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2131#true} is VALID [2020-07-10 15:01:08,590 INFO L280 TraceCheckUtils]: 27: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,591 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2131#true} {2131#true} #145#return; {2131#true} is VALID [2020-07-10 15:01:08,591 INFO L280 TraceCheckUtils]: 29: Hoare triple {2131#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~b~0 := #t~ret8;havoc #t~ret8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~n.base, 8 + ~n.offset, 4); {2131#true} is VALID [2020-07-10 15:01:08,591 INFO L263 TraceCheckUtils]: 30: Hoare triple {2131#true} call #t~ret10 := min(#t~mem9.base, #t~mem9.offset); {2131#true} is VALID [2020-07-10 15:01:08,591 INFO L280 TraceCheckUtils]: 31: Hoare triple {2131#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2131#true} is VALID [2020-07-10 15:01:08,591 INFO L280 TraceCheckUtils]: 32: Hoare triple {2131#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2131#true} is VALID [2020-07-10 15:01:08,591 INFO L280 TraceCheckUtils]: 33: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,592 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2131#true} {2131#true} #147#return; {2131#true} is VALID [2020-07-10 15:01:08,592 INFO L280 TraceCheckUtils]: 35: Hoare triple {2131#true} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~c~0 := #t~ret10;havoc #t~mem9.base, #t~mem9.offset;havoc #t~ret10; {2131#true} is VALID [2020-07-10 15:01:08,592 INFO L280 TraceCheckUtils]: 36: Hoare triple {2131#true} assume ~b~0 <= ~a~0 && ~b~0 <= ~c~0;#res := ~b~0; {2131#true} is VALID [2020-07-10 15:01:08,592 INFO L280 TraceCheckUtils]: 37: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,593 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2131#true} {2151#(= 0 task_~t.offset)} #153#return; {2151#(= 0 task_~t.offset)} is VALID [2020-07-10 15:01:08,594 INFO L280 TraceCheckUtils]: 39: Hoare triple {2151#(= 0 task_~t.offset)} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;~a~1 := #t~ret26;havoc #t~ret26;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {2151#(= 0 task_~t.offset)} is VALID [2020-07-10 15:01:08,594 INFO L263 TraceCheckUtils]: 40: Hoare triple {2151#(= 0 task_~t.offset)} call #t~ret27 := size(~t.base, ~t.offset); {2131#true} is VALID [2020-07-10 15:01:08,595 INFO L280 TraceCheckUtils]: 41: Hoare triple {2131#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2355#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} is VALID [2020-07-10 15:01:08,595 INFO L280 TraceCheckUtils]: 42: Hoare triple {2355#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2359#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:01:08,596 INFO L263 TraceCheckUtils]: 43: Hoare triple {2359#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret23 := size(#t~mem22.base, #t~mem22.offset); {2131#true} is VALID [2020-07-10 15:01:08,596 INFO L280 TraceCheckUtils]: 44: Hoare triple {2131#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2131#true} is VALID [2020-07-10 15:01:08,596 INFO L280 TraceCheckUtils]: 45: Hoare triple {2131#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2131#true} is VALID [2020-07-10 15:01:08,596 INFO L280 TraceCheckUtils]: 46: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,597 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2131#true} {2359#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #179#return; {2359#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:01:08,598 INFO L280 TraceCheckUtils]: 48: Hoare triple {2359#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret23 && #t~ret23 <= 2147483647;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2359#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:01:08,598 INFO L263 TraceCheckUtils]: 49: Hoare triple {2359#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret25 := size(#t~mem24.base, #t~mem24.offset); {2131#true} is VALID [2020-07-10 15:01:08,598 INFO L280 TraceCheckUtils]: 50: Hoare triple {2131#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2131#true} is VALID [2020-07-10 15:01:08,598 INFO L280 TraceCheckUtils]: 51: Hoare triple {2131#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2131#true} is VALID [2020-07-10 15:01:08,599 INFO L280 TraceCheckUtils]: 52: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,599 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {2131#true} {2359#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #181#return; {2359#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:01:08,600 INFO L280 TraceCheckUtils]: 54: Hoare triple {2359#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;#res := 1 + (#t~ret23 + #t~ret25);havoc #t~mem22.base, #t~mem22.offset;havoc #t~ret25;havoc #t~ret23;havoc #t~mem24.base, #t~mem24.offset; {2359#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:01:08,601 INFO L280 TraceCheckUtils]: 55: Hoare triple {2359#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {2359#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:01:08,602 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2359#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {2151#(= 0 task_~t.offset)} #155#return; {2169#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:01:08,602 INFO L280 TraceCheckUtils]: 57: Hoare triple {2169#(not (= 0 task_~t.base))} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;~n~1 := #t~ret27;havoc #t~ret27; {2169#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:01:08,602 INFO L263 TraceCheckUtils]: 58: Hoare triple {2169#(not (= 0 task_~t.base))} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {2131#true} is VALID [2020-07-10 15:01:08,603 INFO L280 TraceCheckUtils]: 59: Hoare triple {2131#true} ~cond := #in~cond; {2131#true} is VALID [2020-07-10 15:01:08,603 INFO L280 TraceCheckUtils]: 60: Hoare triple {2131#true} assume !(0 == ~cond); {2131#true} is VALID [2020-07-10 15:01:08,603 INFO L280 TraceCheckUtils]: 61: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,604 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2131#true} {2169#(not (= 0 task_~t.base))} #157#return; {2169#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:01:08,604 INFO L280 TraceCheckUtils]: 63: Hoare triple {2169#(not (= 0 task_~t.base))} call #t~malloc28.base, #t~malloc28.offset := #Ultimate.allocOnHeap(4 * ~n~1); {2169#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:01:08,604 INFO L263 TraceCheckUtils]: 64: Hoare triple {2169#(not (= 0 task_~t.base))} call #Ultimate.meminit(#t~malloc28.base, #t~malloc28.offset, ~n~1, 4, 4 * ~n~1); {2131#true} is VALID [2020-07-10 15:01:08,605 INFO L280 TraceCheckUtils]: 65: Hoare triple {2131#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2131#true} is VALID [2020-07-10 15:01:08,605 INFO L280 TraceCheckUtils]: 66: Hoare triple {2131#true} assume true; {2131#true} is VALID [2020-07-10 15:01:08,606 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {2131#true} {2169#(not (= 0 task_~t.base))} #159#return; {2169#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:01:08,606 INFO L280 TraceCheckUtils]: 68: Hoare triple {2169#(not (= 0 task_~t.base))} ~x~0.base, ~x~0.offset := #t~malloc28.base, #t~malloc28.offset; {2169#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:01:08,607 INFO L263 TraceCheckUtils]: 69: Hoare triple {2169#(not (= 0 task_~t.base))} call #t~ret29 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {2131#true} is VALID [2020-07-10 15:01:08,607 INFO L280 TraceCheckUtils]: 70: Hoare triple {2131#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2227#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2020-07-10 15:01:08,608 INFO L280 TraceCheckUtils]: 71: Hoare triple {2227#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2228#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-10 15:01:08,609 INFO L280 TraceCheckUtils]: 72: Hoare triple {2228#(= 0 |tree_inorder_#in~t.base|)} assume true; {2228#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-10 15:01:08,610 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {2228#(= 0 |tree_inorder_#in~t.base|)} {2169#(not (= 0 task_~t.base))} #161#return; {2132#false} is VALID [2020-07-10 15:01:08,610 INFO L280 TraceCheckUtils]: 74: Hoare triple {2132#false} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;havoc #t~ret29;call #t~mem30 := read~int(~x~0.base, ~x~0.offset, 4); {2132#false} is VALID [2020-07-10 15:01:08,610 INFO L263 TraceCheckUtils]: 75: Hoare triple {2132#false} call __VERIFIER_assert((if ~a~1 == #t~mem30 then 1 else 0)); {2132#false} is VALID [2020-07-10 15:01:08,611 INFO L280 TraceCheckUtils]: 76: Hoare triple {2132#false} ~cond := #in~cond; {2132#false} is VALID [2020-07-10 15:01:08,611 INFO L280 TraceCheckUtils]: 77: Hoare triple {2132#false} assume 0 == ~cond; {2132#false} is VALID [2020-07-10 15:01:08,611 INFO L280 TraceCheckUtils]: 78: Hoare triple {2132#false} assume !false; {2132#false} is VALID [2020-07-10 15:01:08,622 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-10 15:01:08,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:01:08,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 18 [2020-07-10 15:01:08,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181545997] [2020-07-10 15:01:08,625 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 79 [2020-07-10 15:01:08,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:01:08,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-10 15:01:08,747 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-10 15:01:08,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-10 15:01:08,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:01:08,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-10 15:01:08,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2020-07-10 15:01:08,749 INFO L87 Difference]: Start difference. First operand 94 states and 120 transitions. Second operand 18 states. [2020-07-10 15:01:13,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:13,683 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2020-07-10 15:01:13,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-10 15:01:13,684 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 79 [2020-07-10 15:01:13,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:01:13,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 15:01:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 190 transitions. [2020-07-10 15:01:13,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 15:01:13,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 190 transitions. [2020-07-10 15:01:13,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 190 transitions. [2020-07-10 15:01:14,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:14,005 INFO L225 Difference]: With dead ends: 151 [2020-07-10 15:01:14,006 INFO L226 Difference]: Without dead ends: 99 [2020-07-10 15:01:14,007 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-10 15:01:14,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-07-10 15:01:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2020-07-10 15:01:14,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:01:14,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 98 states. [2020-07-10 15:01:14,103 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 98 states. [2020-07-10 15:01:14,103 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 98 states. [2020-07-10 15:01:14,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:14,109 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2020-07-10 15:01:14,110 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 125 transitions. [2020-07-10 15:01:14,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:14,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:14,111 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 99 states. [2020-07-10 15:01:14,111 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 99 states. [2020-07-10 15:01:14,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:14,116 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2020-07-10 15:01:14,117 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 125 transitions. [2020-07-10 15:01:14,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:14,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:14,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:01:14,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:01:14,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-10 15:01:14,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 124 transitions. [2020-07-10 15:01:14,123 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 124 transitions. Word has length 79 [2020-07-10 15:01:14,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:01:14,123 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 124 transitions. [2020-07-10 15:01:14,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-10 15:01:14,123 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 124 transitions. [2020-07-10 15:01:14,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-10 15:01:14,125 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:01:14,125 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-10 15:01:14,339 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:01:14,340 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:01:14,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:01:14,340 INFO L82 PathProgramCache]: Analyzing trace with hash -299285422, now seen corresponding path program 1 times [2020-07-10 15:01:14,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:01:14,341 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681214664] [2020-07-10 15:01:14,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:01:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:01:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:01:14,493 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:01:14,494 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:01:14,494 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:01:14,597 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:01:14,598 WARN L170 areAnnotationChecker]: minENTRY has no Hoare annotation [2020-07-10 15:01:14,598 WARN L170 areAnnotationChecker]: taskENTRY has no Hoare annotation [2020-07-10 15:01:14,598 WARN L170 areAnnotationChecker]: sizeENTRY has no Hoare annotation [2020-07-10 15:01:14,598 WARN L170 areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation [2020-07-10 15:01:14,598 WARN L170 areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation [2020-07-10 15:01:14,598 WARN L170 areAnnotationChecker]: assume_cycle_if_notENTRY has no Hoare annotation [2020-07-10 15:01:14,599 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:01:14,599 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:01:14,599 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:01:14,599 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:01:14,599 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:01:14,599 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2020-07-10 15:01:14,599 WARN L170 areAnnotationChecker]: tree_inorderENTRY has no Hoare annotation [2020-07-10 15:01:14,599 WARN L170 areAnnotationChecker]: tree_delENTRY has no Hoare annotation [2020-07-10 15:01:14,600 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:01:14,600 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-10 15:01:14,600 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-10 15:01:14,600 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2020-07-10 15:01:14,600 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2020-07-10 15:01:14,600 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2020-07-10 15:01:14,600 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2020-07-10 15:01:14,601 WARN L170 areAnnotationChecker]: nondet_treeFINAL has no Hoare annotation [2020-07-10 15:01:14,601 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-10 15:01:14,601 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-10 15:01:14,601 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 15:01:14,601 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 15:01:14,601 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:01:14,601 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:01:14,601 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2020-07-10 15:01:14,601 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2020-07-10 15:01:14,602 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 15:01:14,602 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 15:01:14,602 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2020-07-10 15:01:14,602 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-10 15:01:14,602 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-10 15:01:14,602 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 15:01:14,602 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-10 15:01:14,602 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:01:14,603 WARN L170 areAnnotationChecker]: minFINAL has no Hoare annotation [2020-07-10 15:01:14,603 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 15:01:14,603 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 15:01:14,603 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2020-07-10 15:01:14,603 WARN L170 areAnnotationChecker]: sizeFINAL has no Hoare annotation [2020-07-10 15:01:14,603 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-10 15:01:14,603 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-10 15:01:14,603 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2020-07-10 15:01:14,603 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2020-07-10 15:01:14,603 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2020-07-10 15:01:14,604 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2020-07-10 15:01:14,604 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2020-07-10 15:01:14,604 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2020-07-10 15:01:14,604 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2020-07-10 15:01:14,604 WARN L170 areAnnotationChecker]: L9-5 has no Hoare annotation [2020-07-10 15:01:14,604 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:01:14,604 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2020-07-10 15:01:14,604 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-10 15:01:14,604 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-10 15:01:14,605 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2020-07-10 15:01:14,605 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2020-07-10 15:01:14,605 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2020-07-10 15:01:14,605 WARN L170 areAnnotationChecker]: tree_inorderFINAL has no Hoare annotation [2020-07-10 15:01:14,605 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2020-07-10 15:01:14,605 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2020-07-10 15:01:14,605 WARN L170 areAnnotationChecker]: tree_delFINAL has no Hoare annotation [2020-07-10 15:01:14,605 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-10 15:01:14,605 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-10 15:01:14,605 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2020-07-10 15:01:14,606 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2020-07-10 15:01:14,606 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2020-07-10 15:01:14,606 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-10 15:01:14,606 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2020-07-10 15:01:14,606 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2020-07-10 15:01:14,606 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2020-07-10 15:01:14,606 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2020-07-10 15:01:14,606 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2020-07-10 15:01:14,606 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2020-07-10 15:01:14,606 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2020-07-10 15:01:14,607 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-10 15:01:14,607 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-10 15:01:14,607 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-10 15:01:14,607 WARN L170 areAnnotationChecker]: assume_cycle_if_notEXIT has no Hoare annotation [2020-07-10 15:01:14,607 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:01:14,607 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:01:14,607 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:01:14,607 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:01:14,607 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:01:14,607 WARN L170 areAnnotationChecker]: L81-1 has no Hoare annotation [2020-07-10 15:01:14,608 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2020-07-10 15:01:14,608 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2020-07-10 15:01:14,608 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2020-07-10 15:01:14,608 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2020-07-10 15:01:14,608 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2020-07-10 15:01:14,608 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2020-07-10 15:01:14,608 WARN L170 areAnnotationChecker]: tree_delEXIT has no Hoare annotation [2020-07-10 15:01:14,608 WARN L170 areAnnotationChecker]: tree_delEXIT has no Hoare annotation [2020-07-10 15:01:14,608 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2020-07-10 15:01:14,608 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-10 15:01:14,608 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 15:01:14,609 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 15:01:14,609 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2020-07-10 15:01:14,609 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2020-07-10 15:01:14,609 WARN L170 areAnnotationChecker]: L72-3 has no Hoare annotation [2020-07-10 15:01:14,609 WARN L170 areAnnotationChecker]: L72-2 has no Hoare annotation [2020-07-10 15:01:14,609 WARN L170 areAnnotationChecker]: L72-2 has no Hoare annotation [2020-07-10 15:01:14,609 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2020-07-10 15:01:14,609 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:01:14,609 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2020-07-10 15:01:14,609 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2020-07-10 15:01:14,610 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2020-07-10 15:01:14,610 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2020-07-10 15:01:14,610 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2020-07-10 15:01:14,610 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2020-07-10 15:01:14,610 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2020-07-10 15:01:14,610 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2020-07-10 15:01:14,610 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2020-07-10 15:01:14,610 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2020-07-10 15:01:14,610 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2020-07-10 15:01:14,611 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2020-07-10 15:01:14,611 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2020-07-10 15:01:14,611 WARN L170 areAnnotationChecker]: L85-1 has no Hoare annotation [2020-07-10 15:01:14,611 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 15:01:14,611 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 15:01:14,611 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2020-07-10 15:01:14,611 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2020-07-10 15:01:14,611 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2020-07-10 15:01:14,611 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2020-07-10 15:01:14,611 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2020-07-10 15:01:14,612 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2020-07-10 15:01:14,612 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-10 15:01:14,612 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-10 15:01:14,612 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2020-07-10 15:01:14,612 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2020-07-10 15:01:14,612 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2020-07-10 15:01:14,612 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2020-07-10 15:01:14,612 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2020-07-10 15:01:14,613 WARN L170 areAnnotationChecker]: L93-2 has no Hoare annotation [2020-07-10 15:01:14,613 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2020-07-10 15:01:14,613 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2020-07-10 15:01:14,613 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2020-07-10 15:01:14,613 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2020-07-10 15:01:14,613 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-10 15:01:14,613 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-10 15:01:14,613 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-10 15:01:14,613 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-10 15:01:14,614 WARN L170 areAnnotationChecker]: L93-4 has no Hoare annotation [2020-07-10 15:01:14,614 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2020-07-10 15:01:14,614 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2020-07-10 15:01:14,614 WARN L170 areAnnotationChecker]: taskFINAL has no Hoare annotation [2020-07-10 15:01:14,614 WARN L170 areAnnotationChecker]: taskEXIT has no Hoare annotation [2020-07-10 15:01:14,614 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-10 15:01:14,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:01:14 BoogieIcfgContainer [2020-07-10 15:01:14,618 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:01:14,623 INFO L168 Benchmark]: Toolchain (without parser) took 20867.24 ms. Allocated memory was 135.3 MB in the beginning and 504.9 MB in the end (delta: 369.6 MB). Free memory was 99.2 MB in the beginning and 330.7 MB in the end (delta: -231.5 MB). Peak memory consumption was 138.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:01:14,625 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:01:14,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 426.10 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 99.0 MB in the beginning and 174.9 MB in the end (delta: -75.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:01:14,632 INFO L168 Benchmark]: Boogie Preprocessor took 67.04 ms. Allocated memory is still 199.2 MB. Free memory was 174.9 MB in the beginning and 172.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:01:14,632 INFO L168 Benchmark]: RCFGBuilder took 796.41 ms. Allocated memory is still 199.2 MB. Free memory was 171.3 MB in the beginning and 111.2 MB in the end (delta: 60.1 MB). Peak memory consumption was 60.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:01:14,633 INFO L168 Benchmark]: TraceAbstraction took 19572.26 ms. Allocated memory was 199.2 MB in the beginning and 504.9 MB in the end (delta: 305.7 MB). Free memory was 110.5 MB in the beginning and 330.7 MB in the end (delta: -220.3 MB). Peak memory consumption was 85.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:01:14,641 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.50 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 426.10 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 99.0 MB in the beginning and 174.9 MB in the end (delta: -75.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 67.04 ms. Allocated memory is still 199.2 MB. Free memory was 174.9 MB in the beginning and 172.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 796.41 ms. Allocated memory is still 199.2 MB. Free memory was 171.3 MB in the beginning and 111.2 MB in the end (delta: 60.1 MB). Peak memory consumption was 60.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19572.26 ms. Allocated memory was 199.2 MB in the beginning and 504.9 MB in the end (delta: 305.7 MB). Free memory was 110.5 MB in the beginning and 330.7 MB in the end (delta: -220.3 MB). Peak memory consumption was 85.4 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: [L100] 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}] [L100] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L100] CALL task(nondet_tree()) VAL [t={-1:0}] [L76] CALL, EXPR min(t) VAL [n={-1:0}] [L35] COND FALSE !(!n) [L38] EXPR n->data [L38] int a = n->data; [L39] EXPR n->left VAL [a=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L39] 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}] [L39] RET, EXPR min(n->left) VAL [a=2147483647, min(n->left)=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L39] int b = min(n->left); [L40] EXPR n->right VAL [a=2147483647, b=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L40] 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}] [L40] RET, EXPR min(n->right) VAL [a=2147483647, b=2147483647, min(n->right)=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L40] int c = min(n->right); [L41] COND TRUE b <= a && b <= c [L41] return b; VAL [\result=2147483647, a=2147483647, b=2147483647, c=2147483647, n={-1:0}, n={-1:0}] [L76] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L76] int a = min(t); [L77] int b; VAL [a=2147483647, b={2:0}, t={-1:0}, t={-1:0}] [L79] CALL, EXPR size(t) VAL [t={-1:0}] [L71] COND FALSE !(!t) [L72] EXPR t->left VAL [t={-1:0}, t={-1:0}, t->left={0:0}] [L72] CALL, EXPR size(t->left) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}] [L72] EXPR t->right VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L72] CALL, EXPR size(t->right) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] 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}] [L72] return size(t->left) + size(t->right) + 1; [L79] RET, EXPR size(t) VAL [a=2147483647, b={2:0}, size(t)=1, t={-1:0}, t={-1:0}] [L79] int n = size(t); [L80] CALL assume_cycle_if_not(n != 0) VAL [\old(cond)=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L80] RET assume_cycle_if_not(n != 0) VAL [a=2147483647, b={2:0}, n=1, t={-1:0}, t={-1:0}] [L81] 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}] [L81] 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}] [L82] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L60] COND FALSE !(!t) [L63] 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}] [L63] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L63] 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] [L63] i = tree_inorder(t->left, a, i) [L64] EXPR i++ [L64] EXPR t->data [L64] a[i++] = t->data [L65] 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}] [L65] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L65] 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] [L65] i = tree_inorder(t->right, a, i) [L66] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L82] 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}] [L83] 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] [L83] 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, 97 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.3s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 15.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 350 SDtfs, 574 SDslu, 1695 SDs, 0 SdLazy, 2248 SolverSat, 548 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 199 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 4 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 471 NumberOfCodeBlocks, 471 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 374 ConstructedInterpolants, 0 QuantifiedInterpolants, 71528 SizeOfPredicates, 16 NumberOfNonLiveVariables, 633 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 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...