/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:33:41,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:33:41,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:33:41,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:33:41,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:33:41,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:33:41,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:33:41,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:33:41,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:33:41,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:33:41,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:33:41,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:33:41,111 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:33:41,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:33:41,117 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:33:41,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:33:41,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:33:41,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:33:41,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:33:41,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:33:41,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:33:41,139 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:33:41,140 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:33:41,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:33:41,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:33:41,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:33:41,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:33:41,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:33:41,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:33:41,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:33:41,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:33:41,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:33:41,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:33:41,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:33:41,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:33:41,155 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:33:41,158 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:33:41,158 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:33:41,158 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:33:41,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:33:41,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:33:41,161 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:33:41,173 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:33:41,173 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:33:41,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:33:41,175 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:33:41,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:33:41,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:33:41,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:33:41,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:33:41,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:33:41,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:33:41,177 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:33:41,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:33:41,178 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:33:41,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:33:41,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:33:41,179 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:33:41,179 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:33:41,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:33:41,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:33:41,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:33:41,180 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:33:41,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:33:41,180 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 02:33:41,458 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:33:41,470 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:33:41,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:33:41,476 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:33:41,476 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:33:41,477 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter.c [2020-07-11 02:33:41,568 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d7c96d7e/ddb22db97eab463a9f578f78a6efce97/FLAGdb9c57363 [2020-07-11 02:33:42,084 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:33:42,085 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c [2020-07-11 02:33:42,094 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d7c96d7e/ddb22db97eab463a9f578f78a6efce97/FLAGdb9c57363 [2020-07-11 02:33:42,441 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d7c96d7e/ddb22db97eab463a9f578f78a6efce97 [2020-07-11 02:33:42,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:33:42,454 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:33:42,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:33:42,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:33:42,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:33:42,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:33:42" (1/1) ... [2020-07-11 02:33:42,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31bf9a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:33:42, skipping insertion in model container [2020-07-11 02:33:42,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:33:42" (1/1) ... [2020-07-11 02:33:42,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:33:42,492 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:33:42,710 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-11 02:33:42,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:33:42,747 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:33:42,772 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-11 02:33:42,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:33:42,902 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:33:42,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:33:42 WrapperNode [2020-07-11 02:33:42,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:33:42,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:33:42,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:33:42,903 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:33:42,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:33:42" (1/1) ... [2020-07-11 02:33:42,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:33:42" (1/1) ... [2020-07-11 02:33:42,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:33:42" (1/1) ... [2020-07-11 02:33:42,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:33:42" (1/1) ... [2020-07-11 02:33:42,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:33:42" (1/1) ... [2020-07-11 02:33:42,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:33:42" (1/1) ... [2020-07-11 02:33:43,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:33:42" (1/1) ... [2020-07-11 02:33:43,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:33:43,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:33:43,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:33:43,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:33:43,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:33:42" (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-11 02:33:43,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:33:43,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:33:43,074 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2020-07-11 02:33:43,074 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:33:43,074 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-07-11 02:33:43,074 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-07-11 02:33:43,074 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-07-11 02:33:43,074 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-07-11 02:33:43,075 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-07-11 02:33:43,075 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-07-11 02:33:43,080 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:33:43,081 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-11 02:33:43,081 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-11 02:33:43,081 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-11 02:33:43,081 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-11 02:33:43,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:33:43,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-11 02:33:43,081 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2020-07-11 02:33:43,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:33:43,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:33:43,082 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-07-11 02:33:43,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-11 02:33:43,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 02:33:43,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-11 02:33:43,083 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-07-11 02:33:43,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 02:33:43,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-11 02:33:43,083 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-07-11 02:33:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 02:33:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-07-11 02:33:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-07-11 02:33:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-07-11 02:33:43,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 02:33:43,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-11 02:33:43,086 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:33:43,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:33:43,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:33:44,123 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:33:44,123 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-11 02:33:44,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:33:44 BoogieIcfgContainer [2020-07-11 02:33:44,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:33:44,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:33:44,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:33:44,143 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:33:44,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:33:42" (1/3) ... [2020-07-11 02:33:44,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c70a0f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:33:44, skipping insertion in model container [2020-07-11 02:33:44,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:33:42" (2/3) ... [2020-07-11 02:33:44,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c70a0f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:33:44, skipping insertion in model container [2020-07-11 02:33:44,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:33:44" (3/3) ... [2020-07-11 02:33:44,149 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2020-07-11 02:33:44,164 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:33:44,175 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:33:44,195 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:33:44,229 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:33:44,229 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:33:44,229 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:33:44,230 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:33:44,230 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:33:44,230 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:33:44,231 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:33:44,231 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:33:44,261 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2020-07-11 02:33:44,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-11 02:33:44,287 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:33:44,292 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:33:44,293 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:33:44,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:33:44,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1657225032, now seen corresponding path program 1 times [2020-07-11 02:33:44,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:33:44,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1261193467] [2020-07-11 02:33:44,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:33:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:44,706 INFO L280 TraceCheckUtils]: 0: Hoare triple {247#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {209#true} is VALID [2020-07-11 02:33:44,707 INFO L280 TraceCheckUtils]: 1: Hoare triple {209#true} #valid := #valid[0 := 0]; {209#true} is VALID [2020-07-11 02:33:44,708 INFO L280 TraceCheckUtils]: 2: Hoare triple {209#true} assume 0 < #StackHeapBarrier; {209#true} is VALID [2020-07-11 02:33:44,710 INFO L280 TraceCheckUtils]: 3: Hoare triple {209#true} assume true; {209#true} is VALID [2020-07-11 02:33:44,710 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {209#true} {209#true} #303#return; {209#true} is VALID [2020-07-11 02:33:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:44,760 INFO L280 TraceCheckUtils]: 0: Hoare triple {248#(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; {209#true} is VALID [2020-07-11 02:33:44,761 INFO L280 TraceCheckUtils]: 1: Hoare triple {209#true} havoc #t~nondet1; {209#true} is VALID [2020-07-11 02:33:44,761 INFO L280 TraceCheckUtils]: 2: Hoare triple {209#true} #res.base, #res.offset := 0, 0; {209#true} is VALID [2020-07-11 02:33:44,761 INFO L280 TraceCheckUtils]: 3: Hoare triple {209#true} assume true; {209#true} is VALID [2020-07-11 02:33:44,762 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {209#true} {209#true} #261#return; {209#true} is VALID [2020-07-11 02:33:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:44,773 INFO L280 TraceCheckUtils]: 0: Hoare triple {209#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {209#true} is VALID [2020-07-11 02:33:44,773 INFO L280 TraceCheckUtils]: 1: Hoare triple {209#true} assume ~n.base == 0 && ~n.offset == 0; {209#true} is VALID [2020-07-11 02:33:44,774 INFO L280 TraceCheckUtils]: 2: Hoare triple {209#true} #res := 2147483647; {209#true} is VALID [2020-07-11 02:33:44,774 INFO L280 TraceCheckUtils]: 3: Hoare triple {209#true} assume true; {209#true} is VALID [2020-07-11 02:33:44,775 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {209#true} {209#true} #273#return; {209#true} is VALID [2020-07-11 02:33:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:44,803 INFO L280 TraceCheckUtils]: 0: Hoare triple {209#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {209#true} is VALID [2020-07-11 02:33:44,804 INFO L280 TraceCheckUtils]: 1: Hoare triple {209#true} assume ~t.base == 0 && ~t.offset == 0; {209#true} is VALID [2020-07-11 02:33:44,805 INFO L280 TraceCheckUtils]: 2: Hoare triple {209#true} #res := 0; {249#(= 0 |size_#res|)} is VALID [2020-07-11 02:33:44,806 INFO L280 TraceCheckUtils]: 3: Hoare triple {249#(= 0 |size_#res|)} assume true; {249#(= 0 |size_#res|)} is VALID [2020-07-11 02:33:44,808 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {249#(= 0 |size_#res|)} {209#true} #275#return; {231#(= 0 |task_#t~ret29|)} is VALID [2020-07-11 02:33:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:44,852 INFO L280 TraceCheckUtils]: 0: Hoare triple {209#true} ~cond := #in~cond; {250#(= assume_cycle_if_not_~cond |assume_cycle_if_not_#in~cond|)} is VALID [2020-07-11 02:33:44,854 INFO L280 TraceCheckUtils]: 1: Hoare triple {250#(= assume_cycle_if_not_~cond |assume_cycle_if_not_#in~cond|)} assume !(0 == ~cond); {251#(not (= 0 |assume_cycle_if_not_#in~cond|))} is VALID [2020-07-11 02:33:44,855 INFO L280 TraceCheckUtils]: 2: Hoare triple {251#(not (= 0 |assume_cycle_if_not_#in~cond|))} assume true; {251#(not (= 0 |assume_cycle_if_not_#in~cond|))} is VALID [2020-07-11 02:33:44,856 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {251#(not (= 0 |assume_cycle_if_not_#in~cond|))} {232#(= 0 task_~n~1)} #277#return; {210#false} is VALID [2020-07-11 02:33:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:44,878 INFO L280 TraceCheckUtils]: 0: Hoare triple {252#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {209#true} is VALID [2020-07-11 02:33:44,879 INFO L280 TraceCheckUtils]: 1: Hoare triple {209#true} assume true; {209#true} is VALID [2020-07-11 02:33:44,879 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {209#true} {210#false} #279#return; {210#false} is VALID [2020-07-11 02:33:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:44,929 INFO L280 TraceCheckUtils]: 0: Hoare triple {253#(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; {209#true} is VALID [2020-07-11 02:33:44,930 INFO L280 TraceCheckUtils]: 1: Hoare triple {209#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {209#true} is VALID [2020-07-11 02:33:44,930 INFO L280 TraceCheckUtils]: 2: Hoare triple {209#true} ~i := #in~i; {209#true} is VALID [2020-07-11 02:33:44,931 INFO L280 TraceCheckUtils]: 3: Hoare triple {209#true} assume ~t.base == 0 && ~t.offset == 0; {209#true} is VALID [2020-07-11 02:33:44,931 INFO L280 TraceCheckUtils]: 4: Hoare triple {209#true} #res := ~i; {209#true} is VALID [2020-07-11 02:33:44,931 INFO L280 TraceCheckUtils]: 5: Hoare triple {209#true} assume true; {209#true} is VALID [2020-07-11 02:33:44,932 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {209#true} {210#false} #281#return; {210#false} is VALID [2020-07-11 02:33:44,935 INFO L263 TraceCheckUtils]: 0: Hoare triple {209#true} call ULTIMATE.init(); {247#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:33:44,935 INFO L280 TraceCheckUtils]: 1: Hoare triple {247#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {209#true} is VALID [2020-07-11 02:33:44,935 INFO L280 TraceCheckUtils]: 2: Hoare triple {209#true} #valid := #valid[0 := 0]; {209#true} is VALID [2020-07-11 02:33:44,936 INFO L280 TraceCheckUtils]: 3: Hoare triple {209#true} assume 0 < #StackHeapBarrier; {209#true} is VALID [2020-07-11 02:33:44,936 INFO L280 TraceCheckUtils]: 4: Hoare triple {209#true} assume true; {209#true} is VALID [2020-07-11 02:33:44,937 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {209#true} {209#true} #303#return; {209#true} is VALID [2020-07-11 02:33:44,937 INFO L263 TraceCheckUtils]: 6: Hoare triple {209#true} call #t~ret42 := main(); {209#true} is VALID [2020-07-11 02:33:44,940 INFO L263 TraceCheckUtils]: 7: Hoare triple {209#true} call #t~ret41.base, #t~ret41.offset := nondet_tree(); {248#(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-11 02:33:44,940 INFO L280 TraceCheckUtils]: 8: Hoare triple {248#(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; {209#true} is VALID [2020-07-11 02:33:44,941 INFO L280 TraceCheckUtils]: 9: Hoare triple {209#true} havoc #t~nondet1; {209#true} is VALID [2020-07-11 02:33:44,941 INFO L280 TraceCheckUtils]: 10: Hoare triple {209#true} #res.base, #res.offset := 0, 0; {209#true} is VALID [2020-07-11 02:33:44,941 INFO L280 TraceCheckUtils]: 11: Hoare triple {209#true} assume true; {209#true} is VALID [2020-07-11 02:33:44,942 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {209#true} {209#true} #261#return; {209#true} is VALID [2020-07-11 02:33:44,942 INFO L263 TraceCheckUtils]: 13: Hoare triple {209#true} call task(#t~ret41.base, #t~ret41.offset); {209#true} is VALID [2020-07-11 02:33:44,942 INFO L280 TraceCheckUtils]: 14: Hoare triple {209#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {209#true} is VALID [2020-07-11 02:33:44,943 INFO L263 TraceCheckUtils]: 15: Hoare triple {209#true} call #t~ret28 := min(~t.base, ~t.offset); {209#true} is VALID [2020-07-11 02:33:44,944 INFO L280 TraceCheckUtils]: 16: Hoare triple {209#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {209#true} is VALID [2020-07-11 02:33:44,944 INFO L280 TraceCheckUtils]: 17: Hoare triple {209#true} assume ~n.base == 0 && ~n.offset == 0; {209#true} is VALID [2020-07-11 02:33:44,944 INFO L280 TraceCheckUtils]: 18: Hoare triple {209#true} #res := 2147483647; {209#true} is VALID [2020-07-11 02:33:44,945 INFO L280 TraceCheckUtils]: 19: Hoare triple {209#true} assume true; {209#true} is VALID [2020-07-11 02:33:44,945 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {209#true} {209#true} #273#return; {209#true} is VALID [2020-07-11 02:33:44,945 INFO L280 TraceCheckUtils]: 21: Hoare triple {209#true} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647; {209#true} is VALID [2020-07-11 02:33:44,946 INFO L280 TraceCheckUtils]: 22: Hoare triple {209#true} ~a~1 := #t~ret28; {209#true} is VALID [2020-07-11 02:33:44,946 INFO L280 TraceCheckUtils]: 23: Hoare triple {209#true} havoc #t~ret28; {209#true} is VALID [2020-07-11 02:33:44,946 INFO L280 TraceCheckUtils]: 24: Hoare triple {209#true} SUMMARY for call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); srcloc: L85 {209#true} is VALID [2020-07-11 02:33:44,947 INFO L263 TraceCheckUtils]: 25: Hoare triple {209#true} call #t~ret29 := size(~t.base, ~t.offset); {209#true} is VALID [2020-07-11 02:33:44,947 INFO L280 TraceCheckUtils]: 26: Hoare triple {209#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {209#true} is VALID [2020-07-11 02:33:44,950 INFO L280 TraceCheckUtils]: 27: Hoare triple {209#true} assume ~t.base == 0 && ~t.offset == 0; {209#true} is VALID [2020-07-11 02:33:44,952 INFO L280 TraceCheckUtils]: 28: Hoare triple {209#true} #res := 0; {249#(= 0 |size_#res|)} is VALID [2020-07-11 02:33:44,954 INFO L280 TraceCheckUtils]: 29: Hoare triple {249#(= 0 |size_#res|)} assume true; {249#(= 0 |size_#res|)} is VALID [2020-07-11 02:33:44,956 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {249#(= 0 |size_#res|)} {209#true} #275#return; {231#(= 0 |task_#t~ret29|)} is VALID [2020-07-11 02:33:44,957 INFO L280 TraceCheckUtils]: 31: Hoare triple {231#(= 0 |task_#t~ret29|)} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647; {231#(= 0 |task_#t~ret29|)} is VALID [2020-07-11 02:33:44,958 INFO L280 TraceCheckUtils]: 32: Hoare triple {231#(= 0 |task_#t~ret29|)} ~n~1 := #t~ret29; {232#(= 0 task_~n~1)} is VALID [2020-07-11 02:33:44,959 INFO L280 TraceCheckUtils]: 33: Hoare triple {232#(= 0 task_~n~1)} havoc #t~ret29; {232#(= 0 task_~n~1)} is VALID [2020-07-11 02:33:44,960 INFO L263 TraceCheckUtils]: 34: Hoare triple {232#(= 0 task_~n~1)} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {209#true} is VALID [2020-07-11 02:33:44,962 INFO L280 TraceCheckUtils]: 35: Hoare triple {209#true} ~cond := #in~cond; {250#(= assume_cycle_if_not_~cond |assume_cycle_if_not_#in~cond|)} is VALID [2020-07-11 02:33:44,963 INFO L280 TraceCheckUtils]: 36: Hoare triple {250#(= assume_cycle_if_not_~cond |assume_cycle_if_not_#in~cond|)} assume !(0 == ~cond); {251#(not (= 0 |assume_cycle_if_not_#in~cond|))} is VALID [2020-07-11 02:33:44,964 INFO L280 TraceCheckUtils]: 37: Hoare triple {251#(not (= 0 |assume_cycle_if_not_#in~cond|))} assume true; {251#(not (= 0 |assume_cycle_if_not_#in~cond|))} is VALID [2020-07-11 02:33:44,966 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {251#(not (= 0 |assume_cycle_if_not_#in~cond|))} {232#(= 0 task_~n~1)} #277#return; {210#false} is VALID [2020-07-11 02:33:44,967 INFO L280 TraceCheckUtils]: 39: Hoare triple {210#false} SUMMARY for call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(4 * ~n~1); srcloc: L88-1 {210#false} is VALID [2020-07-11 02:33:44,970 INFO L263 TraceCheckUtils]: 40: Hoare triple {210#false} call #Ultimate.meminit(#t~malloc30.base, #t~malloc30.offset, ~n~1, 4, 4 * ~n~1); {252#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-11 02:33:44,971 INFO L280 TraceCheckUtils]: 41: Hoare triple {252#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {209#true} is VALID [2020-07-11 02:33:44,971 INFO L280 TraceCheckUtils]: 42: Hoare triple {209#true} assume true; {209#true} is VALID [2020-07-11 02:33:44,971 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {209#true} {210#false} #279#return; {210#false} is VALID [2020-07-11 02:33:44,972 INFO L280 TraceCheckUtils]: 44: Hoare triple {210#false} ~x~0.base, ~x~0.offset := #t~malloc30.base, #t~malloc30.offset; {210#false} is VALID [2020-07-11 02:33:44,973 INFO L263 TraceCheckUtils]: 45: Hoare triple {210#false} call #t~ret31 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {253#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-11 02:33:44,974 INFO L280 TraceCheckUtils]: 46: Hoare triple {253#(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; {209#true} is VALID [2020-07-11 02:33:44,974 INFO L280 TraceCheckUtils]: 47: Hoare triple {209#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {209#true} is VALID [2020-07-11 02:33:44,975 INFO L280 TraceCheckUtils]: 48: Hoare triple {209#true} ~i := #in~i; {209#true} is VALID [2020-07-11 02:33:44,975 INFO L280 TraceCheckUtils]: 49: Hoare triple {209#true} assume ~t.base == 0 && ~t.offset == 0; {209#true} is VALID [2020-07-11 02:33:44,976 INFO L280 TraceCheckUtils]: 50: Hoare triple {209#true} #res := ~i; {209#true} is VALID [2020-07-11 02:33:44,976 INFO L280 TraceCheckUtils]: 51: Hoare triple {209#true} assume true; {209#true} is VALID [2020-07-11 02:33:44,977 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {209#true} {210#false} #281#return; {210#false} is VALID [2020-07-11 02:33:44,977 INFO L280 TraceCheckUtils]: 53: Hoare triple {210#false} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647; {210#false} is VALID [2020-07-11 02:33:44,977 INFO L280 TraceCheckUtils]: 54: Hoare triple {210#false} havoc #t~ret31; {210#false} is VALID [2020-07-11 02:33:44,978 INFO L280 TraceCheckUtils]: 55: Hoare triple {210#false} SUMMARY for call #t~mem32 := read~int(~x~0.base, ~x~0.offset, 4); srcloc: L91 {210#false} is VALID [2020-07-11 02:33:44,978 INFO L263 TraceCheckUtils]: 56: Hoare triple {210#false} call __VERIFIER_assert((if ~a~1 == #t~mem32 then 1 else 0)); {210#false} is VALID [2020-07-11 02:33:44,978 INFO L280 TraceCheckUtils]: 57: Hoare triple {210#false} ~cond := #in~cond; {210#false} is VALID [2020-07-11 02:33:44,979 INFO L280 TraceCheckUtils]: 58: Hoare triple {210#false} assume 0 == ~cond; {210#false} is VALID [2020-07-11 02:33:44,979 INFO L280 TraceCheckUtils]: 59: Hoare triple {210#false} assume !false; {210#false} is VALID [2020-07-11 02:33:44,992 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-11 02:33:44,993 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1261193467] [2020-07-11 02:33:44,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:33:44,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-11 02:33:44,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268814707] [2020-07-11 02:33:45,007 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2020-07-11 02:33:45,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:33:45,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 02:33:45,130 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:33:45,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 02:33:45,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:33:45,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 02:33:45,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-11 02:33:45,144 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 11 states. [2020-07-11 02:33:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:33:49,907 INFO L93 Difference]: Finished difference Result 366 states and 427 transitions. [2020-07-11 02:33:49,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 02:33:49,907 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2020-07-11 02:33:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:33:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:33:49,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 427 transitions. [2020-07-11 02:33:49,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:33:49,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 427 transitions. [2020-07-11 02:33:49,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 427 transitions. [2020-07-11 02:33:50,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:33:50,608 INFO L225 Difference]: With dead ends: 366 [2020-07-11 02:33:50,608 INFO L226 Difference]: Without dead ends: 210 [2020-07-11 02:33:50,615 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2020-07-11 02:33:50,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-07-11 02:33:51,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 196. [2020-07-11 02:33:51,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:33:51,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand 196 states. [2020-07-11 02:33:51,024 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 196 states. [2020-07-11 02:33:51,024 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 196 states. [2020-07-11 02:33:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:33:51,051 INFO L93 Difference]: Finished difference Result 210 states and 239 transitions. [2020-07-11 02:33:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 239 transitions. [2020-07-11 02:33:51,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:33:51,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:33:51,061 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 210 states. [2020-07-11 02:33:51,061 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 210 states. [2020-07-11 02:33:51,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:33:51,084 INFO L93 Difference]: Finished difference Result 210 states and 239 transitions. [2020-07-11 02:33:51,084 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 239 transitions. [2020-07-11 02:33:51,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:33:51,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:33:51,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:33:51,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:33:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-07-11 02:33:51,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 220 transitions. [2020-07-11 02:33:51,109 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 220 transitions. Word has length 60 [2020-07-11 02:33:51,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:33:51,109 INFO L479 AbstractCegarLoop]: Abstraction has 196 states and 220 transitions. [2020-07-11 02:33:51,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 02:33:51,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 196 states and 220 transitions. [2020-07-11 02:33:51,429 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:33:51,430 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 220 transitions. [2020-07-11 02:33:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-07-11 02:33:51,434 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:33:51,435 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:33:51,435 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:33:51,435 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:33:51,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:33:51,436 INFO L82 PathProgramCache]: Analyzing trace with hash -290171790, now seen corresponding path program 1 times [2020-07-11 02:33:51,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:33:51,436 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [150216184] [2020-07-11 02:33:51,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:33:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:51,555 INFO L280 TraceCheckUtils]: 0: Hoare triple {1874#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1815#true} is VALID [2020-07-11 02:33:51,555 INFO L280 TraceCheckUtils]: 1: Hoare triple {1815#true} #valid := #valid[0 := 0]; {1815#true} is VALID [2020-07-11 02:33:51,555 INFO L280 TraceCheckUtils]: 2: Hoare triple {1815#true} assume 0 < #StackHeapBarrier; {1815#true} is VALID [2020-07-11 02:33:51,555 INFO L280 TraceCheckUtils]: 3: Hoare triple {1815#true} assume true; {1815#true} is VALID [2020-07-11 02:33:51,556 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1815#true} {1815#true} #303#return; {1815#true} is VALID [2020-07-11 02:33:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:51,639 INFO L280 TraceCheckUtils]: 0: Hoare triple {1875#(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; {1815#true} is VALID [2020-07-11 02:33:51,640 INFO L280 TraceCheckUtils]: 1: Hoare triple {1815#true} havoc #t~nondet1; {1815#true} is VALID [2020-07-11 02:33:51,641 INFO L280 TraceCheckUtils]: 2: Hoare triple {1815#true} #res.base, #res.offset := 0, 0; {1876#(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-11 02:33:51,642 INFO L280 TraceCheckUtils]: 3: Hoare triple {1876#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1876#(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-11 02:33:51,647 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1876#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {1815#true} #261#return; {1827#(and (= 0 |main_#t~ret41.base|) (= 0 |main_#t~ret41.offset|))} is VALID [2020-07-11 02:33:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:51,656 INFO L280 TraceCheckUtils]: 0: Hoare triple {1815#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1815#true} is VALID [2020-07-11 02:33:51,656 INFO L280 TraceCheckUtils]: 1: Hoare triple {1815#true} assume ~n.base == 0 && ~n.offset == 0; {1815#true} is VALID [2020-07-11 02:33:51,656 INFO L280 TraceCheckUtils]: 2: Hoare triple {1815#true} #res := 2147483647; {1815#true} is VALID [2020-07-11 02:33:51,657 INFO L280 TraceCheckUtils]: 3: Hoare triple {1815#true} assume true; {1815#true} is VALID [2020-07-11 02:33:51,658 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1815#true} {1829#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #273#return; {1829#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-11 02:33:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:51,786 INFO L280 TraceCheckUtils]: 0: Hoare triple {1815#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1815#true} is VALID [2020-07-11 02:33:51,786 INFO L280 TraceCheckUtils]: 1: Hoare triple {1815#true} assume ~t.base == 0 && ~t.offset == 0; {1815#true} is VALID [2020-07-11 02:33:51,787 INFO L280 TraceCheckUtils]: 2: Hoare triple {1815#true} #res := 0; {1815#true} is VALID [2020-07-11 02:33:51,787 INFO L280 TraceCheckUtils]: 3: Hoare triple {1815#true} assume true; {1815#true} is VALID [2020-07-11 02:33:51,790 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1815#true} {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #299#return; {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:51,807 INFO L280 TraceCheckUtils]: 0: Hoare triple {1815#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1815#true} is VALID [2020-07-11 02:33:51,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {1815#true} assume ~t.base == 0 && ~t.offset == 0; {1815#true} is VALID [2020-07-11 02:33:51,807 INFO L280 TraceCheckUtils]: 2: Hoare triple {1815#true} #res := 0; {1815#true} is VALID [2020-07-11 02:33:51,808 INFO L280 TraceCheckUtils]: 3: Hoare triple {1815#true} assume true; {1815#true} is VALID [2020-07-11 02:33:51,814 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1815#true} {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #301#return; {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,820 INFO L280 TraceCheckUtils]: 0: Hoare triple {1815#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1877#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} is VALID [2020-07-11 02:33:51,825 INFO L280 TraceCheckUtils]: 1: Hoare triple {1877#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0 && ~t.offset == 0); {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,849 INFO L280 TraceCheckUtils]: 2: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} SUMMARY for call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); srcloc: L80 {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,849 INFO L263 TraceCheckUtils]: 3: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret25 := size(#t~mem24.base, #t~mem24.offset); {1815#true} is VALID [2020-07-11 02:33:51,850 INFO L280 TraceCheckUtils]: 4: Hoare triple {1815#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1815#true} is VALID [2020-07-11 02:33:51,850 INFO L280 TraceCheckUtils]: 5: Hoare triple {1815#true} assume ~t.base == 0 && ~t.offset == 0; {1815#true} is VALID [2020-07-11 02:33:51,850 INFO L280 TraceCheckUtils]: 6: Hoare triple {1815#true} #res := 0; {1815#true} is VALID [2020-07-11 02:33:51,851 INFO L280 TraceCheckUtils]: 7: Hoare triple {1815#true} assume true; {1815#true} is VALID [2020-07-11 02:33:51,864 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1815#true} {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #299#return; {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,866 INFO L280 TraceCheckUtils]: 9: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647; {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,867 INFO L280 TraceCheckUtils]: 10: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} SUMMARY for call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); srcloc: L80-3 {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,867 INFO L263 TraceCheckUtils]: 11: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret27 := size(#t~mem26.base, #t~mem26.offset); {1815#true} is VALID [2020-07-11 02:33:51,867 INFO L280 TraceCheckUtils]: 12: Hoare triple {1815#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1815#true} is VALID [2020-07-11 02:33:51,868 INFO L280 TraceCheckUtils]: 13: Hoare triple {1815#true} assume ~t.base == 0 && ~t.offset == 0; {1815#true} is VALID [2020-07-11 02:33:51,868 INFO L280 TraceCheckUtils]: 14: Hoare triple {1815#true} #res := 0; {1815#true} is VALID [2020-07-11 02:33:51,868 INFO L280 TraceCheckUtils]: 15: Hoare triple {1815#true} assume true; {1815#true} is VALID [2020-07-11 02:33:51,870 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1815#true} {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #301#return; {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,871 INFO L280 TraceCheckUtils]: 17: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647; {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,871 INFO L280 TraceCheckUtils]: 18: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #res := 1 + (#t~ret25 + #t~ret27); {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,872 INFO L280 TraceCheckUtils]: 19: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~mem24.base, #t~mem24.offset; {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,873 INFO L280 TraceCheckUtils]: 20: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~ret25; {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,873 INFO L280 TraceCheckUtils]: 21: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~ret27; {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,874 INFO L280 TraceCheckUtils]: 22: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~mem26.base, #t~mem26.offset; {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,875 INFO L280 TraceCheckUtils]: 23: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,876 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {1829#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #275#return; {1816#false} is VALID [2020-07-11 02:33:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:51,900 INFO L280 TraceCheckUtils]: 0: Hoare triple {1815#true} ~cond := #in~cond; {1815#true} is VALID [2020-07-11 02:33:51,901 INFO L280 TraceCheckUtils]: 1: Hoare triple {1815#true} assume !(0 == ~cond); {1815#true} is VALID [2020-07-11 02:33:51,901 INFO L280 TraceCheckUtils]: 2: Hoare triple {1815#true} assume true; {1815#true} is VALID [2020-07-11 02:33:51,902 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1815#true} {1816#false} #277#return; {1816#false} is VALID [2020-07-11 02:33:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:51,920 INFO L280 TraceCheckUtils]: 0: Hoare triple {1889#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1815#true} is VALID [2020-07-11 02:33:51,921 INFO L280 TraceCheckUtils]: 1: Hoare triple {1815#true} assume true; {1815#true} is VALID [2020-07-11 02:33:51,921 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1815#true} {1816#false} #279#return; {1816#false} is VALID [2020-07-11 02:33:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:51,947 INFO L280 TraceCheckUtils]: 0: Hoare triple {1890#(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; {1815#true} is VALID [2020-07-11 02:33:51,947 INFO L280 TraceCheckUtils]: 1: Hoare triple {1815#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1815#true} is VALID [2020-07-11 02:33:51,948 INFO L280 TraceCheckUtils]: 2: Hoare triple {1815#true} ~i := #in~i; {1815#true} is VALID [2020-07-11 02:33:51,948 INFO L280 TraceCheckUtils]: 3: Hoare triple {1815#true} assume ~t.base == 0 && ~t.offset == 0; {1815#true} is VALID [2020-07-11 02:33:51,948 INFO L280 TraceCheckUtils]: 4: Hoare triple {1815#true} #res := ~i; {1815#true} is VALID [2020-07-11 02:33:51,948 INFO L280 TraceCheckUtils]: 5: Hoare triple {1815#true} assume true; {1815#true} is VALID [2020-07-11 02:33:51,949 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1815#true} {1816#false} #281#return; {1816#false} is VALID [2020-07-11 02:33:51,950 INFO L263 TraceCheckUtils]: 0: Hoare triple {1815#true} call ULTIMATE.init(); {1874#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:33:51,950 INFO L280 TraceCheckUtils]: 1: Hoare triple {1874#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1815#true} is VALID [2020-07-11 02:33:51,950 INFO L280 TraceCheckUtils]: 2: Hoare triple {1815#true} #valid := #valid[0 := 0]; {1815#true} is VALID [2020-07-11 02:33:51,951 INFO L280 TraceCheckUtils]: 3: Hoare triple {1815#true} assume 0 < #StackHeapBarrier; {1815#true} is VALID [2020-07-11 02:33:51,951 INFO L280 TraceCheckUtils]: 4: Hoare triple {1815#true} assume true; {1815#true} is VALID [2020-07-11 02:33:51,951 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1815#true} {1815#true} #303#return; {1815#true} is VALID [2020-07-11 02:33:51,951 INFO L263 TraceCheckUtils]: 6: Hoare triple {1815#true} call #t~ret42 := main(); {1815#true} is VALID [2020-07-11 02:33:51,953 INFO L263 TraceCheckUtils]: 7: Hoare triple {1815#true} call #t~ret41.base, #t~ret41.offset := nondet_tree(); {1875#(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-11 02:33:51,953 INFO L280 TraceCheckUtils]: 8: Hoare triple {1875#(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; {1815#true} is VALID [2020-07-11 02:33:51,953 INFO L280 TraceCheckUtils]: 9: Hoare triple {1815#true} havoc #t~nondet1; {1815#true} is VALID [2020-07-11 02:33:51,954 INFO L280 TraceCheckUtils]: 10: Hoare triple {1815#true} #res.base, #res.offset := 0, 0; {1876#(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-11 02:33:51,955 INFO L280 TraceCheckUtils]: 11: Hoare triple {1876#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1876#(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-11 02:33:51,957 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1876#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {1815#true} #261#return; {1827#(and (= 0 |main_#t~ret41.base|) (= 0 |main_#t~ret41.offset|))} is VALID [2020-07-11 02:33:51,958 INFO L263 TraceCheckUtils]: 13: Hoare triple {1827#(and (= 0 |main_#t~ret41.base|) (= 0 |main_#t~ret41.offset|))} call task(#t~ret41.base, #t~ret41.offset); {1828#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} is VALID [2020-07-11 02:33:51,960 INFO L280 TraceCheckUtils]: 14: Hoare triple {1828#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1829#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-11 02:33:51,960 INFO L263 TraceCheckUtils]: 15: Hoare triple {1829#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret28 := min(~t.base, ~t.offset); {1815#true} is VALID [2020-07-11 02:33:51,960 INFO L280 TraceCheckUtils]: 16: Hoare triple {1815#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1815#true} is VALID [2020-07-11 02:33:51,960 INFO L280 TraceCheckUtils]: 17: Hoare triple {1815#true} assume ~n.base == 0 && ~n.offset == 0; {1815#true} is VALID [2020-07-11 02:33:51,961 INFO L280 TraceCheckUtils]: 18: Hoare triple {1815#true} #res := 2147483647; {1815#true} is VALID [2020-07-11 02:33:51,961 INFO L280 TraceCheckUtils]: 19: Hoare triple {1815#true} assume true; {1815#true} is VALID [2020-07-11 02:33:51,962 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1815#true} {1829#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #273#return; {1829#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-11 02:33:51,964 INFO L280 TraceCheckUtils]: 21: Hoare triple {1829#(and (= 0 task_~t.offset) (= 0 task_~t.base))} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647; {1829#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-11 02:33:51,965 INFO L280 TraceCheckUtils]: 22: Hoare triple {1829#(and (= 0 task_~t.offset) (= 0 task_~t.base))} ~a~1 := #t~ret28; {1829#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-11 02:33:51,966 INFO L280 TraceCheckUtils]: 23: Hoare triple {1829#(and (= 0 task_~t.offset) (= 0 task_~t.base))} havoc #t~ret28; {1829#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-11 02:33:51,967 INFO L280 TraceCheckUtils]: 24: Hoare triple {1829#(and (= 0 task_~t.offset) (= 0 task_~t.base))} SUMMARY for call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); srcloc: L85 {1829#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-11 02:33:51,967 INFO L263 TraceCheckUtils]: 25: Hoare triple {1829#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret29 := size(~t.base, ~t.offset); {1815#true} is VALID [2020-07-11 02:33:51,969 INFO L280 TraceCheckUtils]: 26: Hoare triple {1815#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1877#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} is VALID [2020-07-11 02:33:51,971 INFO L280 TraceCheckUtils]: 27: Hoare triple {1877#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0 && ~t.offset == 0); {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,972 INFO L280 TraceCheckUtils]: 28: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} SUMMARY for call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); srcloc: L80 {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,973 INFO L263 TraceCheckUtils]: 29: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret25 := size(#t~mem24.base, #t~mem24.offset); {1815#true} is VALID [2020-07-11 02:33:51,973 INFO L280 TraceCheckUtils]: 30: Hoare triple {1815#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1815#true} is VALID [2020-07-11 02:33:51,973 INFO L280 TraceCheckUtils]: 31: Hoare triple {1815#true} assume ~t.base == 0 && ~t.offset == 0; {1815#true} is VALID [2020-07-11 02:33:51,973 INFO L280 TraceCheckUtils]: 32: Hoare triple {1815#true} #res := 0; {1815#true} is VALID [2020-07-11 02:33:51,974 INFO L280 TraceCheckUtils]: 33: Hoare triple {1815#true} assume true; {1815#true} is VALID [2020-07-11 02:33:51,975 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1815#true} {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #299#return; {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,975 INFO L280 TraceCheckUtils]: 35: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647; {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,976 INFO L280 TraceCheckUtils]: 36: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} SUMMARY for call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); srcloc: L80-3 {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,976 INFO L263 TraceCheckUtils]: 37: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret27 := size(#t~mem26.base, #t~mem26.offset); {1815#true} is VALID [2020-07-11 02:33:51,977 INFO L280 TraceCheckUtils]: 38: Hoare triple {1815#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1815#true} is VALID [2020-07-11 02:33:51,977 INFO L280 TraceCheckUtils]: 39: Hoare triple {1815#true} assume ~t.base == 0 && ~t.offset == 0; {1815#true} is VALID [2020-07-11 02:33:51,977 INFO L280 TraceCheckUtils]: 40: Hoare triple {1815#true} #res := 0; {1815#true} is VALID [2020-07-11 02:33:51,977 INFO L280 TraceCheckUtils]: 41: Hoare triple {1815#true} assume true; {1815#true} is VALID [2020-07-11 02:33:51,978 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1815#true} {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #301#return; {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,979 INFO L280 TraceCheckUtils]: 43: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647; {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,980 INFO L280 TraceCheckUtils]: 44: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #res := 1 + (#t~ret25 + #t~ret27); {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,980 INFO L280 TraceCheckUtils]: 45: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~mem24.base, #t~mem24.offset; {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,981 INFO L280 TraceCheckUtils]: 46: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~ret25; {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,982 INFO L280 TraceCheckUtils]: 47: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~ret27; {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,982 INFO L280 TraceCheckUtils]: 48: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~mem26.base, #t~mem26.offset; {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,983 INFO L280 TraceCheckUtils]: 49: Hoare triple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-11 02:33:51,984 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {1878#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {1829#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #275#return; {1816#false} is VALID [2020-07-11 02:33:51,984 INFO L280 TraceCheckUtils]: 51: Hoare triple {1816#false} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647; {1816#false} is VALID [2020-07-11 02:33:51,984 INFO L280 TraceCheckUtils]: 52: Hoare triple {1816#false} ~n~1 := #t~ret29; {1816#false} is VALID [2020-07-11 02:33:51,985 INFO L280 TraceCheckUtils]: 53: Hoare triple {1816#false} havoc #t~ret29; {1816#false} is VALID [2020-07-11 02:33:51,985 INFO L263 TraceCheckUtils]: 54: Hoare triple {1816#false} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {1815#true} is VALID [2020-07-11 02:33:51,985 INFO L280 TraceCheckUtils]: 55: Hoare triple {1815#true} ~cond := #in~cond; {1815#true} is VALID [2020-07-11 02:33:51,985 INFO L280 TraceCheckUtils]: 56: Hoare triple {1815#true} assume !(0 == ~cond); {1815#true} is VALID [2020-07-11 02:33:51,986 INFO L280 TraceCheckUtils]: 57: Hoare triple {1815#true} assume true; {1815#true} is VALID [2020-07-11 02:33:51,986 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {1815#true} {1816#false} #277#return; {1816#false} is VALID [2020-07-11 02:33:51,986 INFO L280 TraceCheckUtils]: 59: Hoare triple {1816#false} SUMMARY for call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(4 * ~n~1); srcloc: L88-1 {1816#false} is VALID [2020-07-11 02:33:51,986 INFO L263 TraceCheckUtils]: 60: Hoare triple {1816#false} call #Ultimate.meminit(#t~malloc30.base, #t~malloc30.offset, ~n~1, 4, 4 * ~n~1); {1889#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-11 02:33:51,987 INFO L280 TraceCheckUtils]: 61: Hoare triple {1889#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1815#true} is VALID [2020-07-11 02:33:51,987 INFO L280 TraceCheckUtils]: 62: Hoare triple {1815#true} assume true; {1815#true} is VALID [2020-07-11 02:33:51,987 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {1815#true} {1816#false} #279#return; {1816#false} is VALID [2020-07-11 02:33:51,987 INFO L280 TraceCheckUtils]: 64: Hoare triple {1816#false} ~x~0.base, ~x~0.offset := #t~malloc30.base, #t~malloc30.offset; {1816#false} is VALID [2020-07-11 02:33:51,988 INFO L263 TraceCheckUtils]: 65: Hoare triple {1816#false} call #t~ret31 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {1890#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-11 02:33:51,988 INFO L280 TraceCheckUtils]: 66: Hoare triple {1890#(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; {1815#true} is VALID [2020-07-11 02:33:51,988 INFO L280 TraceCheckUtils]: 67: Hoare triple {1815#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1815#true} is VALID [2020-07-11 02:33:51,988 INFO L280 TraceCheckUtils]: 68: Hoare triple {1815#true} ~i := #in~i; {1815#true} is VALID [2020-07-11 02:33:51,989 INFO L280 TraceCheckUtils]: 69: Hoare triple {1815#true} assume ~t.base == 0 && ~t.offset == 0; {1815#true} is VALID [2020-07-11 02:33:51,989 INFO L280 TraceCheckUtils]: 70: Hoare triple {1815#true} #res := ~i; {1815#true} is VALID [2020-07-11 02:33:51,989 INFO L280 TraceCheckUtils]: 71: Hoare triple {1815#true} assume true; {1815#true} is VALID [2020-07-11 02:33:51,989 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {1815#true} {1816#false} #281#return; {1816#false} is VALID [2020-07-11 02:33:51,990 INFO L280 TraceCheckUtils]: 73: Hoare triple {1816#false} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647; {1816#false} is VALID [2020-07-11 02:33:51,990 INFO L280 TraceCheckUtils]: 74: Hoare triple {1816#false} havoc #t~ret31; {1816#false} is VALID [2020-07-11 02:33:51,990 INFO L280 TraceCheckUtils]: 75: Hoare triple {1816#false} SUMMARY for call #t~mem32 := read~int(~x~0.base, ~x~0.offset, 4); srcloc: L91 {1816#false} is VALID [2020-07-11 02:33:51,991 INFO L263 TraceCheckUtils]: 76: Hoare triple {1816#false} call __VERIFIER_assert((if ~a~1 == #t~mem32 then 1 else 0)); {1816#false} is VALID [2020-07-11 02:33:51,991 INFO L280 TraceCheckUtils]: 77: Hoare triple {1816#false} ~cond := #in~cond; {1816#false} is VALID [2020-07-11 02:33:51,991 INFO L280 TraceCheckUtils]: 78: Hoare triple {1816#false} assume 0 == ~cond; {1816#false} is VALID [2020-07-11 02:33:51,991 INFO L280 TraceCheckUtils]: 79: Hoare triple {1816#false} assume !false; {1816#false} is VALID [2020-07-11 02:33:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-11 02:33:52,004 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [150216184] [2020-07-11 02:33:52,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:33:52,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-11 02:33:52,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750920652] [2020-07-11 02:33:52,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 80 [2020-07-11 02:33:52,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:33:52,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-11 02:33:52,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:33:52,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-11 02:33:52,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:33:52,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-11 02:33:52,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-07-11 02:33:52,095 INFO L87 Difference]: Start difference. First operand 196 states and 220 transitions. Second operand 12 states. [2020-07-11 02:33:57,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:33:57,183 INFO L93 Difference]: Finished difference Result 354 states and 400 transitions. [2020-07-11 02:33:57,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-11 02:33:57,184 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 80 [2020-07-11 02:33:57,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:33:57,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 02:33:57,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 396 transitions. [2020-07-11 02:33:57,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 02:33:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 396 transitions. [2020-07-11 02:33:57,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 396 transitions. [2020-07-11 02:33:57,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:33:57,773 INFO L225 Difference]: With dead ends: 354 [2020-07-11 02:33:57,773 INFO L226 Difference]: Without dead ends: 209 [2020-07-11 02:33:57,776 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2020-07-11 02:33:57,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-07-11 02:33:58,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 198. [2020-07-11 02:33:58,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:33:58,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand 198 states. [2020-07-11 02:33:58,178 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 198 states. [2020-07-11 02:33:58,178 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 198 states. [2020-07-11 02:33:58,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:33:58,190 INFO L93 Difference]: Finished difference Result 209 states and 237 transitions. [2020-07-11 02:33:58,190 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 237 transitions. [2020-07-11 02:33:58,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:33:58,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:33:58,192 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand 209 states. [2020-07-11 02:33:58,192 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 209 states. [2020-07-11 02:33:58,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:33:58,204 INFO L93 Difference]: Finished difference Result 209 states and 237 transitions. [2020-07-11 02:33:58,204 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 237 transitions. [2020-07-11 02:33:58,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:33:58,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:33:58,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:33:58,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:33:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-07-11 02:33:58,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 223 transitions. [2020-07-11 02:33:58,216 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 223 transitions. Word has length 80 [2020-07-11 02:33:58,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:33:58,217 INFO L479 AbstractCegarLoop]: Abstraction has 198 states and 223 transitions. [2020-07-11 02:33:58,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-11 02:33:58,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 198 states and 223 transitions. [2020-07-11 02:33:58,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:33:58,580 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2020-07-11 02:33:58,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-07-11 02:33:58,585 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:33:58,585 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 02:33:58,585 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:33:58,586 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:33:58,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:33:58,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1366806748, now seen corresponding path program 1 times [2020-07-11 02:33:58,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:33:58,587 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1618580459] [2020-07-11 02:33:58,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:33:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:58,722 INFO L280 TraceCheckUtils]: 0: Hoare triple {3513#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3433#true} is VALID [2020-07-11 02:33:58,722 INFO L280 TraceCheckUtils]: 1: Hoare triple {3433#true} #valid := #valid[0 := 0]; {3433#true} is VALID [2020-07-11 02:33:58,722 INFO L280 TraceCheckUtils]: 2: Hoare triple {3433#true} assume 0 < #StackHeapBarrier; {3433#true} is VALID [2020-07-11 02:33:58,722 INFO L280 TraceCheckUtils]: 3: Hoare triple {3433#true} assume true; {3433#true} is VALID [2020-07-11 02:33:58,722 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3433#true} {3433#true} #303#return; {3433#true} is VALID [2020-07-11 02:33:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:58,908 INFO L280 TraceCheckUtils]: 0: Hoare triple {3514#(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; {3433#true} is VALID [2020-07-11 02:33:58,909 INFO L280 TraceCheckUtils]: 1: Hoare triple {3433#true} havoc #t~nondet1; {3433#true} is VALID [2020-07-11 02:33:58,909 INFO L280 TraceCheckUtils]: 2: Hoare triple {3433#true} #res.base, #res.offset := 0, 0; {3433#true} is VALID [2020-07-11 02:33:58,909 INFO L280 TraceCheckUtils]: 3: Hoare triple {3433#true} assume true; {3433#true} is VALID [2020-07-11 02:33:58,910 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3433#true} {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #269#return; {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:33:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:58,926 INFO L280 TraceCheckUtils]: 0: Hoare triple {3514#(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; {3433#true} is VALID [2020-07-11 02:33:58,927 INFO L280 TraceCheckUtils]: 1: Hoare triple {3433#true} havoc #t~nondet1; {3433#true} is VALID [2020-07-11 02:33:58,927 INFO L280 TraceCheckUtils]: 2: Hoare triple {3433#true} #res.base, #res.offset := 0, 0; {3433#true} is VALID [2020-07-11 02:33:58,927 INFO L280 TraceCheckUtils]: 3: Hoare triple {3433#true} assume true; {3433#true} is VALID [2020-07-11 02:33:58,928 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3433#true} {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #271#return; {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:33:58,928 INFO L280 TraceCheckUtils]: 0: Hoare triple {3514#(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); {3433#true} is VALID [2020-07-11 02:33:58,928 INFO L280 TraceCheckUtils]: 1: Hoare triple {3433#true} havoc #t~nondet1; {3433#true} is VALID [2020-07-11 02:33:58,929 INFO L280 TraceCheckUtils]: 2: Hoare triple {3433#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L26 {3515#(or (< 0 |nondet_tree_#t~malloc2.base|) (<= (+ |nondet_tree_#t~malloc2.base| 1) 0))} is VALID [2020-07-11 02:33:58,930 INFO L280 TraceCheckUtils]: 3: Hoare triple {3515#(or (< 0 |nondet_tree_#t~malloc2.base|) (<= (+ |nondet_tree_#t~malloc2.base| 1) 0))} ~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset; {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:33:58,931 INFO L280 TraceCheckUtils]: 4: Hoare triple {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:33:58,931 INFO L280 TraceCheckUtils]: 5: Hoare triple {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} SUMMARY for call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4); srcloc: L27-1 {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:33:58,938 INFO L280 TraceCheckUtils]: 6: Hoare triple {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} havoc #t~nondet3; {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:33:58,939 INFO L263 TraceCheckUtils]: 7: Hoare triple {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {3514#(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-11 02:33:58,939 INFO L280 TraceCheckUtils]: 8: Hoare triple {3514#(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; {3433#true} is VALID [2020-07-11 02:33:58,939 INFO L280 TraceCheckUtils]: 9: Hoare triple {3433#true} havoc #t~nondet1; {3433#true} is VALID [2020-07-11 02:33:58,939 INFO L280 TraceCheckUtils]: 10: Hoare triple {3433#true} #res.base, #res.offset := 0, 0; {3433#true} is VALID [2020-07-11 02:33:58,939 INFO L280 TraceCheckUtils]: 11: Hoare triple {3433#true} assume true; {3433#true} is VALID [2020-07-11 02:33:58,940 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {3433#true} {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #269#return; {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:33:58,941 INFO L280 TraceCheckUtils]: 13: Hoare triple {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} SUMMARY for call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4); srcloc: L28-1 {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:33:58,941 INFO L280 TraceCheckUtils]: 14: Hoare triple {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} havoc #t~ret4.base, #t~ret4.offset; {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:33:58,942 INFO L263 TraceCheckUtils]: 15: Hoare triple {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {3514#(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-11 02:33:58,942 INFO L280 TraceCheckUtils]: 16: Hoare triple {3514#(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; {3433#true} is VALID [2020-07-11 02:33:58,943 INFO L280 TraceCheckUtils]: 17: Hoare triple {3433#true} havoc #t~nondet1; {3433#true} is VALID [2020-07-11 02:33:58,943 INFO L280 TraceCheckUtils]: 18: Hoare triple {3433#true} #res.base, #res.offset := 0, 0; {3433#true} is VALID [2020-07-11 02:33:58,943 INFO L280 TraceCheckUtils]: 19: Hoare triple {3433#true} assume true; {3433#true} is VALID [2020-07-11 02:33:58,944 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3433#true} {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #271#return; {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:33:58,944 INFO L280 TraceCheckUtils]: 21: Hoare triple {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} SUMMARY for call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4); srcloc: L29-1 {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:33:58,945 INFO L280 TraceCheckUtils]: 22: Hoare triple {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} havoc #t~ret5.base, #t~ret5.offset; {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:33:58,945 INFO L280 TraceCheckUtils]: 23: Hoare triple {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #res.base, #res.offset := ~n~0.base, ~n~0.offset; {3527#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-11 02:33:58,946 INFO L280 TraceCheckUtils]: 24: Hoare triple {3527#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} assume true; {3527#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-11 02:33:58,946 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {3527#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} {3433#true} #261#return; {3466#(not (= 0 |main_#t~ret41.base|))} is VALID [2020-07-11 02:33:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:58,988 INFO L280 TraceCheckUtils]: 0: Hoare triple {3433#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {3528#(= min_~n.base |min_#in~n.base|)} is VALID [2020-07-11 02:33:58,989 INFO L280 TraceCheckUtils]: 1: Hoare triple {3528#(= min_~n.base |min_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0; {3529#(= 0 |min_#in~n.base|)} is VALID [2020-07-11 02:33:58,990 INFO L280 TraceCheckUtils]: 2: Hoare triple {3529#(= 0 |min_#in~n.base|)} #res := 2147483647; {3529#(= 0 |min_#in~n.base|)} is VALID [2020-07-11 02:33:58,990 INFO L280 TraceCheckUtils]: 3: Hoare triple {3529#(= 0 |min_#in~n.base|)} assume true; {3529#(= 0 |min_#in~n.base|)} is VALID [2020-07-11 02:33:58,991 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3529#(= 0 |min_#in~n.base|)} {3468#(not (= 0 task_~t.base))} #273#return; {3434#false} is VALID [2020-07-11 02:33:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:59,012 INFO L280 TraceCheckUtils]: 0: Hoare triple {3433#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3433#true} is VALID [2020-07-11 02:33:59,013 INFO L280 TraceCheckUtils]: 1: Hoare triple {3433#true} assume ~t.base == 0 && ~t.offset == 0; {3433#true} is VALID [2020-07-11 02:33:59,013 INFO L280 TraceCheckUtils]: 2: Hoare triple {3433#true} #res := 0; {3433#true} is VALID [2020-07-11 02:33:59,013 INFO L280 TraceCheckUtils]: 3: Hoare triple {3433#true} assume true; {3433#true} is VALID [2020-07-11 02:33:59,013 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3433#true} {3433#true} #299#return; {3433#true} is VALID [2020-07-11 02:33:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:59,019 INFO L280 TraceCheckUtils]: 0: Hoare triple {3433#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3433#true} is VALID [2020-07-11 02:33:59,020 INFO L280 TraceCheckUtils]: 1: Hoare triple {3433#true} assume ~t.base == 0 && ~t.offset == 0; {3433#true} is VALID [2020-07-11 02:33:59,020 INFO L280 TraceCheckUtils]: 2: Hoare triple {3433#true} #res := 0; {3433#true} is VALID [2020-07-11 02:33:59,020 INFO L280 TraceCheckUtils]: 3: Hoare triple {3433#true} assume true; {3433#true} is VALID [2020-07-11 02:33:59,021 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3433#true} {3433#true} #301#return; {3433#true} is VALID [2020-07-11 02:33:59,021 INFO L280 TraceCheckUtils]: 0: Hoare triple {3433#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3433#true} is VALID [2020-07-11 02:33:59,021 INFO L280 TraceCheckUtils]: 1: Hoare triple {3433#true} assume !(~t.base == 0 && ~t.offset == 0); {3433#true} is VALID [2020-07-11 02:33:59,021 INFO L280 TraceCheckUtils]: 2: Hoare triple {3433#true} SUMMARY for call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); srcloc: L80 {3433#true} is VALID [2020-07-11 02:33:59,022 INFO L263 TraceCheckUtils]: 3: Hoare triple {3433#true} call #t~ret25 := size(#t~mem24.base, #t~mem24.offset); {3433#true} is VALID [2020-07-11 02:33:59,022 INFO L280 TraceCheckUtils]: 4: Hoare triple {3433#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3433#true} is VALID [2020-07-11 02:33:59,022 INFO L280 TraceCheckUtils]: 5: Hoare triple {3433#true} assume ~t.base == 0 && ~t.offset == 0; {3433#true} is VALID [2020-07-11 02:33:59,022 INFO L280 TraceCheckUtils]: 6: Hoare triple {3433#true} #res := 0; {3433#true} is VALID [2020-07-11 02:33:59,023 INFO L280 TraceCheckUtils]: 7: Hoare triple {3433#true} assume true; {3433#true} is VALID [2020-07-11 02:33:59,023 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {3433#true} {3433#true} #299#return; {3433#true} is VALID [2020-07-11 02:33:59,023 INFO L280 TraceCheckUtils]: 9: Hoare triple {3433#true} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647; {3433#true} is VALID [2020-07-11 02:33:59,023 INFO L280 TraceCheckUtils]: 10: Hoare triple {3433#true} SUMMARY for call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); srcloc: L80-3 {3433#true} is VALID [2020-07-11 02:33:59,024 INFO L263 TraceCheckUtils]: 11: Hoare triple {3433#true} call #t~ret27 := size(#t~mem26.base, #t~mem26.offset); {3433#true} is VALID [2020-07-11 02:33:59,024 INFO L280 TraceCheckUtils]: 12: Hoare triple {3433#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3433#true} is VALID [2020-07-11 02:33:59,024 INFO L280 TraceCheckUtils]: 13: Hoare triple {3433#true} assume ~t.base == 0 && ~t.offset == 0; {3433#true} is VALID [2020-07-11 02:33:59,024 INFO L280 TraceCheckUtils]: 14: Hoare triple {3433#true} #res := 0; {3433#true} is VALID [2020-07-11 02:33:59,025 INFO L280 TraceCheckUtils]: 15: Hoare triple {3433#true} assume true; {3433#true} is VALID [2020-07-11 02:33:59,025 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3433#true} {3433#true} #301#return; {3433#true} is VALID [2020-07-11 02:33:59,025 INFO L280 TraceCheckUtils]: 17: Hoare triple {3433#true} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647; {3433#true} is VALID [2020-07-11 02:33:59,025 INFO L280 TraceCheckUtils]: 18: Hoare triple {3433#true} #res := 1 + (#t~ret25 + #t~ret27); {3433#true} is VALID [2020-07-11 02:33:59,026 INFO L280 TraceCheckUtils]: 19: Hoare triple {3433#true} havoc #t~mem24.base, #t~mem24.offset; {3433#true} is VALID [2020-07-11 02:33:59,026 INFO L280 TraceCheckUtils]: 20: Hoare triple {3433#true} havoc #t~ret25; {3433#true} is VALID [2020-07-11 02:33:59,026 INFO L280 TraceCheckUtils]: 21: Hoare triple {3433#true} havoc #t~ret27; {3433#true} is VALID [2020-07-11 02:33:59,026 INFO L280 TraceCheckUtils]: 22: Hoare triple {3433#true} havoc #t~mem26.base, #t~mem26.offset; {3433#true} is VALID [2020-07-11 02:33:59,027 INFO L280 TraceCheckUtils]: 23: Hoare triple {3433#true} assume true; {3433#true} is VALID [2020-07-11 02:33:59,027 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3433#true} {3434#false} #275#return; {3434#false} is VALID [2020-07-11 02:33:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:59,033 INFO L280 TraceCheckUtils]: 0: Hoare triple {3433#true} ~cond := #in~cond; {3433#true} is VALID [2020-07-11 02:33:59,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {3433#true} assume !(0 == ~cond); {3433#true} is VALID [2020-07-11 02:33:59,033 INFO L280 TraceCheckUtils]: 2: Hoare triple {3433#true} assume true; {3433#true} is VALID [2020-07-11 02:33:59,033 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3433#true} {3434#false} #277#return; {3434#false} is VALID [2020-07-11 02:33:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:59,067 INFO L280 TraceCheckUtils]: 0: Hoare triple {3540#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3433#true} is VALID [2020-07-11 02:33:59,068 INFO L280 TraceCheckUtils]: 1: Hoare triple {3433#true} assume true; {3433#true} is VALID [2020-07-11 02:33:59,068 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3433#true} {3434#false} #279#return; {3434#false} is VALID [2020-07-11 02:33:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:33:59,094 INFO L280 TraceCheckUtils]: 0: Hoare triple {3541#(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; {3433#true} is VALID [2020-07-11 02:33:59,095 INFO L280 TraceCheckUtils]: 1: Hoare triple {3433#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {3433#true} is VALID [2020-07-11 02:33:59,095 INFO L280 TraceCheckUtils]: 2: Hoare triple {3433#true} ~i := #in~i; {3433#true} is VALID [2020-07-11 02:33:59,095 INFO L280 TraceCheckUtils]: 3: Hoare triple {3433#true} assume ~t.base == 0 && ~t.offset == 0; {3433#true} is VALID [2020-07-11 02:33:59,095 INFO L280 TraceCheckUtils]: 4: Hoare triple {3433#true} #res := ~i; {3433#true} is VALID [2020-07-11 02:33:59,096 INFO L280 TraceCheckUtils]: 5: Hoare triple {3433#true} assume true; {3433#true} is VALID [2020-07-11 02:33:59,096 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {3433#true} {3434#false} #281#return; {3434#false} is VALID [2020-07-11 02:33:59,098 INFO L263 TraceCheckUtils]: 0: Hoare triple {3433#true} call ULTIMATE.init(); {3513#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:33:59,098 INFO L280 TraceCheckUtils]: 1: Hoare triple {3513#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3433#true} is VALID [2020-07-11 02:33:59,098 INFO L280 TraceCheckUtils]: 2: Hoare triple {3433#true} #valid := #valid[0 := 0]; {3433#true} is VALID [2020-07-11 02:33:59,099 INFO L280 TraceCheckUtils]: 3: Hoare triple {3433#true} assume 0 < #StackHeapBarrier; {3433#true} is VALID [2020-07-11 02:33:59,099 INFO L280 TraceCheckUtils]: 4: Hoare triple {3433#true} assume true; {3433#true} is VALID [2020-07-11 02:33:59,099 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3433#true} {3433#true} #303#return; {3433#true} is VALID [2020-07-11 02:33:59,099 INFO L263 TraceCheckUtils]: 6: Hoare triple {3433#true} call #t~ret42 := main(); {3433#true} is VALID [2020-07-11 02:33:59,110 INFO L263 TraceCheckUtils]: 7: Hoare triple {3433#true} call #t~ret41.base, #t~ret41.offset := nondet_tree(); {3514#(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-11 02:33:59,110 INFO L280 TraceCheckUtils]: 8: Hoare triple {3514#(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); {3433#true} is VALID [2020-07-11 02:33:59,110 INFO L280 TraceCheckUtils]: 9: Hoare triple {3433#true} havoc #t~nondet1; {3433#true} is VALID [2020-07-11 02:33:59,111 INFO L280 TraceCheckUtils]: 10: Hoare triple {3433#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L26 {3515#(or (< 0 |nondet_tree_#t~malloc2.base|) (<= (+ |nondet_tree_#t~malloc2.base| 1) 0))} is VALID [2020-07-11 02:33:59,112 INFO L280 TraceCheckUtils]: 11: Hoare triple {3515#(or (< 0 |nondet_tree_#t~malloc2.base|) (<= (+ |nondet_tree_#t~malloc2.base| 1) 0))} ~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset; {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:33:59,112 INFO L280 TraceCheckUtils]: 12: Hoare triple {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:33:59,113 INFO L280 TraceCheckUtils]: 13: Hoare triple {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} SUMMARY for call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4); srcloc: L27-1 {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:33:59,113 INFO L280 TraceCheckUtils]: 14: Hoare triple {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} havoc #t~nondet3; {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:33:59,114 INFO L263 TraceCheckUtils]: 15: Hoare triple {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {3514#(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-11 02:33:59,114 INFO L280 TraceCheckUtils]: 16: Hoare triple {3514#(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; {3433#true} is VALID [2020-07-11 02:33:59,114 INFO L280 TraceCheckUtils]: 17: Hoare triple {3433#true} havoc #t~nondet1; {3433#true} is VALID [2020-07-11 02:33:59,114 INFO L280 TraceCheckUtils]: 18: Hoare triple {3433#true} #res.base, #res.offset := 0, 0; {3433#true} is VALID [2020-07-11 02:33:59,115 INFO L280 TraceCheckUtils]: 19: Hoare triple {3433#true} assume true; {3433#true} is VALID [2020-07-11 02:33:59,115 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3433#true} {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #269#return; {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:33:59,116 INFO L280 TraceCheckUtils]: 21: Hoare triple {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} SUMMARY for call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4); srcloc: L28-1 {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:33:59,116 INFO L280 TraceCheckUtils]: 22: Hoare triple {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} havoc #t~ret4.base, #t~ret4.offset; {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:33:59,117 INFO L263 TraceCheckUtils]: 23: Hoare triple {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {3514#(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-11 02:33:59,117 INFO L280 TraceCheckUtils]: 24: Hoare triple {3514#(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; {3433#true} is VALID [2020-07-11 02:33:59,117 INFO L280 TraceCheckUtils]: 25: Hoare triple {3433#true} havoc #t~nondet1; {3433#true} is VALID [2020-07-11 02:33:59,118 INFO L280 TraceCheckUtils]: 26: Hoare triple {3433#true} #res.base, #res.offset := 0, 0; {3433#true} is VALID [2020-07-11 02:33:59,118 INFO L280 TraceCheckUtils]: 27: Hoare triple {3433#true} assume true; {3433#true} is VALID [2020-07-11 02:33:59,120 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3433#true} {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #271#return; {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:33:59,120 INFO L280 TraceCheckUtils]: 29: Hoare triple {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} SUMMARY for call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4); srcloc: L29-1 {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:33:59,121 INFO L280 TraceCheckUtils]: 30: Hoare triple {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} havoc #t~ret5.base, #t~ret5.offset; {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:33:59,121 INFO L280 TraceCheckUtils]: 31: Hoare triple {3516#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #res.base, #res.offset := ~n~0.base, ~n~0.offset; {3527#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-11 02:33:59,122 INFO L280 TraceCheckUtils]: 32: Hoare triple {3527#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} assume true; {3527#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-11 02:33:59,122 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {3527#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} {3433#true} #261#return; {3466#(not (= 0 |main_#t~ret41.base|))} is VALID [2020-07-11 02:33:59,123 INFO L263 TraceCheckUtils]: 34: Hoare triple {3466#(not (= 0 |main_#t~ret41.base|))} call task(#t~ret41.base, #t~ret41.offset); {3467#(not (= |task_#in~t.base| 0))} is VALID [2020-07-11 02:33:59,123 INFO L280 TraceCheckUtils]: 35: Hoare triple {3467#(not (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3468#(not (= 0 task_~t.base))} is VALID [2020-07-11 02:33:59,124 INFO L263 TraceCheckUtils]: 36: Hoare triple {3468#(not (= 0 task_~t.base))} call #t~ret28 := min(~t.base, ~t.offset); {3433#true} is VALID [2020-07-11 02:33:59,124 INFO L280 TraceCheckUtils]: 37: Hoare triple {3433#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {3528#(= min_~n.base |min_#in~n.base|)} is VALID [2020-07-11 02:33:59,125 INFO L280 TraceCheckUtils]: 38: Hoare triple {3528#(= min_~n.base |min_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0; {3529#(= 0 |min_#in~n.base|)} is VALID [2020-07-11 02:33:59,125 INFO L280 TraceCheckUtils]: 39: Hoare triple {3529#(= 0 |min_#in~n.base|)} #res := 2147483647; {3529#(= 0 |min_#in~n.base|)} is VALID [2020-07-11 02:33:59,125 INFO L280 TraceCheckUtils]: 40: Hoare triple {3529#(= 0 |min_#in~n.base|)} assume true; {3529#(= 0 |min_#in~n.base|)} is VALID [2020-07-11 02:33:59,126 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {3529#(= 0 |min_#in~n.base|)} {3468#(not (= 0 task_~t.base))} #273#return; {3434#false} is VALID [2020-07-11 02:33:59,126 INFO L280 TraceCheckUtils]: 42: Hoare triple {3434#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647; {3434#false} is VALID [2020-07-11 02:33:59,126 INFO L280 TraceCheckUtils]: 43: Hoare triple {3434#false} ~a~1 := #t~ret28; {3434#false} is VALID [2020-07-11 02:33:59,127 INFO L280 TraceCheckUtils]: 44: Hoare triple {3434#false} havoc #t~ret28; {3434#false} is VALID [2020-07-11 02:33:59,127 INFO L280 TraceCheckUtils]: 45: Hoare triple {3434#false} SUMMARY for call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); srcloc: L85 {3434#false} is VALID [2020-07-11 02:33:59,127 INFO L263 TraceCheckUtils]: 46: Hoare triple {3434#false} call #t~ret29 := size(~t.base, ~t.offset); {3433#true} is VALID [2020-07-11 02:33:59,127 INFO L280 TraceCheckUtils]: 47: Hoare triple {3433#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3433#true} is VALID [2020-07-11 02:33:59,127 INFO L280 TraceCheckUtils]: 48: Hoare triple {3433#true} assume !(~t.base == 0 && ~t.offset == 0); {3433#true} is VALID [2020-07-11 02:33:59,128 INFO L280 TraceCheckUtils]: 49: Hoare triple {3433#true} SUMMARY for call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); srcloc: L80 {3433#true} is VALID [2020-07-11 02:33:59,128 INFO L263 TraceCheckUtils]: 50: Hoare triple {3433#true} call #t~ret25 := size(#t~mem24.base, #t~mem24.offset); {3433#true} is VALID [2020-07-11 02:33:59,128 INFO L280 TraceCheckUtils]: 51: Hoare triple {3433#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3433#true} is VALID [2020-07-11 02:33:59,128 INFO L280 TraceCheckUtils]: 52: Hoare triple {3433#true} assume ~t.base == 0 && ~t.offset == 0; {3433#true} is VALID [2020-07-11 02:33:59,129 INFO L280 TraceCheckUtils]: 53: Hoare triple {3433#true} #res := 0; {3433#true} is VALID [2020-07-11 02:33:59,129 INFO L280 TraceCheckUtils]: 54: Hoare triple {3433#true} assume true; {3433#true} is VALID [2020-07-11 02:33:59,129 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {3433#true} {3433#true} #299#return; {3433#true} is VALID [2020-07-11 02:33:59,129 INFO L280 TraceCheckUtils]: 56: Hoare triple {3433#true} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647; {3433#true} is VALID [2020-07-11 02:33:59,130 INFO L280 TraceCheckUtils]: 57: Hoare triple {3433#true} SUMMARY for call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); srcloc: L80-3 {3433#true} is VALID [2020-07-11 02:33:59,130 INFO L263 TraceCheckUtils]: 58: Hoare triple {3433#true} call #t~ret27 := size(#t~mem26.base, #t~mem26.offset); {3433#true} is VALID [2020-07-11 02:33:59,130 INFO L280 TraceCheckUtils]: 59: Hoare triple {3433#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {3433#true} is VALID [2020-07-11 02:33:59,130 INFO L280 TraceCheckUtils]: 60: Hoare triple {3433#true} assume ~t.base == 0 && ~t.offset == 0; {3433#true} is VALID [2020-07-11 02:33:59,131 INFO L280 TraceCheckUtils]: 61: Hoare triple {3433#true} #res := 0; {3433#true} is VALID [2020-07-11 02:33:59,131 INFO L280 TraceCheckUtils]: 62: Hoare triple {3433#true} assume true; {3433#true} is VALID [2020-07-11 02:33:59,131 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {3433#true} {3433#true} #301#return; {3433#true} is VALID [2020-07-11 02:33:59,131 INFO L280 TraceCheckUtils]: 64: Hoare triple {3433#true} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647; {3433#true} is VALID [2020-07-11 02:33:59,131 INFO L280 TraceCheckUtils]: 65: Hoare triple {3433#true} #res := 1 + (#t~ret25 + #t~ret27); {3433#true} is VALID [2020-07-11 02:33:59,131 INFO L280 TraceCheckUtils]: 66: Hoare triple {3433#true} havoc #t~mem24.base, #t~mem24.offset; {3433#true} is VALID [2020-07-11 02:33:59,131 INFO L280 TraceCheckUtils]: 67: Hoare triple {3433#true} havoc #t~ret25; {3433#true} is VALID [2020-07-11 02:33:59,132 INFO L280 TraceCheckUtils]: 68: Hoare triple {3433#true} havoc #t~ret27; {3433#true} is VALID [2020-07-11 02:33:59,132 INFO L280 TraceCheckUtils]: 69: Hoare triple {3433#true} havoc #t~mem26.base, #t~mem26.offset; {3433#true} is VALID [2020-07-11 02:33:59,132 INFO L280 TraceCheckUtils]: 70: Hoare triple {3433#true} assume true; {3433#true} is VALID [2020-07-11 02:33:59,132 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {3433#true} {3434#false} #275#return; {3434#false} is VALID [2020-07-11 02:33:59,132 INFO L280 TraceCheckUtils]: 72: Hoare triple {3434#false} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647; {3434#false} is VALID [2020-07-11 02:33:59,133 INFO L280 TraceCheckUtils]: 73: Hoare triple {3434#false} ~n~1 := #t~ret29; {3434#false} is VALID [2020-07-11 02:33:59,133 INFO L280 TraceCheckUtils]: 74: Hoare triple {3434#false} havoc #t~ret29; {3434#false} is VALID [2020-07-11 02:33:59,133 INFO L263 TraceCheckUtils]: 75: Hoare triple {3434#false} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {3433#true} is VALID [2020-07-11 02:33:59,133 INFO L280 TraceCheckUtils]: 76: Hoare triple {3433#true} ~cond := #in~cond; {3433#true} is VALID [2020-07-11 02:33:59,133 INFO L280 TraceCheckUtils]: 77: Hoare triple {3433#true} assume !(0 == ~cond); {3433#true} is VALID [2020-07-11 02:33:59,134 INFO L280 TraceCheckUtils]: 78: Hoare triple {3433#true} assume true; {3433#true} is VALID [2020-07-11 02:33:59,134 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {3433#true} {3434#false} #277#return; {3434#false} is VALID [2020-07-11 02:33:59,134 INFO L280 TraceCheckUtils]: 80: Hoare triple {3434#false} SUMMARY for call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(4 * ~n~1); srcloc: L88-1 {3434#false} is VALID [2020-07-11 02:33:59,134 INFO L263 TraceCheckUtils]: 81: Hoare triple {3434#false} call #Ultimate.meminit(#t~malloc30.base, #t~malloc30.offset, ~n~1, 4, 4 * ~n~1); {3540#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-11 02:33:59,135 INFO L280 TraceCheckUtils]: 82: Hoare triple {3540#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3433#true} is VALID [2020-07-11 02:33:59,135 INFO L280 TraceCheckUtils]: 83: Hoare triple {3433#true} assume true; {3433#true} is VALID [2020-07-11 02:33:59,135 INFO L275 TraceCheckUtils]: 84: Hoare quadruple {3433#true} {3434#false} #279#return; {3434#false} is VALID [2020-07-11 02:33:59,135 INFO L280 TraceCheckUtils]: 85: Hoare triple {3434#false} ~x~0.base, ~x~0.offset := #t~malloc30.base, #t~malloc30.offset; {3434#false} is VALID [2020-07-11 02:33:59,135 INFO L263 TraceCheckUtils]: 86: Hoare triple {3434#false} call #t~ret31 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {3541#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-11 02:33:59,136 INFO L280 TraceCheckUtils]: 87: Hoare triple {3541#(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; {3433#true} is VALID [2020-07-11 02:33:59,136 INFO L280 TraceCheckUtils]: 88: Hoare triple {3433#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {3433#true} is VALID [2020-07-11 02:33:59,136 INFO L280 TraceCheckUtils]: 89: Hoare triple {3433#true} ~i := #in~i; {3433#true} is VALID [2020-07-11 02:33:59,136 INFO L280 TraceCheckUtils]: 90: Hoare triple {3433#true} assume ~t.base == 0 && ~t.offset == 0; {3433#true} is VALID [2020-07-11 02:33:59,136 INFO L280 TraceCheckUtils]: 91: Hoare triple {3433#true} #res := ~i; {3433#true} is VALID [2020-07-11 02:33:59,137 INFO L280 TraceCheckUtils]: 92: Hoare triple {3433#true} assume true; {3433#true} is VALID [2020-07-11 02:33:59,137 INFO L275 TraceCheckUtils]: 93: Hoare quadruple {3433#true} {3434#false} #281#return; {3434#false} is VALID [2020-07-11 02:33:59,137 INFO L280 TraceCheckUtils]: 94: Hoare triple {3434#false} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647; {3434#false} is VALID [2020-07-11 02:33:59,137 INFO L280 TraceCheckUtils]: 95: Hoare triple {3434#false} havoc #t~ret31; {3434#false} is VALID [2020-07-11 02:33:59,137 INFO L280 TraceCheckUtils]: 96: Hoare triple {3434#false} SUMMARY for call #t~mem32 := read~int(~x~0.base, ~x~0.offset, 4); srcloc: L91 {3434#false} is VALID [2020-07-11 02:33:59,138 INFO L263 TraceCheckUtils]: 97: Hoare triple {3434#false} call __VERIFIER_assert((if ~a~1 == #t~mem32 then 1 else 0)); {3434#false} is VALID [2020-07-11 02:33:59,138 INFO L280 TraceCheckUtils]: 98: Hoare triple {3434#false} ~cond := #in~cond; {3434#false} is VALID [2020-07-11 02:33:59,138 INFO L280 TraceCheckUtils]: 99: Hoare triple {3434#false} assume 0 == ~cond; {3434#false} is VALID [2020-07-11 02:33:59,138 INFO L280 TraceCheckUtils]: 100: Hoare triple {3434#false} assume !false; {3434#false} is VALID [2020-07-11 02:33:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-11 02:33:59,147 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1618580459] [2020-07-11 02:33:59,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:33:59,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-11 02:33:59,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256945625] [2020-07-11 02:33:59,148 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 101 [2020-07-11 02:33:59,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:33:59,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-11 02:33:59,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:33:59,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-11 02:33:59,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:33:59,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-11 02:33:59,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-07-11 02:33:59,249 INFO L87 Difference]: Start difference. First operand 198 states and 223 transitions. Second operand 14 states. [2020-07-11 02:34:04,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:34:04,903 INFO L93 Difference]: Finished difference Result 353 states and 399 transitions. [2020-07-11 02:34:04,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-11 02:34:04,903 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 101 [2020-07-11 02:34:04,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:34:04,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 02:34:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 391 transitions. [2020-07-11 02:34:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 02:34:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 391 transitions. [2020-07-11 02:34:04,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 391 transitions. [2020-07-11 02:34:05,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 391 edges. 391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:34:05,483 INFO L225 Difference]: With dead ends: 353 [2020-07-11 02:34:05,484 INFO L226 Difference]: Without dead ends: 211 [2020-07-11 02:34:05,485 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2020-07-11 02:34:05,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-07-11 02:34:06,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 200. [2020-07-11 02:34:06,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:34:06,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand 200 states. [2020-07-11 02:34:06,205 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 200 states. [2020-07-11 02:34:06,206 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 200 states. [2020-07-11 02:34:06,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:34:06,228 INFO L93 Difference]: Finished difference Result 211 states and 240 transitions. [2020-07-11 02:34:06,228 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 240 transitions. [2020-07-11 02:34:06,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:34:06,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:34:06,238 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 211 states. [2020-07-11 02:34:06,238 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 211 states. [2020-07-11 02:34:06,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:34:06,260 INFO L93 Difference]: Finished difference Result 211 states and 240 transitions. [2020-07-11 02:34:06,261 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 240 transitions. [2020-07-11 02:34:06,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:34:06,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:34:06,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:34:06,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:34:06,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-07-11 02:34:06,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 226 transitions. [2020-07-11 02:34:06,280 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 226 transitions. Word has length 101 [2020-07-11 02:34:06,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:34:06,283 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 226 transitions. [2020-07-11 02:34:06,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-11 02:34:06,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 200 states and 226 transitions. [2020-07-11 02:34:06,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:34:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 226 transitions. [2020-07-11 02:34:06,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-07-11 02:34:06,828 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:34:06,829 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 02:34:06,829 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:34:06,829 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:34:06,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:34:06,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1397703292, now seen corresponding path program 1 times [2020-07-11 02:34:06,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:34:06,830 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1921263695] [2020-07-11 02:34:06,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:34:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:34:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:34:07,018 INFO L280 TraceCheckUtils]: 0: Hoare triple {5202#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5096#true} is VALID [2020-07-11 02:34:07,019 INFO L280 TraceCheckUtils]: 1: Hoare triple {5096#true} #valid := #valid[0 := 0]; {5096#true} is VALID [2020-07-11 02:34:07,019 INFO L280 TraceCheckUtils]: 2: Hoare triple {5096#true} assume 0 < #StackHeapBarrier; {5096#true} is VALID [2020-07-11 02:34:07,020 INFO L280 TraceCheckUtils]: 3: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,020 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5096#true} {5096#true} #303#return; {5096#true} is VALID [2020-07-11 02:34:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:34:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:34:07,160 INFO L280 TraceCheckUtils]: 0: Hoare triple {5203#(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; {5096#true} is VALID [2020-07-11 02:34:07,160 INFO L280 TraceCheckUtils]: 1: Hoare triple {5096#true} havoc #t~nondet1; {5096#true} is VALID [2020-07-11 02:34:07,160 INFO L280 TraceCheckUtils]: 2: Hoare triple {5096#true} #res.base, #res.offset := 0, 0; {5096#true} is VALID [2020-07-11 02:34:07,161 INFO L280 TraceCheckUtils]: 3: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,162 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5096#true} {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #269#return; {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:34:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:34:07,174 INFO L280 TraceCheckUtils]: 0: Hoare triple {5203#(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; {5096#true} is VALID [2020-07-11 02:34:07,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {5096#true} havoc #t~nondet1; {5096#true} is VALID [2020-07-11 02:34:07,175 INFO L280 TraceCheckUtils]: 2: Hoare triple {5096#true} #res.base, #res.offset := 0, 0; {5096#true} is VALID [2020-07-11 02:34:07,175 INFO L280 TraceCheckUtils]: 3: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,177 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5096#true} {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #271#return; {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:34:07,177 INFO L280 TraceCheckUtils]: 0: Hoare triple {5203#(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); {5096#true} is VALID [2020-07-11 02:34:07,178 INFO L280 TraceCheckUtils]: 1: Hoare triple {5096#true} havoc #t~nondet1; {5096#true} is VALID [2020-07-11 02:34:07,179 INFO L280 TraceCheckUtils]: 2: Hoare triple {5096#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L26 {5204#(or (< 0 |nondet_tree_#t~malloc2.base|) (<= (+ |nondet_tree_#t~malloc2.base| 1) 0))} is VALID [2020-07-11 02:34:07,181 INFO L280 TraceCheckUtils]: 3: Hoare triple {5204#(or (< 0 |nondet_tree_#t~malloc2.base|) (<= (+ |nondet_tree_#t~malloc2.base| 1) 0))} ~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset; {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:34:07,182 INFO L280 TraceCheckUtils]: 4: Hoare triple {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:34:07,182 INFO L280 TraceCheckUtils]: 5: Hoare triple {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} SUMMARY for call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4); srcloc: L27-1 {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:34:07,183 INFO L280 TraceCheckUtils]: 6: Hoare triple {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} havoc #t~nondet3; {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:34:07,185 INFO L263 TraceCheckUtils]: 7: Hoare triple {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {5203#(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-11 02:34:07,185 INFO L280 TraceCheckUtils]: 8: Hoare triple {5203#(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; {5096#true} is VALID [2020-07-11 02:34:07,186 INFO L280 TraceCheckUtils]: 9: Hoare triple {5096#true} havoc #t~nondet1; {5096#true} is VALID [2020-07-11 02:34:07,186 INFO L280 TraceCheckUtils]: 10: Hoare triple {5096#true} #res.base, #res.offset := 0, 0; {5096#true} is VALID [2020-07-11 02:34:07,186 INFO L280 TraceCheckUtils]: 11: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,188 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {5096#true} {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #269#return; {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:34:07,189 INFO L280 TraceCheckUtils]: 13: Hoare triple {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} SUMMARY for call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4); srcloc: L28-1 {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:34:07,190 INFO L280 TraceCheckUtils]: 14: Hoare triple {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} havoc #t~ret4.base, #t~ret4.offset; {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:34:07,191 INFO L263 TraceCheckUtils]: 15: Hoare triple {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {5203#(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-11 02:34:07,192 INFO L280 TraceCheckUtils]: 16: Hoare triple {5203#(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; {5096#true} is VALID [2020-07-11 02:34:07,192 INFO L280 TraceCheckUtils]: 17: Hoare triple {5096#true} havoc #t~nondet1; {5096#true} is VALID [2020-07-11 02:34:07,193 INFO L280 TraceCheckUtils]: 18: Hoare triple {5096#true} #res.base, #res.offset := 0, 0; {5096#true} is VALID [2020-07-11 02:34:07,193 INFO L280 TraceCheckUtils]: 19: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,194 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {5096#true} {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #271#return; {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:34:07,195 INFO L280 TraceCheckUtils]: 21: Hoare triple {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} SUMMARY for call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4); srcloc: L29-1 {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:34:07,196 INFO L280 TraceCheckUtils]: 22: Hoare triple {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} havoc #t~ret5.base, #t~ret5.offset; {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:34:07,197 INFO L280 TraceCheckUtils]: 23: Hoare triple {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #res.base, #res.offset := ~n~0.base, ~n~0.offset; {5216#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-11 02:34:07,198 INFO L280 TraceCheckUtils]: 24: Hoare triple {5216#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} assume true; {5216#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-11 02:34:07,200 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {5216#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} {5096#true} #261#return; {5129#(not (= 0 |main_#t~ret41.base|))} is VALID [2020-07-11 02:34:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:34:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:34:07,221 INFO L280 TraceCheckUtils]: 0: Hoare triple {5096#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {5096#true} is VALID [2020-07-11 02:34:07,222 INFO L280 TraceCheckUtils]: 1: Hoare triple {5096#true} assume ~n.base == 0 && ~n.offset == 0; {5096#true} is VALID [2020-07-11 02:34:07,222 INFO L280 TraceCheckUtils]: 2: Hoare triple {5096#true} #res := 2147483647; {5096#true} is VALID [2020-07-11 02:34:07,222 INFO L280 TraceCheckUtils]: 3: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,223 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5096#true} {5096#true} #265#return; {5096#true} is VALID [2020-07-11 02:34:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:34:07,227 INFO L280 TraceCheckUtils]: 0: Hoare triple {5096#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {5096#true} is VALID [2020-07-11 02:34:07,228 INFO L280 TraceCheckUtils]: 1: Hoare triple {5096#true} assume ~n.base == 0 && ~n.offset == 0; {5096#true} is VALID [2020-07-11 02:34:07,228 INFO L280 TraceCheckUtils]: 2: Hoare triple {5096#true} #res := 2147483647; {5096#true} is VALID [2020-07-11 02:34:07,228 INFO L280 TraceCheckUtils]: 3: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,229 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5096#true} {5096#true} #267#return; {5096#true} is VALID [2020-07-11 02:34:07,229 INFO L280 TraceCheckUtils]: 0: Hoare triple {5096#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {5096#true} is VALID [2020-07-11 02:34:07,230 INFO L280 TraceCheckUtils]: 1: Hoare triple {5096#true} assume !(~n.base == 0 && ~n.offset == 0); {5096#true} is VALID [2020-07-11 02:34:07,230 INFO L280 TraceCheckUtils]: 2: Hoare triple {5096#true} SUMMARY for call #t~mem6 := read~int(~n.base, ~n.offset, 4); srcloc: L38 {5096#true} is VALID [2020-07-11 02:34:07,230 INFO L280 TraceCheckUtils]: 3: Hoare triple {5096#true} ~a~0 := #t~mem6; {5096#true} is VALID [2020-07-11 02:34:07,231 INFO L280 TraceCheckUtils]: 4: Hoare triple {5096#true} havoc #t~mem6; {5096#true} is VALID [2020-07-11 02:34:07,231 INFO L280 TraceCheckUtils]: 5: Hoare triple {5096#true} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 4); srcloc: L39 {5096#true} is VALID [2020-07-11 02:34:07,231 INFO L263 TraceCheckUtils]: 6: Hoare triple {5096#true} call #t~ret8 := min(#t~mem7.base, #t~mem7.offset); {5096#true} is VALID [2020-07-11 02:34:07,232 INFO L280 TraceCheckUtils]: 7: Hoare triple {5096#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {5096#true} is VALID [2020-07-11 02:34:07,232 INFO L280 TraceCheckUtils]: 8: Hoare triple {5096#true} assume ~n.base == 0 && ~n.offset == 0; {5096#true} is VALID [2020-07-11 02:34:07,232 INFO L280 TraceCheckUtils]: 9: Hoare triple {5096#true} #res := 2147483647; {5096#true} is VALID [2020-07-11 02:34:07,233 INFO L280 TraceCheckUtils]: 10: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,233 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {5096#true} {5096#true} #265#return; {5096#true} is VALID [2020-07-11 02:34:07,234 INFO L280 TraceCheckUtils]: 12: Hoare triple {5096#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5096#true} is VALID [2020-07-11 02:34:07,234 INFO L280 TraceCheckUtils]: 13: Hoare triple {5096#true} ~b~0 := #t~ret8; {5096#true} is VALID [2020-07-11 02:34:07,234 INFO L280 TraceCheckUtils]: 14: Hoare triple {5096#true} havoc #t~mem7.base, #t~mem7.offset; {5096#true} is VALID [2020-07-11 02:34:07,235 INFO L280 TraceCheckUtils]: 15: Hoare triple {5096#true} havoc #t~ret8; {5096#true} is VALID [2020-07-11 02:34:07,235 INFO L280 TraceCheckUtils]: 16: Hoare triple {5096#true} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~n.base, 8 + ~n.offset, 4); srcloc: L40 {5096#true} is VALID [2020-07-11 02:34:07,235 INFO L263 TraceCheckUtils]: 17: Hoare triple {5096#true} call #t~ret10 := min(#t~mem9.base, #t~mem9.offset); {5096#true} is VALID [2020-07-11 02:34:07,236 INFO L280 TraceCheckUtils]: 18: Hoare triple {5096#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {5096#true} is VALID [2020-07-11 02:34:07,236 INFO L280 TraceCheckUtils]: 19: Hoare triple {5096#true} assume ~n.base == 0 && ~n.offset == 0; {5096#true} is VALID [2020-07-11 02:34:07,236 INFO L280 TraceCheckUtils]: 20: Hoare triple {5096#true} #res := 2147483647; {5096#true} is VALID [2020-07-11 02:34:07,237 INFO L280 TraceCheckUtils]: 21: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,237 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {5096#true} {5096#true} #267#return; {5096#true} is VALID [2020-07-11 02:34:07,238 INFO L280 TraceCheckUtils]: 23: Hoare triple {5096#true} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; {5096#true} is VALID [2020-07-11 02:34:07,238 INFO L280 TraceCheckUtils]: 24: Hoare triple {5096#true} ~c~0 := #t~ret10; {5096#true} is VALID [2020-07-11 02:34:07,238 INFO L280 TraceCheckUtils]: 25: Hoare triple {5096#true} havoc #t~ret10; {5096#true} is VALID [2020-07-11 02:34:07,238 INFO L280 TraceCheckUtils]: 26: Hoare triple {5096#true} havoc #t~mem9.base, #t~mem9.offset; {5096#true} is VALID [2020-07-11 02:34:07,239 INFO L280 TraceCheckUtils]: 27: Hoare triple {5096#true} assume ~b~0 <= ~a~0 && ~b~0 <= ~c~0; {5096#true} is VALID [2020-07-11 02:34:07,239 INFO L280 TraceCheckUtils]: 28: Hoare triple {5096#true} #res := ~b~0; {5096#true} is VALID [2020-07-11 02:34:07,239 INFO L280 TraceCheckUtils]: 29: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,240 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {5096#true} {5131#(not (= 0 task_~t.base))} #273#return; {5131#(not (= 0 task_~t.base))} is VALID [2020-07-11 02:34:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:34:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:34:07,255 INFO L280 TraceCheckUtils]: 0: Hoare triple {5096#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {5096#true} is VALID [2020-07-11 02:34:07,255 INFO L280 TraceCheckUtils]: 1: Hoare triple {5096#true} assume ~t.base == 0 && ~t.offset == 0; {5096#true} is VALID [2020-07-11 02:34:07,256 INFO L280 TraceCheckUtils]: 2: Hoare triple {5096#true} #res := 0; {5096#true} is VALID [2020-07-11 02:34:07,256 INFO L280 TraceCheckUtils]: 3: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,256 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5096#true} {5096#true} #299#return; {5096#true} is VALID [2020-07-11 02:34:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:34:07,261 INFO L280 TraceCheckUtils]: 0: Hoare triple {5096#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {5096#true} is VALID [2020-07-11 02:34:07,261 INFO L280 TraceCheckUtils]: 1: Hoare triple {5096#true} assume ~t.base == 0 && ~t.offset == 0; {5096#true} is VALID [2020-07-11 02:34:07,262 INFO L280 TraceCheckUtils]: 2: Hoare triple {5096#true} #res := 0; {5096#true} is VALID [2020-07-11 02:34:07,262 INFO L280 TraceCheckUtils]: 3: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,262 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5096#true} {5096#true} #301#return; {5096#true} is VALID [2020-07-11 02:34:07,262 INFO L280 TraceCheckUtils]: 0: Hoare triple {5096#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {5096#true} is VALID [2020-07-11 02:34:07,263 INFO L280 TraceCheckUtils]: 1: Hoare triple {5096#true} assume !(~t.base == 0 && ~t.offset == 0); {5096#true} is VALID [2020-07-11 02:34:07,263 INFO L280 TraceCheckUtils]: 2: Hoare triple {5096#true} SUMMARY for call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); srcloc: L80 {5096#true} is VALID [2020-07-11 02:34:07,263 INFO L263 TraceCheckUtils]: 3: Hoare triple {5096#true} call #t~ret25 := size(#t~mem24.base, #t~mem24.offset); {5096#true} is VALID [2020-07-11 02:34:07,263 INFO L280 TraceCheckUtils]: 4: Hoare triple {5096#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {5096#true} is VALID [2020-07-11 02:34:07,263 INFO L280 TraceCheckUtils]: 5: Hoare triple {5096#true} assume ~t.base == 0 && ~t.offset == 0; {5096#true} is VALID [2020-07-11 02:34:07,264 INFO L280 TraceCheckUtils]: 6: Hoare triple {5096#true} #res := 0; {5096#true} is VALID [2020-07-11 02:34:07,264 INFO L280 TraceCheckUtils]: 7: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,264 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {5096#true} {5096#true} #299#return; {5096#true} is VALID [2020-07-11 02:34:07,264 INFO L280 TraceCheckUtils]: 9: Hoare triple {5096#true} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647; {5096#true} is VALID [2020-07-11 02:34:07,265 INFO L280 TraceCheckUtils]: 10: Hoare triple {5096#true} SUMMARY for call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); srcloc: L80-3 {5096#true} is VALID [2020-07-11 02:34:07,265 INFO L263 TraceCheckUtils]: 11: Hoare triple {5096#true} call #t~ret27 := size(#t~mem26.base, #t~mem26.offset); {5096#true} is VALID [2020-07-11 02:34:07,265 INFO L280 TraceCheckUtils]: 12: Hoare triple {5096#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {5096#true} is VALID [2020-07-11 02:34:07,266 INFO L280 TraceCheckUtils]: 13: Hoare triple {5096#true} assume ~t.base == 0 && ~t.offset == 0; {5096#true} is VALID [2020-07-11 02:34:07,266 INFO L280 TraceCheckUtils]: 14: Hoare triple {5096#true} #res := 0; {5096#true} is VALID [2020-07-11 02:34:07,267 INFO L280 TraceCheckUtils]: 15: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,267 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {5096#true} {5096#true} #301#return; {5096#true} is VALID [2020-07-11 02:34:07,267 INFO L280 TraceCheckUtils]: 17: Hoare triple {5096#true} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647; {5096#true} is VALID [2020-07-11 02:34:07,267 INFO L280 TraceCheckUtils]: 18: Hoare triple {5096#true} #res := 1 + (#t~ret25 + #t~ret27); {5096#true} is VALID [2020-07-11 02:34:07,268 INFO L280 TraceCheckUtils]: 19: Hoare triple {5096#true} havoc #t~mem24.base, #t~mem24.offset; {5096#true} is VALID [2020-07-11 02:34:07,268 INFO L280 TraceCheckUtils]: 20: Hoare triple {5096#true} havoc #t~ret25; {5096#true} is VALID [2020-07-11 02:34:07,268 INFO L280 TraceCheckUtils]: 21: Hoare triple {5096#true} havoc #t~ret27; {5096#true} is VALID [2020-07-11 02:34:07,268 INFO L280 TraceCheckUtils]: 22: Hoare triple {5096#true} havoc #t~mem26.base, #t~mem26.offset; {5096#true} is VALID [2020-07-11 02:34:07,268 INFO L280 TraceCheckUtils]: 23: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,269 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {5096#true} {5131#(not (= 0 task_~t.base))} #275#return; {5131#(not (= 0 task_~t.base))} is VALID [2020-07-11 02:34:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:34:07,276 INFO L280 TraceCheckUtils]: 0: Hoare triple {5096#true} ~cond := #in~cond; {5096#true} is VALID [2020-07-11 02:34:07,276 INFO L280 TraceCheckUtils]: 1: Hoare triple {5096#true} assume !(0 == ~cond); {5096#true} is VALID [2020-07-11 02:34:07,277 INFO L280 TraceCheckUtils]: 2: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,278 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5096#true} {5131#(not (= 0 task_~t.base))} #277#return; {5131#(not (= 0 task_~t.base))} is VALID [2020-07-11 02:34:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:34:07,303 INFO L280 TraceCheckUtils]: 0: Hoare triple {5237#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5096#true} is VALID [2020-07-11 02:34:07,304 INFO L280 TraceCheckUtils]: 1: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,306 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5096#true} {5131#(not (= 0 task_~t.base))} #279#return; {5131#(not (= 0 task_~t.base))} is VALID [2020-07-11 02:34:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:34:07,390 INFO L280 TraceCheckUtils]: 0: Hoare triple {5238#(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; {5239#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2020-07-11 02:34:07,391 INFO L280 TraceCheckUtils]: 1: Hoare triple {5239#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {5239#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2020-07-11 02:34:07,392 INFO L280 TraceCheckUtils]: 2: Hoare triple {5239#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} ~i := #in~i; {5239#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2020-07-11 02:34:07,393 INFO L280 TraceCheckUtils]: 3: Hoare triple {5239#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0; {5240#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-11 02:34:07,394 INFO L280 TraceCheckUtils]: 4: Hoare triple {5240#(= 0 |tree_inorder_#in~t.base|)} #res := ~i; {5240#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-11 02:34:07,395 INFO L280 TraceCheckUtils]: 5: Hoare triple {5240#(= 0 |tree_inorder_#in~t.base|)} assume true; {5240#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-11 02:34:07,398 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {5240#(= 0 |tree_inorder_#in~t.base|)} {5131#(not (= 0 task_~t.base))} #281#return; {5097#false} is VALID [2020-07-11 02:34:07,399 INFO L263 TraceCheckUtils]: 0: Hoare triple {5096#true} call ULTIMATE.init(); {5202#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:34:07,400 INFO L280 TraceCheckUtils]: 1: Hoare triple {5202#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5096#true} is VALID [2020-07-11 02:34:07,400 INFO L280 TraceCheckUtils]: 2: Hoare triple {5096#true} #valid := #valid[0 := 0]; {5096#true} is VALID [2020-07-11 02:34:07,400 INFO L280 TraceCheckUtils]: 3: Hoare triple {5096#true} assume 0 < #StackHeapBarrier; {5096#true} is VALID [2020-07-11 02:34:07,401 INFO L280 TraceCheckUtils]: 4: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,401 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5096#true} {5096#true} #303#return; {5096#true} is VALID [2020-07-11 02:34:07,401 INFO L263 TraceCheckUtils]: 6: Hoare triple {5096#true} call #t~ret42 := main(); {5096#true} is VALID [2020-07-11 02:34:07,403 INFO L263 TraceCheckUtils]: 7: Hoare triple {5096#true} call #t~ret41.base, #t~ret41.offset := nondet_tree(); {5203#(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-11 02:34:07,403 INFO L280 TraceCheckUtils]: 8: Hoare triple {5203#(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); {5096#true} is VALID [2020-07-11 02:34:07,404 INFO L280 TraceCheckUtils]: 9: Hoare triple {5096#true} havoc #t~nondet1; {5096#true} is VALID [2020-07-11 02:34:07,405 INFO L280 TraceCheckUtils]: 10: Hoare triple {5096#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L26 {5204#(or (< 0 |nondet_tree_#t~malloc2.base|) (<= (+ |nondet_tree_#t~malloc2.base| 1) 0))} is VALID [2020-07-11 02:34:07,407 INFO L280 TraceCheckUtils]: 11: Hoare triple {5204#(or (< 0 |nondet_tree_#t~malloc2.base|) (<= (+ |nondet_tree_#t~malloc2.base| 1) 0))} ~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset; {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:34:07,407 INFO L280 TraceCheckUtils]: 12: Hoare triple {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:34:07,408 INFO L280 TraceCheckUtils]: 13: Hoare triple {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} SUMMARY for call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4); srcloc: L27-1 {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:34:07,409 INFO L280 TraceCheckUtils]: 14: Hoare triple {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} havoc #t~nondet3; {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:34:07,411 INFO L263 TraceCheckUtils]: 15: Hoare triple {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {5203#(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-11 02:34:07,411 INFO L280 TraceCheckUtils]: 16: Hoare triple {5203#(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; {5096#true} is VALID [2020-07-11 02:34:07,412 INFO L280 TraceCheckUtils]: 17: Hoare triple {5096#true} havoc #t~nondet1; {5096#true} is VALID [2020-07-11 02:34:07,412 INFO L280 TraceCheckUtils]: 18: Hoare triple {5096#true} #res.base, #res.offset := 0, 0; {5096#true} is VALID [2020-07-11 02:34:07,412 INFO L280 TraceCheckUtils]: 19: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,413 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {5096#true} {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #269#return; {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:34:07,414 INFO L280 TraceCheckUtils]: 21: Hoare triple {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} SUMMARY for call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4); srcloc: L28-1 {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:34:07,415 INFO L280 TraceCheckUtils]: 22: Hoare triple {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} havoc #t~ret4.base, #t~ret4.offset; {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:34:07,417 INFO L263 TraceCheckUtils]: 23: Hoare triple {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {5203#(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-11 02:34:07,417 INFO L280 TraceCheckUtils]: 24: Hoare triple {5203#(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; {5096#true} is VALID [2020-07-11 02:34:07,418 INFO L280 TraceCheckUtils]: 25: Hoare triple {5096#true} havoc #t~nondet1; {5096#true} is VALID [2020-07-11 02:34:07,418 INFO L280 TraceCheckUtils]: 26: Hoare triple {5096#true} #res.base, #res.offset := 0, 0; {5096#true} is VALID [2020-07-11 02:34:07,418 INFO L280 TraceCheckUtils]: 27: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,420 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {5096#true} {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #271#return; {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:34:07,421 INFO L280 TraceCheckUtils]: 29: Hoare triple {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} SUMMARY for call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4); srcloc: L29-1 {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:34:07,421 INFO L280 TraceCheckUtils]: 30: Hoare triple {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} havoc #t~ret5.base, #t~ret5.offset; {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-11 02:34:07,423 INFO L280 TraceCheckUtils]: 31: Hoare triple {5205#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #res.base, #res.offset := ~n~0.base, ~n~0.offset; {5216#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-11 02:34:07,424 INFO L280 TraceCheckUtils]: 32: Hoare triple {5216#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} assume true; {5216#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-11 02:34:07,425 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {5216#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} {5096#true} #261#return; {5129#(not (= 0 |main_#t~ret41.base|))} is VALID [2020-07-11 02:34:07,426 INFO L263 TraceCheckUtils]: 34: Hoare triple {5129#(not (= 0 |main_#t~ret41.base|))} call task(#t~ret41.base, #t~ret41.offset); {5130#(not (= |task_#in~t.base| 0))} is VALID [2020-07-11 02:34:07,427 INFO L280 TraceCheckUtils]: 35: Hoare triple {5130#(not (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {5131#(not (= 0 task_~t.base))} is VALID [2020-07-11 02:34:07,428 INFO L263 TraceCheckUtils]: 36: Hoare triple {5131#(not (= 0 task_~t.base))} call #t~ret28 := min(~t.base, ~t.offset); {5096#true} is VALID [2020-07-11 02:34:07,428 INFO L280 TraceCheckUtils]: 37: Hoare triple {5096#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {5096#true} is VALID [2020-07-11 02:34:07,428 INFO L280 TraceCheckUtils]: 38: Hoare triple {5096#true} assume !(~n.base == 0 && ~n.offset == 0); {5096#true} is VALID [2020-07-11 02:34:07,429 INFO L280 TraceCheckUtils]: 39: Hoare triple {5096#true} SUMMARY for call #t~mem6 := read~int(~n.base, ~n.offset, 4); srcloc: L38 {5096#true} is VALID [2020-07-11 02:34:07,429 INFO L280 TraceCheckUtils]: 40: Hoare triple {5096#true} ~a~0 := #t~mem6; {5096#true} is VALID [2020-07-11 02:34:07,429 INFO L280 TraceCheckUtils]: 41: Hoare triple {5096#true} havoc #t~mem6; {5096#true} is VALID [2020-07-11 02:34:07,430 INFO L280 TraceCheckUtils]: 42: Hoare triple {5096#true} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 4); srcloc: L39 {5096#true} is VALID [2020-07-11 02:34:07,430 INFO L263 TraceCheckUtils]: 43: Hoare triple {5096#true} call #t~ret8 := min(#t~mem7.base, #t~mem7.offset); {5096#true} is VALID [2020-07-11 02:34:07,430 INFO L280 TraceCheckUtils]: 44: Hoare triple {5096#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {5096#true} is VALID [2020-07-11 02:34:07,431 INFO L280 TraceCheckUtils]: 45: Hoare triple {5096#true} assume ~n.base == 0 && ~n.offset == 0; {5096#true} is VALID [2020-07-11 02:34:07,431 INFO L280 TraceCheckUtils]: 46: Hoare triple {5096#true} #res := 2147483647; {5096#true} is VALID [2020-07-11 02:34:07,431 INFO L280 TraceCheckUtils]: 47: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,432 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {5096#true} {5096#true} #265#return; {5096#true} is VALID [2020-07-11 02:34:07,432 INFO L280 TraceCheckUtils]: 49: Hoare triple {5096#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5096#true} is VALID [2020-07-11 02:34:07,432 INFO L280 TraceCheckUtils]: 50: Hoare triple {5096#true} ~b~0 := #t~ret8; {5096#true} is VALID [2020-07-11 02:34:07,432 INFO L280 TraceCheckUtils]: 51: Hoare triple {5096#true} havoc #t~mem7.base, #t~mem7.offset; {5096#true} is VALID [2020-07-11 02:34:07,433 INFO L280 TraceCheckUtils]: 52: Hoare triple {5096#true} havoc #t~ret8; {5096#true} is VALID [2020-07-11 02:34:07,433 INFO L280 TraceCheckUtils]: 53: Hoare triple {5096#true} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~n.base, 8 + ~n.offset, 4); srcloc: L40 {5096#true} is VALID [2020-07-11 02:34:07,433 INFO L263 TraceCheckUtils]: 54: Hoare triple {5096#true} call #t~ret10 := min(#t~mem9.base, #t~mem9.offset); {5096#true} is VALID [2020-07-11 02:34:07,434 INFO L280 TraceCheckUtils]: 55: Hoare triple {5096#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {5096#true} is VALID [2020-07-11 02:34:07,434 INFO L280 TraceCheckUtils]: 56: Hoare triple {5096#true} assume ~n.base == 0 && ~n.offset == 0; {5096#true} is VALID [2020-07-11 02:34:07,434 INFO L280 TraceCheckUtils]: 57: Hoare triple {5096#true} #res := 2147483647; {5096#true} is VALID [2020-07-11 02:34:07,435 INFO L280 TraceCheckUtils]: 58: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,435 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {5096#true} {5096#true} #267#return; {5096#true} is VALID [2020-07-11 02:34:07,435 INFO L280 TraceCheckUtils]: 60: Hoare triple {5096#true} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; {5096#true} is VALID [2020-07-11 02:34:07,436 INFO L280 TraceCheckUtils]: 61: Hoare triple {5096#true} ~c~0 := #t~ret10; {5096#true} is VALID [2020-07-11 02:34:07,436 INFO L280 TraceCheckUtils]: 62: Hoare triple {5096#true} havoc #t~ret10; {5096#true} is VALID [2020-07-11 02:34:07,436 INFO L280 TraceCheckUtils]: 63: Hoare triple {5096#true} havoc #t~mem9.base, #t~mem9.offset; {5096#true} is VALID [2020-07-11 02:34:07,437 INFO L280 TraceCheckUtils]: 64: Hoare triple {5096#true} assume ~b~0 <= ~a~0 && ~b~0 <= ~c~0; {5096#true} is VALID [2020-07-11 02:34:07,437 INFO L280 TraceCheckUtils]: 65: Hoare triple {5096#true} #res := ~b~0; {5096#true} is VALID [2020-07-11 02:34:07,437 INFO L280 TraceCheckUtils]: 66: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,439 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {5096#true} {5131#(not (= 0 task_~t.base))} #273#return; {5131#(not (= 0 task_~t.base))} is VALID [2020-07-11 02:34:07,440 INFO L280 TraceCheckUtils]: 68: Hoare triple {5131#(not (= 0 task_~t.base))} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647; {5131#(not (= 0 task_~t.base))} is VALID [2020-07-11 02:34:07,441 INFO L280 TraceCheckUtils]: 69: Hoare triple {5131#(not (= 0 task_~t.base))} ~a~1 := #t~ret28; {5131#(not (= 0 task_~t.base))} is VALID [2020-07-11 02:34:07,442 INFO L280 TraceCheckUtils]: 70: Hoare triple {5131#(not (= 0 task_~t.base))} havoc #t~ret28; {5131#(not (= 0 task_~t.base))} is VALID [2020-07-11 02:34:07,443 INFO L280 TraceCheckUtils]: 71: Hoare triple {5131#(not (= 0 task_~t.base))} SUMMARY for call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); srcloc: L85 {5131#(not (= 0 task_~t.base))} is VALID [2020-07-11 02:34:07,443 INFO L263 TraceCheckUtils]: 72: Hoare triple {5131#(not (= 0 task_~t.base))} call #t~ret29 := size(~t.base, ~t.offset); {5096#true} is VALID [2020-07-11 02:34:07,444 INFO L280 TraceCheckUtils]: 73: Hoare triple {5096#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {5096#true} is VALID [2020-07-11 02:34:07,444 INFO L280 TraceCheckUtils]: 74: Hoare triple {5096#true} assume !(~t.base == 0 && ~t.offset == 0); {5096#true} is VALID [2020-07-11 02:34:07,444 INFO L280 TraceCheckUtils]: 75: Hoare triple {5096#true} SUMMARY for call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); srcloc: L80 {5096#true} is VALID [2020-07-11 02:34:07,444 INFO L263 TraceCheckUtils]: 76: Hoare triple {5096#true} call #t~ret25 := size(#t~mem24.base, #t~mem24.offset); {5096#true} is VALID [2020-07-11 02:34:07,445 INFO L280 TraceCheckUtils]: 77: Hoare triple {5096#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {5096#true} is VALID [2020-07-11 02:34:07,445 INFO L280 TraceCheckUtils]: 78: Hoare triple {5096#true} assume ~t.base == 0 && ~t.offset == 0; {5096#true} is VALID [2020-07-11 02:34:07,445 INFO L280 TraceCheckUtils]: 79: Hoare triple {5096#true} #res := 0; {5096#true} is VALID [2020-07-11 02:34:07,445 INFO L280 TraceCheckUtils]: 80: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,445 INFO L275 TraceCheckUtils]: 81: Hoare quadruple {5096#true} {5096#true} #299#return; {5096#true} is VALID [2020-07-11 02:34:07,446 INFO L280 TraceCheckUtils]: 82: Hoare triple {5096#true} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647; {5096#true} is VALID [2020-07-11 02:34:07,446 INFO L280 TraceCheckUtils]: 83: Hoare triple {5096#true} SUMMARY for call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); srcloc: L80-3 {5096#true} is VALID [2020-07-11 02:34:07,446 INFO L263 TraceCheckUtils]: 84: Hoare triple {5096#true} call #t~ret27 := size(#t~mem26.base, #t~mem26.offset); {5096#true} is VALID [2020-07-11 02:34:07,446 INFO L280 TraceCheckUtils]: 85: Hoare triple {5096#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {5096#true} is VALID [2020-07-11 02:34:07,446 INFO L280 TraceCheckUtils]: 86: Hoare triple {5096#true} assume ~t.base == 0 && ~t.offset == 0; {5096#true} is VALID [2020-07-11 02:34:07,447 INFO L280 TraceCheckUtils]: 87: Hoare triple {5096#true} #res := 0; {5096#true} is VALID [2020-07-11 02:34:07,447 INFO L280 TraceCheckUtils]: 88: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,447 INFO L275 TraceCheckUtils]: 89: Hoare quadruple {5096#true} {5096#true} #301#return; {5096#true} is VALID [2020-07-11 02:34:07,447 INFO L280 TraceCheckUtils]: 90: Hoare triple {5096#true} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647; {5096#true} is VALID [2020-07-11 02:34:07,447 INFO L280 TraceCheckUtils]: 91: Hoare triple {5096#true} #res := 1 + (#t~ret25 + #t~ret27); {5096#true} is VALID [2020-07-11 02:34:07,447 INFO L280 TraceCheckUtils]: 92: Hoare triple {5096#true} havoc #t~mem24.base, #t~mem24.offset; {5096#true} is VALID [2020-07-11 02:34:07,448 INFO L280 TraceCheckUtils]: 93: Hoare triple {5096#true} havoc #t~ret25; {5096#true} is VALID [2020-07-11 02:34:07,448 INFO L280 TraceCheckUtils]: 94: Hoare triple {5096#true} havoc #t~ret27; {5096#true} is VALID [2020-07-11 02:34:07,448 INFO L280 TraceCheckUtils]: 95: Hoare triple {5096#true} havoc #t~mem26.base, #t~mem26.offset; {5096#true} is VALID [2020-07-11 02:34:07,448 INFO L280 TraceCheckUtils]: 96: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,449 INFO L275 TraceCheckUtils]: 97: Hoare quadruple {5096#true} {5131#(not (= 0 task_~t.base))} #275#return; {5131#(not (= 0 task_~t.base))} is VALID [2020-07-11 02:34:07,450 INFO L280 TraceCheckUtils]: 98: Hoare triple {5131#(not (= 0 task_~t.base))} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647; {5131#(not (= 0 task_~t.base))} is VALID [2020-07-11 02:34:07,450 INFO L280 TraceCheckUtils]: 99: Hoare triple {5131#(not (= 0 task_~t.base))} ~n~1 := #t~ret29; {5131#(not (= 0 task_~t.base))} is VALID [2020-07-11 02:34:07,451 INFO L280 TraceCheckUtils]: 100: Hoare triple {5131#(not (= 0 task_~t.base))} havoc #t~ret29; {5131#(not (= 0 task_~t.base))} is VALID [2020-07-11 02:34:07,451 INFO L263 TraceCheckUtils]: 101: Hoare triple {5131#(not (= 0 task_~t.base))} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {5096#true} is VALID [2020-07-11 02:34:07,451 INFO L280 TraceCheckUtils]: 102: Hoare triple {5096#true} ~cond := #in~cond; {5096#true} is VALID [2020-07-11 02:34:07,451 INFO L280 TraceCheckUtils]: 103: Hoare triple {5096#true} assume !(0 == ~cond); {5096#true} is VALID [2020-07-11 02:34:07,452 INFO L280 TraceCheckUtils]: 104: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,452 INFO L275 TraceCheckUtils]: 105: Hoare quadruple {5096#true} {5131#(not (= 0 task_~t.base))} #277#return; {5131#(not (= 0 task_~t.base))} is VALID [2020-07-11 02:34:07,453 INFO L280 TraceCheckUtils]: 106: Hoare triple {5131#(not (= 0 task_~t.base))} SUMMARY for call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(4 * ~n~1); srcloc: L88-1 {5131#(not (= 0 task_~t.base))} is VALID [2020-07-11 02:34:07,454 INFO L263 TraceCheckUtils]: 107: Hoare triple {5131#(not (= 0 task_~t.base))} call #Ultimate.meminit(#t~malloc30.base, #t~malloc30.offset, ~n~1, 4, 4 * ~n~1); {5237#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-11 02:34:07,454 INFO L280 TraceCheckUtils]: 108: Hoare triple {5237#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5096#true} is VALID [2020-07-11 02:34:07,455 INFO L280 TraceCheckUtils]: 109: Hoare triple {5096#true} assume true; {5096#true} is VALID [2020-07-11 02:34:07,456 INFO L275 TraceCheckUtils]: 110: Hoare quadruple {5096#true} {5131#(not (= 0 task_~t.base))} #279#return; {5131#(not (= 0 task_~t.base))} is VALID [2020-07-11 02:34:07,457 INFO L280 TraceCheckUtils]: 111: Hoare triple {5131#(not (= 0 task_~t.base))} ~x~0.base, ~x~0.offset := #t~malloc30.base, #t~malloc30.offset; {5131#(not (= 0 task_~t.base))} is VALID [2020-07-11 02:34:07,459 INFO L263 TraceCheckUtils]: 112: Hoare triple {5131#(not (= 0 task_~t.base))} call #t~ret31 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {5238#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-11 02:34:07,460 INFO L280 TraceCheckUtils]: 113: Hoare triple {5238#(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; {5239#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2020-07-11 02:34:07,461 INFO L280 TraceCheckUtils]: 114: Hoare triple {5239#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {5239#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2020-07-11 02:34:07,462 INFO L280 TraceCheckUtils]: 115: Hoare triple {5239#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} ~i := #in~i; {5239#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2020-07-11 02:34:07,463 INFO L280 TraceCheckUtils]: 116: Hoare triple {5239#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0; {5240#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-11 02:34:07,464 INFO L280 TraceCheckUtils]: 117: Hoare triple {5240#(= 0 |tree_inorder_#in~t.base|)} #res := ~i; {5240#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-11 02:34:07,465 INFO L280 TraceCheckUtils]: 118: Hoare triple {5240#(= 0 |tree_inorder_#in~t.base|)} assume true; {5240#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-11 02:34:07,467 INFO L275 TraceCheckUtils]: 119: Hoare quadruple {5240#(= 0 |tree_inorder_#in~t.base|)} {5131#(not (= 0 task_~t.base))} #281#return; {5097#false} is VALID [2020-07-11 02:34:07,467 INFO L280 TraceCheckUtils]: 120: Hoare triple {5097#false} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647; {5097#false} is VALID [2020-07-11 02:34:07,468 INFO L280 TraceCheckUtils]: 121: Hoare triple {5097#false} havoc #t~ret31; {5097#false} is VALID [2020-07-11 02:34:07,468 INFO L280 TraceCheckUtils]: 122: Hoare triple {5097#false} SUMMARY for call #t~mem32 := read~int(~x~0.base, ~x~0.offset, 4); srcloc: L91 {5097#false} is VALID [2020-07-11 02:34:07,468 INFO L263 TraceCheckUtils]: 123: Hoare triple {5097#false} call __VERIFIER_assert((if ~a~1 == #t~mem32 then 1 else 0)); {5097#false} is VALID [2020-07-11 02:34:07,469 INFO L280 TraceCheckUtils]: 124: Hoare triple {5097#false} ~cond := #in~cond; {5097#false} is VALID [2020-07-11 02:34:07,469 INFO L280 TraceCheckUtils]: 125: Hoare triple {5097#false} assume 0 == ~cond; {5097#false} is VALID [2020-07-11 02:34:07,469 INFO L280 TraceCheckUtils]: 126: Hoare triple {5097#false} assume !false; {5097#false} is VALID [2020-07-11 02:34:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-07-11 02:34:07,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1921263695] [2020-07-11 02:34:07,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:34:07,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-11 02:34:07,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961632675] [2020-07-11 02:34:07,502 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 127 [2020-07-11 02:34:07,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:34:07,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-11 02:34:07,672 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:34:07,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-11 02:34:07,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:34:07,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-11 02:34:07,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-07-11 02:34:07,674 INFO L87 Difference]: Start difference. First operand 200 states and 226 transitions. Second operand 14 states. [2020-07-11 02:34:13,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:34:13,740 INFO L93 Difference]: Finished difference Result 336 states and 378 transitions. [2020-07-11 02:34:13,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-11 02:34:13,740 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 127 [2020-07-11 02:34:13,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:34:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 02:34:13,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 367 transitions. [2020-07-11 02:34:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 02:34:13,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 367 transitions. [2020-07-11 02:34:13,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 367 transitions. [2020-07-11 02:34:14,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:34:14,255 INFO L225 Difference]: With dead ends: 336 [2020-07-11 02:34:14,255 INFO L226 Difference]: Without dead ends: 211 [2020-07-11 02:34:14,256 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2020-07-11 02:34:14,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-07-11 02:34:14,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 202. [2020-07-11 02:34:14,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:34:14,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand 202 states. [2020-07-11 02:34:14,699 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 202 states. [2020-07-11 02:34:14,699 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 202 states. [2020-07-11 02:34:14,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:34:14,712 INFO L93 Difference]: Finished difference Result 211 states and 239 transitions. [2020-07-11 02:34:14,712 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 239 transitions. [2020-07-11 02:34:14,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:34:14,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:34:14,714 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 211 states. [2020-07-11 02:34:14,714 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 211 states. [2020-07-11 02:34:14,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:34:14,724 INFO L93 Difference]: Finished difference Result 211 states and 239 transitions. [2020-07-11 02:34:14,725 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 239 transitions. [2020-07-11 02:34:14,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:34:14,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:34:14,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:34:14,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:34:14,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-07-11 02:34:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 230 transitions. [2020-07-11 02:34:14,735 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 230 transitions. Word has length 127 [2020-07-11 02:34:14,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:34:14,736 INFO L479 AbstractCegarLoop]: Abstraction has 202 states and 230 transitions. [2020-07-11 02:34:14,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-11 02:34:14,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 202 states and 230 transitions. [2020-07-11 02:34:15,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:34:15,121 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 230 transitions. [2020-07-11 02:34:15,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-07-11 02:34:15,124 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:34:15,124 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 02:34:15,125 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 02:34:15,125 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:34:15,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:34:15,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1130815571, now seen corresponding path program 1 times [2020-07-11 02:34:15,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:34:15,126 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [716867] [2020-07-11 02:34:15,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:34:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 02:34:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 02:34:15,352 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 02:34:15,353 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 02:34:15,353 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 02:34:15,508 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-11 02:34:15,508 WARN L170 areAnnotationChecker]: minENTRY has no Hoare annotation [2020-07-11 02:34:15,508 WARN L170 areAnnotationChecker]: taskENTRY has no Hoare annotation [2020-07-11 02:34:15,508 WARN L170 areAnnotationChecker]: sizeENTRY has no Hoare annotation [2020-07-11 02:34:15,508 WARN L170 areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation [2020-07-11 02:34:15,509 WARN L170 areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation [2020-07-11 02:34:15,509 WARN L170 areAnnotationChecker]: assume_cycle_if_notENTRY has no Hoare annotation [2020-07-11 02:34:15,509 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:34:15,509 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:34:15,509 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 02:34:15,509 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 02:34:15,510 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-11 02:34:15,510 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2020-07-11 02:34:15,510 WARN L170 areAnnotationChecker]: tree_inorderENTRY has no Hoare annotation [2020-07-11 02:34:15,510 WARN L170 areAnnotationChecker]: tree_delENTRY has no Hoare annotation [2020-07-11 02:34:15,511 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:34:15,511 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-11 02:34:15,511 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-11 02:34:15,511 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2020-07-11 02:34:15,511 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2020-07-11 02:34:15,511 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2020-07-11 02:34:15,511 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2020-07-11 02:34:15,512 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-11 02:34:15,512 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-11 02:34:15,512 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-11 02:34:15,512 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-11 02:34:15,512 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:34:15,512 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:34:15,513 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2020-07-11 02:34:15,513 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2020-07-11 02:34:15,513 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-11 02:34:15,513 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-11 02:34:15,513 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2020-07-11 02:34:15,513 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2020-07-11 02:34:15,514 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-11 02:34:15,514 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-11 02:34:15,514 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-11 02:34:15,514 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-11 02:34:15,514 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2020-07-11 02:34:15,514 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2020-07-11 02:34:15,515 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2020-07-11 02:34:15,515 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-11 02:34:15,515 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-11 02:34:15,515 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2020-07-11 02:34:15,515 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2020-07-11 02:34:15,515 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2020-07-11 02:34:15,515 WARN L170 areAnnotationChecker]: L9-5 has no Hoare annotation [2020-07-11 02:34:15,516 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 02:34:15,516 WARN L170 areAnnotationChecker]: L108-1 has no Hoare annotation [2020-07-11 02:34:15,516 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-11 02:34:15,516 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-11 02:34:15,516 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2020-07-11 02:34:15,517 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2020-07-11 02:34:15,517 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2020-07-11 02:34:15,518 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2020-07-11 02:34:15,518 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-11 02:34:15,518 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 02:34:15,518 WARN L170 areAnnotationChecker]: minFINAL has no Hoare annotation [2020-07-11 02:34:15,519 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-11 02:34:15,519 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2020-07-11 02:34:15,519 WARN L170 areAnnotationChecker]: sizeFINAL has no Hoare annotation [2020-07-11 02:34:15,519 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2020-07-11 02:34:15,519 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2020-07-11 02:34:15,519 WARN L170 areAnnotationChecker]: nondet_treeFINAL has no Hoare annotation [2020-07-11 02:34:15,519 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-11 02:34:15,520 WARN L170 areAnnotationChecker]: assume_cycle_if_notEXIT has no Hoare annotation [2020-07-11 02:34:15,520 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 02:34:15,520 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-11 02:34:15,520 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-11 02:34:15,520 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-11 02:34:15,520 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-11 02:34:15,520 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2020-07-11 02:34:15,520 WARN L170 areAnnotationChecker]: L96-2 has no Hoare annotation [2020-07-11 02:34:15,520 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2020-07-11 02:34:15,521 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2020-07-11 02:34:15,521 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-11 02:34:15,521 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 02:34:15,521 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2020-07-11 02:34:15,521 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2020-07-11 02:34:15,521 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2020-07-11 02:34:15,521 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-11 02:34:15,521 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2020-07-11 02:34:15,521 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2020-07-11 02:34:15,522 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2020-07-11 02:34:15,522 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2020-07-11 02:34:15,522 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2020-07-11 02:34:15,522 WARN L170 areAnnotationChecker]: L80-2 has no Hoare annotation [2020-07-11 02:34:15,522 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2020-07-11 02:34:15,522 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2020-07-11 02:34:15,522 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2020-07-11 02:34:15,522 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-11 02:34:15,522 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2020-07-11 02:34:15,523 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 02:34:15,523 WARN L170 areAnnotationChecker]: L91-2 has no Hoare annotation [2020-07-11 02:34:15,523 WARN L170 areAnnotationChecker]: L94-2 has no Hoare annotation [2020-07-11 02:34:15,523 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2020-07-11 02:34:15,523 WARN L170 areAnnotationChecker]: L102-3 has no Hoare annotation [2020-07-11 02:34:15,523 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2020-07-11 02:34:15,523 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2020-07-11 02:34:15,523 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2020-07-11 02:34:15,523 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2020-07-11 02:34:15,523 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2020-07-11 02:34:15,524 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2020-07-11 02:34:15,524 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2020-07-11 02:34:15,524 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2020-07-11 02:34:15,524 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-11 02:34:15,524 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-11 02:34:15,524 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-11 02:34:15,524 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2020-07-11 02:34:15,524 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2020-07-11 02:34:15,524 WARN L170 areAnnotationChecker]: L80-5 has no Hoare annotation [2020-07-11 02:34:15,524 WARN L170 areAnnotationChecker]: L80-3 has no Hoare annotation [2020-07-11 02:34:15,525 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2020-07-11 02:34:15,525 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-11 02:34:15,525 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-11 02:34:15,525 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2020-07-11 02:34:15,525 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2020-07-11 02:34:15,525 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2020-07-11 02:34:15,525 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2020-07-11 02:34:15,525 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2020-07-11 02:34:15,525 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2020-07-11 02:34:15,525 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2020-07-11 02:34:15,526 WARN L170 areAnnotationChecker]: L102-4 has no Hoare annotation [2020-07-11 02:34:15,526 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2020-07-11 02:34:15,526 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2020-07-11 02:34:15,526 WARN L170 areAnnotationChecker]: tree_inorderFINAL has no Hoare annotation [2020-07-11 02:34:15,526 WARN L170 areAnnotationChecker]: L71-1 has no Hoare annotation [2020-07-11 02:34:15,526 WARN L170 areAnnotationChecker]: L71-1 has no Hoare annotation [2020-07-11 02:34:15,526 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2020-07-11 02:34:15,526 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2020-07-11 02:34:15,527 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-11 02:34:15,527 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-11 02:34:15,527 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-11 02:34:15,527 WARN L170 areAnnotationChecker]: L85-1 has no Hoare annotation [2020-07-11 02:34:15,527 WARN L170 areAnnotationChecker]: L85-1 has no Hoare annotation [2020-07-11 02:34:15,527 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2020-07-11 02:34:15,528 WARN L170 areAnnotationChecker]: L95-2 has no Hoare annotation [2020-07-11 02:34:15,528 WARN L170 areAnnotationChecker]: L80-6 has no Hoare annotation [2020-07-11 02:34:15,528 WARN L170 areAnnotationChecker]: L80-4 has no Hoare annotation [2020-07-11 02:34:15,528 WARN L170 areAnnotationChecker]: L80-4 has no Hoare annotation [2020-07-11 02:34:15,528 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2020-07-11 02:34:15,528 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-11 02:34:15,528 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2020-07-11 02:34:15,529 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2020-07-11 02:34:15,529 WARN L170 areAnnotationChecker]: L101-6 has no Hoare annotation [2020-07-11 02:34:15,529 WARN L170 areAnnotationChecker]: L101-6 has no Hoare annotation [2020-07-11 02:34:15,529 WARN L170 areAnnotationChecker]: L101-6 has no Hoare annotation [2020-07-11 02:34:15,529 WARN L170 areAnnotationChecker]: L101-3 has no Hoare annotation [2020-07-11 02:34:15,529 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2020-07-11 02:34:15,529 WARN L170 areAnnotationChecker]: L97-2 has no Hoare annotation [2020-07-11 02:34:15,530 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2020-07-11 02:34:15,530 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2020-07-11 02:34:15,530 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2020-07-11 02:34:15,530 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2020-07-11 02:34:15,530 WARN L170 areAnnotationChecker]: L71-2 has no Hoare annotation [2020-07-11 02:34:15,530 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-11 02:34:15,530 WARN L170 areAnnotationChecker]: L39-4 has no Hoare annotation [2020-07-11 02:34:15,530 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-11 02:34:15,530 WARN L170 areAnnotationChecker]: L87-2 has no Hoare annotation [2020-07-11 02:34:15,531 WARN L170 areAnnotationChecker]: L95-3 has no Hoare annotation [2020-07-11 02:34:15,531 WARN L170 areAnnotationChecker]: L80-7 has no Hoare annotation [2020-07-11 02:34:15,531 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-11 02:34:15,531 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-11 02:34:15,531 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-11 02:34:15,531 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-11 02:34:15,531 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-11 02:34:15,532 WARN L170 areAnnotationChecker]: L93-2 has no Hoare annotation [2020-07-11 02:34:15,532 WARN L170 areAnnotationChecker]: L101-7 has no Hoare annotation [2020-07-11 02:34:15,532 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2020-07-11 02:34:15,532 WARN L170 areAnnotationChecker]: L101-4 has no Hoare annotation [2020-07-11 02:34:15,532 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2020-07-11 02:34:15,532 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2020-07-11 02:34:15,533 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2020-07-11 02:34:15,533 WARN L170 areAnnotationChecker]: L73-2 has no Hoare annotation [2020-07-11 02:34:15,533 WARN L170 areAnnotationChecker]: L71-3 has no Hoare annotation [2020-07-11 02:34:15,533 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2020-07-11 02:34:15,533 WARN L170 areAnnotationChecker]: L39-5 has no Hoare annotation [2020-07-11 02:34:15,533 WARN L170 areAnnotationChecker]: L40-5 has no Hoare annotation [2020-07-11 02:34:15,533 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2020-07-11 02:34:15,533 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2020-07-11 02:34:15,534 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2020-07-11 02:34:15,534 WARN L170 areAnnotationChecker]: L80-8 has no Hoare annotation [2020-07-11 02:34:15,534 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2020-07-11 02:34:15,534 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2020-07-11 02:34:15,534 WARN L170 areAnnotationChecker]: L102-1 has no Hoare annotation [2020-07-11 02:34:15,534 WARN L170 areAnnotationChecker]: L101-5 has no Hoare annotation [2020-07-11 02:34:15,535 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2020-07-11 02:34:15,535 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2020-07-11 02:34:15,535 WARN L170 areAnnotationChecker]: L73-3 has no Hoare annotation [2020-07-11 02:34:15,535 WARN L170 areAnnotationChecker]: L71-4 has no Hoare annotation [2020-07-11 02:34:15,535 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-11 02:34:15,535 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-11 02:34:15,535 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-11 02:34:15,536 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-11 02:34:15,536 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-11 02:34:15,536 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2020-07-11 02:34:15,536 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2020-07-11 02:34:15,536 WARN L170 areAnnotationChecker]: L80-9 has no Hoare annotation [2020-07-11 02:34:15,536 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2020-07-11 02:34:15,537 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2020-07-11 02:34:15,537 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2020-07-11 02:34:15,537 WARN L170 areAnnotationChecker]: L102-2 has no Hoare annotation [2020-07-11 02:34:15,537 WARN L170 areAnnotationChecker]: L102-2 has no Hoare annotation [2020-07-11 02:34:15,537 WARN L170 areAnnotationChecker]: L73-4 has no Hoare annotation [2020-07-11 02:34:15,537 WARN L170 areAnnotationChecker]: L71-5 has no Hoare annotation [2020-07-11 02:34:15,537 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-11 02:34:15,538 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-11 02:34:15,538 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-11 02:34:15,538 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-11 02:34:15,538 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2020-07-11 02:34:15,538 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-11 02:34:15,538 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-11 02:34:15,538 WARN L170 areAnnotationChecker]: L80-10 has no Hoare annotation [2020-07-11 02:34:15,539 WARN L170 areAnnotationChecker]: L85-2 has no Hoare annotation [2020-07-11 02:34:15,539 WARN L170 areAnnotationChecker]: L73-5 has no Hoare annotation [2020-07-11 02:34:15,539 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-11 02:34:15,539 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2020-07-11 02:34:15,539 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2020-07-11 02:34:15,539 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-11 02:34:15,540 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-11 02:34:15,540 WARN L170 areAnnotationChecker]: taskFINAL has no Hoare annotation [2020-07-11 02:34:15,540 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-11 02:34:15,540 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2020-07-11 02:34:15,540 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2020-07-11 02:34:15,540 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2020-07-11 02:34:15,541 WARN L170 areAnnotationChecker]: taskEXIT has no Hoare annotation [2020-07-11 02:34:15,541 WARN L170 areAnnotationChecker]: L72-2 has no Hoare annotation [2020-07-11 02:34:15,541 WARN L170 areAnnotationChecker]: L54-3 has no Hoare annotation [2020-07-11 02:34:15,541 WARN L170 areAnnotationChecker]: L56-3 has no Hoare annotation [2020-07-11 02:34:15,541 WARN L170 areAnnotationChecker]: L72-3 has no Hoare annotation [2020-07-11 02:34:15,541 WARN L170 areAnnotationChecker]: L54-4 has no Hoare annotation [2020-07-11 02:34:15,541 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-11 02:34:15,542 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-11 02:34:15,542 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-11 02:34:15,542 WARN L170 areAnnotationChecker]: L72-4 has no Hoare annotation [2020-07-11 02:34:15,542 WARN L170 areAnnotationChecker]: L54-5 has no Hoare annotation [2020-07-11 02:34:15,542 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-11 02:34:15,542 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-11 02:34:15,543 WARN L170 areAnnotationChecker]: L72-5 has no Hoare annotation [2020-07-11 02:34:15,543 WARN L170 areAnnotationChecker]: L54-6 has no Hoare annotation [2020-07-11 02:34:15,543 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-11 02:34:15,543 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-11 02:34:15,543 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2020-07-11 02:34:15,543 WARN L170 areAnnotationChecker]: L54-7 has no Hoare annotation [2020-07-11 02:34:15,544 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2020-07-11 02:34:15,544 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2020-07-11 02:34:15,544 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2020-07-11 02:34:15,544 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2020-07-11 02:34:15,544 WARN L170 areAnnotationChecker]: L60-7 has no Hoare annotation [2020-07-11 02:34:15,544 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2020-07-11 02:34:15,544 WARN L170 areAnnotationChecker]: L58-3 has no Hoare annotation [2020-07-11 02:34:15,545 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2020-07-11 02:34:15,545 WARN L170 areAnnotationChecker]: L60-3 has no Hoare annotation [2020-07-11 02:34:15,545 WARN L170 areAnnotationChecker]: L58-4 has no Hoare annotation [2020-07-11 02:34:15,545 WARN L170 areAnnotationChecker]: tree_delFINAL has no Hoare annotation [2020-07-11 02:34:15,546 WARN L170 areAnnotationChecker]: L60-4 has no Hoare annotation [2020-07-11 02:34:15,547 WARN L170 areAnnotationChecker]: tree_delEXIT has no Hoare annotation [2020-07-11 02:34:15,547 WARN L170 areAnnotationChecker]: L60-5 has no Hoare annotation [2020-07-11 02:34:15,547 WARN L170 areAnnotationChecker]: L60-6 has no Hoare annotation [2020-07-11 02:34:15,547 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-11 02:34:15,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:34:15 BoogieIcfgContainer [2020-07-11 02:34:15,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:34:15,564 INFO L168 Benchmark]: Toolchain (without parser) took 33108.42 ms. Allocated memory was 138.9 MB in the beginning and 502.3 MB in the end (delta: 363.3 MB). Free memory was 104.1 MB in the beginning and 302.1 MB in the end (delta: -197.9 MB). Peak memory consumption was 165.4 MB. Max. memory is 7.1 GB. [2020-07-11 02:34:15,565 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 02:34:15,570 INFO L168 Benchmark]: CACSL2BoogieTranslator took 448.13 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 103.9 MB in the beginning and 181.5 MB in the end (delta: -77.6 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2020-07-11 02:34:15,571 INFO L168 Benchmark]: Boogie Preprocessor took 107.69 ms. Allocated memory is still 203.4 MB. Free memory was 181.5 MB in the beginning and 177.6 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2020-07-11 02:34:15,572 INFO L168 Benchmark]: RCFGBuilder took 1121.65 ms. Allocated memory is still 203.4 MB. Free memory was 177.6 MB in the beginning and 98.4 MB in the end (delta: 79.2 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. [2020-07-11 02:34:15,573 INFO L168 Benchmark]: TraceAbstraction took 31421.12 ms. Allocated memory was 203.4 MB in the beginning and 502.3 MB in the end (delta: 298.8 MB). Free memory was 97.7 MB in the beginning and 302.1 MB in the end (delta: -204.4 MB). Peak memory consumption was 94.5 MB. Max. memory is 7.1 GB. [2020-07-11 02:34:15,581 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.17 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 448.13 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 103.9 MB in the beginning and 181.5 MB in the end (delta: -77.6 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.69 ms. Allocated memory is still 203.4 MB. Free memory was 181.5 MB in the beginning and 177.6 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1121.65 ms. Allocated memory is still 203.4 MB. Free memory was 177.6 MB in the beginning and 98.4 MB in the end (delta: 79.2 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31421.12 ms. Allocated memory was 203.4 MB in the beginning and 502.3 MB in the end (delta: 298.8 MB). Free memory was 97.7 MB in the beginning and 302.1 MB in the end (delta: -204.4 MB). Peak memory consumption was 94.5 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: [L108] CALL, EXPR nondet_tree() [L23] COND FALSE !(__VERIFIER_nondet_bool()) VAL [__VERIFIER_nondet_bool()=0] [L26] struct node *n = (struct node *)malloc(sizeof(struct node)); VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}] [L27] n->data = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=2147483647, malloc(sizeof(struct node))={-1:0}, n={-1:0}] [L28] CALL, EXPR nondet_tree() [L23] COND TRUE __VERIFIER_nondet_bool() VAL [__VERIFIER_nondet_bool()=1] [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() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L29] CALL, EXPR nondet_tree() [L23] COND TRUE __VERIFIER_nondet_bool() VAL [__VERIFIER_nondet_bool()=1] [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() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L30] return n; VAL [\result={-1:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}] [L108] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L108] CALL task(nondet_tree()) VAL [t={-1:0}] [L84] CALL, EXPR min(t) VAL [n={-1:0}] [L35] COND FALSE !(!n) VAL [n={-1:0}, n={-1:0}] [L38] EXPR n->data VAL [n={-1:0}, n={-1:0}, n->data=2147483647] [L38] int a = n->data; VAL [a=2147483647, n={-1:0}, n={-1:0}, n->data=2147483647] [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 VAL [n={0:0}, n={0:0}] [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); VAL [a=2147483647, b=2147483647, min(n->left)=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [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 VAL [n={0:0}, n={0:0}] [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); VAL [a=2147483647, b=2147483647, c=2147483647, min(n->right)=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L41] COND TRUE b <= a && b <= c VAL [a=2147483647, b=2147483647, c=2147483647, n={-1:0}, n={-1:0}] [L41] return b; VAL [\result=2147483647, a=2147483647, b=2147483647, c=2147483647, n={-1:0}, n={-1:0}] [L84] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L84] int a = min(t); VAL [a=2147483647, min(t)=2147483647, t={-1:0}, t={-1:0}] [L85] int b; VAL [a=2147483647, b={2:0}, t={-1:0}, t={-1:0}] [L87] CALL, EXPR size(t) VAL [t={-1:0}] [L79] COND FALSE !(!t) VAL [t={-1:0}, t={-1:0}] [L80] EXPR t->left VAL [t={-1:0}, t={-1:0}, t->left={0:0}] [L80] CALL, EXPR size(t->left) VAL [t={0:0}] [L79] COND TRUE !t VAL [t={0:0}, t={0:0}] [L79] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L80] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}] [L80] EXPR t->right VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L80] CALL, EXPR size(t->right) VAL [t={0:0}] [L79] COND TRUE !t VAL [t={0:0}, t={0:0}] [L79] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L80] 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}] [L80] return size(t->left) + size(t->right) + 1; VAL [\result=1, size(t->left)=0, size(t->right)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L87] RET, EXPR size(t) VAL [a=2147483647, b={2:0}, size(t)=1, t={-1:0}, t={-1:0}] [L87] int n = size(t); VAL [a=2147483647, b={2:0}, n=1, size(t)=1, t={-1:0}, t={-1:0}] [L88] CALL assume_cycle_if_not(n != 0) VAL [\old(cond)=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L88] RET assume_cycle_if_not(n != 0) VAL [a=2147483647, b={2:0}, n=1, t={-1:0}, t={-1:0}] [L89] 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}] [L89] 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}] [L90] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L68] COND FALSE !(!t) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}] [L71] 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}] [L71] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L68] COND TRUE !t VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L69] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L71] 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] [L71] i = 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] [L72] EXPR i++ VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, i++=1, t={-1:0}, t={-1:0}] [L72] EXPR t->data VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, i++=1, t={-1:0}, t={-1:0}, t->data=2147483647] [L72] a[i++] = t->data VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, i++=1, t={-1:0}, t={-1:0}, t->data=2147483647] [L73] 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}] [L73] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L68] COND TRUE !t VAL [\old(i)=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L69] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L73] 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] [L73] i = 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] [L74] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L90] 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}] [L91] 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] [L91] 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, 206 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 31.1s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 23.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 726 SDtfs, 1668 SDslu, 2135 SDs, 0 SdLazy, 4474 SolverSat, 555 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 45 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 527 NumberOfCodeBlocks, 527 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 364 ConstructedInterpolants, 0 QuantifiedInterpolants, 103440 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 72/74 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...