/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-6253b08 [2021-05-06 12:21:07,646 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-06 12:21:07,648 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-06 12:21:07,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-06 12:21:07,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-06 12:21:07,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-06 12:21:07,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-06 12:21:07,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-06 12:21:07,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-06 12:21:07,695 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-06 12:21:07,696 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-06 12:21:07,697 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-06 12:21:07,697 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-06 12:21:07,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-06 12:21:07,700 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-06 12:21:07,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-06 12:21:07,703 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-06 12:21:07,704 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-06 12:21:07,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-06 12:21:07,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-06 12:21:07,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-06 12:21:07,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-06 12:21:07,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-06 12:21:07,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-06 12:21:07,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-06 12:21:07,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-06 12:21:07,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-06 12:21:07,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-06 12:21:07,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-06 12:21:07,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-06 12:21:07,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-06 12:21:07,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-06 12:21:07,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-06 12:21:07,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-06 12:21:07,720 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-06 12:21:07,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-06 12:21:07,721 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-06 12:21:07,721 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-06 12:21:07,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-06 12:21:07,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-06 12:21:07,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-06 12:21:07,728 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-06 12:21:07,740 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-06 12:21:07,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-06 12:21:07,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-06 12:21:07,741 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-06 12:21:07,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-06 12:21:07,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-06 12:21:07,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-06 12:21:07,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-06 12:21:07,741 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-06 12:21:07,741 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-06 12:21:07,742 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-06 12:21:07,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-06 12:21:07,742 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-06 12:21:07,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-06 12:21:07,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-06 12:21:07,742 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-06 12:21:07,742 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-06 12:21:07,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-06 12:21:07,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 12:21:07,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-06 12:21:07,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-06 12:21:07,743 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-06 12:21:07,743 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-06 12:21:07,743 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-06 12:21:08,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-06 12:21:08,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-06 12:21:08,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-06 12:21:08,031 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-06 12:21:08,031 INFO L275 PluginConnector]: CDTParser initialized [2021-05-06 12:21:08,032 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter.c [2021-05-06 12:21:08,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a96607d5d/00bcb57898074522a2661aefb610af8f/FLAG6ef5110be [2021-05-06 12:21:08,517 INFO L306 CDTParser]: Found 1 translation units. [2021-05-06 12:21:08,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c [2021-05-06 12:21:08,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a96607d5d/00bcb57898074522a2661aefb610af8f/FLAG6ef5110be [2021-05-06 12:21:08,534 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a96607d5d/00bcb57898074522a2661aefb610af8f [2021-05-06 12:21:08,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-06 12:21:08,537 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-06 12:21:08,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-06 12:21:08,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-06 12:21:08,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-06 12:21:08,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 12:21:08" (1/1) ... [2021-05-06 12:21:08,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36316097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:21:08, skipping insertion in model container [2021-05-06 12:21:08,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 12:21:08" (1/1) ... [2021-05-06 12:21:08,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-06 12:21:08,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-06 12:21:08,670 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c[586,599] [2021-05-06 12:21:08,740 WARN L1507 CHandler]: Possible shadowing of function min [2021-05-06 12:21:08,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 12:21:08,779 INFO L203 MainTranslator]: Completed pre-run [2021-05-06 12:21:08,791 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c[586,599] [2021-05-06 12:21:08,811 WARN L1507 CHandler]: Possible shadowing of function min [2021-05-06 12:21:08,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 12:21:08,843 INFO L208 MainTranslator]: Completed translation [2021-05-06 12:21:08,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:21:08 WrapperNode [2021-05-06 12:21:08,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-06 12:21:08,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-06 12:21:08,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-06 12:21:08,844 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-06 12:21:08,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:21:08" (1/1) ... [2021-05-06 12:21:08,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:21:08" (1/1) ... [2021-05-06 12:21:08,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:21:08" (1/1) ... [2021-05-06 12:21:08,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:21:08" (1/1) ... [2021-05-06 12:21:08,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:21:08" (1/1) ... [2021-05-06 12:21:08,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:21:08" (1/1) ... [2021-05-06 12:21:08,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:21:08" (1/1) ... [2021-05-06 12:21:08,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-06 12:21:08,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-06 12:21:08,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-06 12:21:08,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-06 12:21:08,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:21:08" (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 [2021-05-06 12:21:08,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-06 12:21:08,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-06 12:21:08,987 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2021-05-06 12:21:08,987 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-06 12:21:08,987 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-06 12:21:08,988 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2021-05-06 12:21:08,988 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2021-05-06 12:21:08,988 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2021-05-06 12:21:08,988 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2021-05-06 12:21:08,988 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2021-05-06 12:21:08,988 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2021-05-06 12:21:08,989 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-06 12:21:08,989 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-05-06 12:21:08,989 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-05-06 12:21:08,989 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-05-06 12:21:08,990 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-05-06 12:21:08,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-06 12:21:08,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2021-05-06 12:21:08,990 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2021-05-06 12:21:08,990 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-06 12:21:08,990 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-06 12:21:08,990 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-06 12:21:08,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-06 12:21:08,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-06 12:21:08,991 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2021-05-06 12:21:08,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-05-06 12:21:08,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-06 12:21:08,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-05-06 12:21:08,991 INFO L130 BoogieDeclarations]: Found specification of procedure min [2021-05-06 12:21:08,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-06 12:21:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-05-06 12:21:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2021-05-06 12:21:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-06 12:21:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2021-05-06 12:21:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure size [2021-05-06 12:21:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure task [2021-05-06 12:21:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-05-06 12:21:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-06 12:21:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-06 12:21:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-06 12:21:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-06 12:21:09,468 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-06 12:21:09,468 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-05-06 12:21:09,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 12:21:09 BoogieIcfgContainer [2021-05-06 12:21:09,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-06 12:21:09,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-06 12:21:09,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-06 12:21:09,485 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-06 12:21:09,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 12:21:08" (1/3) ... [2021-05-06 12:21:09,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6fe93a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 12:21:09, skipping insertion in model container [2021-05-06 12:21:09,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:21:08" (2/3) ... [2021-05-06 12:21:09,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6fe93a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 12:21:09, skipping insertion in model container [2021-05-06 12:21:09,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 12:21:09" (3/3) ... [2021-05-06 12:21:09,487 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2021-05-06 12:21:09,491 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-06 12:21:09,493 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-06 12:21:09,503 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-06 12:21:09,531 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-06 12:21:09,531 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-06 12:21:09,531 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-06 12:21:09,531 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-06 12:21:09,531 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-06 12:21:09,531 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-06 12:21:09,531 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-06 12:21:09,532 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-06 12:21:09,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2021-05-06 12:21:09,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-06 12:21:09,552 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:21:09,553 INFO L523 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] [2021-05-06 12:21:09,553 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:21:09,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:21:09,556 INFO L82 PathProgramCache]: Analyzing trace with hash -738616471, now seen corresponding path program 1 times [2021-05-06 12:21:09,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:21:09,561 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [265490257] [2021-05-06 12:21:09,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:21:09,604 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:21:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:09,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:21:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:09,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-05-06 12:21:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:09,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:21:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:09,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-06 12:21:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:09,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-05-06 12:21:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:09,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:21:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:09,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-05-06 12:21:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 12:21:09,959 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:21:09,959 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [265490257] [2021-05-06 12:21:09,960 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [265490257] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:21:09,960 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:21:09,961 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-06 12:21:09,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618063326] [2021-05-06 12:21:09,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-06 12:21:09,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:21:09,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-06 12:21:09,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-05-06 12:21:09,973 INFO L87 Difference]: Start difference. First operand has 98 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-05-06 12:21:10,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:21:10,565 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2021-05-06 12:21:10,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-06 12:21:10,566 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2021-05-06 12:21:10,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:21:10,575 INFO L225 Difference]: With dead ends: 174 [2021-05-06 12:21:10,575 INFO L226 Difference]: Without dead ends: 98 [2021-05-06 12:21:10,579 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 222.1ms TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2021-05-06 12:21:10,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-05-06 12:21:10,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2021-05-06 12:21:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 56 states have internal predecessors, (64), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2021-05-06 12:21:10,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2021-05-06 12:21:10,620 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 44 [2021-05-06 12:21:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:21:10,620 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2021-05-06 12:21:10,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-05-06 12:21:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2021-05-06 12:21:10,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-05-06 12:21:10,622 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:21:10,622 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:21:10,622 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-06 12:21:10,622 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:21:10,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:21:10,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1232690542, now seen corresponding path program 1 times [2021-05-06 12:21:10,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:21:10,623 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1187262027] [2021-05-06 12:21:10,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:21:10,625 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:21:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:10,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:21:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:10,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-05-06 12:21:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:10,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:21:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:10,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-06 12:21:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:10,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-05-06 12:21:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:10,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-05-06 12:21:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:10,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-05-06 12:21:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:10,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-06 12:21:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:10,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-05-06 12:21:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-05-06 12:21:10,783 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:21:10,783 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1187262027] [2021-05-06 12:21:10,783 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1187262027] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:21:10,783 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:21:10,783 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-06 12:21:10,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333936147] [2021-05-06 12:21:10,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-06 12:21:10,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:21:10,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-06 12:21:10,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-05-06 12:21:10,784 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 6 states have internal predecessors, (32), 5 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2021-05-06 12:21:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:21:11,361 INFO L93 Difference]: Finished difference Result 165 states and 211 transitions. [2021-05-06 12:21:11,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-06 12:21:11,361 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 6 states have internal predecessors, (32), 5 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 56 [2021-05-06 12:21:11,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:21:11,363 INFO L225 Difference]: With dead ends: 165 [2021-05-06 12:21:11,363 INFO L226 Difference]: Without dead ends: 97 [2021-05-06 12:21:11,364 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 285.1ms TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2021-05-06 12:21:11,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-06 12:21:11,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2021-05-06 12:21:11,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 58 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) [2021-05-06 12:21:11,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2021-05-06 12:21:11,375 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 56 [2021-05-06 12:21:11,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:21:11,375 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2021-05-06 12:21:11,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 6 states have internal predecessors, (32), 5 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2021-05-06 12:21:11,375 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2021-05-06 12:21:11,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-05-06 12:21:11,377 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:21:11,377 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:21:11,377 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-06 12:21:11,377 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:21:11,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:21:11,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1976466705, now seen corresponding path program 1 times [2021-05-06 12:21:11,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:21:11,378 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1676097097] [2021-05-06 12:21:11,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:21:11,379 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:21:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:11,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:21:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:11,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-05-06 12:21:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:11,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-06 12:21:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:11,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:21:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:11,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-05-06 12:21:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:11,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-05-06 12:21:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:11,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-05-06 12:21:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:11,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-05-06 12:21:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:11,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-05-06 12:21:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:11,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-05-06 12:21:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:11,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-05-06 12:21:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-05-06 12:21:11,524 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:21:11,524 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1676097097] [2021-05-06 12:21:11,525 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1676097097] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:21:11,525 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:21:11,525 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-06 12:21:11,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857291779] [2021-05-06 12:21:11,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-06 12:21:11,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:21:11,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-06 12:21:11,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-05-06 12:21:11,526 INFO L87 Difference]: Start difference. First operand 93 states and 118 transitions. Second operand has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2021-05-06 12:21:12,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:21:12,029 INFO L93 Difference]: Finished difference Result 164 states and 210 transitions. [2021-05-06 12:21:12,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-06 12:21:12,030 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 66 [2021-05-06 12:21:12,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:21:12,031 INFO L225 Difference]: With dead ends: 164 [2021-05-06 12:21:12,031 INFO L226 Difference]: Without dead ends: 99 [2021-05-06 12:21:12,032 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 214.0ms TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2021-05-06 12:21:12,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-06 12:21:12,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2021-05-06 12:21:12,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 60 states have internal predecessors, (66), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) [2021-05-06 12:21:12,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2021-05-06 12:21:12,043 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 66 [2021-05-06 12:21:12,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:21:12,043 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2021-05-06 12:21:12,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2021-05-06 12:21:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2021-05-06 12:21:12,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-06 12:21:12,044 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:21:12,044 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:21:12,045 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-06 12:21:12,045 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:21:12,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:21:12,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1818938389, now seen corresponding path program 1 times [2021-05-06 12:21:12,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:21:12,045 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [675024334] [2021-05-06 12:21:12,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:21:12,047 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:21:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:12,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:21:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:12,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-05-06 12:21:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:12,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-06 12:21:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:12,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:21:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:12,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-05-06 12:21:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:12,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-05-06 12:21:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:12,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-05-06 12:21:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:12,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-05-06 12:21:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:12,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-05-06 12:21:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:12,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-05-06 12:21:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:12,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-05-06 12:21:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:12,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-05-06 12:21:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:12,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-05-06 12:21:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:12,250 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-05-06 12:21:12,251 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:21:12,251 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [675024334] [2021-05-06 12:21:12,251 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [675024334] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:21:12,251 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:21:12,251 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-06 12:21:12,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587923976] [2021-05-06 12:21:12,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-06 12:21:12,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:21:12,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-06 12:21:12,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-05-06 12:21:12,252 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 11 states have internal predecessors, (40), 8 states have call successors, (16), 7 states have call predecessors, (16), 4 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2021-05-06 12:21:13,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:21:13,040 INFO L93 Difference]: Finished difference Result 152 states and 194 transitions. [2021-05-06 12:21:13,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-06 12:21:13,041 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 11 states have internal predecessors, (40), 8 states have call successors, (16), 7 states have call predecessors, (16), 4 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Word has length 79 [2021-05-06 12:21:13,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:21:13,042 INFO L225 Difference]: With dead ends: 152 [2021-05-06 12:21:13,042 INFO L226 Difference]: Without dead ends: 99 [2021-05-06 12:21:13,043 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 455.0ms TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2021-05-06 12:21:13,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-06 12:21:13,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2021-05-06 12:21:13,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 62 states have internal predecessors, (67), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (33), 23 states have call predecessors, (33), 23 states have call successors, (33) [2021-05-06 12:21:13,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2021-05-06 12:21:13,054 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 79 [2021-05-06 12:21:13,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:21:13,054 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2021-05-06 12:21:13,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 11 states have internal predecessors, (40), 8 states have call successors, (16), 7 states have call predecessors, (16), 4 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2021-05-06 12:21:13,055 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2021-05-06 12:21:13,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-05-06 12:21:13,055 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:21:13,055 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:21:13,056 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-06 12:21:13,056 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:21:13,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:21:13,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1854783018, now seen corresponding path program 1 times [2021-05-06 12:21:13,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:21:13,056 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [986921564] [2021-05-06 12:21:13,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:21:13,058 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:21:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-06 12:21:13,074 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-06 12:21:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-06 12:21:13,092 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-06 12:21:13,122 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2021-05-06 12:21:13,122 INFO L624 BasicCegarLoop]: Counterexample might be feasible [2021-05-06 12:21:13,123 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-06 12:21:13,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 12:21:13 BoogieIcfgContainer [2021-05-06 12:21:13,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-06 12:21:13,134 INFO L168 Benchmark]: Toolchain (without parser) took 4596.79 ms. Allocated memory was 175.1 MB in the beginning and 274.7 MB in the end (delta: 99.6 MB). Free memory was 139.3 MB in the beginning and 208.5 MB in the end (delta: -69.2 MB). Peak memory consumption was 31.8 MB. Max. memory is 8.0 GB. [2021-05-06 12:21:13,134 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 175.1 MB. Free memory is still 156.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-06 12:21:13,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.19 ms. Allocated memory is still 175.1 MB. Free memory was 139.1 MB in the beginning and 154.3 MB in the end (delta: -15.2 MB). Peak memory consumption was 15.6 MB. Max. memory is 8.0 GB. [2021-05-06 12:21:13,135 INFO L168 Benchmark]: Boogie Preprocessor took 68.79 ms. Allocated memory is still 175.1 MB. Free memory was 154.3 MB in the beginning and 152.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-06 12:21:13,135 INFO L168 Benchmark]: RCFGBuilder took 555.08 ms. Allocated memory is still 175.1 MB. Free memory was 152.0 MB in the beginning and 117.6 MB in the end (delta: 34.3 MB). Peak memory consumption was 34.6 MB. Max. memory is 8.0 GB. [2021-05-06 12:21:13,135 INFO L168 Benchmark]: TraceAbstraction took 3663.37 ms. Allocated memory was 175.1 MB in the beginning and 274.7 MB in the end (delta: 99.6 MB). Free memory was 117.2 MB in the beginning and 208.5 MB in the end (delta: -91.3 MB). Peak memory consumption was 9.9 MB. Max. memory is 8.0 GB. [2021-05-06 12:21:13,137 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 175.1 MB. Free memory is still 156.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 305.19 ms. Allocated memory is still 175.1 MB. Free memory was 139.1 MB in the beginning and 154.3 MB in the end (delta: -15.2 MB). Peak memory consumption was 15.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 68.79 ms. Allocated memory is still 175.1 MB. Free memory was 154.3 MB in the beginning and 152.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 555.08 ms. Allocated memory is still 175.1 MB. Free memory was 152.0 MB in the beginning and 117.6 MB in the end (delta: 34.3 MB). Peak memory consumption was 34.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 3663.37 ms. Allocated memory was 175.1 MB in the beginning and 274.7 MB in the end (delta: 99.6 MB). Free memory was 117.2 MB in the beginning and 208.5 MB in the end (delta: -91.3 MB). Peak memory consumption was 9.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L110] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; [L30] RET, EXPR nondet_tree() [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; [L31] RET, EXPR nondet_tree() [L31] n->right = nondet_tree() [L32] return n; [L110] RET, EXPR nondet_tree() [L110] CALL task(nondet_tree()) [L86] CALL, EXPR min(t) [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left [L41] CALL, EXPR min(n->left) [L37] COND TRUE !n [L38] return 2147483647; [L41] RET, EXPR min(n->left) [L41] int b = min(n->left); [L42] EXPR n->right [L42] CALL, EXPR min(n->right) [L37] COND TRUE !n [L38] return 2147483647; [L42] RET, EXPR min(n->right) [L42] int c = min(n->right); [L43] COND TRUE b <= a && b <= c [L43] return b; [L86] RET, EXPR min(t) [L86] int a = min(t); [L87] int b; [L89] CALL, EXPR size(t) [L81] COND FALSE !(!t) [L82] EXPR t->left [L82] CALL, EXPR size(t->left) [L81] COND TRUE !t [L81] return 0; [L82] RET, EXPR size(t->left) [L82] EXPR t->right [L82] CALL, EXPR size(t->right) [L81] COND TRUE !t [L81] return 0; [L82] RET, EXPR size(t->right) [L82] return size(t->left) + size(t->right) + 1; [L89] RET, EXPR size(t) [L89] int n = size(t); [L90] CALL assume_cycle_if_not(n != 0) [L9] COND FALSE !(!cond) [L90] RET assume_cycle_if_not(n != 0) [L91] EXPR, FCALL calloc(n, sizeof(int)) [L91] int *x = calloc(n, sizeof(int)); [L92] CALL tree_inorder(t, x, n) [L70] COND FALSE !(!t) [L73] EXPR t->left [L73] CALL, EXPR tree_inorder(t->left, a, i) [L70] COND TRUE !t [L71] return i; [L73] RET, EXPR tree_inorder(t->left, a, i) [L73] i = tree_inorder(t->left, a, i) [L74] EXPR i++ [L74] EXPR t->data [L74] a[i++] = t->data [L75] EXPR t->right [L75] CALL, EXPR tree_inorder(t->right, a, i) [L70] COND TRUE !t [L71] return i; [L75] RET, EXPR tree_inorder(t->right, a, i) [L75] i = tree_inorder(t->right, a, i) [L76] return i; [L92] RET tree_inorder(t, x, n) [L93] EXPR x[0] [L93] CALL __VERIFIER_assert(a == x[0]) [L16] COND TRUE !cond [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3593.7ms, OverallIterations: 5, TraceHistogramMax: 3, EmptinessCheckTime: 14.2ms, AutomataDifference: 2492.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 344 SDtfs, 659 SDslu, 1525 SDs, 0 SdLazy, 2163 SolverSat, 606 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1185.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1176.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 65.7ms AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...