/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_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05ce600 [2022-02-24 01:50:02,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-24 01:50:02,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-24 01:50:02,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-24 01:50:02,820 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-24 01:50:02,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-24 01:50:02,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-24 01:50:02,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-24 01:50:02,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-24 01:50:02,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-24 01:50:02,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-24 01:50:02,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-24 01:50:02,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-24 01:50:02,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-24 01:50:02,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-24 01:50:02,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-24 01:50:02,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-24 01:50:02,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-24 01:50:02,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-24 01:50:02,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-24 01:50:02,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-24 01:50:02,839 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-24 01:50:02,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-24 01:50:02,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-24 01:50:02,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-24 01:50:02,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-24 01:50:02,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-24 01:50:02,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-24 01:50:02,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-24 01:50:02,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-24 01:50:02,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-24 01:50:02,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-24 01:50:02,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-24 01:50:02,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-24 01:50:02,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-24 01:50:02,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-24 01:50:02,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-24 01:50:02,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-24 01:50:02,849 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-24 01:50:02,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-24 01:50:02,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-24 01:50:02,852 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-02-24 01:50:02,859 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-24 01:50:02,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-24 01:50:02,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-24 01:50:02,860 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-24 01:50:02,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-24 01:50:02,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-24 01:50:02,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-24 01:50:02,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-24 01:50:02,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-24 01:50:02,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-24 01:50:02,861 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-24 01:50:02,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-24 01:50:02,862 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-24 01:50:02,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-24 01:50:02,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-24 01:50:02,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-24 01:50:02,862 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-24 01:50:02,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-24 01:50:02,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 01:50:02,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-24 01:50:02,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-24 01:50:02,863 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-24 01:50:02,863 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-02-24 01:50:02,863 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; [2022-02-24 01:50:03,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-24 01:50:03,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-24 01:50:03,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-24 01:50:03,088 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-24 01:50:03,088 INFO L275 PluginConnector]: CDTParser initialized [2022-02-24 01:50:03,089 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c [2022-02-24 01:50:03,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8bc1e713/e541f84a7c774a66a7d67cbfb3430544/FLAG93c6223fb [2022-02-24 01:50:03,536 INFO L306 CDTParser]: Found 1 translation units. [2022-02-24 01:50:03,537 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c [2022-02-24 01:50:03,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8bc1e713/e541f84a7c774a66a7d67cbfb3430544/FLAG93c6223fb [2022-02-24 01:50:03,551 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8bc1e713/e541f84a7c774a66a7d67cbfb3430544 [2022-02-24 01:50:03,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-24 01:50:03,554 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-24 01:50:03,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-24 01:50:03,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-24 01:50:03,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-24 01:50:03,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 01:50:03" (1/1) ... [2022-02-24 01:50:03,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e8027e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:50:03, skipping insertion in model container [2022-02-24 01:50:03,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 01:50:03" (1/1) ... [2022-02-24 01:50:03,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-24 01:50:03,580 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-24 01:50:03,762 WARN L230 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_incorrect.c[619,632] [2022-02-24 01:50:03,794 WARN L1545 CHandler]: Possible shadowing of function min [2022-02-24 01:50:03,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 01:50:03,831 INFO L203 MainTranslator]: Completed pre-run [2022-02-24 01:50:03,845 WARN L230 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_incorrect.c[619,632] [2022-02-24 01:50:03,865 WARN L1545 CHandler]: Possible shadowing of function min [2022-02-24 01:50:03,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 01:50:03,887 INFO L208 MainTranslator]: Completed translation [2022-02-24 01:50:03,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:50:03 WrapperNode [2022-02-24 01:50:03,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-24 01:50:03,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-24 01:50:03,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-24 01:50:03,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-24 01:50:03,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:50:03" (1/1) ... [2022-02-24 01:50:03,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:50:03" (1/1) ... [2022-02-24 01:50:03,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:50:03" (1/1) ... [2022-02-24 01:50:03,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:50:03" (1/1) ... [2022-02-24 01:50:03,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:50:03" (1/1) ... [2022-02-24 01:50:03,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:50:03" (1/1) ... [2022-02-24 01:50:03,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:50:03" (1/1) ... [2022-02-24 01:50:03,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-24 01:50:03,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-24 01:50:03,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-24 01:50:03,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-24 01:50:03,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:50:03" (1/1) ... [2022-02-24 01:50:03,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 01:50:03,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-24 01:50:03,976 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-24 01:50:03,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-24 01:50:04,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-24 01:50:04,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-24 01:50:04,009 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-24 01:50:04,009 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-24 01:50:04,010 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-24 01:50:04,010 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-02-24 01:50:04,010 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-02-24 01:50:04,010 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-02-24 01:50:04,010 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-02-24 01:50:04,011 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-02-24 01:50:04,011 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2022-02-24 01:50:04,011 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-24 01:50:04,012 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-24 01:50:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-02-24 01:50:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-02-24 01:50:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-02-24 01:50:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-24 01:50:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-02-24 01:50:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-24 01:50:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-24 01:50:04,014 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-24 01:50:04,014 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-24 01:50:04,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-24 01:50:04,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-24 01:50:04,014 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-02-24 01:50:04,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-24 01:50:04,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-24 01:50:04,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-24 01:50:04,015 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-02-24 01:50:04,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-24 01:50:04,015 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-02-24 01:50:04,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-24 01:50:04,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-24 01:50:04,016 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-02-24 01:50:04,016 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-02-24 01:50:04,016 INFO L130 BoogieDeclarations]: Found specification of procedure task [2022-02-24 01:50:04,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-24 01:50:04,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-24 01:50:04,016 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-24 01:50:04,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-24 01:50:04,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-24 01:50:04,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-24 01:50:04,121 INFO L234 CfgBuilder]: Building ICFG [2022-02-24 01:50:04,122 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-24 01:50:04,390 INFO L275 CfgBuilder]: Performing block encoding [2022-02-24 01:50:04,397 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-24 01:50:04,397 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-24 01:50:04,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 01:50:04 BoogieIcfgContainer [2022-02-24 01:50:04,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-24 01:50:04,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-24 01:50:04,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-24 01:50:04,403 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-24 01:50:04,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.02 01:50:03" (1/3) ... [2022-02-24 01:50:04,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed76d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 01:50:04, skipping insertion in model container [2022-02-24 01:50:04,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:50:03" (2/3) ... [2022-02-24 01:50:04,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed76d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 01:50:04, skipping insertion in model container [2022-02-24 01:50:04,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 01:50:04" (3/3) ... [2022-02-24 01:50:04,406 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.c [2022-02-24 01:50:04,410 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-24 01:50:04,410 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-24 01:50:04,444 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-24 01:50:04,449 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=JORDAN [2022-02-24 01:50:04,449 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-24 01:50:04,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 59 states have internal predecessors, (71), 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) [2022-02-24 01:50:04,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-24 01:50:04,471 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:50:04,471 INFO L514 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] [2022-02-24 01:50:04,472 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:50:04,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:50:04,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1536185801, now seen corresponding path program 1 times [2022-02-24 01:50:04,483 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:50:04,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1572929758] [2022-02-24 01:50:04,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:50:04,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:50:04,534 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:50:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:04,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:50:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:04,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-24 01:50:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:04,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-24 01:50:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:04,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-24 01:50:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:04,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-24 01:50:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:04,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-24 01:50:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:04,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-24 01:50:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:04,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:50:04,817 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:50:04,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1572929758] [2022-02-24 01:50:04,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1572929758] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:50:04,819 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:50:04,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 01:50:04,820 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319492830] [2022-02-24 01:50:04,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:50:04,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 01:50:04,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:50:04,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 01:50:04,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-24 01:50:04,856 INFO L87 Difference]: Start difference. First operand has 96 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 59 states have internal predecessors, (71), 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 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-24 01:50:05,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:50:05,247 INFO L93 Difference]: Finished difference Result 168 states and 221 transitions. [2022-02-24 01:50:05,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-24 01:50:05,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2022-02-24 01:50:05,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:50:05,260 INFO L225 Difference]: With dead ends: 168 [2022-02-24 01:50:05,260 INFO L226 Difference]: Without dead ends: 95 [2022-02-24 01:50:05,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-24 01:50:05,268 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 167 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-24 01:50:05,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 80 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-24 01:50:05,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-24 01:50:05,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2022-02-24 01:50:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-02-24 01:50:05,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2022-02-24 01:50:05,315 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 44 [2022-02-24 01:50:05,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:50:05,315 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2022-02-24 01:50:05,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-24 01:50:05,316 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-02-24 01:50:05,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-24 01:50:05,318 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:50:05,318 INFO L514 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] [2022-02-24 01:50:05,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-24 01:50:05,319 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:50:05,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:50:05,319 INFO L85 PathProgramCache]: Analyzing trace with hash -152757941, now seen corresponding path program 1 times [2022-02-24 01:50:05,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:50:05,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1792882123] [2022-02-24 01:50:05,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:50:05,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:50:05,323 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:50:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:05,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:50:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:05,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-24 01:50:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:05,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-24 01:50:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:05,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-24 01:50:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:05,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-24 01:50:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:05,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-24 01:50:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:05,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-24 01:50:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:05,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:50:05,542 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:50:05,542 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1792882123] [2022-02-24 01:50:05,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1792882123] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:50:05,543 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:50:05,543 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-24 01:50:05,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315924791] [2022-02-24 01:50:05,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:50:05,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-24 01:50:05,544 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:50:05,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-24 01:50:05,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-02-24 01:50:05,545 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. 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) [2022-02-24 01:50:06,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:50:06,160 INFO L93 Difference]: Finished difference Result 154 states and 197 transitions. [2022-02-24 01:50:06,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-24 01:50:06,161 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 [2022-02-24 01:50:06,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:50:06,163 INFO L225 Difference]: With dead ends: 154 [2022-02-24 01:50:06,163 INFO L226 Difference]: Without dead ends: 97 [2022-02-24 01:50:06,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-02-24 01:50:06,165 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 98 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-24 01:50:06,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 79 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-24 01:50:06,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-24 01:50:06,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2022-02-24 01:50:06,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 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) [2022-02-24 01:50:06,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2022-02-24 01:50:06,182 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 44 [2022-02-24 01:50:06,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:50:06,182 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2022-02-24 01:50:06,183 INFO L471 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) [2022-02-24 01:50:06,183 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2022-02-24 01:50:06,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-24 01:50:06,192 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:50:06,192 INFO L514 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] [2022-02-24 01:50:06,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-24 01:50:06,195 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:50:06,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:50:06,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2001282500, now seen corresponding path program 1 times [2022-02-24 01:50:06,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:50:06,195 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1326167484] [2022-02-24 01:50:06,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:50:06,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:50:06,198 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:50:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:06,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:50:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:06,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-24 01:50:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:06,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-24 01:50:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:06,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-24 01:50:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:06,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 01:50:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:06,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-24 01:50:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:06,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-24 01:50:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:06,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-24 01:50:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:06,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-24 01:50:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:06,473 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-24 01:50:06,473 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:50:06,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1326167484] [2022-02-24 01:50:06,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1326167484] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:50:06,474 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:50:06,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-24 01:50:06,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589622237] [2022-02-24 01:50:06,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:50:06,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-24 01:50:06,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:50:06,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-24 01:50:06,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-02-24 01:50:06,477 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 7 states have internal predecessors, (32), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-02-24 01:50:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:50:07,248 INFO L93 Difference]: Finished difference Result 164 states and 209 transitions. [2022-02-24 01:50:07,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-24 01:50:07,248 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 7 states have internal predecessors, (32), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 56 [2022-02-24 01:50:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:50:07,250 INFO L225 Difference]: With dead ends: 164 [2022-02-24 01:50:07,250 INFO L226 Difference]: Without dead ends: 96 [2022-02-24 01:50:07,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-02-24 01:50:07,252 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 175 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-24 01:50:07,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 84 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-24 01:50:07,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-24 01:50:07,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2022-02-24 01:50:07,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 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) [2022-02-24 01:50:07,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2022-02-24 01:50:07,278 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 56 [2022-02-24 01:50:07,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:50:07,278 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 116 transitions. [2022-02-24 01:50:07,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 7 states have internal predecessors, (32), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-02-24 01:50:07,279 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2022-02-24 01:50:07,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-24 01:50:07,280 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:50:07,280 INFO L514 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] [2022-02-24 01:50:07,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-24 01:50:07,281 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:50:07,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:50:07,281 INFO L85 PathProgramCache]: Analyzing trace with hash 921875361, now seen corresponding path program 1 times [2022-02-24 01:50:07,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:50:07,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2039979757] [2022-02-24 01:50:07,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:50:07,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:50:07,286 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:50:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:07,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:50:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:07,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-24 01:50:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:07,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 01:50:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:07,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 01:50:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:07,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 01:50:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:07,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-24 01:50:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:07,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 01:50:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:07,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-24 01:50:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:07,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-02-24 01:50:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:07,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-24 01:50:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:07,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-02-24 01:50:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-24 01:50:07,487 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:50:07,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2039979757] [2022-02-24 01:50:07,487 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2039979757] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:50:07,487 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:50:07,488 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-24 01:50:07,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139274221] [2022-02-24 01:50:07,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:50:07,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-24 01:50:07,488 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:50:07,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-24 01:50:07,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-02-24 01:50:07,489 INFO L87 Difference]: Start difference. First operand 92 states and 116 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) [2022-02-24 01:50:08,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:50:08,130 INFO L93 Difference]: Finished difference Result 163 states and 208 transitions. [2022-02-24 01:50:08,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-24 01:50:08,131 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 [2022-02-24 01:50:08,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:50:08,132 INFO L225 Difference]: With dead ends: 163 [2022-02-24 01:50:08,132 INFO L226 Difference]: Without dead ends: 98 [2022-02-24 01:50:08,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-02-24 01:50:08,134 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 168 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-24 01:50:08,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 82 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-24 01:50:08,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-24 01:50:08,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2022-02-24 01:50:08,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 59 states have internal predecessors, (64), 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) [2022-02-24 01:50:08,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2022-02-24 01:50:08,148 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 66 [2022-02-24 01:50:08,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:50:08,148 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2022-02-24 01:50:08,148 INFO L471 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) [2022-02-24 01:50:08,148 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2022-02-24 01:50:08,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-24 01:50:08,149 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:50:08,149 INFO L514 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] [2022-02-24 01:50:08,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-24 01:50:08,150 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:50:08,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:50:08,150 INFO L85 PathProgramCache]: Analyzing trace with hash 940648973, now seen corresponding path program 1 times [2022-02-24 01:50:08,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:50:08,150 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2012216100] [2022-02-24 01:50:08,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:50:08,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:50:08,152 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:50:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:08,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:50:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:08,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-24 01:50:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:08,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 01:50:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:08,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 01:50:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:08,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 01:50:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:08,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 01:50:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:08,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-24 01:50:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:08,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-24 01:50:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:08,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 01:50:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:08,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-24 01:50:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:08,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-02-24 01:50:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:08,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-02-24 01:50:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:08,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-24 01:50:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:50:08,379 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-24 01:50:08,380 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:50:08,380 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2012216100] [2022-02-24 01:50:08,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2012216100] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:50:08,380 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:50:08,380 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-24 01:50:08,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743377419] [2022-02-24 01:50:08,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:50:08,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-24 01:50:08,381 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:50:08,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-24 01:50:08,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-02-24 01:50:08,381 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-02-24 01:50:08,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:50:08,979 INFO L93 Difference]: Finished difference Result 151 states and 192 transitions. [2022-02-24 01:50:08,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-24 01:50:08,980 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 79 [2022-02-24 01:50:08,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:50:08,981 INFO L225 Difference]: With dead ends: 151 [2022-02-24 01:50:08,981 INFO L226 Difference]: Without dead ends: 98 [2022-02-24 01:50:08,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2022-02-24 01:50:08,985 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 196 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-24 01:50:08,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 82 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-24 01:50:08,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-24 01:50:08,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-02-24 01:50:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 61 states have internal predecessors, (65), 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) [2022-02-24 01:50:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2022-02-24 01:50:08,999 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 79 [2022-02-24 01:50:08,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:50:08,999 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2022-02-24 01:50:09,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-02-24 01:50:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2022-02-24 01:50:09,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-24 01:50:09,001 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:50:09,001 INFO L514 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] [2022-02-24 01:50:09,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-24 01:50:09,001 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:50:09,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:50:09,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1677199096, now seen corresponding path program 1 times [2022-02-24 01:50:09,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:50:09,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [797910781] [2022-02-24 01:50:09,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:50:09,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:50:09,003 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:50:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-24 01:50:09,035 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-24 01:50:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-24 01:50:09,099 INFO L138 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2022-02-24 01:50:09,099 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-24 01:50:09,103 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-24 01:50:09,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-24 01:50:09,108 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-24 01:50:09,110 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-24 01:50:09,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 01:50:09 BoogieIcfgContainer [2022-02-24 01:50:09,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-24 01:50:09,135 INFO L158 Benchmark]: Toolchain (without parser) took 5580.34ms. Allocated memory was 198.2MB in the beginning and 249.6MB in the end (delta: 51.4MB). Free memory was 143.4MB in the beginning and 129.4MB in the end (delta: 14.0MB). Peak memory consumption was 67.6MB. Max. memory is 8.0GB. [2022-02-24 01:50:09,135 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 198.2MB. Free memory is still 160.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-24 01:50:09,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.64ms. Allocated memory was 198.2MB in the beginning and 249.6MB in the end (delta: 51.4MB). Free memory was 143.3MB in the beginning and 218.5MB in the end (delta: -75.2MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-02-24 01:50:09,136 INFO L158 Benchmark]: Boogie Preprocessor took 57.43ms. Allocated memory is still 249.6MB. Free memory was 218.5MB in the beginning and 216.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-24 01:50:09,136 INFO L158 Benchmark]: RCFGBuilder took 452.05ms. Allocated memory is still 249.6MB. Free memory was 216.4MB in the beginning and 197.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-02-24 01:50:09,136 INFO L158 Benchmark]: TraceAbstraction took 4733.74ms. Allocated memory is still 249.6MB. Free memory was 197.0MB in the beginning and 129.4MB in the end (delta: 67.6MB). Peak memory consumption was 67.6MB. Max. memory is 8.0GB. [2022-02-24 01:50:09,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.13ms. Allocated memory is still 198.2MB. Free memory is still 160.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 332.64ms. Allocated memory was 198.2MB in the beginning and 249.6MB in the end (delta: 51.4MB). Free memory was 143.3MB in the beginning and 218.5MB in the end (delta: -75.2MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.43ms. Allocated memory is still 249.6MB. Free memory was 218.5MB in the beginning and 216.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 452.05ms. Allocated memory is still 249.6MB. Free memory was 216.4MB in the beginning and 197.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 4733.74ms. Allocated memory is still 249.6MB. Free memory was 197.0MB in the beginning and 129.4MB in the end (delta: 67.6MB). Peak memory consumption was 67.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L105] 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; [L105] RET, EXPR nondet_tree() [L105] CALL task(nondet_tree()) [L83] CALL, EXPR min(t) [L37] COND FALSE !(!n) [L40] EXPR n->left [L40] CALL, EXPR min(n->left) [L37] COND TRUE !n [L38] return 2147483647; [L40] RET, EXPR min(n->left) [L40] int a = min(n->left); [L41] EXPR n->right [L41] CALL, EXPR min(n->right) [L37] COND TRUE !n [L38] return 2147483647; [L41] RET, EXPR min(n->right) [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; [L83] RET, EXPR min(t) [L83] int a = min(t); [L84] int b; [L86] CALL, EXPR size(t) [L78] COND FALSE !(!t) [L79] EXPR t->left [L79] CALL, EXPR size(t->left) [L78] COND TRUE !t [L78] return 0; [L79] RET, EXPR size(t->left) [L79] EXPR t->right [L79] CALL, EXPR size(t->right) [L78] COND TRUE !t [L78] return 0; [L79] RET, EXPR size(t->right) [L79] return size(t->left) + size(t->right) + 1; [L86] RET, EXPR size(t) [L86] int n = size(t); [L87] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) [L87] RET assume_abort_if_not(n != 0) [L88] EXPR, FCALL calloc(n, sizeof(int)) [L88] int *x = calloc(n, sizeof(int)); [L89] CALL tree_inorder(t, x, n) [L67] COND FALSE !(!t) [L70] EXPR t->left [L70] CALL, EXPR tree_inorder(t->left, a, i) [L67] COND TRUE !t [L68] return i; [L70] RET, EXPR tree_inorder(t->left, a, i) [L70] i = tree_inorder(t->left, a, i) [L71] EXPR i++ [L71] EXPR t->data [L71] a[i++] = t->data [L72] EXPR t->right [L72] CALL, EXPR tree_inorder(t->right, a, i) [L67] COND TRUE !t [L68] return i; [L72] RET, EXPR tree_inorder(t->right, a, i) [L72] i = tree_inorder(t->right, a, i) [L73] return i; [L89] RET tree_inorder(t, x, n) [L90] EXPR x[0] [L90] CALL __VERIFIER_assert(a == x[0]) [L16] COND TRUE !cond [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 859 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 804 mSDsluCounter, 407 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 779 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3216 IncrementalHoareTripleChecker+Invalid, 3995 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 779 mSolverCounterUnsat, 353 mSDtfsCounter, 3216 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=0, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 24 StatesRemovedByMinimization, 5 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! [2022-02-24 01:50:09,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...