/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 18:45:02,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 18:45:02,900 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 18:45:02,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 18:45:02,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 18:45:02,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 18:45:02,916 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 18:45:02,918 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 18:45:02,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 18:45:02,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 18:45:02,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 18:45:02,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 18:45:02,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 18:45:02,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 18:45:02,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 18:45:02,926 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 18:45:02,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 18:45:02,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 18:45:02,929 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 18:45:02,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 18:45:02,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 18:45:02,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 18:45:02,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 18:45:02,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 18:45:02,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 18:45:02,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 18:45:02,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 18:45:02,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 18:45:02,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 18:45:02,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 18:45:02,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 18:45:02,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 18:45:02,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 18:45:02,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 18:45:02,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 18:45:02,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 18:45:02,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 18:45:02,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 18:45:02,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 18:45:02,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 18:45:02,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 18:45:02,949 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 18:45:02,958 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 18:45:02,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 18:45:02,960 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 18:45:02,960 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 18:45:02,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 18:45:02,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 18:45:02,961 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 18:45:02,961 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 18:45:02,961 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 18:45:02,961 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 18:45:02,961 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 18:45:02,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 18:45:02,962 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 18:45:02,962 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 18:45:02,962 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 18:45:02,962 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 18:45:02,963 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 18:45:02,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 18:45:02,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:45:02,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 18:45:02,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 18:45:02,964 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 18:45:02,964 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 18:45:03,253 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 18:45:03,270 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 18:45:03,274 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 18:45:03,275 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 18:45:03,276 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 18:45:03,277 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c [2020-07-10 18:45:03,340 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e165ecb43/94613a2b55044cc585c59a0064ee827e/FLAG8b7d2f509 [2020-07-10 18:45:03,863 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 18:45:03,864 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c [2020-07-10 18:45:03,874 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e165ecb43/94613a2b55044cc585c59a0064ee827e/FLAG8b7d2f509 [2020-07-10 18:45:04,206 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e165ecb43/94613a2b55044cc585c59a0064ee827e [2020-07-10 18:45:04,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 18:45:04,218 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 18:45:04,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 18:45:04,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 18:45:04,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 18:45:04,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:45:04" (1/1) ... [2020-07-10 18:45:04,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2092566f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:45:04, skipping insertion in model container [2020-07-10 18:45:04,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:45:04" (1/1) ... [2020-07-10 18:45:04,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 18:45:04,264 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 18:45:04,467 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-10 18:45:04,470 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-10 18:45:04,503 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:45:04,520 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 18:45:04,632 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-10 18:45:04,634 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-10 18:45:04,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:45:04,672 INFO L208 MainTranslator]: Completed translation [2020-07-10 18:45:04,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:45:04 WrapperNode [2020-07-10 18:45:04,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 18:45:04,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 18:45:04,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 18:45:04,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 18:45:04,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:45:04" (1/1) ... [2020-07-10 18:45:04,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:45:04" (1/1) ... [2020-07-10 18:45:04,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:45:04" (1/1) ... [2020-07-10 18:45:04,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:45:04" (1/1) ... [2020-07-10 18:45:04,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:45:04" (1/1) ... [2020-07-10 18:45:04,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:45:04" (1/1) ... [2020-07-10 18:45:04,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:45:04" (1/1) ... [2020-07-10 18:45:04,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 18:45:04,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 18:45:04,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 18:45:04,741 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 18:45:04,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:45:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:45:04,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 18:45:04,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 18:45:04,807 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 18:45:04,807 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 18:45:04,807 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-07-10 18:45:04,808 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-07-10 18:45:04,808 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-07-10 18:45:04,808 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-07-10 18:45:04,808 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-07-10 18:45:04,808 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-07-10 18:45:04,808 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 18:45:04,809 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-10 18:45:04,809 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 18:45:04,809 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 18:45:04,809 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 18:45:04,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 18:45:04,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-10 18:45:04,810 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 18:45:04,810 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 18:45:04,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 18:45:04,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 18:45:04,811 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-07-10 18:45:04,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 18:45:04,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 18:45:04,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 18:45:04,811 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-07-10 18:45:04,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 18:45:04,812 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-07-10 18:45:04,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 18:45:04,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 18:45:04,812 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-07-10 18:45:04,812 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-07-10 18:45:04,812 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-07-10 18:45:04,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 18:45:04,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-10 18:45:04,813 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 18:45:04,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 18:45:04,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 18:45:05,697 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 18:45:05,698 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 18:45:05,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:45:05 BoogieIcfgContainer [2020-07-10 18:45:05,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 18:45:05,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 18:45:05,706 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 18:45:05,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 18:45:05,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 06:45:04" (1/3) ... [2020-07-10 18:45:05,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4e6d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:45:05, skipping insertion in model container [2020-07-10 18:45:05,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:45:04" (2/3) ... [2020-07-10 18:45:05,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4e6d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:45:05, skipping insertion in model container [2020-07-10 18:45:05,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:45:05" (3/3) ... [2020-07-10 18:45:05,714 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2020-07-10 18:45:05,726 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 18:45:05,735 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 18:45:05,752 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 18:45:05,777 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 18:45:05,778 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 18:45:05,778 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 18:45:05,778 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 18:45:05,779 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 18:45:05,779 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 18:45:05,779 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 18:45:05,779 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 18:45:05,804 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states. [2020-07-10 18:45:05,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-10 18:45:05,831 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:45:05,832 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-10 18:45:05,833 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:45:05,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:45:05,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1242734485, now seen corresponding path program 1 times [2020-07-10 18:45:05,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:45:05,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [182611757] [2020-07-10 18:45:05,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:45:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:06,200 INFO L280 TraceCheckUtils]: 0: Hoare triple {224#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {186#true} is VALID [2020-07-10 18:45:06,201 INFO L280 TraceCheckUtils]: 1: Hoare triple {186#true} #valid := #valid[0 := 0]; {186#true} is VALID [2020-07-10 18:45:06,201 INFO L280 TraceCheckUtils]: 2: Hoare triple {186#true} assume 0 < #StackHeapBarrier; {186#true} is VALID [2020-07-10 18:45:06,202 INFO L280 TraceCheckUtils]: 3: Hoare triple {186#true} assume true; {186#true} is VALID [2020-07-10 18:45:06,203 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {186#true} {186#true} #255#return; {186#true} is VALID [2020-07-10 18:45:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:06,267 INFO L280 TraceCheckUtils]: 0: Hoare triple {225#(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; {186#true} is VALID [2020-07-10 18:45:06,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {186#true} havoc #t~nondet1; {186#true} is VALID [2020-07-10 18:45:06,268 INFO L280 TraceCheckUtils]: 2: Hoare triple {186#true} #res.base, #res.offset := 0, 0; {186#true} is VALID [2020-07-10 18:45:06,268 INFO L280 TraceCheckUtils]: 3: Hoare triple {186#true} assume true; {186#true} is VALID [2020-07-10 18:45:06,268 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {186#true} {186#true} #211#return; {186#true} is VALID [2020-07-10 18:45:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:06,282 INFO L280 TraceCheckUtils]: 0: Hoare triple {186#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {186#true} is VALID [2020-07-10 18:45:06,282 INFO L280 TraceCheckUtils]: 1: Hoare triple {186#true} assume ~n.base == 0 && ~n.offset == 0; {186#true} is VALID [2020-07-10 18:45:06,283 INFO L280 TraceCheckUtils]: 2: Hoare triple {186#true} #res := 2147483647; {186#true} is VALID [2020-07-10 18:45:06,283 INFO L280 TraceCheckUtils]: 3: Hoare triple {186#true} assume true; {186#true} is VALID [2020-07-10 18:45:06,283 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {186#true} {186#true} #225#return; {186#true} is VALID [2020-07-10 18:45:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:06,309 INFO L280 TraceCheckUtils]: 0: Hoare triple {186#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {186#true} is VALID [2020-07-10 18:45:06,310 INFO L280 TraceCheckUtils]: 1: Hoare triple {186#true} assume ~t.base == 0 && ~t.offset == 0; {186#true} is VALID [2020-07-10 18:45:06,311 INFO L280 TraceCheckUtils]: 2: Hoare triple {186#true} #res := 0; {226#(= 0 |size_#res|)} is VALID [2020-07-10 18:45:06,312 INFO L280 TraceCheckUtils]: 3: Hoare triple {226#(= 0 |size_#res|)} assume true; {226#(= 0 |size_#res|)} is VALID [2020-07-10 18:45:06,314 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {226#(= 0 |size_#res|)} {186#true} #227#return; {208#(= 0 |task_#t~ret26|)} is VALID [2020-07-10 18:45:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:06,355 INFO L280 TraceCheckUtils]: 0: Hoare triple {186#true} ~cond := #in~cond; {227#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2020-07-10 18:45:06,357 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {228#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID [2020-07-10 18:45:06,357 INFO L280 TraceCheckUtils]: 2: Hoare triple {228#(not (= 0 |assume_abort_if_not_#in~cond|))} assume true; {228#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID [2020-07-10 18:45:06,359 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {228#(not (= 0 |assume_abort_if_not_#in~cond|))} {209#(= 0 task_~n~1)} #229#return; {187#false} is VALID [2020-07-10 18:45:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:06,379 INFO L280 TraceCheckUtils]: 0: Hoare triple {229#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {186#true} is VALID [2020-07-10 18:45:06,379 INFO L280 TraceCheckUtils]: 1: Hoare triple {186#true} assume true; {186#true} is VALID [2020-07-10 18:45:06,380 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {186#true} {187#false} #231#return; {187#false} is VALID [2020-07-10 18:45:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:06,408 INFO L280 TraceCheckUtils]: 0: Hoare triple {230#(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; {186#true} is VALID [2020-07-10 18:45:06,409 INFO L280 TraceCheckUtils]: 1: Hoare triple {186#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {186#true} is VALID [2020-07-10 18:45:06,409 INFO L280 TraceCheckUtils]: 2: Hoare triple {186#true} ~i := #in~i; {186#true} is VALID [2020-07-10 18:45:06,410 INFO L280 TraceCheckUtils]: 3: Hoare triple {186#true} assume ~t.base == 0 && ~t.offset == 0; {186#true} is VALID [2020-07-10 18:45:06,410 INFO L280 TraceCheckUtils]: 4: Hoare triple {186#true} #res := ~i; {186#true} is VALID [2020-07-10 18:45:06,411 INFO L280 TraceCheckUtils]: 5: Hoare triple {186#true} assume true; {186#true} is VALID [2020-07-10 18:45:06,411 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {186#true} {187#false} #233#return; {187#false} is VALID [2020-07-10 18:45:06,413 INFO L263 TraceCheckUtils]: 0: Hoare triple {186#true} call ULTIMATE.init(); {224#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:45:06,413 INFO L280 TraceCheckUtils]: 1: Hoare triple {224#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {186#true} is VALID [2020-07-10 18:45:06,413 INFO L280 TraceCheckUtils]: 2: Hoare triple {186#true} #valid := #valid[0 := 0]; {186#true} is VALID [2020-07-10 18:45:06,414 INFO L280 TraceCheckUtils]: 3: Hoare triple {186#true} assume 0 < #StackHeapBarrier; {186#true} is VALID [2020-07-10 18:45:06,414 INFO L280 TraceCheckUtils]: 4: Hoare triple {186#true} assume true; {186#true} is VALID [2020-07-10 18:45:06,415 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {186#true} {186#true} #255#return; {186#true} is VALID [2020-07-10 18:45:06,415 INFO L263 TraceCheckUtils]: 6: Hoare triple {186#true} call #t~ret39 := main(); {186#true} is VALID [2020-07-10 18:45:06,416 INFO L263 TraceCheckUtils]: 7: Hoare triple {186#true} call #t~ret38.base, #t~ret38.offset := nondet_tree(); {225#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 18:45:06,417 INFO L280 TraceCheckUtils]: 8: Hoare triple {225#(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; {186#true} is VALID [2020-07-10 18:45:06,417 INFO L280 TraceCheckUtils]: 9: Hoare triple {186#true} havoc #t~nondet1; {186#true} is VALID [2020-07-10 18:45:06,417 INFO L280 TraceCheckUtils]: 10: Hoare triple {186#true} #res.base, #res.offset := 0, 0; {186#true} is VALID [2020-07-10 18:45:06,418 INFO L280 TraceCheckUtils]: 11: Hoare triple {186#true} assume true; {186#true} is VALID [2020-07-10 18:45:06,418 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {186#true} {186#true} #211#return; {186#true} is VALID [2020-07-10 18:45:06,418 INFO L263 TraceCheckUtils]: 13: Hoare triple {186#true} call task(#t~ret38.base, #t~ret38.offset); {186#true} is VALID [2020-07-10 18:45:06,419 INFO L280 TraceCheckUtils]: 14: Hoare triple {186#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {186#true} is VALID [2020-07-10 18:45:06,419 INFO L263 TraceCheckUtils]: 15: Hoare triple {186#true} call #t~ret25 := min(~t.base, ~t.offset); {186#true} is VALID [2020-07-10 18:45:06,419 INFO L280 TraceCheckUtils]: 16: Hoare triple {186#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {186#true} is VALID [2020-07-10 18:45:06,420 INFO L280 TraceCheckUtils]: 17: Hoare triple {186#true} assume ~n.base == 0 && ~n.offset == 0; {186#true} is VALID [2020-07-10 18:45:06,420 INFO L280 TraceCheckUtils]: 18: Hoare triple {186#true} #res := 2147483647; {186#true} is VALID [2020-07-10 18:45:06,420 INFO L280 TraceCheckUtils]: 19: Hoare triple {186#true} assume true; {186#true} is VALID [2020-07-10 18:45:06,421 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {186#true} {186#true} #225#return; {186#true} is VALID [2020-07-10 18:45:06,421 INFO L280 TraceCheckUtils]: 21: Hoare triple {186#true} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647; {186#true} is VALID [2020-07-10 18:45:06,421 INFO L280 TraceCheckUtils]: 22: Hoare triple {186#true} ~a~1 := #t~ret25; {186#true} is VALID [2020-07-10 18:45:06,422 INFO L280 TraceCheckUtils]: 23: Hoare triple {186#true} havoc #t~ret25; {186#true} is VALID [2020-07-10 18:45:06,422 INFO L280 TraceCheckUtils]: 24: Hoare triple {186#true} SUMMARY for call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); srcloc: L75 {186#true} is VALID [2020-07-10 18:45:06,423 INFO L263 TraceCheckUtils]: 25: Hoare triple {186#true} call #t~ret26 := size(~t.base, ~t.offset); {186#true} is VALID [2020-07-10 18:45:06,423 INFO L280 TraceCheckUtils]: 26: Hoare triple {186#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {186#true} is VALID [2020-07-10 18:45:06,423 INFO L280 TraceCheckUtils]: 27: Hoare triple {186#true} assume ~t.base == 0 && ~t.offset == 0; {186#true} is VALID [2020-07-10 18:45:06,424 INFO L280 TraceCheckUtils]: 28: Hoare triple {186#true} #res := 0; {226#(= 0 |size_#res|)} is VALID [2020-07-10 18:45:06,425 INFO L280 TraceCheckUtils]: 29: Hoare triple {226#(= 0 |size_#res|)} assume true; {226#(= 0 |size_#res|)} is VALID [2020-07-10 18:45:06,427 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {226#(= 0 |size_#res|)} {186#true} #227#return; {208#(= 0 |task_#t~ret26|)} is VALID [2020-07-10 18:45:06,427 INFO L280 TraceCheckUtils]: 31: Hoare triple {208#(= 0 |task_#t~ret26|)} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647; {208#(= 0 |task_#t~ret26|)} is VALID [2020-07-10 18:45:06,428 INFO L280 TraceCheckUtils]: 32: Hoare triple {208#(= 0 |task_#t~ret26|)} ~n~1 := #t~ret26; {209#(= 0 task_~n~1)} is VALID [2020-07-10 18:45:06,429 INFO L280 TraceCheckUtils]: 33: Hoare triple {209#(= 0 task_~n~1)} havoc #t~ret26; {209#(= 0 task_~n~1)} is VALID [2020-07-10 18:45:06,429 INFO L263 TraceCheckUtils]: 34: Hoare triple {209#(= 0 task_~n~1)} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {186#true} is VALID [2020-07-10 18:45:06,430 INFO L280 TraceCheckUtils]: 35: Hoare triple {186#true} ~cond := #in~cond; {227#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2020-07-10 18:45:06,431 INFO L280 TraceCheckUtils]: 36: Hoare triple {227#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {228#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID [2020-07-10 18:45:06,432 INFO L280 TraceCheckUtils]: 37: Hoare triple {228#(not (= 0 |assume_abort_if_not_#in~cond|))} assume true; {228#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID [2020-07-10 18:45:06,433 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {228#(not (= 0 |assume_abort_if_not_#in~cond|))} {209#(= 0 task_~n~1)} #229#return; {187#false} is VALID [2020-07-10 18:45:06,434 INFO L280 TraceCheckUtils]: 39: Hoare triple {187#false} SUMMARY for call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(4 * ~n~1); srcloc: L78-1 {187#false} is VALID [2020-07-10 18:45:06,434 INFO L263 TraceCheckUtils]: 40: Hoare triple {187#false} call #Ultimate.meminit(#t~malloc27.base, #t~malloc27.offset, ~n~1, 4, 4 * ~n~1); {229#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 18:45:06,434 INFO L280 TraceCheckUtils]: 41: Hoare triple {229#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {186#true} is VALID [2020-07-10 18:45:06,435 INFO L280 TraceCheckUtils]: 42: Hoare triple {186#true} assume true; {186#true} is VALID [2020-07-10 18:45:06,435 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {186#true} {187#false} #231#return; {187#false} is VALID [2020-07-10 18:45:06,435 INFO L280 TraceCheckUtils]: 44: Hoare triple {187#false} ~x~0.base, ~x~0.offset := #t~malloc27.base, #t~malloc27.offset; {187#false} is VALID [2020-07-10 18:45:06,436 INFO L263 TraceCheckUtils]: 45: Hoare triple {187#false} call #t~ret28 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {230#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 18:45:06,436 INFO L280 TraceCheckUtils]: 46: Hoare triple {230#(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; {186#true} is VALID [2020-07-10 18:45:06,436 INFO L280 TraceCheckUtils]: 47: Hoare triple {186#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {186#true} is VALID [2020-07-10 18:45:06,437 INFO L280 TraceCheckUtils]: 48: Hoare triple {186#true} ~i := #in~i; {186#true} is VALID [2020-07-10 18:45:06,437 INFO L280 TraceCheckUtils]: 49: Hoare triple {186#true} assume ~t.base == 0 && ~t.offset == 0; {186#true} is VALID [2020-07-10 18:45:06,437 INFO L280 TraceCheckUtils]: 50: Hoare triple {186#true} #res := ~i; {186#true} is VALID [2020-07-10 18:45:06,438 INFO L280 TraceCheckUtils]: 51: Hoare triple {186#true} assume true; {186#true} is VALID [2020-07-10 18:45:06,438 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {186#true} {187#false} #233#return; {187#false} is VALID [2020-07-10 18:45:06,438 INFO L280 TraceCheckUtils]: 53: Hoare triple {187#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647; {187#false} is VALID [2020-07-10 18:45:06,439 INFO L280 TraceCheckUtils]: 54: Hoare triple {187#false} havoc #t~ret28; {187#false} is VALID [2020-07-10 18:45:06,439 INFO L280 TraceCheckUtils]: 55: Hoare triple {187#false} SUMMARY for call #t~mem29 := read~int(~x~0.base, ~x~0.offset, 4); srcloc: L81 {187#false} is VALID [2020-07-10 18:45:06,439 INFO L263 TraceCheckUtils]: 56: Hoare triple {187#false} call __VERIFIER_assert((if ~a~1 == #t~mem29 then 1 else 0)); {187#false} is VALID [2020-07-10 18:45:06,440 INFO L280 TraceCheckUtils]: 57: Hoare triple {187#false} ~cond := #in~cond; {187#false} is VALID [2020-07-10 18:45:06,440 INFO L280 TraceCheckUtils]: 58: Hoare triple {187#false} assume 0 == ~cond; {187#false} is VALID [2020-07-10 18:45:06,440 INFO L280 TraceCheckUtils]: 59: Hoare triple {187#false} assume !false; {187#false} is VALID [2020-07-10 18:45:06,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:45:06,451 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:45:06,453 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [182611757] [2020-07-10 18:45:06,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:45:06,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 18:45:06,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193950658] [2020-07-10 18:45:06,463 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2020-07-10 18:45:06,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:45:06,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 18:45:06,574 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-10 18:45:06,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 18:45:06,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:45:06,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 18:45:06,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-10 18:45:06,589 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 11 states. [2020-07-10 18:45:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:45:10,848 INFO L93 Difference]: Finished difference Result 324 states and 379 transitions. [2020-07-10 18:45:10,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 18:45:10,849 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2020-07-10 18:45:10,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:45:10,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 18:45:10,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 379 transitions. [2020-07-10 18:45:10,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 18:45:10,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 379 transitions. [2020-07-10 18:45:10,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 379 transitions. [2020-07-10 18:45:11,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 379 edges. 379 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:45:11,508 INFO L225 Difference]: With dead ends: 324 [2020-07-10 18:45:11,509 INFO L226 Difference]: Without dead ends: 188 [2020-07-10 18:45:11,521 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-10 18:45:11,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-07-10 18:45:11,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2020-07-10 18:45:11,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:45:11,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 175 states. [2020-07-10 18:45:11,866 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 175 states. [2020-07-10 18:45:11,867 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 175 states. [2020-07-10 18:45:11,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:45:11,890 INFO L93 Difference]: Finished difference Result 188 states and 216 transitions. [2020-07-10 18:45:11,890 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 216 transitions. [2020-07-10 18:45:11,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:45:11,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:45:11,896 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand 188 states. [2020-07-10 18:45:11,896 INFO L87 Difference]: Start difference. First operand 175 states. Second operand 188 states. [2020-07-10 18:45:11,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:45:11,916 INFO L93 Difference]: Finished difference Result 188 states and 216 transitions. [2020-07-10 18:45:11,916 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 216 transitions. [2020-07-10 18:45:11,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:45:11,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:45:11,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:45:11,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:45:11,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-07-10 18:45:11,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 198 transitions. [2020-07-10 18:45:11,937 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 198 transitions. Word has length 60 [2020-07-10 18:45:11,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:45:11,938 INFO L479 AbstractCegarLoop]: Abstraction has 175 states and 198 transitions. [2020-07-10 18:45:11,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 18:45:11,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 175 states and 198 transitions. [2020-07-10 18:45:12,238 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:45:12,239 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 198 transitions. [2020-07-10 18:45:12,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-07-10 18:45:12,243 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:45:12,244 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-10 18:45:12,244 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 18:45:12,244 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:45:12,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:45:12,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1686429873, now seen corresponding path program 1 times [2020-07-10 18:45:12,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:45:12,245 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1372467316] [2020-07-10 18:45:12,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:45:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:12,413 INFO L280 TraceCheckUtils]: 0: Hoare triple {1681#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1622#true} is VALID [2020-07-10 18:45:12,414 INFO L280 TraceCheckUtils]: 1: Hoare triple {1622#true} #valid := #valid[0 := 0]; {1622#true} is VALID [2020-07-10 18:45:12,414 INFO L280 TraceCheckUtils]: 2: Hoare triple {1622#true} assume 0 < #StackHeapBarrier; {1622#true} is VALID [2020-07-10 18:45:12,414 INFO L280 TraceCheckUtils]: 3: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-10 18:45:12,415 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1622#true} {1622#true} #255#return; {1622#true} is VALID [2020-07-10 18:45:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:12,477 INFO L280 TraceCheckUtils]: 0: Hoare triple {1682#(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; {1622#true} is VALID [2020-07-10 18:45:12,478 INFO L280 TraceCheckUtils]: 1: Hoare triple {1622#true} havoc #t~nondet1; {1622#true} is VALID [2020-07-10 18:45:12,480 INFO L280 TraceCheckUtils]: 2: Hoare triple {1622#true} #res.base, #res.offset := 0, 0; {1683#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-10 18:45:12,481 INFO L280 TraceCheckUtils]: 3: Hoare triple {1683#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1683#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-10 18:45:12,482 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1683#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {1622#true} #211#return; {1634#(and (= 0 |main_#t~ret38.offset|) (= 0 |main_#t~ret38.base|))} is VALID [2020-07-10 18:45:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:12,491 INFO L280 TraceCheckUtils]: 0: Hoare triple {1622#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1622#true} is VALID [2020-07-10 18:45:12,491 INFO L280 TraceCheckUtils]: 1: Hoare triple {1622#true} assume ~n.base == 0 && ~n.offset == 0; {1622#true} is VALID [2020-07-10 18:45:12,492 INFO L280 TraceCheckUtils]: 2: Hoare triple {1622#true} #res := 2147483647; {1622#true} is VALID [2020-07-10 18:45:12,492 INFO L280 TraceCheckUtils]: 3: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-10 18:45:12,493 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1622#true} {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #225#return; {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-10 18:45:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:12,567 INFO L280 TraceCheckUtils]: 0: Hoare triple {1622#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1622#true} is VALID [2020-07-10 18:45:12,568 INFO L280 TraceCheckUtils]: 1: Hoare triple {1622#true} assume ~t.base == 0 && ~t.offset == 0; {1622#true} is VALID [2020-07-10 18:45:12,568 INFO L280 TraceCheckUtils]: 2: Hoare triple {1622#true} #res := 0; {1622#true} is VALID [2020-07-10 18:45:12,568 INFO L280 TraceCheckUtils]: 3: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-10 18:45:12,569 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1622#true} {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #251#return; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:12,577 INFO L280 TraceCheckUtils]: 0: Hoare triple {1622#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1622#true} is VALID [2020-07-10 18:45:12,577 INFO L280 TraceCheckUtils]: 1: Hoare triple {1622#true} assume ~t.base == 0 && ~t.offset == 0; {1622#true} is VALID [2020-07-10 18:45:12,578 INFO L280 TraceCheckUtils]: 2: Hoare triple {1622#true} #res := 0; {1622#true} is VALID [2020-07-10 18:45:12,578 INFO L280 TraceCheckUtils]: 3: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-10 18:45:12,579 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1622#true} {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #253#return; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,580 INFO L280 TraceCheckUtils]: 0: Hoare triple {1622#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1684#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} is VALID [2020-07-10 18:45:12,581 INFO L280 TraceCheckUtils]: 1: Hoare triple {1684#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0 && ~t.offset == 0); {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,582 INFO L280 TraceCheckUtils]: 2: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} SUMMARY for call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); srcloc: L70 {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,582 INFO L263 TraceCheckUtils]: 3: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {1622#true} is VALID [2020-07-10 18:45:12,583 INFO L280 TraceCheckUtils]: 4: Hoare triple {1622#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1622#true} is VALID [2020-07-10 18:45:12,583 INFO L280 TraceCheckUtils]: 5: Hoare triple {1622#true} assume ~t.base == 0 && ~t.offset == 0; {1622#true} is VALID [2020-07-10 18:45:12,583 INFO L280 TraceCheckUtils]: 6: Hoare triple {1622#true} #res := 0; {1622#true} is VALID [2020-07-10 18:45:12,584 INFO L280 TraceCheckUtils]: 7: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-10 18:45:12,585 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1622#true} {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #251#return; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,586 INFO L280 TraceCheckUtils]: 9: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,588 INFO L280 TraceCheckUtils]: 10: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); srcloc: L70-3 {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,588 INFO L263 TraceCheckUtils]: 11: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1622#true} is VALID [2020-07-10 18:45:12,588 INFO L280 TraceCheckUtils]: 12: Hoare triple {1622#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1622#true} is VALID [2020-07-10 18:45:12,589 INFO L280 TraceCheckUtils]: 13: Hoare triple {1622#true} assume ~t.base == 0 && ~t.offset == 0; {1622#true} is VALID [2020-07-10 18:45:12,589 INFO L280 TraceCheckUtils]: 14: Hoare triple {1622#true} #res := 0; {1622#true} is VALID [2020-07-10 18:45:12,589 INFO L280 TraceCheckUtils]: 15: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-10 18:45:12,591 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1622#true} {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #253#return; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,592 INFO L280 TraceCheckUtils]: 17: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,593 INFO L280 TraceCheckUtils]: 18: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #res := 1 + (#t~ret22 + #t~ret24); {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,593 INFO L280 TraceCheckUtils]: 19: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~mem21.base, #t~mem21.offset; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,594 INFO L280 TraceCheckUtils]: 20: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~ret24; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,595 INFO L280 TraceCheckUtils]: 21: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~ret22; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,595 INFO L280 TraceCheckUtils]: 22: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~mem23.base, #t~mem23.offset; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,596 INFO L280 TraceCheckUtils]: 23: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,597 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #227#return; {1623#false} is VALID [2020-07-10 18:45:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:12,605 INFO L280 TraceCheckUtils]: 0: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2020-07-10 18:45:12,605 INFO L280 TraceCheckUtils]: 1: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2020-07-10 18:45:12,606 INFO L280 TraceCheckUtils]: 2: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-10 18:45:12,606 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1622#true} {1623#false} #229#return; {1623#false} is VALID [2020-07-10 18:45:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:12,648 INFO L280 TraceCheckUtils]: 0: Hoare triple {1696#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1622#true} is VALID [2020-07-10 18:45:12,648 INFO L280 TraceCheckUtils]: 1: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-10 18:45:12,649 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1622#true} {1623#false} #231#return; {1623#false} is VALID [2020-07-10 18:45:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:12,675 INFO L280 TraceCheckUtils]: 0: Hoare triple {1697#(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; {1622#true} is VALID [2020-07-10 18:45:12,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {1622#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1622#true} is VALID [2020-07-10 18:45:12,675 INFO L280 TraceCheckUtils]: 2: Hoare triple {1622#true} ~i := #in~i; {1622#true} is VALID [2020-07-10 18:45:12,675 INFO L280 TraceCheckUtils]: 3: Hoare triple {1622#true} assume ~t.base == 0 && ~t.offset == 0; {1622#true} is VALID [2020-07-10 18:45:12,676 INFO L280 TraceCheckUtils]: 4: Hoare triple {1622#true} #res := ~i; {1622#true} is VALID [2020-07-10 18:45:12,676 INFO L280 TraceCheckUtils]: 5: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-10 18:45:12,676 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1622#true} {1623#false} #233#return; {1623#false} is VALID [2020-07-10 18:45:12,677 INFO L263 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1681#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:45:12,677 INFO L280 TraceCheckUtils]: 1: Hoare triple {1681#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1622#true} is VALID [2020-07-10 18:45:12,678 INFO L280 TraceCheckUtils]: 2: Hoare triple {1622#true} #valid := #valid[0 := 0]; {1622#true} is VALID [2020-07-10 18:45:12,678 INFO L280 TraceCheckUtils]: 3: Hoare triple {1622#true} assume 0 < #StackHeapBarrier; {1622#true} is VALID [2020-07-10 18:45:12,678 INFO L280 TraceCheckUtils]: 4: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-10 18:45:12,678 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1622#true} {1622#true} #255#return; {1622#true} is VALID [2020-07-10 18:45:12,678 INFO L263 TraceCheckUtils]: 6: Hoare triple {1622#true} call #t~ret39 := main(); {1622#true} is VALID [2020-07-10 18:45:12,679 INFO L263 TraceCheckUtils]: 7: Hoare triple {1622#true} call #t~ret38.base, #t~ret38.offset := nondet_tree(); {1682#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 18:45:12,679 INFO L280 TraceCheckUtils]: 8: Hoare triple {1682#(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; {1622#true} is VALID [2020-07-10 18:45:12,680 INFO L280 TraceCheckUtils]: 9: Hoare triple {1622#true} havoc #t~nondet1; {1622#true} is VALID [2020-07-10 18:45:12,681 INFO L280 TraceCheckUtils]: 10: Hoare triple {1622#true} #res.base, #res.offset := 0, 0; {1683#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-10 18:45:12,682 INFO L280 TraceCheckUtils]: 11: Hoare triple {1683#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1683#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-10 18:45:12,683 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1683#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {1622#true} #211#return; {1634#(and (= 0 |main_#t~ret38.offset|) (= 0 |main_#t~ret38.base|))} is VALID [2020-07-10 18:45:12,684 INFO L263 TraceCheckUtils]: 13: Hoare triple {1634#(and (= 0 |main_#t~ret38.offset|) (= 0 |main_#t~ret38.base|))} call task(#t~ret38.base, #t~ret38.offset); {1635#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} is VALID [2020-07-10 18:45:12,685 INFO L280 TraceCheckUtils]: 14: Hoare triple {1635#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-10 18:45:12,686 INFO L263 TraceCheckUtils]: 15: Hoare triple {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret25 := min(~t.base, ~t.offset); {1622#true} is VALID [2020-07-10 18:45:12,686 INFO L280 TraceCheckUtils]: 16: Hoare triple {1622#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1622#true} is VALID [2020-07-10 18:45:12,686 INFO L280 TraceCheckUtils]: 17: Hoare triple {1622#true} assume ~n.base == 0 && ~n.offset == 0; {1622#true} is VALID [2020-07-10 18:45:12,686 INFO L280 TraceCheckUtils]: 18: Hoare triple {1622#true} #res := 2147483647; {1622#true} is VALID [2020-07-10 18:45:12,687 INFO L280 TraceCheckUtils]: 19: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-10 18:45:12,687 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1622#true} {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #225#return; {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-10 18:45:12,688 INFO L280 TraceCheckUtils]: 21: Hoare triple {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647; {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-10 18:45:12,689 INFO L280 TraceCheckUtils]: 22: Hoare triple {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} ~a~1 := #t~ret25; {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-10 18:45:12,690 INFO L280 TraceCheckUtils]: 23: Hoare triple {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} havoc #t~ret25; {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-10 18:45:12,690 INFO L280 TraceCheckUtils]: 24: Hoare triple {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} SUMMARY for call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); srcloc: L75 {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-10 18:45:12,691 INFO L263 TraceCheckUtils]: 25: Hoare triple {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret26 := size(~t.base, ~t.offset); {1622#true} is VALID [2020-07-10 18:45:12,693 INFO L280 TraceCheckUtils]: 26: Hoare triple {1622#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1684#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} is VALID [2020-07-10 18:45:12,694 INFO L280 TraceCheckUtils]: 27: Hoare triple {1684#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0 && ~t.offset == 0); {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,695 INFO L280 TraceCheckUtils]: 28: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} SUMMARY for call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); srcloc: L70 {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,695 INFO L263 TraceCheckUtils]: 29: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {1622#true} is VALID [2020-07-10 18:45:12,695 INFO L280 TraceCheckUtils]: 30: Hoare triple {1622#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1622#true} is VALID [2020-07-10 18:45:12,696 INFO L280 TraceCheckUtils]: 31: Hoare triple {1622#true} assume ~t.base == 0 && ~t.offset == 0; {1622#true} is VALID [2020-07-10 18:45:12,696 INFO L280 TraceCheckUtils]: 32: Hoare triple {1622#true} #res := 0; {1622#true} is VALID [2020-07-10 18:45:12,696 INFO L280 TraceCheckUtils]: 33: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-10 18:45:12,698 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1622#true} {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #251#return; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,699 INFO L280 TraceCheckUtils]: 35: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,701 INFO L280 TraceCheckUtils]: 36: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); srcloc: L70-3 {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,701 INFO L263 TraceCheckUtils]: 37: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1622#true} is VALID [2020-07-10 18:45:12,701 INFO L280 TraceCheckUtils]: 38: Hoare triple {1622#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1622#true} is VALID [2020-07-10 18:45:12,701 INFO L280 TraceCheckUtils]: 39: Hoare triple {1622#true} assume ~t.base == 0 && ~t.offset == 0; {1622#true} is VALID [2020-07-10 18:45:12,701 INFO L280 TraceCheckUtils]: 40: Hoare triple {1622#true} #res := 0; {1622#true} is VALID [2020-07-10 18:45:12,702 INFO L280 TraceCheckUtils]: 41: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-10 18:45:12,702 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1622#true} {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #253#return; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,703 INFO L280 TraceCheckUtils]: 43: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,703 INFO L280 TraceCheckUtils]: 44: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #res := 1 + (#t~ret22 + #t~ret24); {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,704 INFO L280 TraceCheckUtils]: 45: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~mem21.base, #t~mem21.offset; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,704 INFO L280 TraceCheckUtils]: 46: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~ret24; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,705 INFO L280 TraceCheckUtils]: 47: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~ret22; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,712 INFO L280 TraceCheckUtils]: 48: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~mem23.base, #t~mem23.offset; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,713 INFO L280 TraceCheckUtils]: 49: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 18:45:12,716 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #227#return; {1623#false} is VALID [2020-07-10 18:45:12,717 INFO L280 TraceCheckUtils]: 51: Hoare triple {1623#false} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647; {1623#false} is VALID [2020-07-10 18:45:12,717 INFO L280 TraceCheckUtils]: 52: Hoare triple {1623#false} ~n~1 := #t~ret26; {1623#false} is VALID [2020-07-10 18:45:12,718 INFO L280 TraceCheckUtils]: 53: Hoare triple {1623#false} havoc #t~ret26; {1623#false} is VALID [2020-07-10 18:45:12,718 INFO L263 TraceCheckUtils]: 54: Hoare triple {1623#false} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {1622#true} is VALID [2020-07-10 18:45:12,718 INFO L280 TraceCheckUtils]: 55: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2020-07-10 18:45:12,718 INFO L280 TraceCheckUtils]: 56: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2020-07-10 18:45:12,719 INFO L280 TraceCheckUtils]: 57: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-10 18:45:12,719 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {1622#true} {1623#false} #229#return; {1623#false} is VALID [2020-07-10 18:45:12,719 INFO L280 TraceCheckUtils]: 59: Hoare triple {1623#false} SUMMARY for call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(4 * ~n~1); srcloc: L78-1 {1623#false} is VALID [2020-07-10 18:45:12,720 INFO L263 TraceCheckUtils]: 60: Hoare triple {1623#false} call #Ultimate.meminit(#t~malloc27.base, #t~malloc27.offset, ~n~1, 4, 4 * ~n~1); {1696#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 18:45:12,721 INFO L280 TraceCheckUtils]: 61: Hoare triple {1696#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1622#true} is VALID [2020-07-10 18:45:12,721 INFO L280 TraceCheckUtils]: 62: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-10 18:45:12,721 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {1622#true} {1623#false} #231#return; {1623#false} is VALID [2020-07-10 18:45:12,721 INFO L280 TraceCheckUtils]: 64: Hoare triple {1623#false} ~x~0.base, ~x~0.offset := #t~malloc27.base, #t~malloc27.offset; {1623#false} is VALID [2020-07-10 18:45:12,722 INFO L263 TraceCheckUtils]: 65: Hoare triple {1623#false} call #t~ret28 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {1697#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 18:45:12,723 INFO L280 TraceCheckUtils]: 66: Hoare triple {1697#(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; {1622#true} is VALID [2020-07-10 18:45:12,723 INFO L280 TraceCheckUtils]: 67: Hoare triple {1622#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1622#true} is VALID [2020-07-10 18:45:12,724 INFO L280 TraceCheckUtils]: 68: Hoare triple {1622#true} ~i := #in~i; {1622#true} is VALID [2020-07-10 18:45:12,724 INFO L280 TraceCheckUtils]: 69: Hoare triple {1622#true} assume ~t.base == 0 && ~t.offset == 0; {1622#true} is VALID [2020-07-10 18:45:12,725 INFO L280 TraceCheckUtils]: 70: Hoare triple {1622#true} #res := ~i; {1622#true} is VALID [2020-07-10 18:45:12,725 INFO L280 TraceCheckUtils]: 71: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-10 18:45:12,726 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {1622#true} {1623#false} #233#return; {1623#false} is VALID [2020-07-10 18:45:12,726 INFO L280 TraceCheckUtils]: 73: Hoare triple {1623#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647; {1623#false} is VALID [2020-07-10 18:45:12,726 INFO L280 TraceCheckUtils]: 74: Hoare triple {1623#false} havoc #t~ret28; {1623#false} is VALID [2020-07-10 18:45:12,727 INFO L280 TraceCheckUtils]: 75: Hoare triple {1623#false} SUMMARY for call #t~mem29 := read~int(~x~0.base, ~x~0.offset, 4); srcloc: L81 {1623#false} is VALID [2020-07-10 18:45:12,727 INFO L263 TraceCheckUtils]: 76: Hoare triple {1623#false} call __VERIFIER_assert((if ~a~1 == #t~mem29 then 1 else 0)); {1623#false} is VALID [2020-07-10 18:45:12,727 INFO L280 TraceCheckUtils]: 77: Hoare triple {1623#false} ~cond := #in~cond; {1623#false} is VALID [2020-07-10 18:45:12,728 INFO L280 TraceCheckUtils]: 78: Hoare triple {1623#false} assume 0 == ~cond; {1623#false} is VALID [2020-07-10 18:45:12,728 INFO L280 TraceCheckUtils]: 79: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2020-07-10 18:45:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-10 18:45:12,740 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:45:12,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1372467316] [2020-07-10 18:45:12,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:45:12,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-10 18:45:12,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333920382] [2020-07-10 18:45:12,755 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 80 [2020-07-10 18:45:12,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:45:12,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 18:45:12,852 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-10 18:45:12,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 18:45:12,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:45:12,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 18:45:12,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-07-10 18:45:12,854 INFO L87 Difference]: Start difference. First operand 175 states and 198 transitions. Second operand 12 states. [2020-07-10 18:45:17,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:45:17,523 INFO L93 Difference]: Finished difference Result 316 states and 361 transitions. [2020-07-10 18:45:17,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 18:45:17,523 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 80 [2020-07-10 18:45:17,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:45:17,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 18:45:17,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 357 transitions. [2020-07-10 18:45:17,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 18:45:17,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 357 transitions. [2020-07-10 18:45:17,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 357 transitions. [2020-07-10 18:45:18,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 357 edges. 357 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:45:18,054 INFO L225 Difference]: With dead ends: 316 [2020-07-10 18:45:18,054 INFO L226 Difference]: Without dead ends: 187 [2020-07-10 18:45:18,057 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-10 18:45:18,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-07-10 18:45:18,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 177. [2020-07-10 18:45:18,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:45:18,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand 177 states. [2020-07-10 18:45:18,419 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 177 states. [2020-07-10 18:45:18,419 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 177 states. [2020-07-10 18:45:18,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:45:18,430 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2020-07-10 18:45:18,431 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 214 transitions. [2020-07-10 18:45:18,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:45:18,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:45:18,434 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 187 states. [2020-07-10 18:45:18,434 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 187 states. [2020-07-10 18:45:18,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:45:18,445 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2020-07-10 18:45:18,445 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 214 transitions. [2020-07-10 18:45:18,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:45:18,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:45:18,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:45:18,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:45:18,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-07-10 18:45:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 201 transitions. [2020-07-10 18:45:18,459 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 201 transitions. Word has length 80 [2020-07-10 18:45:18,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:45:18,460 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 201 transitions. [2020-07-10 18:45:18,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 18:45:18,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 177 states and 201 transitions. [2020-07-10 18:45:18,764 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:45:18,764 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 201 transitions. [2020-07-10 18:45:18,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-07-10 18:45:18,769 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:45:18,770 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-10 18:45:18,770 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 18:45:18,770 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:45:18,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:45:18,771 INFO L82 PathProgramCache]: Analyzing trace with hash 96122912, now seen corresponding path program 1 times [2020-07-10 18:45:18,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:45:18,772 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1897946479] [2020-07-10 18:45:18,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:45:18,791 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 18:45:18,792 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 18:45:18,798 INFO L168 Benchmark]: Toolchain (without parser) took 14579.51 ms. Allocated memory was 137.4 MB in the beginning and 398.5 MB in the end (delta: 261.1 MB). Free memory was 100.2 MB in the beginning and 284.6 MB in the end (delta: -184.4 MB). Peak memory consumption was 76.7 MB. Max. memory is 7.1 GB. [2020-07-10 18:45:18,799 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.4 MB. Free memory is still 119.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 18:45:18,800 INFO L168 Benchmark]: CACSL2BoogieTranslator took 453.61 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 100.0 MB in the beginning and 175.6 MB in the end (delta: -75.6 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2020-07-10 18:45:18,801 INFO L168 Benchmark]: Boogie Preprocessor took 66.91 ms. Allocated memory is still 200.3 MB. Free memory was 175.6 MB in the beginning and 172.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-07-10 18:45:18,803 INFO L168 Benchmark]: RCFGBuilder took 963.21 ms. Allocated memory is still 200.3 MB. Free memory was 172.8 MB in the beginning and 100.8 MB in the end (delta: 72.0 MB). Peak memory consumption was 72.0 MB. Max. memory is 7.1 GB. [2020-07-10 18:45:18,811 INFO L168 Benchmark]: TraceAbstraction took 13089.36 ms. Allocated memory was 200.3 MB in the beginning and 398.5 MB in the end (delta: 198.2 MB). Free memory was 100.8 MB in the beginning and 284.6 MB in the end (delta: -183.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-10 18:45:18,816 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 137.4 MB. Free memory is still 119.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 453.61 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 100.0 MB in the beginning and 175.6 MB in the end (delta: -75.6 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.91 ms. Allocated memory is still 200.3 MB. Free memory was 175.6 MB in the beginning and 172.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 963.21 ms. Allocated memory is still 200.3 MB. Free memory was 172.8 MB in the beginning and 100.8 MB in the end (delta: 72.0 MB). Peak memory consumption was 72.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13089.36 ms. Allocated memory was 200.3 MB in the beginning and 398.5 MB in the end (delta: 198.2 MB). Free memory was 100.8 MB in the beginning and 284.6 MB in the end (delta: -183.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...